Asymptotic optimality of statistical multiplexing in pipelined processing
From MaRDI portal
Publication:1908671
DOI10.1007/BF01158576zbMath0838.60081MaRDI QIDQ1908671
Nicholas Bambos, Kimberly Wasserman
Publication date: 20 March 1996
Published in: Queueing Systems (Search for Journal in Brave)
ergodicity; stationarity; tandem queueing networks; throughput optimization; statistical multiplexing; pipelined processing
60K25: Queueing theory (aspects of probability theory)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Cites Work
- On the asymptotic execution time of multi-tasked processes on tandem processors
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Open Shop Scheduling to Minimize Finish Time
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item