DocumentCode
2343918
Title
A static workload balance scheduling algorithm
Author
Tabirca, T. ; Tabirca, Sabin ; Freeman, Len ; Yang, Laurence Tianruo
Author_Institution
Dept. of Comput. Sci., Manchester Univ., UK
fYear
2002
fDate
2002
Firstpage
235
Lastpage
239
Abstract
This article studies a static scheduling method based on workload balancing. An equation is presented for the case when the workload is equally distributed onto all the processors. An efficient load balance scheduling algorithm is developed assuming that the workload has certain properties. Finally, some computational results are given for the product between an upper diagonal matrix and a vector.
Keywords
computational complexity; parallel programming; processor scheduling; resource allocation; computational complexity; load balancing; processors scheduling; static scheduling; static workload balance scheduling; upper bounds; upper diagonal matrix; Computer science; Concurrent computing; Dynamic scheduling; Educational institutions; Equations; Parallel processing; Parallel programming; Processor scheduling; Runtime; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Workshops, 2002. Proceedings. International Conference on
ISSN
1530-2016
Print_ISBN
0-7695-1680-7
Type
conf
DOI
10.1109/ICPPW.2002.1039735
Filename
1039735
Link To Document