Browse > Article

An Efficient Data Structure for Queuing Jobs in Dynamic Priority Scheduling under the Stack Resource Policy  

Han Sang-Chul (서울대학교 컴퓨터공학과)
Park Moon-Ju (IBM 유비쿼터스 컴퓨팅 연구소)
Cho Yoo-Kun (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.33, no.6, 2006 , pp. 337-343 More about this Journal
Abstract
The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.
Keywords
real-time scheduling; dynamic priority; EDF; resource sharing; SRP; ready queue; binary tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 K. Jeffay, 'Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems,' In Proceedings of 13th IEEE Real-Time Systems Symposium, pp.89-99, 1992
2 C. L. Liu and J. W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,' Journal of the ACM, Vol.20, No.1, pp.46-61, 1973   DOI
3 M. Chen and K. Lin, 'Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time Systems,' Real-Time Systems, Vol.2, No.4, pp.325-346   DOI
4 T. Baker, 'Stack-Based Scheduling of Real-Time Processes,' Real-Time Systems, Vol.3, No.1, pp.67-100, 1991   DOI
5 L. Sha, R. Rajkumar, and J. Lehoczky, 'Priority Inheritance Protocols: An Approach to Real-Time Synchronization,' IEEE Transactions on Computers, Vol.39, No.9, pp.1175-1185, 1990   DOI   ScienceOn
6 K. M. Zuberi, P. Pillai, and K. G. Shin, 'EMERALDS: A Small-Memory Real-Time Microkernel,' In Proceedings of 17th ACM Symposium on Operating Systems Principles, pp.277-299, 1999   DOI
7 J. W. Liu, Real-Time Systems, Prentice-Hall, 2000
8 J. P. Lehoczky and L.. Sha, 'Performance of Real-Time Bus Scheduling Algorithms,' In Proceedings of the Joint Conference on Computer Performance Modelling, Measurement and Evaluation, pp.44-53, 1986
9 M. Park, L. Sha, and Y. Cho, 'A Practical Approach to Earliest Deadline Scheduling,' SNU-CE-TR-2001-2, 2001