ネットワークコンピューティング論 Ⅱ

ネットワークコンピューティング論Ⅱ 平成25年度　後期火曜　第２時限（１０：４０－１２：１０）吉永　努（ＵＥＣ) yosinaga@is.uec.ac.jp ＮＣ論２

内容 • 分散・並列処理計算機における相互結合ネットワークとその上でのメッセージ・ルーティング技法などについて学ぶ • 資料　http://comp.is.uec.ac.jp/yoshinagalab/yoshinaga/dp2.html • http://ceng.usc.edu/smart/presentations/archives/AppendixE.ppt (253 slides, 13MB) • http://booksite.mkp.com/9780123838728/references/appendix_f.pdf (P.118, 2MB) • TA: 重信裕政君shige@comp.is.uec.ac.jp ＮＣ論２

References • T. M. Pinkston and J. Duato: Interconnection Networks, Appendix E in Computer Architecture: A Quantitative Approach, 4th Edition, Morgan Kaufmann publishers(2006). • 5thEdition, Morgan Kaufmann publishers(2011). • J. Duato, S. Yalamanchili, L. Ni: Interconnection Networks - an Engineering Approach-, 第2版, Morgan Kaufmann publishers (2003) • 富田眞治：　並列コンピュータ、昭晃堂（1996） • W.D. Dally, B. Towles: Principles and Practices of Interconnection Networks, Morgan Kaufmann publishers (2003)

What is an interconnection Network? • It is a programmable system that transports data between terminals, such as processors and memory. • It is programmable in the sense that it makes different connections at different points. • It is a system because it is composed of many components: buffers, channels, switches, and controls that works together to deliver data. ＮＣ論２

Interconnection Network (1/2) Interconnection Network P P P M M M Multicomputer ＮＣ論２

Interconnection Network (2/2) P P P Interconnection Network M M M UMA type shared memory multiprocessor It is also called dance-hall architecture. ＮＣ論２

Trend • Its performance is increasing with processor performance at a rate of 50% per year. • Communication is a limiting factor in the performance of many modern systems. • Buses have been unable to keep up with the bandwidth demand, and point-to-point interconnection networks are rapidly taking over. ＮＣ論２

Computer Classifications (%) http://www.top500.org/ share of the TOP500 June, 2013 – June, 2011 ＮＣ論２

Examples of clusters ＮＣ論２

Examples of MPPs ＮＣ論２

Other Networks of Supercomputers • Sequoia (2011): 5D torus, proprietary IBM SeaStar • Pleiades / NASA (2011): partial 11D hypercube topology with IB QDR/DDR • Red Sky/ Sandia National Lab. (2010): 3D torus (12 bristled node) with IB QDR switches • IBM Roadrunner (2009): fat-tree with IB DDR • Earth Simulator2 / NEC SX-9E (2009): Fat-Tree (64GB/s/cpu, 8-CPU/node, 160 nodes) • IBM Blue Gene/L (2004): 3D torus proprietary (64 x 32 x 32 = 64K nodes) ＮＣ論２

Architecture vs. software ＮＣ論２

Network Design (1/3) • Performance: latency and throughput (bandwidth) • Scalability: #processors vs. network, memory, I/O bandwidth • Incremental expandability: small to maximum size • Partitionability: netwrok may be partitioned for several users ＮＣ論２

Network Design (2/3) • Simplicity: simple design, higher clock frequency, easy to use • Distance span: smaller system is preferred for noise and cable delay, etc. • Physical constraints: packaging (pin count), wiring(wire length), and maintenance (power consumption) should meet physical limitation. ＮＣ論２

Network Design (3/3) • Reliability: fault tolerant, reliable communication, hot swap • Expected workload: robust performance over a wade range of traffic conditions. • Cost: trade-offs between cost and performance. ＮＣ論２

Classifiction of Interconnection Networks • Shared-Medium Networks • Local area networks (ethernet, token ring) • Backplane bus (e.g. SUN Gigaplane) • Direct Networks (router-based) • mesh, torus, hypercube, tree, … etc. • Indirect Networks (switch-based) • Hybrid Networks ＮＣ論２

Shared-Medium Networks (LAN) • Arbitration that determines the mastership of the shared-medium network to resolve network access is needed. • The most well-known protocol is carrier-sense multiple access with collision detection (CSMA/CD). • Token bus and token ring pass a token from the owner which has the right to access the bus/ring and resolve nondeterministic waiting time. ＮＣ論２

Shared-Medium Networks (Backplane bus) • It is commonly used to interconnect processor(s) and memory modules to provide SMP (Symmetrical Memory Processor) architecture. • It is realized by printed lines on a circuit board by discrete wiring. • Gigaplane in SUN Enterprise x000 server(1996): 2.6GB/s, 256 bits data, 42 bits address, 83.8MHz clock. ＮＣ論２

Direct (static) Networks • Consists of a set of nodes. • Each node is directly connected to a subset of other nodes in the network. • Examples: • 2D mesh (intel Paragon), 3D mesh (MIT J-Mahine) • 2D torus (Fujitsu AP3000), 3D torus (Cray T3D, T3E) • Hypercube (CM1, CM2, nCUBE) ＮＣ論２

Mesh topology node 2D 3D ＮＣ論２

Torus topology 2D (4-ary 2-cube) 3D (3-ary 3-cube) ＮＣ論２

Hypercube (binary n-cube) 4D (2-ary 4-cube) ＮＣ論２

tree x tree Binary tree fat tree ＮＣ論２

Hierarchical topology (1/2) Pyramid (Hierarchical 2D mesh) Hierarchical ring ＮＣ論２

Hierarchical topology (2/2) Cube-connected cycles RDT (Recursive Diagonal Torus) ＮＣ論２

Hypermesh (spaninng-bus hypercube) Single or multiple buses ＮＣ論２

Base-m n-cube (hyper-crossbar) 770 777 070 077 707 000 007 8x8 crossbar Base-8 3-cube (Toshiba Prodigy) ＮＣ論２

Diameter and degrees (1/2) ３ＮＣ論２

Diameter and degrees (2/2) ３ＮＣ論２

ネットワークコンピューティング論 Ⅱ

ネットワークコンピューティング論 Ⅱ

Presentation Transcript