Mapping heterogeneous task graphs onto networks: Execution time optimization

DOI10.1007/3-540-44743-1_13MaRDI QIDQ4778631zbMATH OpenFDO

Authors Natalya Vodovoz

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/21270142

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph
• scientific article; zbMATH DE number 2153019
• scientific article; zbMATH DE number 279005
• Mapping parallel programs onto multicore computers by recurrent neural networks
• scientific article; zbMATH DE number 1953184

Cited in

(3)

• scientific article; zbMATH DE number 2153019 (Why is no real title available?)
• Mapping parallel programs onto multicore computers by recurrent neural networks
• Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph

This page was built for publication: Mapping heterogeneous task graphs onto networks: Execution time optimization

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