High performance datacenter networks : architectures, algorithms, and opportunities /

Saved in:
Bibliographic Details
Author / Creator:Abts, Dennis.
Imprint:San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, c2011.
Description:1 electronic text (ix, 99 p.) : ill., digital file.
Language:English
Series:Synthesis lectures on computer architecture, 1935-3243 ; # 14
Synthesis digital library of engineering and computer science.
Synthesis lectures on computer architecture, # 14.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/10510985
Hidden Bibliographic Details
Other authors / contributors:Kim, John.
ISBN:9781608454037 (electronic bk.)
9781608454020 (pbk.)
Notes:Part of: Synthesis digital library of engineering and computer science.
Series from website.
Includes bibliographical references (p. 93-98).
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
Compendex
INSPEC
Google scholar
Google book search
Also available in print.
Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Summary:Datacenter networks provide the communication substrate for large parallel computer systems that form the ecosystem for high performance computing (HPC) systems and modern Internet applications. The design of new datacenter networks is motivated by an array of applications ranging from communication intensive climatology, complex material simulations and molecular dynamics to such Internet applications as Web search, language translation, collaborative Internet applications, streaming video and voice-over-IP. For both Supercomputing and Cloud Computing the network enables distributed applications to communicate and interoperate in an orchestrated and efficient way.
Standard no.:10.2200/S00341ED1V01Y201103CAC014
Table of Contents:
  • Preface
  • Acknowledgments
  • Note to the reader
  • 1. Introduction
  • From supercomputing to cloud computing
  • Beowulf: the cluster is born
  • Overview of parallel programming models
  • Putting it all together
  • Quality of service (QoS) requirements
  • Flow control
  • Lossy flow control
  • Lossless flow control
  • The rise of ethernet
  • Summary
  • 2. Background
  • Interconnection networks
  • Technology trends
  • Topology, routing and flow control
  • Communication stack
  • 3. Topology basics
  • Introduction
  • Types of networks
  • Mesh,torus, and hypercubes
  • Node identifiers
  • K-ary n-cube tradeoffs
  • 4. High-radix topologies
  • Towards high-radix topologies
  • Technology drivers
  • Pin bandwidth
  • Economical optical signaling
  • High-radix topology
  • High-dimension hypercube, mesh, torus
  • Butterfly
  • High-radix folded-clos
  • Flattened butterfly
  • Dragonfly
  • HyperX
  • 5. Routing
  • Routing basics
  • Objectives of a routing algorithm
  • Minimal routing
  • Deterministic routing
  • Oblivious routing
  • Non-minimal routing
  • Valiant's algorithm (VAL)
  • Universal global adaptive load-balancing (UGAL)
  • Progressive adaptive routing (PAR)
  • Dimensionally-adaptive, load-balanced (DAL) routing
  • Indirect adaptive routing
  • Routing algorithm examples
  • Example 1: Folded-clos
  • Example 2: Flattened butterfly
  • Example 3: Dragonfly
  • 6. Scalable switch microarchitecture
  • Router microarchitecture basics
  • Scaling baseline microarchitecture to high radix
  • Fully buffered crossbar
  • Hierarchical crossbar architecture
  • Examples of high-radix routers
  • Cray YARC router
  • Mellanox InfiniScale IV
  • 7. System packaging
  • Packaging hierarchy
  • Power delivery and cooling
  • Topology and packaging locality
  • 8. Case studies
  • Cray BlackWidow multiprocessor
  • BlackWidow node organization
  • High-radix folded-clos network
  • System packaging
  • High-radix fat-tree
  • Packet format
  • Network layer flow control
  • Data-link layer protocol
  • Serializer/deserializer
  • Cray XT multiprocessor
  • 3-D torus
  • Routing
  • Flow control
  • SeaStar router microarchitecture
  • Summary
  • 9. Closing remarks
  • Programming models
  • Wire protocols
  • Opportunities
  • Bibliography
  • Authors' biographies.