“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $30/month

Get 2 Weeks Free

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

Real-time scheduling of multimedia data retrieval to minimize buffer requirement 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGOPS Operating Systems Review Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/real-time-scheduling-of-multimedia-data-retrieval-to-minimize-buffer-kGi1aeTVWy

You're reading a free preview. Subscribe to read or print the entire article.

And millions more from thousands of peer-reviewed journals, for just $30/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.