Asymptotic optimality of statistical multiplexing in pipelined processing

DOI10.1007/BF01158576MaRDI QIDQ1908671zbMATH OpenOpenAlexFDO

Authors Nicholas Bambos, Kimberly Wasserman

Publication date 20 March 1996

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01158576

zbMATH Keywords

ergodicitystationaritytandem queueing networksthroughput optimizationstatistical multiplexingpipelined processing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• Asymptotic scheduling
• On the asymptotic execution time of multi-tasked processes on tandem processors
• Stochastic dispatching of multi-priority jobs to heterogeneous processors
• On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem
• Blocking, reordering, and the throughput of a series of servers

Cites work

• scientific article; zbMATH DE number 3745547 (Why is no real title available?)
• scientific article; zbMATH DE number 3786125 (Why is no real title available?)
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• scientific article; zbMATH DE number 53772 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 204193 (Why is no real title available?)
• scientific article; zbMATH DE number 941166 (Why is no real title available?)
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop and Jobshop Schedules: Complexity and Approximation
• On the asymptotic execution time of multi-tasked processes on tandem processors
• Open Shop Scheduling to Minimize Finish Time
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(3)

• On the asymptotic execution time of multi-tasked processes on tandem processors
• The minimal average latency of multiconfigurable pipelines
• Optimal depth of the computational pipeline for a given amount of input data

This page was built for publication: Asymptotic optimality of statistical multiplexing in pipelined processing

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