Referenced Items are not available for this document.
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
Published in:
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Date of Conference: 9-13 Dec 1990
- Page(s):
- 570 - 577
- Meeting Date :
- 09 Dec 1990-13 Dec 1990
- Print ISBN:
- 0-8186-2087-0
- INSPEC Accession Number:
- 4060464
- Conference Location :
- Dallas, TX
- Digital Object Identifier :
- 10.1109/SPDP.1990.143606
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
