NDLI: Real-time scheduling of multimedia data retrieval to minimize buffer requirement

Please wait, while we are loading the content...

Real-time scheduling of multimedia data retrieval to minimize buffer requirement

Content Provider	ACM Digital Library
Author	Lee, Suh-Yin Tsai, Wen-Jiin
Abstract	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 [7][8]. 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.
Starting Page	67
Ending Page	80
Page Count	14
File Format	PDF
ISSN	01635980
DOI	10.1145/230908.230921
Journal	ACM SIGOPS Operating Systems Review (OPSR)
Volume Number	30
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Data retrieval Buffer management Scheduling Real time
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Energy-efficient soft real-time CPU scheduling for mobile multimedia systems

Energy-aware disk scheduling for soft real-time I/O requests

Systems and architectures for multimedia information retrieval

Incorporating packet semantics in scheduling of real-time multimedia streaming

Retrieval scheduling for collaborative multimedia presentations

Deadline-modification-SCAN with maximum-scannable-groups for multimedia real-time disk scheduling

Buffer model and management in distributed multimedia presentation systems

Robust source-channel coding for real-time multimedia

Disk scheduling in a multimedia I/O system

Real-time scheduling of multimedia data retrieval to minimize buffer requirement

Similar Documents

Energy-efficient soft real-time CPU scheduling for mobile multimedia systems

Energy-aware disk scheduling for soft real-time I/O requests

Systems and architectures for multimedia information retrieval

Incorporating packet semantics in scheduling of real-time multimedia streaming

Retrieval scheduling for collaborative multimedia presentations

Deadline-modification-SCAN with maximum-scannable-groups for multimedia real-time disk scheduling

Buffer model and management in distributed multimedia presentation systems

Robust source-channel coding for real-time multimedia

Disk scheduling in a multimedia I/O system

Real-time scheduling of multimedia data retrieval to minimize buffer requirement