참고문헌
- C. Liu and J. Layland, "Scheduling algorithms for multi-programming in a hard-real-time environment", Journal of the ACM, vol. 20, no. 1, pp. 46-61, 1973. https://doi.org/10.1145/321738.321743
- A. Mok, "Fundamental design problems of distributed systems for the hard-real-time environment", Ph.D. dissertation, Massachusetts Institute of Technology, 1983.
- S. K. Dhall and C. L. Liu, "On a real-time scheduling problem", Operations Research 26(1), 1978, pp.127-140. https://doi.org/10.1287/opre.26.1.127
- S. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, "Proportionate progress: a notion offairness in resource allocation", Algorithmica, vol. 15, no. 6, pp. 600-625, 1996. https://doi.org/10.1007/BF01940883
- J. Lee, A. Easwaran, I. Shin and I. Lee, "Zero-laxity based real-time multiprocessor scheduling", Journal of Systems and Software, vol. 84, pp. 2324-2333, 2011. https://doi.org/10.1016/j.jss.2011.07.002
- J. H. Anderson and A. Srinivasan, "Early-release fair scheduling", in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), 2000, pp. 35-43.
- H. Cho, B. Ravindran, and E. D. Jensen, "An optimal real-time scheduling algorithm for multiprocessors", in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2006, pp. 101-110
- B. Andersson and E. Tovar, "Multiprocessor scheduling with few preemptions", in Proceedings of IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 2006, pp. 322-334.
- G. Levin, S. Funk, C. Sadowski, I. Pye, and S. Brandt, "DP-FAIR: A simple model for understanding optimal multiprocessor scheduling", in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), 2010, pp. 3-13.
- P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt, "RUN: Optimal multiprocessor real-time scheduling via reduction to uniprocessor", in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2011, pp. 104-115.
- G. Nelissen, V. Berten, V. Nelis, J. Goossens, and D. Milojevic, "UEDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks", in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), 2012, pp. 13-23.
- E. Massa, G. Lima, P. Regnier, G. Levin, and S. Brandt, "Quasipartitioned scheduling: optimality and adaptation in multiprocessor realtime systems", Real-Time Systems, vol. 52, no. 5, pp. 566-597, 2016. https://doi.org/10.1007/s11241-016-9251-6
- B. B. Brandenburg and M. Gul, "Global Scheduling Not Required: Simple, Near-Optimal Multiproessor Real-Time Scheduling with Semi-Partitioned Reservations", in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2016, pp. 99-110.
- A. Bastoni, B. Brandenburg, and J. Anderson, "Is semi-partitioned scheduling practical?" in in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), pp. 125-135, 2011.
- S. Kato, N. Yamasaki, and Y. Ishikawa, "Semi-partitioned scheduling of sporadic task systems on multiprocessors", in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), pp. 249-258, 2009.
- A. Bums, R. Davis, P. Wang, and F. Zhang, "Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme", Real-Time Systems, vol. 48, pp. 3-33, 2012. https://doi.org/10.1007/s11241-011-9126-9
- M. Cirinei and T. P. Baker, "EDZL scheduling analysis", in Proceedings of Euromicro Conference on Real-Time Systems (ECRTS), 2007, pp. 9-18.
- R. I. Davis and A. Bums, "FPZL schedulability analysis", in Proceedings of IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2011, pp. 245-256.
- J. Lee, A. Easwaran, and I. Shin, "LLF schedulability analysis on multiprocessor platforms", in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2010, pp. 25-36.
- J. Lee, A. Easwaran, and I. Shin, "Maximizing contention-free executions in multiprocessor scheduling", in Proceedings of IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2011, pp. 235-244.
- H. S. Chwa, H. Back, S. Chen,J. Lee, A. Easwaran, I. Shin, and I. Lee, "Extending task-level to job-level fixed priority assignment and schedulability analysis using pseudo-deadlines", in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2012, pp. 51-62.
- H. Back, H. S. Chwa, and I. Shin, "Schedulability analysis and priority assignment for global job-level fixed-priority multiprocessor scheduling", in Proceedings of IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2012, pp. 297-306.
- H. S. Chwa, H. Back, J. Lee, K. M. Phan, and I. Shin, "Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling", Journal of Systems and Software, vol. 101, pp. 15-29, 2015. https://doi.org/10.1016/j.jss.2014.11.019
- T. P. Baker and M. Cirinei, "A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks", in Proceedings ofIEEE Real-Time Systems Symposium (RTSS), 2006, pp. 178-190.
- H. Baek, H. S. Chwa and J. Lee, "Beyond Implicit-Deadline Optimality: A Multiprocessor Scheduling Framework for Constrained-Deadline Tasks", To appear in Proceedings of IEEE Real-Time Systems Symposium (RTSS), 2017.