Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Reddy, J. Wyllie (1994)
I/O issues in a multimedia systemComputer, 27
Fred Chow, J. Hennessy (1990)
The priority-based coloring approach to register allocationACM Trans. Program. Lang. Syst., 12
Wen-Jiin Tsai, Suh-Yin Lee (1994)
Storage design and retrieval of continuous multimedia using multi-disksProceedings of 1994 International Conference on Parallel and Distributed Systems
J. Jackson (1955)
SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS
A. Reddy, J. Wyllie, Ravi Wijayaratne (1993)
Disk scheduling in a multimedia I/O systemACM Trans. Multim. Comput. Commun. Appl., 1
R. Larson, M. Dessouky (1978)
Heuristic procedures for the single machine problem to minimize maximum latenessIie Transactions, 10
P. Sorenson (1974)
A methodology for real-time system development.
(1973)
Scheduling algorithms for multiprogramming in a hard real-time environment
Qunyan Wu (1996)
Register Allocation via Hierarchical Graph Coloring
Continuous display is an important issue in the domain of multimedia applications. Especially, to ensure this continuity in the presence of multiusers, a feasible scheduling algorithm is prerequisite for real time data retrieval from the I/O subsystem. I/O scheduling techniques can be classified into two types: meta-I/O scheduling which arranges the sequence of data retrieval before issuing physical I/O requests, and disk scheduling which determines the order of processing I/O requests that have been issued. In disk scheduling, there are several elegant algorithms that had been discussed such as Scan, C-Scan, shortest seek time first and Scan-EDF. All of them focused on improving I/O throughput by serving requests closer to disk head first 78. We focus this paper, however, on solving the real time meta-I/O scheduling.For real-time scheduling, several algorithms had been addressed such as earliest-deadline-first (EDF) 4, least-laxity-first (LLF) 9, earliest-ready-time first (LRF) 6, and so on, which had shown to be elegant for task scheduling to promote system throughput. When applying to meta-I/O scheduling, however, these algorithms would result in large amount of buffer requirement for accommodating the retrieved data. In this paper, we proposed two real-time algorithms and a technique, called object migration, to minimize buffer requirement for meta-I/O scheduling. A buffer measurement approach was also proposed in this paper to estimate the performance of a real-time scheduling algorithm, which is based upon the well-known graph coloring technique. Simulation experiments were conducted to analyze the performance of algorithms. The results indicate that our approaches perform much better than existing real-time algorithms in terms of reducing buffer requirement.
ACM SIGOPS Operating Systems Review – Association for Computing Machinery
Published: Jul 1, 1996
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.