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
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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
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
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems 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
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Dynamic Window-Constrained Scheduling for Multimedia Applications
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
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
IEEE Transactions on Computers
Lightweight kernel/user communication for real-time and multimedia applications
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Coordinated CPU and event scheduling for distributed multimedia applications
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Journal of VLSI Signal Processing Systems
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
A tool for describing and evaluating hierarchical real-time bus scheduling policies
Proceedings of the 40th annual Design Automation Conference
On Network CoProcessors for Scalable, Predictable Media Services
IEEE Transactions on Parallel and Distributed Systems
Scheduling algorithms based on weakly hard real-time constraints
Journal of Computer Science and Technology
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
KStreams: kernel support for efficient data streaming in proxy servers
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Flexible cross-domain event delivery for quality-managed multimedia applications
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
IEEE Transactions on Computers
Adaptive fuzzy control scheduling of window-constrained real-time systems
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Effective thread management on network processors with compiler analysis
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Analysis of window-constrained execution time systems
Real-Time Systems
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint
Multimedia Tools and Applications
Proceedings of the 2011 International Conference on Communication, Computing & Security
Workload balancing and throughput optimization for heterogeneous systems subject to failures
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Compiler-Supported Thread Management for Multithreaded Network Processors
ACM Transactions on Embedded Computing Systems (TECS)
Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
A hardware NIC scheduler to guarantee qos on high performance servers
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
International Journal of Advanced Pervasive and Ubiquitous Computing
Scheduling linear chain streaming applications on heterogeneous systems with failures
Future Generation Computer Systems
| Hi-index | 0.01 |
This paper describes how Dynamic Window-Constrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with different performance objectives. We show that: (1) DWCS can guarantee that no more than x packets miss their deadlines for every y consecutive packets requiring service, as long as the minimum aggregate bandwidth requirement of all real-time packet streams does not exceed the available bandwidth, (2) using DWCS, the delay of service to realtime packet streams is bounded even when the scheduler is overloaded, (3) DWCS can ensure that the delay bound of any given stream is independent of other streams, and (4) a fast response time for best-effort packet streams, in the presence of real-time packet streams, is possible. Furthermore, if a feasible schedule exists, each stream is guaranteed a minimum fraction of available bandwidth over a finite window of time.