Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
IEEE/ACM Transactions on Networking (TON)
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
IEEE Transactions on Parallel and Distributed Systems
A lossless smoothing algorithm for compressed video
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Adaptive rate-controlled scheduling for multimedia applications
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines
IEEE Transactions on Software Engineering
Rate-Monotonic Scheduling in the Presence of Timing Unpredictability
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Practical Solutions for QoS-Based Resource Allocation
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Real-time interactive MPEG-4 system encoder using a cluster ofworkstations
IEEE Transactions on Multimedia
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
Joint selection of source and channel rate for VBR video transmission under ATM policing constraints
IEEE Journal on Selected Areas in Communications
Quality control for VBR video over ATM networks
IEEE Journal on Selected Areas in Communications
Rate control for VBR video coders in broad-band networks
IEEE Journal on Selected Areas in Communications
Performance evaluation of ATM networks carrying constant and variable bit-rate video traffic
IEEE Journal on Selected Areas in Communications
Smoothing, statistical multiplexing, and call admission control for stored video
IEEE Journal on Selected Areas in Communications
Performance of software-based MPEG-2 video encoder on parallel and distributed systems
IEEE Transactions on Circuits and Systems for Video Technology
A software-based MPEG-4 video encoder using parallel processing
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
Simultaneous transmission of multiple high quality video streams from a server to the clients is becoming an increasingly important class of traffic in a network of workstations or cluster environment. With a powerful symmetric multiprocessor (SMP) as the server and a high-speed network, such transmission is practicable from a hardware point of view. However, the actual construction of such a video data server system entails tackling a number of difficult problems related to the provision of strict quality of service (QoS) guarantees. Among others, the smoothing and scheduling of multiple video packet streams are two crucial issues. Smoothing is concerned with reducing the rate variability of video streams in view of the fact that video data are usually compressed in a variable bit rate fashion. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. Although much work on smoothing has been done, it is not clear which scheduling scheme is suitable for multiplexing smoothed video data to the network. In this paper we present an extensive performance study of the EDF and RM scheduling algorithms which are modified to provide QoS guarantees for smoothed video data. With a probabilistic definition of QoS, admission control conditions are incorporated into the two algorithms. Furthermore, a counter-based scheduling module is included as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two modified algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments based on an SMP-based Linux platform, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm, due to its conservative admission control policy, is found to be not suitable for a high level of utilization and a large number of requests. In view of the lower complexity of the QRM algorithm, it seems that the QRM approach is a more suitable candidate for packet scheduling in the client-server environment considered in our study.