DocumentCode
3278162
Title
Analysis and synthesis of generalized task graphs
Author
Kant, K.
Author_Institution
Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
fYear
1990
fDate
9-13 Dec 1990
Firstpage
570
Lastpage
577
Abstract
The author introduces the notion of generalized task graphs (GTG), that are useful in specifying the behavior of a richer class of concurrent programs than the classical task graphs. In general, such task graphs are not well-formed; therefore, the author examines necessary and sufficient conditions for well formedness. He introduces an algebra for describing well formed GTGs and shows how it can be exploited in synthesis, i.e. composing several GTGs into a single compact GTG, and analysis, i.e. obtaining completion time distributions
Keywords
computational complexity; directed graphs; multiprocessing programs; parallel algorithms; parallel programming; programming theory; completion time distributions; computational complexity; concurrent programs; directed graphs; generalized task graphs; program specification; synthesis; task scheduling; well formedness; Algebra; Computer science; Petri nets; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2087-0
Type
conf
DOI
10.1109/SPDP.1990.143606
Filename
143606
Link To Document