Minimizing Redundant Dependencies and Interprocessor Synchronizations (1994)
| Venue: | International Journal of Parallel Programming |
| Citations: | 3 - 1 self |
BibTeX
@ARTICLE{Chao94minimizingredundant,
author = {Heng-Yi Chao and Mary P. Harper},
title = {Minimizing Redundant Dependencies and Interprocessor Synchronizations},
journal = {International Journal of Parallel Programming},
year = {1994},
volume = {23},
pages = {245--262}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Run-time synchronization overhead is a crucial factor in achieving speedup for parallel computers. A new algorithm for removing redundant dependencies and minimizing interprocessor synchronizations in a multiprocessor system is presented in this paper. In our simulation, on the average, only 0.59% of the initial dependencies are required synchronizations. The algorithm has O(n 3 ) time complexity and O(n 2 ) space complexity. key words: multiprocessor scheduling, transitive closure, transitive reduction, interprocessor synchronization. 1 Introduction Run-time synchronization overhead is a crucial factor in achieving effective speedup when a system of tasks with dependencies among the tasks is executed on a MIMD machine with identical processing elements. In this paper, we describe a new two-phase algorithm for minimizing synchronizations in a multiprocessor system. In the first phase, redundant dependencies are removed before scheduling; in the second phase, interprocessor synch...
