Introduction to algorithms
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
IEEE/ACM Transactions on Networking (TON)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Improved scheduling of generalized pinwheel task systems
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Comparison of Bandwidth Smoothing Techniques for the Transmission of Prerecorded Compressed Video
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Adaptive Scheduling of MPEG Video Frames during Real-Time Wireless Video Streaming
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
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
The MPEG-4 fine-grained scalable video coding method for multimediastreaming over IP
IEEE Transactions on Multimedia
Rate-distortion optimized streaming of packetized media
IEEE Transactions on Multimedia
Critical bandwidth allocation for the delivery of compressed video
Computer Communications
Applying traffic smoothing techniques for quality of service control in VBR video transmissions
Computer Communications
Cross-Layer Optimized Rate Adaptation and Scheduling for Multiple-User Wireless Video Streaming
IEEE Journal on Selected Areas in Communications
Overview of fine granularity scalability in MPEG-4 video standard
IEEE Transactions on Circuits and Systems for Video Technology
A monotonic-decreasing rate scheduler for variable-bit-rate video streaming
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
MPEG-4 video coding stream with Fine Granularity Scalability (FGS) can be flexibly dropped by very fine granularity so as to adapt to the available network bandwidth. The MPEG-4 FGS model is similar to the imprecise computation model originally proposed in the real-time scheduling field. In both models, it is required that all the mandatory tasks be completely scheduled before their deadlines even in the worst case, which is called the feasible mandatory constraint. The problem is how to maximize the number of the scheduled tasks based on the importance of tasks and to satisfy the feasible mandatory constraint. We adapt the existing unit-time tasks scheduling algorithm to address the problem by using a weighted assignment scheme that adds constant weights to mandatory tasks. Under the feasible mandatory constraint, we prove that the proposed algorithm maximizes the total weights of the scheduled tasks, and all mandatory tasks are guaranteed to be completely scheduled before their deadlines. The experimental results show the performance of the video quality for our scheduling algorithm by the measurements of Peak Signal to Noise Ratio (PSNR).