Cluster partitioning approaches to mapping parallel programs onto a hypercube

From MaRDI portal

Revision as of 09:38, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1262751

Jump to:navigation, search

DOI10.1016/0167-8191(90)90115-PzbMath0686.68020MaRDI QIDQ1262751

J. Ramanujam, Fikret Erçal, Ponnuswamy Sadayappan

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

hypercube nearest-neighbor recursive- clustering task-to-processor mapping

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (6)

Genetic search algorithms and their randomized operators ⋮ Genetic algorithm based heuristics for the mapping problem ⋮ Hypercube embedding heuristics: An evaluation ⋮ Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube ⋮ Partitioning graphs on message-passing machines by pairwise mincut ⋮ The effectiveness of cyclic blockwise distribution

This page was built for publication: Cluster partitioning approaches to mapping parallel programs onto a hypercube

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1262751&oldid=13360943"