Skip to main content

A Parallel Computer as a NOC Region

  • Chapter
Networks on Chip

Abstract

A network on chip (NOC) scheme relying on reuse of existing intellectual property blocks and a unified communication solution has been proposed for solving architectural and design productivity problems of future systems on chips. A NOC consists of a set of heterogeneous computing and storage resources that are connected to each other via a standardized communication network. A heterogeneous structure is suitable for application specific computing, but not for high-speed general purpose computing that is increasingly used in devices that will be powered by NOCs. General purpose functionality can, however, be provided by dedicating the whole chip or a special area on a heterogeneous NOC, called region, for a homogeneous general purpose computing engine. Unfortunately the architectures proposed for NOCs and on-chip parallel computers feature poor performance and portability, or are difficult to program in general purpose computing due to limited communication bandwidth, inability to eliminate delays caused by the latency of the network, high communication overheads, and poor models of parallel computing. In this chapter we will discuss the problems and solutions of implementing an efficient single chip general purpose parallel computing engine. We will also describe our ECLIPSE architecture that can be used either as a truly scalable, high-speed, single chip parallel computer or as a NOC region responsible of general-purpose computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Jouppi and D. Wall, Available Instruction-Level Parallelism for Superscalar and Superpipelined Machines, Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, April 1989, 272–282.

    Google Scholar 

  2. M. Forsell, Architectural differences of efficient sequential and parallel computers, Journal of Systems Architecture 47, 13 (July 2002), 1017–1041.

    Google Scholar 

  3. S. Fortune and J. Wyllie, Parallelism in Random Access Machines, Proceedings of 10th ACM STOC, Association for Computing Machinery, New York, 1978, 114–118.

    Google Scholar 

  4. G. Almasi and A. Gottlieb, Highly Parallel Computing, Benjamin/Cummings, Redwood City, 1994.

    Google Scholar 

  5. V. Leppänen, Studies on the realization of PRAM, Dissertation 3, Turku Centre for Computer Science, University of Turku, Turku, 1996.

    Google Scholar 

  6. L. Benini and G. De Micheli, Networks on Chips: A New SoC Paradigm, IEEE Computer 35, 1 (Jan. 2002), 70–78.

    Google Scholar 

  7. S. Kumar, A. Jantsch, J. Soininen, M. Forsell, M. Millberg, J. Öberg, K. Tiensyrjä and A. Hemani, A Network on Chip Architecture and Design Methodology, In the Proceedings of the ISVLSI’02, April 25–26, 2002, Pittsburgh, Pennsylvania, 117–124.

    Google Scholar 

  8. K. Goossens, E. Rijpkema, P. Wielage, A. Peeters and J. van Meerbergen, Networks on Silicon: The Next Design Paradigm for Systems on Silicon, Design, Automation and Test in Europe Conference, March 4–8, 2002, Paris, France, 423–425.

    Google Scholar 

  9. M. Forsell, V. Leppänen and M. Penttonen, Primitives of Sequential and Parallel Computation, Report 1998/A/3, Department of Computer Science and Applied Mathematics, University of Kuopio, Kuopio, 1998.

    Google Scholar 

  10. E. Bloch, The engineering design of the Stretch computer, Proceedings of the Fall Joint Computer Conference, 1959, 48–59.

    Google Scholar 

  11. J. Thornton, Parallel operation in the Control Data 6600, Proceedings of the Fall Joint Computer Conference 26, 1964, 33–40.

    Google Scholar 

  12. J. T. Schwarz, Large Parallel Computers, Journal of the ACM 13, 1 (1966), 25–32.

    Google Scholar 

  13. D. Culler and J. Singh, Parallel Computer Architecture—A Hardware/ Software Approach, Morgan Kaufmann Publishers Inc., San Fransisco, 1999.

    Google Scholar 

  14. J. Keller, C. Keßler, and J. Träff, Practical PRAM Programming, Wiley, New York, 2001.

    Google Scholar 

  15. J. Jaja, Introduction to Parallel Algorithms, Addison-Wesley, Reading, 1992.

    Google Scholar 

  16. P. Guerrier, A. Greinier, A Generic Architecture for On-Chip Packet-Switched Interconnections, Proceedings of DATE 2000, March 27–30, 2000, Paris, France, 250–256.

    Google Scholar 

  17. K. Mai, T. Paaske, N. Jayasena, R. Ho, W. Dally and M. Horowitz, Smart Memories: A Modular Reconfigurable Architecture, In the Proceedings of the 27th International Symposium on Computer Architecture, Vancouver, Canada.

    Google Scholar 

  18. M. Taylor, et. al., The Raw Microprocessor: A Computational Fabric for Software Circuits and General Purpose Programs, IEEE Micro 22, 2 (March-April 2002), 25–35.

    Google Scholar 

  19. M. Forsell, Are Multiport Memories Physically Feasible?, Computer Architecture News 22, 4 (September 1994), 47–54.

    Google Scholar 

  20. A. Karlin and E. Upfal, Parallel Hashing—an Efficient Implementation of Shared Memory, Journal of the ACM 35, 4 (1988), 876–892.

    Article  MathSciNet  Google Scholar 

  21. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Mayer auf der Heide, H. Rohnert and R. Tarjan, Dynamic Perfect Hashing: Upper and Lower Bounds, SIAM Journal on Computing 23, (August 1994), 738–761.

    Google Scholar 

  22. J. Sibeyn, Solving Fundamental Problems on Sparse-Meshes, IEEE Transactions on Parallel and Distributed Systems 11, 12 (December 2000), 1324–1332.

    Google Scholar 

  23. M. Forsell, A Scalable High-Performance Computing Solution for Network-on-Chips, IEEE Micro 22, 5 (September-October 2002), 46–55.

    Google Scholar 

  24. A. Allan, et al., 2001 Technology Roadmap for Semiconductors, Computer 35, 1 (2002), 42–53.

    Article  Google Scholar 

  25. M. Forsell and V. Leppänen, Memory Module Structures for Shared Memory Simulation, In the Proceedings of the International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet, January 21–27, 2002, L’Aquila, Italy.

    Google Scholar 

  26. M. Forsell, Cacheless Instruction Fetch Mechanism for Multithreaded Processors, WSEAS Transactions on Communications 1, 1 (2002), 150–155.

    Google Scholar 

  27. M. Forsell, MTAC—A Multithreaded VLIW Architecture for PRAM Simulation, Journal of Universal Computer Science 3, 9 (1997), 1037–1055.

    MATH  Google Scholar 

  28. A. Ranade, How to Emulate Shared Memory, Journal of Computer and System Sciences 42, (1991), 307–326.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers

About this chapter

Cite this chapter

Forsell, M. (2003). A Parallel Computer as a NOC Region. In: Jantsch, A., Tenhunen, H. (eds) Networks on Chip. Springer, Boston, MA. https://doi.org/10.1007/0-306-48727-6_9

Download citation

  • DOI: https://doi.org/10.1007/0-306-48727-6_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7392-2

  • Online ISBN: 978-0-306-48727-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics