Modeling Multicomputer Task Allocation as a Vector Packing Problem

Authors:
James Beck;Daniel Siewiorek
Affiliations:
Advanced Microcomputer Development, Delco Electronics Corporation;Department of Electrical and Computer Engineering, Carnegie Mellon University
Venue:
ISSS '96 Proceedings of the 9th international symposium on System synthesis
Year:
1996

Citing 10
Cited 3

Multiple-access protocols and time-constrained communication

ACM Computing Surveys (CSUR)
Data flow graph partitioning to reduce communication cost

MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
Task Allocation and Precedence Relations for Distributed Real-Time Systems

IEEE Transactions on Computers
Multicomputers: Message-Passing Concurrent Computers

Computer
Module Allocation of Real-Time Applications to Distributed Systems

IEEE Transactions on Software Engineering
An efficient K-way graph partitioning algorithm for task allocation in parallel computing systems

ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
An efficient algorithm for a task allocation problem

Journal of the ACM (JACM)
Automated processor specification and task allocation methods for embedded multicomputer systems

Automated processor specification and task allocation methods for embedded multicomputer systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
A probabilistic analysis of multidimensional bin packing problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Scheduling data transfers in a network and the set scheduling problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling data transfers in a network and the set scheduling problem

Journal of Algorithms
Online resource management in a multiprocessor with a network-on-chip

Proceedings of the 2007 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of task allocation for embedded, bus-based multicomputers. The problem is shown to be isomorphic to a generalization of vector packing, and heuristic solution techniques are investigated. A total of 256 packing algorithms are considered, using a divide-and-conquer experimentation strategy on a set of sixteen real and synthetic test cases. Performance is compared based on the number of processors, the utilization level of the broadcast bus and run time. This research differs from other approaches in that task allocation is formulated as a multi-dimensional problem, and general purpose solution techniques are developed that can accommodate arbitrary models for the schedulable resources.