Journal of the ACM (JACM)
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction
IEEE Transactions on Computers
IEEE/ACM Transactions on Networking (TON)
Real time groupware as a distributed system: concurrency control and its effect on the interface
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
A hierarchial CPU scheduler for multimedia operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The design, implementation and evaluation of SMART: a scheduler for multimedia applications
Proceedings of the sixteenth ACM symposium on Operating systems principles
Effective remote modeling in large-scale distributed simulation and visualization environments
Effective remote modeling in large-scale distributed simulation and visualization environments
Adaptive variation of reliability
HPN '97 Proceedings of the IFIP TC6 seventh international conference on High performance netwoking VII
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Pfair Scheduling of Generalized Pinwheel Task Systems
IEEE Transactions on Computers
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Leveraging Block Decisions and Aggregation in the ShareStreams QoS Architecture
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Dynamic Window-Constrained Scheduling for Multimedia Applications
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Window-Constrained Real-Time Periodic Task Scheduling
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Guaranteed On-Line Weakly-Hard Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
On Network CoProcessors for Scalable, Predictable Media Services
IEEE Transactions on Parallel and Distributed Systems
Dynamic class-based queue management for scalable media servers
Journal of Systems and Software
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Comments on "Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers"
IEEE Transactions on Computers
High performance and scalable I/O virtualization via self-virtualized devices
Proceedings of the 16th international symposium on High performance distributed computing
DLB: a novel real-time QoS control mechanism for multimedia transmission
International Journal of High Performance Computing and Networking
Distributed DBP: a (m,k)-firm based distributed approach for QoS provision in IEEE 802.15.4 networks
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Proceedings of the 2011 International Conference on Communication, Computing & Security
Combining scheduling and concurrency control of real-time transactions within the MOA architecture
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Scheduling linear chain streaming applications on heterogeneous systems with failures
Future Generation Computer Systems
Reliability-aware energy minimization for real-time embedded systems with window-constraints
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
| Hi-index | 14.98 |
Abstract--This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed (or, equivalently, must be met) in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded, even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while, at the same time, guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for bandwidth by a set of window-constrained streams can exceed 100 percent and still ensure all window-constraints are met. In fact, we show how it is possible to strategically skip certain deadlines in overload conditions, yet fully utilize all available link capacity and guarantee worst-case per-stream bandwidth and delay constraints. Finally, we compare DWCS to the "Distance-Based驴 Priority (DBP) algorithm, emphasizing the trade-offs of both approaches.