Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.1.97

Real-Time Aperiodic Tasks Scheduling Using Improved Synthetic Utilization on Multiprocessor Systems  

Moon, Seok-Hwan (Department of Embedded Software, Youngdong University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.1, 2014 , pp. 97-102 More about this Journal
Abstract
Abdelzaher et al. proposed an algorithm to determine the schedulability of aperiodic tasks on multiprocessor systems, and proved that the aperiodic tasks are schedulable if the upperbound of synthetic utilization is less than or equal to 0.59. But this algorithm has a drawback in that if some tasks, even though they are completed and have no more execution times, are included in the current invocation set, their execution times and deadlines are added to the synthetic utilization. This may lead to a problem in which actually schedulable tasks are decided not to be schedulable. In this paper, we recognize the above mentioned problem and propose an improved synthetic utilization method that can be used to schedule aperiodic tasks more efficiently on multiprocessor systems.
Keywords
Real-Time Scheduling; Aperiodic Tasks; Synthetic Utilization; multiprocessor systems;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in hard real time environment", Journal of the ACM, vol. 20, pp. 46-61, Jan. 1973.   DOI
2 H. Chetto and M. Chetto, "Some results of the earliest deadline first scheduling algorithm", IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1261-1268, Oct. 1989.   DOI   ScienceOn
3 Kim, In-Guk, Kim, Dong-Yoon and Hong, Man-pyo, "Real-time scheduling of tasks that contain the external blocking intervals", Proceedings Second International Workshop on RTCSA '95, pp. 54-59, 1994.
4 A. Wellings, M. Richardson, A. Burns, N. Audsley, K. Tindell, "Applying new scheduling theory to static priority preemptive scheduling." Report RTRG 1921120, Dept. of Computer Science, Univ. of York.
5 J. P. Lehoczky, and S. Ramos-Thuel, "An optimal algorithm for scheduling soft-aperiodic tasks in fixedpriority preemtive systems", in Proceedings of the real- Time Systems Symposium, pp. 110-123, Dec. 1992.
6 S. R. Thuel and J. P. Lehoczky, "Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing", in Proceedings of IEEE Real-Time Systems Symposium, pp. 22-33, Dec. 1995.
7 T. F. Abdelzaher, V. Sharma, and C. Lu, "A Utilization bound for aperiodic tasks and priority driven scheduling", IEEE Transactions on Computers, vol. 53, no. 3, pp. 334-350, Mar 2004.   DOI   ScienceOn
8 T. F. Abdelzaher and C. Lu, "Schedulability analysis and utilization bounds for highly scalable real-time services", in Proceedings of IEEE Real-Time Technology and Applications Symposium, May 2001.
9 T. F. Abdelzaher and B. Anderson, J. Jonsson, V. Sharma, and M. Nguyen. "The aperiodic multiprocessor utilization bound for liquid tasks." in Real-time and Embedded Technology and Applications Symposium, San Jose, California, September 2002.
10 T. F. Abdelzaher and V. Sharma. "A synthetic utilization bound for aperiodic tasks with resource requirements." in 15th Euromicro Conference on Real-Time Systems, porto, Portugal, July 2003.
11 J. Park, M. Ryu, and S. Hong, "Deterministic and statistical admission control for QoS-aware embedded systems", Journal of Embedded Computing, vol. 1, no. 1, 2004.
12 J. P. Lehoczky, "Real-time queueing theory", in Proceedings of IEEE Real-Time Systems Symposium, pp. 186-195, Dec. 1996.