Advertisement

Earliest-Deadline-First scheduling on nonpreemptive real-time threads for a continuous media server

  • Jong Moon Sohn
  • Gil Yong Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1225)

Abstract

The continuous-media application should use the real-time scheduling facility of the operating system to satisfy the time constraints. We consider the problem of non-preemptively scheduling periodic threads on a video server when the Earliest Deadline First(EDF) scheduling is used. When EDF scheduling is used for a set of periodic tasks, we can achieve high processor utilization. But the schedulability test is known to be an NP-hard problem.

This paper analyze the characteristics of video server threads, and proves that there is the sufficient condition for scheduling the threads by limiting the time constraints. The proposed sufficient condition performs the schedulability test within O(1) time complexity. We conclude by considering the applicability to the real-time scheduler.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Clifford W. Mercer, Stefan Savage, Hideyuki Tokuda, “Processor Capacity Reserves for Multimedia Operating Systems”, CMU-CS-93-157, May 1993Google Scholar
  2. [2]
    Kang G. Shin, Yi-Chieh Chang, “A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks”, IEEE Transactions on Computers, pp1405–1419, Dec. 1995Google Scholar
  3. [3]
    Klara Nahrstedt, Ralf Steinmetz, “Resource Management in Networked Multimedia Systems”, IEEE Computer, pp52–64, May 1995Google Scholar
  4. [4]
    Tatjana M. Burkow, “Operating System Support for Distributed Multimedia Applications; A Survey of Current Research”, University of Cambridge, Pegasus Paper 94-8, June 1994Google Scholar
  5. [5]
    Hiroyuki Kaneko, John A. Stankvic, “A Multimedia Server on the Spring Real-Time System”, University of Massachusetts, UM-CS-96-011, Jan. 1996Google Scholar
  6. [6]
    Yun Cheol Baek, Kern Koh, “Design Consideration on Continuous Media File Server using Non-preemptive Real-Time Scheduling”, Journal of the Korea Information Science Society, Vol. 22, No. 2, pp241–248, Feb. 1995Google Scholar
  7. [7]
    Divyesh Jadav, Alok Choudhary, “Designing and Implementing High-Performance Media-on-Demand Servers”, Syracuse University, IEEE, 1995Google Scholar
  8. [8]
    R. Howell and M. Venkatrao. “On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times.” Information and Computation 117 (1995), pp. 50–62.Google Scholar
  9. [9]
    Jeong Gook Koh, Gyeong Gyu Nam, Gil Yong Kim, “Design and Implementation of A File System for Multimedia Data Stream”, proceedings of the 23th KISS Spring Conference, pp407–411, Apr. 1996Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jong Moon Sohn
    • 1
  • Gil Yong Kim
    • 1
  1. 1.Department of Computer EngineeringPusan National UniversityPusanKorea

Personalised recommendations