Table of Contents Author Guidelines Submit a Manuscript

An erratum for this article has been published. To view the erratum, please click here.

Advances in Operations Research
Volume 2011, Article ID 476939, 20 pages
Research Article

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

1Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031 Grenoble Cedex 1, France
2LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France

Received 26 October 2010; Revised 22 March 2011; Accepted 4 April 2011

Academic Editor: Ching-Jong Liao

Copyright © 2011 M. Bouznif and R. Giroudeau. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. C. Picouleau, “UET-UCT schedules on arbitrary networks,” Tech. Rep., LITP, Blaise Pascal, Université Paris VI, 1994. View at Google Scholar
  3. R. Giroudeau, J. C. König, and B. Valéry, “Scheduling uet-tasks on a star network: complexity and approximation,” 4OR A Quarterly Journal of Operations Research, vol. 9, no. 1, pp. 29–48, 2011. View at Google Scholar
  4. V. Boudet, Y. Cohen, R. Giroudeau, and J. C. Konig, “Complexity results for scheduling problem with non trivial topology of processors,” Tech. Rep. 06050, LIRMM, 2006, submitted to Rairo-RO. View at Google Scholar
  5. C. Lahlou, “Scheduling with unit processing and communication times on a ring network: approximation results,” in Proceedings of Europar, pp. 539–542, Springer, New York, NY, USA, 1996. View at Google Scholar
  6. V. J. Rayward-Smith, “UET scheduling with unit interprocessor communication delays,” Discrete Applied Mathematics, vol. 18, no. 1, pp. 55–71, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. J. J. Hwang, Y.-C. Chow, F. D. Anger, and C.-Y. Lee, “Scheduling precedence graphs in systems with interprocessor communication times,” SIAM Journal on Computing, vol. 18, no. 2, pp. 244–257, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of 𝒩𝒫-Completeness, A Series of Books in the Mathematical Science, W. H. Freeman, San Francisco, Calif, USA, 1979.
  9. P. Chrétienne and C. Picouleau, Scheduling Theory and Its Applications, Scheduling with Communication Delays: A Survey, chapter 4, John Wiley & Sons, Chichester, UK, 1995.
  10. A. Munier and J. C. König, “A heuristic for a scheduling problem with communication delays,” Operations Research, vol. 45, no. 1, pp. 145–148, 1997. View at Google Scholar
  11. R. Giroudeau, J.-C. Konig, F. K. Moulai, and J. Palaysi, “Complexity and approximation for precedence constrained scheduling problems with large communication delays,” Theoretical Computer Science, vol. 401, no. 1–3, pp. 107–119, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. R. P. Brent, “The parallel evaluation of general arithmetic expressions,” Journal of the Association for Computing Machinery, vol. 21, pp. 201–206, 1974. View at Google Scholar · View at Zentralblatt MATH
  13. R. Bellman, “On a routing problem,” Quarterly of Applied Mathematics, vol. 16, pp. 87–90, 1958. View at Google Scholar · View at Zentralblatt MATH
  14. R. Graham, “Bounds for certain multiprocessing anomalies,” Bell System Technical Journal, vol. 45, pp. 1563–1581, 1966. View at Google Scholar
  15. A. Munier and C. Hanen, “An approximation algorithm for scheduling unitary tasks on m processors with communication delays,” private communication, 1996.