Task Allocation in a Multi-Server System

@article{Borst2003TaskAI,
  title={Task Allocation in a Multi-Server System},
  author={Sem C. Borst and Onno J. Boxma and Jan Friso Groote and Sjouke Mauw},
  journal={J. Scheduling},
  year={2003},
  volume={6},
  pages={423-436}
}
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… CONTINUE READING
9 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Comparison Methods for Queues and Other Stochastic Models

  • D. Stoyan
  • 1983
Highly Influential
3 Excerpts

Task allocation in a multi-server system

  • S. C. Borst, O. J. Boxma, J. F. Groote, S. Mauw
  • CWI Report PNA-R0122,
  • 2001
2 Excerpts

An algorithm for the asynchronous Write - All problem based on process collision

  • S. Mauw
  • The Grid : Blueprint for a New Computing…
  • 1999

Similar Papers

Loading similar papers…