ClusterNet: An Object-Oriented Cluster Network

  • Raymond R. Hoare
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)


Parallel processing is based on utilizing a group of processors to efficiently solve large problems faster than is possible on a single processor. To accomplish this, the processors must communicate and coordinate with each other through some type of network. However, the only function that most networks support is message routing. Consequently, functions that involve data from a group of processors must be implemented on top of message routing. We propose treating the network switch as a function unit that can receive data from a group of processors, execute operations, and return the result(s) to the appropriate processors. This paper describes how each of the architectural resources that are typically found in a network switch can be better utilized as a centralized function unit. A proof-of-concept prototype called ClusterNet4EPP has been implemented to demonstrate feasibility of this concept.


Lookup Table Network Interface Network Switch Memory Architecture Memory Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. S. Stone, High-Performance Computer Architecture, Third ed. Reading, MA: Addison-Wesley Publishing Company, 1993.Google Scholar
  2. 2.
    D. Culler, L. Liu, R. Martin, and C. Yoshikawa, “Assessing Fast Network Interfaces,” IEEE Micro, vol. 16, pp. 35–43, 1996.CrossRefGoogle Scholar
  3. 3.
    M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra, MPI, The Complete Reference. Cambridge, Massachusetts: The MIT Press, 1996.Google Scholar
  4. 4.
    R. Hoare and H. Dietz, “A Case for Aggregate Networks,” Proceedings of the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, FL, 1998.Google Scholar
  5. 5.
    C. Stunkel and e. al., “The SP2 High-Performance Switch,” IBM Systems Journeal, vol. 34, pp. 185–204, 1994.CrossRefGoogle Scholar
  6. 6.
    R. Kessler and J. Schwarzmeier, “Cray T3D: a New Dimension for Cray Research,” Proceedings of the In Digest of Papers. COMPCON Spring’ 93, San Francisco, CA, 1993.Google Scholar
  7. 7.
    M. Fillo and R. Gillett, “Architecture and Implementation of Memory Channel 2,” Digital Equipment Corporation High Performance Technical Computing, pp. 34–48, 1997.Google Scholar
  8. 8.
    M. Blumrich and e. al., “Virtual Memory Mapped Network Interfaces for the SHRIMP Multicomputer,” Proceedings of the The 21st Annual International Symposium on Computer Architecture, 1994.Google Scholar
  9. 9.
    T. Warshko, W. Tichy, and C. Herter, “Efficient Parallel Computing on Workstation Clusters,” University of Karlsruhe, Dept. of Informatics, Karlsruhe, Germany Technical Report 21/95, 1995.Google Scholar
  10. 10.
    R. Hoare, T. Mattox, and H. Dietz, “TTL-PAPERS 960801, The Modularly Scalable, Field Upgradable, Implementation of Purdue’s Adapter for Parallel Execution and Rapid Synchronization,” Purdue University, W. Lafayette, Internet On-line Tech Report:, 1996.Google Scholar
  11. 11.
    R. Hoare, “Object-Oriented Aggregate Networks,” in School of Electrical Engineering. W. Lafayette: Purdue University, 1999.Google Scholar
  12. 12.
    A. Gottlieb and e. al., “The NYU Ultracomputer, Designing a MIMD Shared Memory Prallel Computer,” IEEE Transactions on Computers, pp. 175–189, 1983.Google Scholar
  13. 13.
    R. Bianchini, S. Dickey, J. Edler, G. Goodman, A. Gottlieb, R. Kenner, and J. Wang, “The Ultra III Prototype,” Proceedings of the Parallel Systems Fair, 1993.Google Scholar
  14. 14.
    G. Pfister and V. Norton, “‘Hot Spot’ Contention and Combining in Multistage Interconnection Networks,” Proceedings of the 1985 International Conference on Parallel Processing, 1985.Google Scholar
  15. 15.
    D. Tennenhouse and D. Wetherall, “Towards an Active Network Architecture,” Computer Communications Review, vol. 26, 1996.Google Scholar
  16. 16.
    D. Tennenhouse and e. al., “A Survey of Active Network Research,” IEEE Communications Magazine, vol. 35, pp. 80–86, 1997.CrossRefGoogle Scholar
  17. 17.
    H. Bal, R. Hofman, and K. Verstoep, “A Comparison of Three High Speed Networks for Parallel Cluster Computing,” Proceedings of the First International Workstion on Communication and Architectural Support for Network-Based Parallel Computing, San Antonio, TX, 1997.Google Scholar
  18. 18.
    K. Batcher, “Sorting Networks and Their Applicaitons,” Proceedings of the Spring Joint Computer Conference, 1968.Google Scholar
  19. 19.
    J. Lee and K. Batcher, “Minimizing Communication of a Recirculating Bitonic Sorting Network,” Proceedings of the the 1996 International Conference on Parallel Processing, 1996.Google Scholar
  20. 20.
    Z. Wen, “Multiway Merging in Parallel,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, pp. 11–17, 1996.CrossRefGoogle Scholar
  21. 21.
    H. J. Siegel, Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies, Second Edition ed. New York, NY: McGraw-Hill, 1990.Google Scholar
  22. 22.
    G. Almasi and A. Gottlieb, Highly Parallel Computing, Second Edition. Redwood City, CA: The Benjamin/Cummings Publishing Company, Inc., 1994.zbMATHGoogle Scholar
  23. 23.
    H. Dietz, R. Hoare, and T. Mattox, “A Fine-Grain Parallel Architecture Based on Barrier Synchronization,” Proceedings of the International Conference on Parallel Processing, Bloomington, IL, 1996.Google Scholar
  24. 24.
    R. Hoare, H. Dietz, T. Mattox, and S. Kim, “Bitwise Aggregate Networks,” Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, New Orleans, LA, 1996.Google Scholar
  25. 25.
    T. Mattox, “Synchronous Aggregate Communication Architecture for MIMD Parallel Processing,” in School of Electrical and Computer Engineering. W. Lafayette, IN: Purdue University, 1997.Google Scholar
  26. 26.
    E. Felten and e. al., “Early Experience with Message-Passing on the SHRIMP Multicomputer,” Proceedings of the The 23rd Annual International Symposium on Comuter Architecture, Philadelphia, PA, 1996.Google Scholar
  27. 27.
    N. Boden and e. al., “Myrinet: A Gigabit per Second Local Area Network,” in IEEE-Micro, vol. 15, 1995, pp. 29–36.CrossRefGoogle Scholar
  28. 28.
    R. Brouwer, “Parallel algorithms for placement and routing in VLSI design”, Ph. D. Thesis, University of Illinois, Urbana-Champaign, 1991.Google Scholar
  29. 29.
    J. Chandy, et. al. “Parallel Simulated Annealing Strategies for VLSI Cell Placement”, in Proceedings of the 1996 International Conference on VLSI Design, Bangalore, India, January 1996.Google Scholar
  30. 30.
    T. Stornetta, et. al., “Implementation of an Efficient Parallel BDD Package”, Proc. 33rd ACM/IEEE Design Automation Conference, 1996.Google Scholar
  31. 31.
    R. Ranjan, et. al., “Binary Decision Diagrams on Network of Workstations”, In Proceedings of the International Conference on Computer-Aided Design, pp. 358–364, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Raymond R. Hoare
    • 1
  1. 1.Department of Electrical EngineeringUniversity of PittsburghPittsburgh

Personalised recommendations