By Topic

Automatic task graph generation techniques

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

2 Author(s)
Cosnard, M. ; Lab. de l''Inf., CNRS, Lyon, France ; Loi, M.

Presents a model of parallel computation, the parameterized task graph, which is a compact, problem-size-independent representation of some frequently-used directed acylic task graphs. Techniques for automating the construction of such a representation, starting from an annotated sequential program, are proposed. We show how to represent the computational load for each node and the communication volume for each edge in a problem-size-independent way. Lastly, we describe related work and techniques required in order to generate local data structures, computation code and communication code

Published in:

System Sciences, 1995. Proceedings of the Twenty-Eighth Hawaii International Conference on  (Volume:2 )

Date of Conference:

3-6 Jan 1995