On Graham's bound for cyclic scheduling

Parallel Computing

Volumn 26, Issue 9, 2000, Pages 1163-1174

  Chrétienne, Philippe ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SYSTEMS PROGRAMMING; RESPONSE TIME (COMPUTER SYSTEMS);

CYCLIC SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0343353892     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00033-8     Document Type: Article

References (13)

1. J.K. Lenstra, D.B. Shmoys, in: P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Computing Near Optimal Schedules, Scheduling Theory and Its Applications, Wiley, New York, 1995, pp. 193-224 (Chapter 1).
2. E.G. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys, Sequencing and Scheduling: algorithms and complexity, Report BS-R8909, Center for Mathematics and Computer Science, Amsterdam, 1994.
3. Hanen C., Munier A. A study of the cyclic scheduling problem on parallel processors. Discrete Appl. Math. 57:1995;167-192.
4. C. Hanen, A. Munier, in: P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Cyclic Scheduling on Parallel Processors, Scheduling Theory and Its Applications, Wiley, New York, 1995, pp. 193-224 (Chapter 9).
5. Gasperoni F., Schwiegelshohn U. Generating close to optimal loop schedules on parallel processors. Parallel Process. Lett. 4(4):1994;391-403.
6. A. Munier, Contribution à l'étude des ordonnancements cycliques, Ph.D. thesis, P. and M. Curie University, 1991.
7. Chrétienne P. Transient and limiting behavior of timed event graphs. RAIRO-TSI. 4:1985;127-142.
8. Chrétienne P. The basic cyclic scheduling problem with deadlines. Discrete Appl. Math. 30:1991;109-123.
9. P. Chrétienne, List schedules for cyclic scheduling, Discrete Appl. Math. (to appear).
10. Cohen G., Dubois D., Quadrat J.P., Viot M. A linear system theoretic view of discrete event process and its use for performance evaluation in manufacturing. IEEE Trans. Automat. Control. 30:1985;3.
11. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17:1969;416-429.
12. E.G. Coffman Jr., R.L. Graham, Optimal scheduling for two processors systems, Acta Inf. 13 (1972) 200-213.
13. T. Watanabe, M.Yamauchi. New priority lists for scheduling in timed Petri nets, in: ICATPN93, LNCS 691, Chicago, 1993.