Automatic task graph generation techniques

Author

Cosnard, M. ; Loi, M.

Author_Institution

Lab. de l´´Inf., CNRS, Lyon, France

Volume

2

fYear

1995

fDate

3-6 Jan 1995

Firstpage

113

Abstract

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

Keywords

automatic programming; data structures; directed graphs; parallel programming; programming theory; annotated sequential program; automatic task graph generation techniques; communication code generation; computation code generation; directed acylic task graphs; edge communication volume; local data structure generation; node computational load; parallel computation model; parameterized task graph; problem-size-independent representation; Automatic control; Computational modeling; Concurrent computing; DC generators; Data structures; Humans; Kernel; Message passing; Processor scheduling; Prototypes;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1995. Proceedings of the Twenty-Eighth Hawaii International Conference on

Conference_Location

Wailea, HI

Print_ISBN

0-8186-6930-6

Type

conf

DOI

10.1109/HICSS.1995.375471

Filename

375471