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 |
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.
|
4 |
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, Sep. 2002.
|
5 |
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.
|
6 |
문석환, 김인국, "실시간 비주기 태스크 스케줄링을 위한 개선된 합성 이용율에 관한 연구," 디지털콘텐츠학회 논문지, 제9권 제3호, pp.441-448, 2008.
과학기술학회마을
|
7 |
M. Spuri and G. C. Buttazzo, "Scheduling Aperiodic Tasks in Dynamic Priority Systems," Journal of Real-Time Systems, vol. 10, no. 2, pp. 179-210, 1996.
DOI
|
8 |
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
|