Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph

DOI10.1142/S0129054101000680zbMATH Open1319.68159MaRDI QIDQ5249283FDOQ5249283

Authors: Mary Mehrnoosh Eshaghian 

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1830921
• scientific article; zbMATH DE number 2153019
• Task assignment in heterogeneous computing systems
• scientific article; zbMATH DE number 1953184
• A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Parallel Processing and Applied Mathematics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Task assignment in heterogeneous computing systems
• Title not available (Why is that?)
• A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems

This page was built for publication: Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph

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