Title :
Analyzing performance of sequencing mechanisms for simple layered task systems
Author :
Tayyab, Athar B. ; Kuhl, Jon G.
Author_Institution :
Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA
Abstract :
Considers the problem of sequencing a set of parallel activities in the presence of nonzero overheads. Mechanisms for sequence control may range from explicit inter-task synchronization to more restrictive mechanisms such as blocking barriers. It is highly desirable to be able to base the choice of a sequence control mechanism for a parallel algorithm upon specific characteristics of the algorithm´s structure and the underlying architecture. The paper presents approximate models for simple layered task systems that can predict overall performance and provide a useful understanding of key performance parameters and tradeoffs. The analytic results are compared with simulation to demonstrate their accuracy. Some simple applications of the model are presented that demonstrate non-intuitive behavior of layered graphs with inter-task versus barrier-based sequencing
Keywords :
graph theory; parallel algorithms; performance evaluation; scheduling; barrier-based sequencing; blocking barriers; inter-task sequencing; inter-task synchronization; layered graphs; layered task systems; nonzero overheads; parallel activities; parallel algorithm; performance analysis; sequence control; Access control; Analytical models; Cities and towns; Computer architecture; Concurrent computing; Control systems; NASA; Parallel algorithms; Performance analysis; Predictive models;
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
DOI :
10.1109/IPPS.1992.223051