Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cluster partitioning approaches to mapping parallel programs onto a hypercube

From MaRDI portal
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

hypercubenearest-neighborrecursive- clusteringtask-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

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1262751&oldid=13360943"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki