Pfair scheduling of periodic tasks with allocation constraints on multiple processors

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 1661-1668

  Liu, Deming ^a   Lee, Yann Hang ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL PFAIR ALGORITHM (HPA); MULTIPROCESSOR SCHEDULING; MULTIPROCESSOR SYSTEMS; TASK CONSTRAINTS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCHEDULING;

COMPUTER NETWORKS;

EID: 12444339816     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. S. Baruah, N. Cohen, C. G. Plaxton, and D. Varvel, "Proportionate progress: A notation of fairness in resource allocation," Algorithmica, vol. 15, no. 6, 1996, pp. 600-625.
2. S. Baruah et al., "Fairness in periodic real-time scheduling," Proceedings of 16th Annual IEEE Real-Time Systems Symposium, December, 1995, pp. 200-209.
3. Mark Moir and Srikanth Ramamurthy, "Pfair scheduling of fixed and migrating periodic tasks on multiple resources," Proceedings of 20th Annual IEEE Real-Time Systems Symposium, December, 1999, pp. 294-303.
4. C. L. Liu and James W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment," Journal of the Association for Computing Machinery, Vol. 20, No. 1, Jan. 1973, pp. 46-61.
5. J. Anderson and A. Srinivasan, "A new look at pfair priorities," Technical report, Dept. of Computer Science, Univ. of North Carolina, 1999.
6. S. Baruah, J. Gehrke, C. G. Plaxton, and I. Stoica, "Fast scheduling of periodic tasks on multiple resources," Proceedings of the 9th International Parallel Processing Symposium, April 1996, pp. 280-288.
7. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
8. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," Journal of the ACM, vol. 35, no. 4, October 1988, pp. 921-940.
9. Laura E. Jackson and George N. Rouskas, "Deterministic preemptive scheduling of real-time tasks," Computer, vol. 35, issue 5, May 2002, pp. 72-79
10. E. G. Coffman Jr., "Introduction to deterministic scheduling theory," Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York, 1976, pp. 1-50.
11. S. Baruah, R. Howell and L. Rosier, "Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor," Real-Time Systems, 2, 1990, pp. 301-324.
12. th Euromicro Conference on Real-Time Systems, June 2001, pp. 76-85.