Parallel SPMD-tasks graph description language for network clusters

DOI10.1007/3-540-44743-1_18MaRDI QIDQ4778639zbMATH OpenFDO

Authors L. K. Babenko, A. G. Chefranov, R. V. Trotsenko

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2127/21270186

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• A platform independent parallelising tool based on graph theoretic models
• scientific article; zbMATH DE number 3874588
• scientific article; zbMATH DE number 4128411
• scientific article; zbMATH DE number 1985710
• On cluster resource allocation for multiple parallel task graphs
• scientific article; zbMATH DE number 4155927
• An integrated performance analysis tool for SPMD data-parallel programs

Cited in

(2)

• Flowgraph stream parallel programming and its implementation on cluster systems
• A user-level extension scheme for a task-parallel script language

This page was built for publication: Parallel SPMD-tasks graph description language for network clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778639)