Scheduling and IPC mechanisms for continuous media
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Architectural issues in microkernel-based operating system: the CHORUS experience
Computer Communications
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Extending the Rate-Monotonic Scheduling Algorithm to Get Shorter Delays
IWACA '94 Proceedings of the Second International Workshop on Multimedia: Advanced Teleservices and High-Speed Communication Architectures
QoS Adaption and Flow Filtering in ATM Networks
IWACA '94 Proceedings of the Second International Workshop on Multimedia: Advanced Teleservices and High-Speed Communication Architectures
SVR4UNIX Scheduler Unacceptable for Multimedia Applications
NOSSDAV '93 Proceedings of the 4th International Workshop on Network and Operating System Support for Digital Audio and Video
Multimedia file systems survey: approaches for continuous media disk scheduling
Computer Communications
The design of a QoS-controlled ATM-based communications system in Chorus
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present new admission tests for periodic real-time threads with explicitly stated deadlines scheduled according to the earliest deadline first (EDF) algorithm. In traditional real-time periodic scheduling, the deadline of a periodic thread is conventionally the end of the current period. In contrast, our tests support periodic threads in which the deadline may be earlier than the end of the current period. In the extreme case, the deadline may be specified as identical to the per period execution time, which results in perfectly isochronous periodic threads. The provision of such threads, which we refer to as jitter-constrained threads, helps end-systems to honour jitter as well as throughput-related QoS parameters in distributed multimedia systems. In addition, such threads can reduce end-to-end delay and buffer memory requirements as less buffering is needed to smooth excessive delay jitter.