On the hardness of approximating optimum schedule problems in store and forward networks

IEEE/ACM Transactions on Networking

Volumn 4, Issue 2, 1996, Pages 272-280

  Clementi, Andrea E F ^a   Di Ianni, Miriam ^b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ERRORS; HEURISTIC METHODS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

POLYNOMIAL TIME ALGORITHM; SUBLINEAR FUNCTION;

COMPUTER NETWORKS;

EID: 0030126834     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.491013     Document Type: Article

References (28)

1. L. Bianco, J. Blazewicz, P. Dell' Olmo, and M. Drozdowski, "Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness," Inform. Processing Lett., vol. 46, pp. 109-113, 1993.
2. J. Blazewicz, "Selected topics in scheduling theory," Ann. Discr. Math., vol. 31, pp. 1-60, 1987.
3. D. P. Bovet and P. Crescenzi, "Minimum-delay schedules in layered networks," Acta Informatica, vol. 28, pp. 453-461, 1991.
4. M. Bellare and M. Sudan, "Improved nonapproximability results," in Proc. 26th ACM-STOC, 1994, pp. 184-193.
5. E. G. Coffman Jr., Computer & Job/Shop Scheduling Theory. New York: Wiley, 1976.
6. A. Clementi and M. Di Ianni, "Optimum schedule problem in store and forward networks," in Proc. IEEE INFOCOM'94, 1994, pp. 1336-1343.
7. E. G. Coffman Jr., M. R. Garey, D. S. Johnson, and A. S. Lapaugh, "Scheduling file transfers," SIAM J. Comput., vol. 14, pp. 744-780, 1985.
8. M. Di Ianni and M. Flammini, "On the efficient off-line and on-line packet routing," University of L'Aquila, Italy, Tech. Rep. 84, 1995, and Tech. Rep. EEC "ESPRIT II research action program under contract no. 8141 - Algorithms and complexity II (ALCOM II)," 1995.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
10. M. Gerla and L. Kleinrock, "Flow control: A comparative survey," IEEE Trans. Commun., vol. 28, pp. 553-574, 1980.
11. Y. Gurevich, "Average case completeness," J. Comput. Syst. Sciences, vol. 42, pp. 346-398, 1991.
12. S. Ha and E. A. Lee, "Compile-time scheduling and assignment of data-flow program graphs with data-dependent iteration," IEEE Trans. Comput., vol. 40, pp. 1225-1238, 1991.
13. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
14. E. Koutsoupias and C. H. Papadimitriou, "Beyond competitive analysis," in Proc. 35th IEEE FOCS, 1994, pp. 394-400.
15. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
16. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, CA: Morgan-Kaufmann, 1992.
17. T. Leighton, B. Maggs, and S. Rao, "Universal packet routing algorithms," in Proc. 29th IEEE FOCS, 1988, pp. 256-269.
18. _, "Packet routing and job-shop scheduling in O (congestion + dilation) steps," in Combinatorica, vol. 14, no. 2, pp. 167-186, 1994.
19. T. Leighton, B. Maggs, S. Rao, and A. G. Ranade, "Randomized routing and sorting on fixed-connection networks," in J. Algorithms, vol. 17, pp. 157-205, 1994.
20. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems," in Proc. 25th ACM STOC, 1993, pp. 286-293.
21. Y. Mansour and B. Patt-Shamir, "Greedy packet scheduling on shortest paths," in Proc. ACM PODC'91, 1991, pp. 165-175.
22. F. Meyer auf der Heide and B. Vöcking, "A packet routing protocol for arbitrary networks," in Proc. 12th STACS'95, 1995, pp. 291-302.
23. L. M. Ni and P. K. McKinley, "A survey of Wormhole routing techniques in direct networks," Comput., pp. 62-76, 1993.
24. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation and complexity classes." J. Comput. Syst. Science, vol. 43, pp. 425-440, 1991.
25. _, "Linear programming without the matrix," in Proc. 25th ACM STOC, 1993, pp. 121-129.
26. V. J. Rayward-Smith and D. Rebaine "Open shop scheduling with delays," in Theoretical Informatics Applications, vol. 26, pp. 439-448, 1992.
27. K. G. Shin and M. Chen, "On the number of acceptable task assignments in distributed computing systems," IEEE Trans. Comput., vol. 39, pp. 99-110, 1990.
28. A. S. Tannenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.