Distributed dispatching in the parallel server model

DOI10.4230/lipics.disc.2020.14zbMATH Open1543.68047MaRDI QIDQ6535011

Yoram Moses, Guy Goren, Shay Vargaftik

Publication date: 2 November 2023

zbMATH Keywords

join the shortest queuedistributed load balancingparallel server modeltidal water filling

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• Load balancing without regret in the bulletin board model
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers
• On the maximum queue length in the supermarket model
• Pull-based load distribution in large-scale heterogeneous service systems
• Power-of-d-Choices with Memory: Fluid Limit and Optimality
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• Time, clocks, and the ordering of events in a distributed system
• Parallel randomized load balancing
• Reducibility among Combinatorial Problems
• Persistent-Idle Load-Distribution
• Tight bounds for parallel randomized load balancing

Related Items (1)

The parallel client--server paradigm

Recommendations

• Task allocation in distributed processing systems 👍 👎
• Task allocation model for distributed systems 👍 👎
• The parallel client--server paradigm 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Distributed dispatching in the parallel server model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535011)