DocumentCode :
348250
Title :
Task partitioning utilizing available time on multiprocessor systems for a given schedule
Author :
López-Bonilla, Oscar R.
Author_Institution :
Inst. de Inv. Oceanologicas, Univ. Autonoma de Baja California, Ensenada, Mexico
fYear :
1999
fDate :
1999
Firstpage :
177
Lastpage :
186
Abstract :
The partitioning of a task at compile time on a multiprocessor system for a given schedule is considered. The optimal distribution of the partition is found. The homogeneous and heterogenous cases are considered. An algorithm is shown that performs the partitioning while ensuring efficient utilization of resources. Tests are developed to predict the profitability of the partition
Keywords :
multiprocessing systems; processor scheduling; algorithm; available time utilisation; compile time; heterogenous case; homogeneous case; multiprocessor systems; optimal partition distribution; schedule; task partitioning; Biology computing; Computer architecture; Finite element methods; Flow graphs; Multiprocessing systems; Neural networks; Partitioning algorithms; Processor scheduling; Testing; Weather forecasting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on
Conference_Location :
Melbourne, Vic.
Print_ISBN :
0-7695-0343-8
Type :
conf
DOI :
10.1109/IWCC.1999.810823
Filename :
810823
Link To Document :
بازگشت