Task allocation in a multi-server system

Authors:
Sem Borst;Onno Boxma;Jan Friso Groote;Sjouke Mauw
Affiliations:
CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Dept. of Math. and Comp. Sci., Eindhoven Univ. of Technol., Eindhoven, The Netherlands and Bell Labs., Lucent Technol., Murray Hill, NJ;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Journal of Scheduling
Year:
2003

Citing 6
Cited 5

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Performing Work Efficiently in the Presence of Faults

SIAM Journal on Computing
Task Allocation on a Network of Processors

IEEE Transactions on Computers
Dynamic Task Scheduling Using Online Optimization

IEEE Transactions on Parallel and Distributed Systems
SETI@HOME—massively distributed computing for SETI

Computing in Science and Engineering
Performing tasks on synchronous restartable message-passing processors

Distributed Computing

Resource allocation in grid computing

Journal of Scheduling
An evolutionary game theoretic approach to adaptive and stable application deployment in clouds

Proceedings of the 2nd workshop on Bio-inspired algorithms for distributed systems
A game-theoretic method of fair resource allocation for cloud computing services

The Journal of Supercomputing
Self-Optimization and Self-Stabilization in Autonomic Clouds

Concurrency and Computation: Practice & Experience
Grid scheduling with NBU service times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a slotted queueing system with C servers (processors) that can handle tasks (jobs). Tasks arrive in batches of random size at the start of every slot. Any task can be executed by any server in one slot with success probability α. If a task execution fails, then the task must be handled in some later time slot until it has been completed successfully. Tasks may be processed by several servers simultaneously. In that case, the task is completed successfully if the task execution is successful on at least one of the servers.We examine the impact of various allocation strategies on the mean number of tasks in the system and the mean response time of tasks. It is proven that both these performance measures are minimized by the strategy which always distributes the tasks over the servers as evenly as possible. Subsequently, we determine the distribution of the number of tasks in the system for a broad class of task allocation strategies, which includes the above optimal strategy as a special case. Some numerical experiments are performed to illustrate the performance characteristics of the various strategies.