Kumar, Anurag (1990) Task allocation in multiserver systems - A survey of results. In: Sadhana, 15 (4-5). pp. 381-395.
Jobs consisting of one or more tasks arrive to a system comprising several servers, each with its own queue. Each task requires a single service at any of the servers, and a job completes service when all its constituent tasks have been serviced. Such models arise in the performance modelling of distributed computing systems, computer communication networks, and manufacturing systems. We survey the literature on this class of models. We classify jobs as being of one of three types: single tasks, multitask with precedence constraints, and multitask stream jobs. After surveying the optimal allocation problem for single task jobs, we discuss the results on the performance analysis and optimal allocation of tasks for the other two job types.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Indian Academy of Sciences.|
|Keywords:||Control of queues; customer allocation; routing; load balancing.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||07 Mar 2008|
|Last Modified:||19 Sep 2010 04:43|
Actions (login required)