Parallel queues with resequencing

DOI10.1145/174147.169748MaRDI QIDQ4285637zbMATH OpenOpenAlexFDO

Authors Alain Jean-Marie, Levent Gün

Publication date 17 April 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174147.169748

zbMATH Keywords

asymptoticsresequencingstochastic convexityparallel queuesM/GI/1

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Optimal routing to two parallel heterogeneous servers with resequencing
• Minimizing response times and queue lengths in systems of parallel queues
• On the Assignment of Customers to Parallel Queues
• Effects of service disciplines in \(G/GI/s\) queueing systems
• Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers

Cited in

(13)

• Tail asymptotics for discrete event systems
• Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
• Resequencing with parallel queues to minimize the maximum number of items in the overflow area
• A. B. Clarke's Tandem Queue Revisited—Sojourn Times
• scientific article; zbMATH DE number 4007418 (Why is no real title available?)
• Asymptotic optimality of the round-robin policy in multipath routing with resequencing
• Delay asymptotics and bounds for multitask parallel jobs
• Two Parallel Queues with Dynamic Routing
• Task allocation in multiserver systems -- a survey of results.
• Tails for (max, plus) recursions under subexponentiality
• Order restoration in queues
• Reordering an existing queue
• Packet reordering in networks with heavy-tailed delays

This page was built for publication: Parallel queues with resequencing

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