A Task Duplication Based Scalable Schedu
โ
Sekhar Darbha; Dharma P. Agrawal
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 466 KB
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