Task allocation in multiserver systems -- a survey of results.
From MaRDI portal
Publication:5955746
DOI10.1007/BF02811333zbMath1075.90513MaRDI QIDQ5955746
Publication date: 18 February 2002
Published in: Sādhanā (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the optimality of semidynamic routing schemes
- Stochastic inequalities on partially ordered spaces
- On the optimal allocation of customers that must depart in sequence
- Two Parallel Queues Created by Arrivals with Two Demands I
- Optimal Load Balancing in a Multiple Processor System with Many Job Classes
- Optimal control of two interacting service stations
- Optimal control of a queueing system with two heterogeneous servers
- Extremal Splittings of Point Processes
- Deciding Which Queue to Join: Some Counterexamples
- Optimal static load balancing in distributed computer systems
- Acyclic fork-join queuing networks
- Resource Sharing for Efficiency in Traffic Systems
- A simple dynamic routing problem
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- Two queues in parallel
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- An upper bound for multi-channel queues
- A Basic Dynamic Routing Problem and Diffusion
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
- Parallel queues with resequencing
This page was built for publication: Task allocation in multiserver systems -- a survey of results.
