1st IEEE Computer Society International Workshop on Cluster Computing Task Partitioning Utilizing Available Time on Multiprocessor Systems for a Given Schedule Melbourne, Australia December 02-December 03 ISBN: 0-7695-0343-8
The Partition 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 the heterogeneous cases are considered. An algorithm is shown that perform the partitioning while ensuring utilization of resources efficiently. Tests are developed to predict the profitability of the partition.
Citation:
Oscar R. López-Bonilla, "Task Partitioning Utilizing Available Time on Multiprocessor Systems for a Given Schedule," iwcc, pp.177, 1st IEEE Computer Society International Workshop on Cluster Computing, 1999 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||