The case for fair multiprocessor scheduling

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Srinivasan, Anand ^a   Holman, Philip ^a   Anderson, James H ^a   Baruah, Sanjoy ^a  

^a Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; FAULT TOLERANCE; SCHEDULING;

DYNAMIC TASKS; EARLIEST DEADLINE FIRST ALGORITHM; FIRST FIT; MULTI PROCESSOR SCHEDULING; PFAIR SCHEDULING; PROCESSOR SCHEDULING; TEMPORAL ISOLATION;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 84947204613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213226     Document Type: Conference Paper

References (38)

1. L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proc. of the IEEE Realtime Systems Symp. , pp. 4-13, Dec. 1998.
2. J. Anderson, S. Ramamurthy, and K. Jeffay. Real-Time Computing with Lock-Free Objects. ACM Trans. on Computer Systems, 15(6):388-395, May, 1997.
3. J. Anderson and A. Srinivasan. Early-release fair scheduling. In Proc. of the Euromicro Conf. on Real-time Systems, pp. 35-43, June 2000.
4. J. Anderson and A. Srinivasan. Pfair scheduling: Beyond periodic task systems. In Proc. of the International Conf. on Real-time Computing Systems and Applications, pp. 297-306, Dec. 2000.
5. J. Anderson and A. Srinivasan. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proc. of the Euromicro Conf. on Real-time Systems, pp. 76-85, June 2001.
6. S. Baruah, N. Cohen, C. G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600-625, 1996.
7. S. Baruah, J. Gehrke, and C. G. Plaxton. Fast scheduling of periodic tasks on multiple resources. In Proc. of the International Parallel Processing Symp. , pp. 280-288, Apr. 1995.
8. J. Bennett and H. Zhang. WF2Q: Worst-case fair queueing. In Proc. of IEEE INFOCOM, pp. 120-128, Mar. 1996.
9. A. Burchard, J. Liebeherr, Y. Oh, and S. H. Son. Assigning real-time tasks to homogeneous multiprocessor systems. IEEE Trans. on Computers, 44(12):1429-1442, 1995.
10. A. Chandra, M. Adler, P. Goyal, and P. Shenoy. Surplus fair scheduling: A proportional-share CPU scheduling algorithm for symmetric multiprocessors. In Proc. of the ACM Symp. on Operating System Design and Implementation, pp. 45-58, Oct. 2000.
11. A. Chandra, M. Adler, and P. Shenoy. Deadline fair scheduling: Bridging the theory and practice of proportionate-fair scheduling in multiprocessor servers. In Proc. of the IEEE Real-time Technology and Applications Symp. , pp. 3-14, May 2001.
12. M. Chen and K. Lin. Dynamic priority ceiling: A concurrency control protocol for real time systems. Real-time Systems, 2(1):325-346, 1990.
13. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proc. of the ACM Symp. on Communications Architectures and Protocols, pp. 1-12, 1989.
14. S. Dhall and C. Liu. On a real-time scheduling problem. Operations Research, 26(1):127-140, 1978.
15. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In Proc. of IEEE INFOCOM, pp. 636-646, Apr. 1994.
16. J. Haritsa, M. Livny, and M. Carey. Earliest deadline scheduling for real-time database systems. In Proc. of the IEEE Real-time Systems Symp. , pp. 232-243, 1991.
17. P. Holman and J. Anderson. Guaranteeing Pfair supertasks by reweighting. In Proc. of the IEEE Real-time Systems Symp. , pp. 203-212, Dec. 2001.
18. P. Holman and J. Anderson. Locking in Pfair-scheduled multiprocessor systems. In Proc. of the IEEE Real-time Systems Symp. , pp. 149-158, Dec. 2002.
19. P. Holman and J. Anderson. Object sharing in Pfairscheduled multiprocessor systems. In Proc. of the Euromicro Conf. on Real-time Systems, pp. 111-120, June 2002.
20. K. Jeffay. Scheduling sporadic tasks with shared resources in hard real-time systems. In Proc. of the IEEE Real-time Systems Symp. , pp. 89-98, Dec. 1992.
21. K. Jeffay, F. D. Smith, A. Moorthy, and J. Anderson. Proportional share scheduling of operating system services for real-time applications. In Proc. of the IEEE Real-time Systems Symp. , pp. 480-491, Dec. 1998.
22. E. Jensen, C. D. Locke, and H. Tokuda. A time-driven scheduling model for real-time operating systems. In Proc. of the IEEE Real-time Systems Symp. , pp. 112-122, 1985.
23. S. Keshav. Private communication, 2001.
24. C. Lee, J. Hahn, Y. Seo, S. Min, R. Ha, S. Hong, C. Park, M. Lee, and C. Kim. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Trans. on Computers, 47(6):700-713, 1998.
25. C. Lee, K. Lee, J. Hahn, Y. Seo, S. Min, R. Ha, S. Hong, C. Park, M. Lee, and C. Kim. Bounding cache-related preemption delay for real-time systems. IEEE Trans. on Software Engineering, 27(9):805-826, 2001.
26. J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proc. of the IEEE Real-time Systems Symp. , pp. 166-171, Dec. 1989.
27. J. Lopez, M. Garcia, J. Diaz, and D. Garcia. Worst-case utilization bound for edf scheduling on real-time multiprocessor systems. In Proc. of the Euromicro Conf. on Real-time Systems, pp. 25-33, June 2000.
28. M. Moir and S. Ramamurthy. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In Proc. of the IEEE Real-time Systems Symp. , pp. 294-303, Dec. 1999.
29. D. Oh and T. Baker. Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-time Systems, 15(2):183-192, 1998.
30. Y. Oh and S. Son. Allocating fixed-priority periodic tasks on multiprocessor systems. Real-time Systems, 9(3):207-239, 1995.
31. A. Parekh and R. Gallagher. A generalized processor sharing approach to flow-control in integrated services networks: The single-node case. IEEE/ACM Trans. on Networking, 1(3):344-357, 1993.
32. R. Rajkumar, L. Sha, and J. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proc. of the IEEE Real-time Systems Symp. , pp. 259-269, 1988.
33. R. Rajkumar. Private communication, 2002.
34. S. Saez, J. Vila, and A. Crespo. Using exact feasibility tests for allocating real-time tasks in multiprocessor systems. In Proc. of the Euromicro Workshop on Real-time Systems, pp. 53-60, June 1998.
35. L. Sha, R. Rajkumar, and J. Lehoczky. Priority inheritance protocols: An approach to real-time system synchronization. IEEE Trans. on Computers, 39(9):1175-1185, 1990.
36. A. Srinivasan and J. Anderson. Fair scheduling of dynamic task systems on multiprocessors. In Proc. of the Workshop on Parallel and Distributed Real-time Systems, Apr. 2003. To appear.
37. A. Srinivasan and J. Anderson. Optimal rate-based scheduling on multiprocessors. In Proc. of the ACM Symp. on Theory of Computing, pp. 189-198, May 2002.
38. L. Zhang. Virtual clock: A new traffic control algorithm for packet-switched networks. ACM Trans. on Computer Systems, 9(2):101-124, May 1991.