Cart (Loading....) | Create Account
Close category search window
 

Analysis and synthesis of generalized task graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kant, K. ; Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA

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

Need Help?


IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.