Assigning chain-like tasks to a chain-like network

Authors:
Gerhard J. Woeginger
Affiliations:
Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 4
Cited 3

Partitioning Problems in Parallel, Pipeline, and Distributed Computing

IEEE Transactions on Computers
Efficient allocation of chain-like task on chain-like network computers

Information Processing Letters
Scheduling Algorithms for a Chain-like Task System

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation

Context-Aware Optimal Assignment of a Chain-Like Processing Task onto Chain-Like Resources in M-Health

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Context aware body area networks for telemedicine

PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Smart distribution of bio-signal processing tasks in m-health

OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the allocation of a chain-like task system consisting of n tasks to a chain-like network of m computers so as to minimize the bottleneck processing cost. We present an &Ogr;(mn) time solution algorithm for this problem. This improves on a sequence of five slower algorithms by Bokhari [1988], Sheu & Chiang [1990], Hsu [1993], and Young & Chan [1993,1994].