Task allocation onto a hypercube by recursive mincut bipartitioning

Authors:
F. Ercal;J. Ramanujam;P. Sadayappan
Affiliations:
Department of Computer and Information Science, The Ohio State University, Columbus, Ohio;Department of Computer and Information Science, The Ohio State University, Columbus, Ohio;Department of Computer and Information Science, The Ohio State University, Columbus, Ohio
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 7
Cited 11

Mapping strategies in message based multiprocessor systems

Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
A Partitioning Strategy for Nonuniform Problems on Multiprocessors

IEEE Transactions on Computers
Efficient computation of optimal assignments for distributed tasks

Journal of Parallel and Distributed Computing
Nearest-neighbor mapping of finite element graphs onto processor meshes

IEEE Transactions on Computers
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Cluster-partitioning approaches to mapping parallel programs onto a hypercube

Proceedings of the 1st International Conference on Supercomputing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Neural networks and dynamic complex systems

ANSS '89 Proceedings of the 22nd annual symposium on Simulation
Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency

IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
HPC-Colony: services and interfaces for very large systems

ACM SIGOPS Operating Systems Review
A Case Study of Communication Optimizations on 3D Mesh Interconnects

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Topology-aware task mapping for reducing communication contention on large parallel machines

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Avoiding hot-spots on two-level direct networks

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
A divide and conquer strategy for scaling weather simulations with multiple regions of interest

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Hierarchical task mapping of cell-based AMR cosmology simulations

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Predicting application performance using supervised learning on communication features

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A divide and conquer strategy for scaling weather simulations with multiple regions of interest

Scientific Programming - Selected Papers from Super Computing 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient recursive task allocation scheme, based on the Kernighan-Lin mincut bisection heuristic, is proposed for the effective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be effective on a number of large test task graphs - its solution quality is nearly as good as that produced by simulated annealing, and its computation time is several orders of magnitude less.