DocumentCode
3091494
Title
An algorithm for coscheduling tasks on network of heterogeneous workstations
Author
Yan-Hui, Wu ; Xin-Da, LU ; Zhi-Yong, Zeng
Author_Institution
Dept. of Comput. Sci., Shanghai Jiao Tong Univ., China
fYear
2002
fDate
23-25 Oct. 2002
Firstpage
100
Lastpage
104
Abstract
An algorithm is proposed, which solves cooperative concurrent computing tasks by using the idle cycle of a number of high performance heterogeneous workstations interconnected by a high-speed network. In order to get better parallel computation performance, this paper gives a model and an algorithm of task scheduling among heterogeneous workstations, in which the costs of loading data, computing, communication and collecting results are considered. Using this efficient algorithm, an optimal subset of heterogeneous workstations with the shortest parallel execution time of tasks can be selected.
Keywords
computational complexity; multiprocessing programs; parallel algorithms; processor scheduling; workstation clusters; algorithm; cooperative concurrent computing tasks; high performance heterogeneous workstations; high-speed network; idle cycle; optimal subset; parallel computation performance; parallel execution time; task coscheduling; Computer networks; Computer science; Concurrent computing; Distributed computing; Parallel algorithms; Parallel processing; Partitioning algorithms; Processor scheduling; Scheduling algorithm; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on
Conference_Location
Beijing, China
Print_ISBN
0-7695-1512-6
Type
conf
DOI
10.1109/ICAPP.2002.1173558
Filename
1173558
Link To Document