The architecture of a homogeneous vector supercomputer
Journal of Parallel and Distributed Computing
Parallel branch and bound algorithms on hypercube multiprocessors
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
A dynamic load balancer for a parallel branch and bound algorithm
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
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
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
The parallel implementation of branch-and-bound algorithms on multiprocessors has received an increasing amount of attention in recent years. This paper describes research currently being conducted at Clemson University. We study the job scheduling problem: given n jobs, each with processing time, pi, and due date, di, schedule these jobs on a single machine such that total tardiness is minimized. Total tardiness, T, is defined as: T = n ∑ i=1 wi * max { 0, Ci - di } where Ci is the completion time and wi is the weight of job i. The hypercube used is a Floating Point Systems T-20: sixteen INMOS Transputers, synchronous communication, programmed in OCCAM. We describe an implementation focusing specifically on efficient communication and load balancing algorithms.