| You are in:Home/Publications/Critical path based Algorithm for mapping a problem graph to a multiprocessor architecture | |
Prof. rafat alkmaar :: Publications: |
|
| Title: | Critical path based Algorithm for mapping a problem graph to a multiprocessor architecture |
| Authors: | Raafat A. El-Kammar, Hassan Shehata, May Salama |
| Year: | 2001 |
| Keywords: | Not Available |
| Journal: | Cairo University, Faculty of Computers and Information, The Egyptian Informatics Journal |
| Volume: | 2 |
| Issue: | 2 |
| Pages: | 140-151 |
| Publisher: | Not Available |
| Local/International: | International |
| Paper Link: | Not Available |
| Full paper | Not Available |
| Supplementary materials | Not Available |
| Abstract: |
This paper presents a general-purpose algorithm for mapping directed acyclic graph to any multiprocessor architecture based on finding the dominant sequence path of a graph. The algorithm aims at minimizing the total parallel processing cost including both computation and communication costs of the program graph. It has a look-ahead feature by which it finds the cost of all paths of the graph, starting from all start nodes to all finish nodes, prior to assignment then it assigns the modules of the paths to the processors according to the processor network topology. The proposed algorithm is a static heuristic algorithm |
