Table of Contents Author Guidelines Submit a Manuscript
International Journal of Reconfigurable Computing
Volume 2009, Article ID 453970, 14 pages
Research Article

A Decentralised Task Mapping Approach for Homogeneous Multiprocessor Network-On-Chips

1Digital Technology Lab, University of Kassel, Wilhelmshöher Allee 73, 34121 Kassel, Germany
2Laboratoire d'Informatique, de Robotique et de Microélectroniqe de Montpellier (LIRMM), University of Montpellier II, UMR CNRS 5506, 161 rue ADA, 34392 Montpellier Cedex 5, France
3Institute of Microelectronic Systems, Darmstadt University of Technology , Karlstrasse 15, 64283 Darmstadt, Germany

Received 27 December 2008; Accepted 25 May 2009

Academic Editor: Michael Huebner

Copyright © 2009 Peter Zipf et al. 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. L. Benini and D. Bertozzi, “Network-on-chip architectures and design methods,” IEE Proceedings: Computers and Digital Techniques, vol. 152, no. 2, pp. 261–272, 2005. View at Publisher · View at Google Scholar
  2. S. Bertozzi, A. Acquaviva, D. Bertozzi, and A. Poggiali, “Supporting task migration in multi-processor systems-on-chip: a feasibility study,” in Proceedings of the Conference on Design, Automation and Test in Europe (DATE '06), vol. 1, pp. 1–6, Munich, Germany, March 2006.
  3. T. D. Braun, H. J. Siegel, N. Beck et al., “A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems,” in Proceedings of the 8th Heterogeneous Computing Workshop (HCW '99), pp. 15–29, San Juan, Puerto Rico, April 1999.
  4. E. Carvalho, N. Calazans, and F. Moraes, “Congestion-aware task mapping in NoC-based MPSoCs with dynamic workload,” in Proceedings of IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07), pp. 459–460, Porto Alegre, Brazil, March 2007. View at Publisher · View at Google Scholar
  5. J. Chakrapani and J. Skorin-Kapov, “Mapping tasks to processors to minimize communication time in a multiprocessor system,” in The Impact of Emerging Technologies of Computer Science and Operations Research, pp. 45–64, Kluwer Academic Publishers, Boston, Mass, USA, 1995. View at Google Scholar
  6. W. W. Chu, L. J. Holloway, M.-T. Lan, and K. Efe, “Task allocation in distributed data processing,” Computer, vol. 13, pp. 57–69, 1980. View at Google Scholar
  7. K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” Computer, vol. 15, no. 6, pp. 50–56, 1982. View at Google Scholar
  8. F. Glover, M. Laguna, and R. Martí, “Fundamentals of scatter search and path relinking,” Control and Cybernetics, vol. 29, no. 3, pp. 653–684, 2000. View at Google Scholar
  9. J. Henkel, W. Wolf, and S. Chakradhar, “On-chip networks: a scalable, communication-centric embedded system design paradigm,” in Proceedings of the 17th IEEE International Conference on VLSI Design, pp. 845–851, Mumbai, India, January 2004.
  10. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Francisco, Calif, USA, 2003.
  11. F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, McGraw-Hill, Boston, Mass, USA, 7th edition, 2001.
  12. B. Hong and V. K. Prasanna, “Performance optimization of a de-centralized task allocation protocol via bandwidth and buffer management,” in Proceedings of the 2nd International Workshop on Challenges of Large Applications in Distributed Environments (CLADE '04), pp. 108–117, Honolulu, Hawaii, USA, June 2004.
  13. J. Hu and R. Marculescu, “Energy- and performance-aware mapping for regular NoC architectures,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 4, pp. 551–562, 2005. View at Publisher · View at Google Scholar
  14. J. A. Keane, A. J. Grant, and M. Q. Xu, “Comparing distributed memory and virtual shared memory parallel programming models,” Future Generation Computer Systems, vol. 11, no. 2, pp. 233–243, 1995. View at Google Scholar
  15. F.-T. Lin and C.-C. Hsu, “Task assignment scheduling by simulated annealing,” in Proceedings of the 10th Conference on Computer and Communication Systems, pp. 279–283, Hong Kong, September 1990.
  16. V. M. Lo, “Heuristic algorithms for task assignment in distributed systems,” IEEE Transactions on Computers, vol. 37, no. 11, pp. 1384–1397, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  17. C. Marcon, A. Borin, A. Susin, L. Carro, and F. Wagner, “Time and energy efficient mapping of embedded applications onto NoCs,” in Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC '05), vol. 1, pp. 33–38, 2005.
  18. A. Ngouanga, G. Sassatelli, L. Torres, T. Gil, A. Soares, and A. Susin, “A contextual resources use: a proof of concept through the APACHES' platform,” in Proceedings of IEEE Design and Diagnostics of Electronic Circuits and Systems, pp. 42–47, Prague, Czech Republic, April 2006. View at Publisher · View at Google Scholar
  19. V. Nollet, T. Marescaux, P. Avasare, D. Verkest, and J.-Y. Mignolet, “Centralized run-time resource management in a network-on-chip containing reconfigurable hardware tiles,” in Proceedings of the Conference on Design, Automation and Test in Europe (DATE '05), vol. 1, pp. 234–239, Munich, Germany, March 2005. View at Publisher · View at Google Scholar
  20. J. M. Orduna, F. Silla, and J. Duato, “A new task mapping technique for communication-aware scheduling strategies,” in Proceedings of the International Conference on Parallel Processing Workshops (ICPPW '01), pp. 349–354, 2001.
  21. K. Park, “A heuristic approach to task assignment optimization in distributed systems,” in Proceedings of IEEE International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1838–1842, Orlando, Fla, USA, October 1997.
  22. D. A. Patterson and J. L. Hennessy, Computer Organization and Design, Morgan Kaufmann, San Francisco, Calif, USA, 2004.
  23. S. Sahni and T. Gonzalez, “P-complete approximation problems,” Journal of the Association for Computing Machinery, vol. 23, no. 3, pp. 555–565, 1976. View at Google Scholar
  24. N. Saint-Jean, G. Sassatelli, P. Benoit, L. Torres, and M. Robert, “HS-Scale: a hardware-software scalable mpsoc architecture for embedded systems,” in Proceedings of IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07), pp. 21–28, Porto Alegre, Brazil, March 2007.
  25. R. Varadarajan, “An efficient approximation algorithm for load balancing with resource migration in distributed systems,” Tech. Rep., 1992, View at Google Scholar
  26. P. Yang and F. Catthoor, “Dynamic mapping and ordering tasks of embedded real-time systems on multiprocessor platforms,” in Proceedings of the 8th International Workshop on Software and Compilers for Embedded Systems (SCOPES '04), pp. 167–181, 2004.