Parallel processor scheduling with delay constraints

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 577-585

  Engels, Daniel W ^a   Feldman, Jon ^a   Karger, David R ^a   Ruhl, Matthias ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Reliability; Theory; Verification

Indexed keywords

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

References (17)

1. David Bernstein , Izidor Gertner, Scheduling expressions on a pipelined processor with a maximal delay of one cycle, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.57-66, Jan. 1989 [doi〉10.1145/59287.59291]
2. P. Chretienne and C. Picouleau. Scheduling with communication delays: A survey. In P. Chretienne, Jr. E. G. Coffman, J. K. Lenstra, and Z. Liu, editors, Scheduling Theory and its Applications, pages 65-90. John Wiley & Sons Ltd, 1995.
3. E.G. Coffman, Jr. and R.L. Graham. Optimal sequencing for two-processor systems. Acta Informatica, 1:200-213, 1972.
4. Daniel Wayne Engels , Srinivas Devadas, Scheduling for hardware-software partitioning in embedded system design, 2000
5. Lucian Finta , Zhen Liu, Single machine scheduling subject to precedence delays, Discrete Applied Mathematics, v.70 n.3, p.247-266, Oct. 8, 1996 [doi〉10.1016/0166-218X(96) 00110-2 ]
6. Lucian Finta , Zhen Liu , Ioannis Milis , Evripidis Bampis, Scheduling UET-UCT seriesparallel graphs on two processors, Theoretical Computer Science, v.162 n.2, p.323-340, Aug. 20, 1996 [doi〉10.1016/0304-3975(96)00035-7 ]
7. Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
8. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A Survey. Annals of Discrete Mathematics, 5:287-326, 1979.
9. Intel Corporation. The IA-64 Architecture Software Developer's Manual, January 2000.
10. H. Jung , L. Kirousis , P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.254-264, June 18-21, 1989, Santa Fe, New Mexico, United States [doi〉10.1145/72935.72962]
11. Jan Karel Lenstra , Marinus Veldhorst , Bart Veltman, The complexity of scheduling trees with communication delays, Journal of Algorithms, v.20 n.1, p.157-173, Jan. 1996 [doi〉10.1006/jagm.1996.0007 ]
12. Rolf H. M6hring and Markus W. Schoffter. A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays. Technical Report 506, Technische Universitat Berlin, Germany, 1995.
13. Christos Papadimitriou , Mihalis Yannakakis, Optimization, approximation, and complexity classes, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.229-234, May 02-04, 1988, Chicago, Illinois, United States [doi〉10.1145/62212.62233]
14. C. Picouleau. Etude de problemes les systdmes distrubes. PhD thesis, Univ. Pierre et Madame Curie, Paris, France, 1992.
15. Texas Instruments. TMS320C6000 Programmer's Guide, March 2000.
16. J.D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10(3):384-393, June 1975.
17. Theodora A. Varvarigou , Vwani P. Roychowdhury , Thomas Kailath , Eugene Lawler, Scheduling In and Out Forests in the Presence of Communication Delays, IEEE Transactions on Parallel and Distributed Systems, v.7 n.10, p.1065-1074, October 1996 [doi〉10.1109/71.539738 ]