Disk scheduling in a multimedia I/O system

@article{Reddy1993DiskSI,
  title={Disk scheduling in a multimedia I/O system},
  author={A. L. Narasimha Reddy and Jim Wyllie},
  journal={ACM Trans. Multim. Comput. Commun. Appl.},
  year={1993},
  volume={1},
  pages={37-59}
}
  • A. Reddy, J. Wyllie
  • Published 1 February 2005
  • Computer Science
  • ACM Trans. Multim. Comput. Commun. Appl.
This article provides a retrospective of our original paper by the same title in the Proceedings of the First ACM Conference on Multimedia, published in 1993. [] Key Method We compare SCAN-EDF with other scheduling strategies and show that SCAN-EDF combines the best features of both SCAN and EDF. We also investigate the impact of buffer space on the maximum number of video streams that can be supported.We show that by making the deadlines larger than the request periods, a larger number of streams can be…
View on ACM
doi.org
246 Citations
Highly Influential Citations
12
Background Citations
80
Methods Citations
35
Results Citations
2

Figures and Tables from this paper

246 Citations

Citation Type

Citation Type

I/o Issues in a Multimedia System 2 Disk Scheduling Algorithms 4 Performance Evaluation 4.1 System Model 4.4 Eeect of Scsi Bus Contention 5 Admission Control 6 Impact on Computer System Design
TLDR
It is shown that by making the deadlines larger than the request periods, a larger number of streams can be supported and how deadline extension helps in utilizing multiple disks on a single SCSI bus is shown.
Real-time scheduling of multimedia data retrieval to minimize buffer requirement
TLDR
Two real-time algorithms and a technique, called object migration, to minimize buffer requirement for meta-I/O scheduling are proposed and results indicate that these approaches perform much better than existing real- time algorithms in terms of reducing buffer requirement.
Multimedia real-time disk scheduling by hybrid local/global seek-optimizing approaches
  • R. Chang, W. Shih, R. Chang
  • Computer Science
    Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)
  • 2000
TLDR
This paper improves SCAN-EDF by applying different hybrid local-merging and global-inserting schemes, and shows that the proposed method is significantly better than SCAN, the best-known real-time disk scheduling method.
Deadline-modification-SCAN with maximum-scannable-groups for multimedia real-time disk scheduling
  • R. Chang, W. Shih, R. Chang
  • Computer Science
    Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)
  • 1998
TLDR
The proposed DM-SCAN method can apply SCAN to MSG iteratively by modifying request deadlines iteratively using the idea of MSG (maximum-scannable-group).
Techniques for Scheduling I/O in a High Performance Multimedia-on-Demand Server
TLDR
This paper develops a model for the architecture of a server for a distributed multimedia system with high performance, and presents two modifications of the basic retrieval algorithm to exploit data access patterns in order to improve system throughput and response time.
Adaptive disk scheduling in a multimedia DBMS
TLDR
This paper focuses on the low-level scheduling in APEX, a disk scheduling framework with QoS support, designed for environments with highly varying disk bandwidth usage, and demonstrates its robustness with respect to misaligned bandwidth allocation.
A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads
TLDR
Experiments with various synthetic and real-world I/O workloads show that G-SCAN outperforms existing disk scheduling algorithms significantly in terms of the average response time, throughput, and QoS-guarantees for heterogeneous I/o workloads.
A parallel disk storage system for real-time multimedia applications
TLDR
The design and implementation of the RIO (Randomized I/O) multimedia object server which manages a set of parallel disks and supports real-time throughput and statistical delay guarantees is described and experimental performance results measured on a prototype implementation are presented.
A New Optimized Real-Time Disk Scheduling Algorithm
TLDR
A new disk scheduling algorithm has been developed and implemented to reduce the number of head movements and hence it maximizes the throughput for the modern storage devices.
Survey and analysis of disk scheduling methods
TLDR
This paper proposes improvements to a recent analysis of the SCAN policy and carries out an empirical investigation of SATF performance to derive a relationship between the queue-length and mean service time, while both methods outperform FCFS scheduling.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Scheduling I/O requests with deadlines: A performance evaluation
TLDR
The authors present a realistic model for studying the I/O scheduling problem in the context of a system which executes real-time transactions that takes advantage of the fact that reading from the disk occurs before a transaction commits, while writing to the disk usually occurs after the transaction commits.
Designing file systems for digital video and audio
TLDR
A model that relates disk and device characteristics to the recording rate, and derive storage granularity and scattering parameters that guarantee continuous access is presented, which serves as a testbed for experimenting with policies and algorithms for multimedia storage.
Support for fully interactive playout in disk-array-based video server
TLDR
Methods to support variable rate browsing for MPEG-like video steams and minimize the additional resources required are devised and it is shown that the proposed method is a viable approach to video browsing.
The SPIFFI scalable video-on-demand system
TLDR
It is shown that the SPIFFI video-on-demand system scales nearly linearly as the number of disks, videos, and terminals is increased.
The Design of a Storage Server for Continuous Media
TLDR
The design and implementation of a file server which has been specially optimized for continuous media, which addresses critical performance issues including the use of disk striping to provide high bandwidth, optimized disk layouts, and hard real-time disk scheduling.
A study of I/O system organizations
TLDR
It is shown that decoupling the fetch size and the cache block size results in significant performance improvements and that optimal block size in a two-level memory hierarchy is dependent only on the latency, data rate product of the second level as previously conjectured.
An Evaluation of Multiple-Disk I/O Systems
TLDR
Through simulations it is shown that synchronized organizations perform better than other organizations at very low request rates; that there is a tradeoff in the amount of declustering/synchronization to be used in a system; and that systems with higher parallelism in reading a file perform better in a scientific workload.
Scalable video data placement on parallel disk arrays
TLDR
The constant frame grouping strategy is tested on an actual array of 8 disks and shown to have performance that is close to the theoretical prediction.
Real-Time Disk Storage and Retrieval of Digital Audio/Video Data
TLDR
Simulation is used to compare different design choices and to estimate the performance of CMFS under various load conditions and hardware assumptions.
Providing VCR capabilities in large-scale video servers
TLDR
This paper proposes an alternative, effectiveFF/Rew service, which provides FF/Rew capabilities with an associated statistical quality-of-service (QoS) guarantee, and shows that using effective FF/ Rew with statistical guarantees on these QoS metrics results in a significant increase in the number of supportable users, when compared to systems in which FF/ Rewards bandwidth is statistically reserved for each user.
...
1
2
3
...