One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt
β¦ LIBER β¦
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
β Scribed by Kuan-Chou Lai; Chao-Tung Yang
- Book ID
- 106539401
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 684 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A Task Duplication Based Scalable Schedu
β
Sekhar Darbha; Dharma P. Agrawal
π
Article
π
1997
π
Elsevier Science
π
English
β 466 KB
An efficient weighted bi-objective sched
β
Cristina Boeres; Idalmis MiliΓ‘n SardiΓ±a; LΓΊcia M.A. Drummond
π
Article
π
2011
π
Elsevier Science
π
English
β 395 KB
A task duplication based scheduling algo
β
Oh-Han Kang; Si-Gwan Kim
π
Article
π
2003
π
Elsevier Science
π
English
β 134 KB
We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performan
Optimal algorithm for scheduling large d
β
Shang Mingsheng
π
Article
π
2008
π
Elsevier Science
π
English
β 218 KB
A high performance, low complexity algor
β
T. Hagras; J. JaneΔek
π
Article
π
2005
π
Elsevier Science
π
English
β 413 KB
A novel fault-tolerant scheduling algori
β
Xiao Qin; Hong Jiang
π
Article
π
2006
π
Elsevier Science
π
English
β 364 KB