Automatic task graph generation techniques

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by M. Cosnard Articles by M. Loi

28th Hawaii International Conference on System Sciences (HICSS'95)

Automatic task graph generation techniques (PDF)

Hawaii, USA

January 04-January 07

ISBN: 0-8186-6935-7

	ASCII Text	x
	M. Cosnard, M. Loi, "Automatic task graph generation techniques," Hawaii International Conference on System Sciences, pp. 113, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995.

	BibTex	x
	@article{ 10.1109/HICSS.1995.375471, author = {M. Cosnard and M. Loi}, title = {Automatic task graph generation techniques}, journal ={Hawaii International Conference on System Sciences}, volume = {0}, year = {1995}, issn = {1060-3425}, pages = {113}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375471}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hawaii International Conference on System Sciences TI - Automatic task graph generation techniques SN - 1060-3425 SP EP A1 - M. Cosnard, A1 - M. Loi, PY - 1995 KW - directed graphs; parallel programming; programming theory; data structures; automatic programming; automatic task graph generation techniques; parallel computation model; parameterized task graph; problem-size-independent representation; directed acylic task graphs; annotated sequential program; node computational load; edge communication volume; local data structure generation; computation code generation; communication code generation VL - 0 JA - Hawaii International Conference on System Sciences ER -

M. Cosnard, Lab. de l'Inf., CNRS, Lyon, France

M. Loi, Lab. de l'Inf., CNRS, Lyon, France

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375471

Presents a model of par References Cited: 24 allel 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.

Index Terms:

directed graphs; parallel programming; programming theory; data structures; automatic programming; automatic task graph generation techniques; parallel computation model; parameterized task graph; problem-size-independent representation; directed acylic task graphs; annotated sequential program; node computational load; edge communication volume; local data structure generation; computation code generation; communication code generation

Citation:

M. Cosnard, M. Loi, "Automatic task graph generation techniques," hicss, pp.113, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.