Computer Science ›› 2009, Vol. 36 ›› Issue (6): 282-285.
Previous Articles Next Articles
LIANG Shan-shan WU Jia-jun ZHANG Jun-chao （Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100080,China）
Online:
Published:
Abstract: All the complicated scheduling problems in modern parallel systems can be converted to the basic scheduling problem for Fork-Join task graphs. However, the communication between two processing nodes is carried on exclusively in real computation environmen
Key words: Task scheduling, Task duplication, Fork-join task graph, Communication constraint
LIANG Shan-shan WU Jia-jun ZHANG Jun-chao （Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100080,China）. [J].Computer Science, 2009, 36(6): 282-285.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2009/V36/I6/282
Cited
Home