Mapping unstructured applications into nested parallelism

DOI10.1007/3-540-36569-9_27MaRDI QIDQ4414787zbMATH OpenFDO

Authors Arturo González-Escribano, Arjan J. C. van Gemund, Valentín Cardeñoso-Payo

Publication date 27 July 2003

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/2565/25650407.htm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• High Performance Computing for Computational Science - VECPAR 2004
• scientific article; zbMATH DE number 934540
• scientific article; zbMATH DE number 1262845
• scientific article; zbMATH DE number 279005
• scientific article; zbMATH DE number 2080129

Cited in

(6)

• Scheduling series-parallel task graphs to minimize peak memory
• scientific article; zbMATH DE number 1262845 (Why is no real title available?)
• scientific article; zbMATH DE number 2080129 (Why is no real title available?)
• Efficient mapping for message-passing applications using the TTIG model: A case study in image processing
• scientific article; zbMATH DE number 934540 (Why is no real title available?)
• Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling

This page was built for publication: Mapping unstructured applications into nested parallelism

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