Asymptotic optimality of statistical multiplexing in pipelined processing
DOI10.1007/BF01158576zbMATH Open0838.60081OpenAlexW2005391014MaRDI QIDQ1908671FDOQ1908671
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
ergodicitystationaritytandem queueing networksthroughput optimizationstatistical multiplexingpipelined processing
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- Open Shop Scheduling to Minimize Finish Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Title not available (Why is that?)
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- On the asymptotic execution time of multi-tasked processes on tandem processors
- Title not available (Why is that?)
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 👍 👎
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)
