Priority-based scheduling and evaluation of precedence graphs with communication times

(1993) Priority-based scheduling and evaluation of precedence graphs with communication times. Masters thesis, King Fahd University of Petroleum and Minerals.


Download (3MB) | Preview

Arabic Abstract


English Abstract

The design of distributed schemes requires partitioning a computation into smaller modules and scheduling it over a number of processors that communicate by exchanging packets of messages. The computation is represented by a directed acyclic graph. The objective function is to minimize the overall computation time. Due to the dynamic nature of the inter-tasks communication, an accurate global estimation of their effect is hard to find. As a result, local scheduling heuristic are used. In this work, new global priority based scheduling algorithms are presented, based on the evaluation of tasks finish times in the reverse graph. Extensive testing is carried out to evaluate the performance of these heuristics. Analysis of the results shows the superiority of these heuristics over reported ones as shorter finish times can be achieved with a stable topology independent performance. Finally, a new low-cost general iterative improvement technique is presented. Experimental testing of this technique is conducted with an analysis of the process behavior.

Item Type: Thesis (Masters)
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Committee Advisor: Youssef, Habib
Committee Members: Sait, Sadiq M. and Ghanta, Subbarao
Depositing User: Mr. Admin Admin
Date Deposited: 22 Jun 2008 13:57
Last Modified: 01 Nov 2019 13:57