A parallel list scheduling algorithm: design and performance

(1993) A parallel list scheduling algorithm: design and performance. Masters thesis, King Fahd University of Petroleum and Minerals.


Download (4MB) | Preview

Arabic Abstract


English Abstract

In this thesis a parallel list scheduling algorithm for scheduling a set of n partially ordered tasks on m processors of a distributed computing system has been studied. The parallel heuristic called Par-ETF is based on the sequential EFT approach. The Par-ETF algorithm was designed on the hypercube model and implemented on a transpute environment. Logical clock was used to study the perfomance of the algorithm to overcome the limitations imposed by the existing parallel computing environment. The time and cost complexity of the developed algorithm is O(n(log n + log m)) and O(mn²(log n + log m)). It has been observed through theoretical analysis and through implementation that the parallel algorithm produces the same schedules as the sequential ETF scheduling algorithm. A number of tests have been made on the Par-ETF program. Results obtained from these tests agree with the theoretical analysis of the Par-ETF algorithm.

Item Type: Thesis (Masters)
Subjects: Computer
Department: College of Computing and Mathematics > Information and Computer Science
Committee Advisor: Bozygit, M.
Committee Members: Er., Meng and Ghanta, Subbarao
Depositing User: Mr. Admin Admin
Date Deposited: 22 Jun 2008 13:44
Last Modified: 01 Nov 2019 13:48
URI: https://eprints.kfupm.edu.sa/id/eprint/9581