Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer

Authors:
K. Schwan;J. Gawkowski;B. Blake
Affiliations:
Department of Computer and Information Science, The Ohio State University, Columbus, OH;Department of Computer and Information Science, The Ohio State University, Columbus, OH;Department of Computer and Information Science, The Ohio State University, Columbus, OH
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 7
Cited 5

DIB—a distributed implementation of backtracking

ACM Transactions on Programming Languages and Systems (TOPLAS)
Attacking the process migration bottleneck

SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Topologies' - computational messaging for multicomputers

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Experience Using Multiprocessor Systems—A Status Report

ACM Computing Surveys (CSUR)
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Performance of parallel programs: model and analyses

Performance of parallel programs: model and analyses

Topologies' - computational messaging for multicomputers

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
“Topologies”—distributed objects on multicomputers

ACM Transactions on Computer Systems (TOCS)
Distributed Shared Abstractions (DSA) on Multiprocessors

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the design and experimental evaluation of a novel parallel implementation of a branch-and-bound algorithm for solving the Traveling Salesperson Problem on a 32 node Intel hypercube. Issues studied experimentally are trade-offs in speed, memory, and communication costs as well as the effects of workload balancing and node utilization on speedup.Since the actual distribution of work among the parallel tasks of the TSP application cannot be predicted in advance, strategies and tradeoffs regarding the migration of processes from heavily loaded processors or the migration of work from heavily loaded processes can be studied. Toward this end, we have implemented operating system constructs for work and for process migration as extensions to the Intel iPSC hypercube's operating system. Furthermore, operating system support for the rapid sharing of intermediate values of the global objective function being optimized (i.e. 'tour' values in TSP) are provided.