Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA New Strategy for Scheduling a Directed Acyclic Graph in Heterogeneous Parallel Environments
استراتيجية جديدة لجدولة بيان موجه لا يحوي دائرة في البيئات المتوازية غير المتجانسة
1166
1 7
0
(
0
)
Added by
Aِl-Baath University ورقة بحثية
Publication date
2018
fields
Mathematics
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
يهدف البحث إلى الاستفادة من وجود عدة وحدات معالجة مركزية بالإضافة إلى وحدات معالجة رسومية و استغلال العمليات الحسابية التي تقوم بها وحدات المعالجة الرسومية, بهدف إنشاء آلية لجدولة بيان موجه لا يحوي دائرة, تهدف إلى تقليل الاتصالات بين الموارد و جدولة المهام المترابطة بأفضل شكل ممكن.
The work aims to make benefit from existence multi-CPU and multi-GPU, exploiting the calculation processes which do multi-GPU, which aims to form mechanism to scheduling a directed acyclic graph(DAG), it aims to reduce communication between resources and inter linked task scheduling in the best form.
References used
Jiannong Cao, Alvin T. S. Chan, Yudong Sun , Sajal K. Das and Minyi Guo , 2006, A taxonomy of application scheduling tools for high performance cluster computing, Cluster Comput 9:355–371
Fangpeng Dong and Selim G. Akl, 2006, Scheduling Algorithms for Grid Computing: State of the Art and Open Problems, Technical Report No. 2006-504
Jia Yu, Rajkumar Buyya, and Kotagiri Ramamohanarao, 2008, Workflow Scheduling Algorithms for Grid Computing, Metaheuristics for Scheduling in Distributed Computing Environments
rate research
Read More
We introduce an auto adaptive strategy enables to write a parallel
algorithm adapts to the number of available resources at allocated
parallel environment to execute the parallel program. The parallel
applications we are studying which are represe
nted by data-flow
graph which built dynamically during the execution. The new
suggested strategy is based on coupling of a sequential algorithm
and a parallel one and relies on the principle of work stealing in
the tasks scheduling. We offer a study of the complexity of the
adaptive algorithm and analyze its performance on processors
and compare it with a performance of a classic parallel algorithm.
The encoder--decoder framework achieves state-of-the-art results in keyphrase generation (KG) tasks by predicting both present keyphrases that appear in the source document and absent keyphrases that do not. However, relying solely on the source docu
ment can result in generating uncontrollable and inaccurate absent keyphrases. To address these problems, we propose a novel graph-based method that can capture explicit knowledge from related references. Our model first retrieves some document-keyphrases pairs similar to the source document from a pre-defined index as references. Then a heterogeneous graph is constructed to capture relations with different levels of granularity of the source document and its retrieved references. To guide the decoding process, a hierarchical attention and copy mechanism is introduced, which directly copies appropriate words from both source document and its references based on their relevance and significance. The experimental results on multiple KG benchmarks show that the proposed model achieves significant improvements against other baseline models, especially with regard to the absent keyphrase prediction.
Prerequisite relations among concepts are crucial for educational applications, such as curriculum planning and intelligent tutoring. In this paper, we propose a novel concept prerequisite relation learning approach, named CPRL, which combines both c
oncept representation learned from a heterogeneous graph and concept pairwise features. Furthermore, we extend CPRL under weakly supervised settings to make our method more practical, including learning prerequisite relations from learning object dependencies and generating training data with data programming. Our experiments on four datasets show that the proposed approach achieves the state-of-the-art results comparing with existing methods.
In this paper, we introduce a continuous mathematical model to
optimize the compromise between the overhead of fault tolerance
mechanism and the faults impacts in the environment of
execution. The fault tolerance mechanism considered in this
rese
arch is a coordinated checkpoint/recovery mechanism and the
study based on stochastic model of different performance critics of
parallel application on parallel and distributed environment.
In this research, We introduce two probabilistic mechanisms to
certificate parallel applications on distribute architecture supposing
that there are no oracles on which we depend on certification, in
addition to introducing cost model of two mecha
nisms and compare
them.
In this research, we are interested in parallel applications, which
are represented by data-flow graph that is built dynamically during
the execution and which are executed in a wide distributed
heterogeneous and dynamic environment and these applications
use the principle of work stealing to distribute the tasks among the
processors.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
