Task allocation in multiserver systems -- a survey of results.
From MaRDI portal
Cites work
- A Basic Dynamic Routing Problem and Diffusion
- A simple dynamic routing problem
- Acyclic fork-join queuing networks
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- An upper bound for multi-channel queues
- Deciding Which Queue to Join: Some Counterexamples
- Extremal Splittings of Point Processes
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 46744 (Why is no real title available?)
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 941166 (Why is no real title available?)
- Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
- On the optimal allocation of customers that must depart in sequence
- On the optimal assignment of customers to parallel servers
- On the optimality of semidynamic routing schemes
- Optimal control of a queueing system with two heterogeneous servers
- Optimal control of two interacting service stations
- Optimal Load Balancing in a Multiple Processor System with Many Job Classes
- Optimal static load balancing in distributed computer systems
- Optimality of the shortest line discipline
- Parallel queues with resequencing
- Resource Sharing for Efficiency in Traffic Systems
- Stochastic inequalities on partially ordered spaces
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two queues in parallel
This page was built for publication: Task allocation in multiserver systems -- a survey of results.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955746)
