Modeling multicomputer task allocation as a vector packing problem

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.

[1]  Alan Burns,et al.  Guaranteeing message latencies on controller area network (can) , 1994 .

[2]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[3]  Torben Noerup Nielsen,et al.  Combinatorial Bin Packing Problems , 1985 .

[4]  James Edward Beck.  Automated processor specification and task allocation methods for embedded multicomputer systems , 1995 .

[5]  Catherine E. Houstis,et al.  Module Allocation of Real-Time Applications to Distributed Systems , 1987, IEEE Trans. Software Eng..

[6]  Charles L. Seitz,et al.  Multicomputers: message-passing concurrent computers , 1988, Computer.

[7]  Wesley W. Chu,et al.  Task Allocation and Precedence Relations for Distributed Real-Time Systems , 1987, IEEE Transactions on Computers.

[8]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9]  Kemal Efe,et al.  Heuristic Models of Task Assignment Scheduling in Distributed Systems , 1982, Computer.

[10]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[11]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[12]  Prabhakar Raghavan,et al.  Multidimensional on-line bin packing: Algorithms and worst-case analysis , 1989 .

[13]  Myunghwan Kim,et al.  An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems , 1990, Systems Integration '90. Proceedings of the First International Conference on Systems Integration.

[14]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[15]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[16]  Yechiam Yemini,et al.  Multiple-access protocols and time-constrained communication , 1984, CSUR.

[17]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[18]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[19]  Timothy G. Saponas.  A Real-Time Distributed Processing System , 1986, RTSS.

[20]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[21]  Ranga Vemuri,et al.  Data flow graph partitioning to reduce communication cost , 1986, MICRO 19.

[22]  Jean-Luc Gaudiot,et al.  Program graph allocation in distributed multicomputers , 1988, Parallel Comput..