Overview. Some Definitions. Some definitions. High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks
|
|
- Clement Dale Hood
- 5 years ago
- Views:
Transcription
1 Overview High Performace Computig Programmig Paradigms ad Scalability Part : High-Performace Networks some defiitios static etwork topologies dyamic etwork topologies examples PD Dr. rer. at. habil. Ralf-Peter Mudai Computatio i Egieerig (CiE) Scietific Computig (SCCS) k is eough for ayoe, ad by the way, what s a etwork? William Gates III, chairma Microsoft Corp., 98 Summer Term Some defiitios Some Defiitios remider: protocols -compoet model ISOOSI model iteret protocols (examples) degree (ode degree) umber of coectios (icomig ad outgoig) betwee this ode ad other odes applicatio commuicatio system applicatio layer presetatio layer sessio layer trasport layer data trasfer, TCP, UDP degree of a etwork max. degree of all odes i the etwork higher degrees lead to more parallelism ad badwidth for the commuicatio more costs (due to a higher amout of coectios) objective: keep degree ad, thus, costs small etwork layer IP, ICMP, IGMP etwork logical lik cotrol data lik layer medium access cotrol physical layer etwork adaptatio degree degree
2 Some Defiitios diameter distace of a pair of odes (legth of the shortest path betwee a pair of odes), i.e. the amout of odes a message has to pass o its way from the seder to the receiver diameter of a etwork max. distace of all pairs of odes i the etwork higher diameters (betwee two odes) lead to loger commuicatios less fault tolerace (due to the higher amout of odes that have to work properly) objective: small diameter Some Defiitios coectivity mi. amout of edges (cables) that have to be removed to discoect the etwork, i.e. the etwork falls apart ito two loose sub-etworks higher coectivity leads to more idepedet paths betwee two odes better fault tolerace (due to more routig possibilities) faster commuicatio (due to the avoidace of cogestios i the etwork) objective: high coectivity coectivity diameter Some Defiitios bisectio width mi. amout of edges (cables) that have to be removed to separate the etwork ito two equal parts (bisectio width coectivity, see below) importat for determiig the amout of messages that ca be trasmitted i parallel betwee oe half of the odes to the other half without the repeated usage of ay coectio extreme case: Etheret with bisectio width objective: high bisectio width (ideal: amout of odes) bisectio width (coectivity ) Some Defiitios blockig a desired coectio betwee two odes caot be established due to already existig coectios betwee other pairs of odes objective: o-blockig etworks fault tolerace (redudacy) coectios betwee (arbitrary) odes ca still be established eve uder the breakdow of sigle compoets a fault-tolerat etwork has to provide at least oe redudat path betwee all arbitrary pairs of odes graceful degradatio: the ability of a system to stay fuctioal (maybe with less performace) eve uder the breakdow of sigle compoets 8
3 Some Defiitios badwidth max. trasmissio performace of a etwork for a certai amout of time badwidth B i geeral measured as megabits or megabytes per secod (Mbps or MBps, resp.), owadays more ofte as gigabits or gigabytes per secod (Gbps or GBps, resp.) Overview some defiitios static etwork topologies dyamic etwork topologies examples bisectio badwidth max. trasmissio performace of a etwork over the bisectio lie, i.e. sum of sigle badwidths from all edges (cables) that are cut whe bisectig the etwork thus bisectio badwidth is a measure of bottleeck badwidth uits are same as for badwidth 9 to be distiguished static etworks fixed coectios betwee pairs of odes cotrol fuctios are doe by the odes or by special coectio hardware dyamic etworks o fixed coectios betwee pairs of odes all odes are coected via iputs ad outputs to a so called switchig compoet cotrol fuctios are cocetrated i the switchig compoet various routes ca be switched chai (liear array) oe-dimesioal etwork N odes ad N edges degree diameter N bisectio width drawback: too slow for large N
4 rig two-dimesioal etwork N odes ad N edges degree diameter N bisectio width drawback: too slow for large N how about fault tolerace? chordal rig two-dimesioal etwork N odes ad N, N, N, edges degree,,, higher degrees lead to smaller diameters higher fault tolerace (due to redudat coectios) drawback: higher costs rig with degree (left) ad degree (right) completely coected two-dimesioal etwork star two-dimesioal etwork N odes ad N (N) edges degree N diameter bisectio width N N very high fault tolerace drawback: too expesive for large N N odes ad N edges degree N diameter bisectio width N drawback: bottleeck i cetral ode
5 biary tree two-dimesioal etwork N odes ad N edges (tree height h ld N ) degree diameter h bisectio width drawback: bottleeck i directio of root ( blockig) biary tree (cot d) addressig label o level m cosists of m bits; root has label suffix is added to left so, suffix is added to right so routig fid commo paret ode P of odes S ad D asced from S to P desced from P to D P S D 8 biary tree (cot d) solutio to overcome the bottleeck fat tree edges o level m get higher priority tha edges o level m capacity is doubled o each higher level ow, bisectio width h frequetly used: HLRB II, e.g. mesh torus k-dimesioal etwork N odes ad k (Nr k ) edges (r k N ) degree k diameter k (r) bisectio width r k high fault tolerace drawback large diameter too expesive for k 9
6 mesh torus (cot d) k-dimesioal mesh with cyclic coectios i each dimesio N odes ad k N edges (r k N ) diameter k r bisectio width r k frequetly used: BlueGeeL, e.g. drawback: too expesive for k ILLIAC mesh two-dimesioal etwork N odes ad N edges (rr mesh, r N ) degree diameter r bisectio width r coforms to a chordal rig of degree hypercube k-dimesioal etwork k odes ad k k edges degree k diameter k bisectio width k drawback: scalability (oly doublig of odes allowed) hypercube (cot d) priciple desig costructio of a k-dimesioal hypercube via coectio of the correspodig odes of two k-dimesioal hypercubes iheret labellig via addig prefix to oe sub-cube ad prefix to the other sub-cube D D D D
7 hypercube (cot d) odes are directly coected for a HAMMING distace of oly routig compute S D (xor) for possible ways betwee odes S ad D route frames i icreasigly decreasigly order util fial destiatio is reached Overview some defiitios static etwork topologies dyamic etwork topologies examples example S, D S D decreasig: icreasig: D S bus simple ad cheap sigle stage etwork shared usage from all coected odes, thus, just oe frame trasfer at ay poit i time frame trasfer i oe step (i.e. diameter ) good extesibility, but bad scalability fault tolerace oly for multiple bus systems example: Etheret crossbar completely coected etwork with all possible permutatios of N iputs ad N outputs (i geeral NM iputs outputs) switch elemets allow simultaeous commuicatio betwee all possible disjoit pairs of iputs ad outputs without blockig very fast (diameter ), but expesive due to N switch elemets used for processor processor ad processor memory couplig example: The Earth Simulator iput sigle bus multiple bus (here dual) switch elemet output 8
8 permutatio etworks tradeoff betwee low performace of buses ad high hardware costs of crossbars ofte crossbar as basic elemet N iputs ca simultaeously be switched to N outputs permutatio of iputs (to outputs) sigle stage: cosists of oe colum of switch elemets multistage: cosists of several of those colums straight crossed upper broadcast lower broadcast permutatio etworks (cot d) permutatios: uique (bijective) mappig of iputs to outputs addressig label iputs from to N (i case of N switch elemets) write labels i biary represetatio (a K, a K,, a, a ) permutatios ca ow be expressed as simple bit maipulatio typical permutatios perfect shuffle butterfly exchage 9 permutatio etworks (cot d) perfect shuffle permutatio cyclic left shift P(a K, a K,, a, a ) (a K,, a, a, a K ) permutatio etworks (cot d) butterfly permutatio exchage of first highest ad last lowest bit B(a K, a K,, a, a ) (a, a K,, a, a K ) a a a a a a a a a a a a
9 permutatio etworks (cot d) exchage permutatio egatio of last lowest bit E(a K, a K,, a, a ) (a K, a K,, a, ā ) permutatio etworks (cot d) example: perfect shuffle coectio patter problem: ot all destiatios are accessible from a source a a a a a ā permutatio etworks (cot d) addig additioal exchage permutatios ( shuffle-exchage) all destiatios are ow accessible from ay source omega based o the shuffle-exchage coectio patter exchage permutatios replaced by switch elemets
10 omega (cot d) multistage etwork with N odes ad E Nld N switch elemets diameter ld N (all stages have to be passed) N! permutatios possible, but oly E differet switch states (self cofigurig) routig compare addresses from S ad D bitwise from left to right, i.e. stage i evaluates address bits s i ad d i if equal switch straight (), otherwise switch crossed () example S, D switch states: omega (cot d) omega is a bidelta etwork operates also backwards drawback: blockig possible 8 baya butterfly idea: urollig of a static hypercube bitwise processig of address bits a i from left to right dyamic hypercube a.k.a. butterfly (kow from FFT flow diagram) baya butterfly (cot d) replace crossed coectios by switch elemets itroduced by GOKE ad LIPOVSKI i 9; blockig still possible baya tree 9
11 BENEŠ multistage etwork with N odes ad N(ld N)N switch elemets butterfly merged at the last colum with its copied mirror diameter (ld N) N! permutatios possible, all ca be switched key property: for ay permutatio of iputs to outputs there is a cotetio-free routig BENEŠ (cot d) example S, D ad S, D blockig for butterfly BENEŠ (cot d) example S, D ad S, D o blockig for BENEŠ CLOS proposed by CLOS i 9 for telephoe switchig systems objective: overcome the costs of crossbars (N switch elemets) idea: replace the etire crossbar with three stages of smaller oes igress stage: R crossbars with NM iputs outputs middle stage: M crossbars with RR iputs outputs egress stage: R crossbars with MN iputs outputs thus much fewer switch elemets tha for the etire system ay icomig frame is routed from the iput via oe of the middle stage crossbars to the respective output a middle stage crossbar is available if both liks to the igress ad egress stage are free
12 CLOS (cot d) RN iputs ca be assiged to RN outputs CLOS (cot d) relative values of M ad N defie the blockig characteristics m r r m M N: rearrageable o-blockig a free iput ca always be coected to a free output existig coectios might be assiged to differet middle stage crossbars (rearragemet) m r r m M N: strict-sese o-blockig a free iput ca always be coected to a free output o re-assigmet ecessary r m r m r r m remider: bipartite graph defiitio: a graph whose vertices ca be divided ito two disjoit sets U ad V such that every edge coects a vertex i U to oe i V; that is, U ad V are each idepedet sets remider: perfect matchig defiitio: perfect matchig (a.k.a. -factor) is a matchig that matches all vertices of a graph, i.e. every vertex is icidet to exactly oe edge of the matchig urse pilot lawyer A N urse Alice Bob B P ilot U V Carol C L awyer divisio of vertices i U ad V, i.e. there are o edges withi U ad V, oly betwee U ad V problem: perfect matchig for bipartite graph to be foud 8
13 CLOS (cot d) proof for M N via HALL s Marriage Theorem () Let G (V IN, V OUT, E) be a bipartite graph. A perfect matchig for G is a ijective fuctio f : V IN V OUT so that for every x V IN, there is a edge i E whose edpoits are x ad f(x). Oe would expect a perfect matchig to exist if G cotais eough edges, i.e. if for every subset A V IN the image set A V OUT is sufficiet large. Theorem: G has a perfect matchig if ad oly if for every subset A V IN the iequality A A holds. Ofte explaied as follows: Imagie two groups of N me ad N wome. If ay subset of S boys (where S N) kows S or more girls, each boy ca be married with a girl he kows. CLOS (cot d) proof for M N via HALL s Marriage Theorem () boy igress stage crossbar girl egress stage crossbar a boy kows a girl if there exists a (direct) coectio betwee them assume there s oe free iput ad oe free output left ) for S R boys there are SN coectios at least S girls ) thus, HALL s theorem states there exists a perfect matchig ) R coectios ca be hadled by oe middle stage crossbar ) budle these coectios ad delete the middle stage crossbar ) repeat from step ) util M ) ew coectio ca be hadled, maybe rearragemet ecessary 9 CLOS (cot d) proof for M N via HALL s Marriage Theorem () example: M N iitial situatio: two coectios caot be established budle coectios o oe middle stage crossbar ad delete it afterwards maybe rearragemets are ecessary repeat steps util M, the all coectios should be possible CLOS (cot d) proof for M N via worst case sceario crossbar with N iputs ad crossbar with N outputs, all coected to differet middle stage crossbars oe further coectio
14 costat bisectio badwidth (CBB) more geeral cocept of CLOS ad fat tree etworks costructio of a o-blockig etwork coectig M odes usig multiple levels of basic NN switch elemets (M N) for ay give level, dowstream BW (i directio to odes) is idetical to upstream BW (i directio to itercoectio) key for o-blockig: always preserve idetical badwidth (upstream ad dowstream) betwee ay two levels observatio: for two-stage costat bisectio badwidth etworks coectig M odes always M ports (i.e. sum of iputs ad outputs) are ecessary CBB frequetly used for high-speed itercoects (IfiiBad, e.g.) costat bisectio badwidth (cot d) example: CBB coectig odes with switch elemets i total 8 ports (i.e. switch elemets) are ecessary level level Overview some defiitios static etwork topologies dyamic etwork topologies examples Examples i the past years, differet (proprietary) high-performace etworks have established o the market typically, these cosist of a static ad or dyamic etwork topology sophisticated etwork iterface cards (NIC) popular etworks Myriet IfiiBad Scalable Coheret Iterface (SCI)
15 Examples Examples Myriet developed by Myricom (99) for clusters Myriet (cot d) programmig model particularly efficiet due to usage of oboard (NIC) processors for protocol offload ad low-latecy, kerel-bypass operatios (ParaStatio, e.g.) highly scalable, cut-through switchig TCP Applicatio UDP low level message passig switchig rearrageable o-blockig CLOS (8 odes) spie of CLOS etwork cosists of eight crossbars odes are coected via lie-cards with 88 crossbar each OS kerel Etheret IP Myriet mmap proprietary protocol (ParaStatio, e. g.) Myriet GM API Etheret Myriet 8 Examples IfiiBad uificatio of two competig efforts i 999 Future IO iitiative (Compaq, IBM, HP) Next-Geeratio IO iitiative (Dell, Itel, SUN et al.) idea: itroductio of a future IO stadard as successor for PCI overcome the bottleeck of limited IO badwidth coectio of hosts (via host chael adapters (HCA)) ad devices (via target chael adapters (TCA)) to the IO fabric switched poit-to-poit bidirectioal liks bodig of liks for badwidth improvemets: (up to Gbps), (up to Gbps), 8 (up to Gbps), ad (up to Gbps) owadays oly used for cluster coectio Examples IfiiBad (cot d) particularly efficiet (amog others) due to protocol offload ad reduced CPU utilisatio Remote Direct Memory Access (RDMA), i.e. direct R/W access via HCA to local/remote memory without CPU usage/iterrupts switchig: costat bisectio badwidth (up to 88 odes) CPU CPU memory cotroller memory HCA ode lik Switch TCA HCA 9
16 Examples Scalable Coheret Iterface (SCI) origiated as a offshoot from IEEE Futurebus project i 988 became IEEE stadard i 99 SCI is a high performace itercoect techology that coects up to, odes (both hosts ad devices) supports remote memory access for read/write (NUMA) uses packet switchig poit-to-poit commuicatio Examples Scalable Coheret Iterface (cot d) shared memory: SCI uses a -bit fixed addressig scheme upper bits: ode o which physical storage is located lower 8 bits: local physical address withi memory hece, ay physical memory locatio of the etire memory space ca be mapped ito a ode s local memory virtual address space P virtual address space P SCI cotroller moitors IO trasactios (memory) to assure cache coherece of all attached odes, i.e. all write accesses that ivalidate cache etries of other SCI modules are detected performace: up to GBps with latecies smaller tha s differet topologies such as rig or torus possible ode A mmap import export SCI address space mmap physical address space ode B
High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks
High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Scientific Computing (SCCS)
More informationHigh Performance Computing Programming Paradigms and Scalability
High Performance Computing Programming Paradigms and Scalability PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Summer Term 208
More informationMultiprocessors. HPC Prof. Robert van Engelen
Multiprocessors Prof. Robert va Egele Overview The PMS model Shared memory multiprocessors Basic shared memory systems SMP, Multicore, ad COMA Distributed memory multicomputers MPP systems Network topologies
More informationSwitching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1
Switchig Hardware Sprig 208 CS 438 Staff, Uiversity of Illiois Where are we? Uderstad Differet ways to move through a etwork (forwardig) Read sigs at each switch (datagram) Follow a kow path (virtual circuit)
More informationOn Nonblocking Folded-Clos Networks in Computer Communication Environments
O Noblockig Folded-Clos Networks i Computer Commuicatio Eviromets Xi Yua Departmet of Computer Sciece, Florida State Uiversity, Tallahassee, FL 3306 xyua@cs.fsu.edu Abstract Folded-Clos etworks, also referred
More informationSwitch Construction CS
Switch Costructio CS 00 Workstatio-Based Aggregate badwidth /2 of the I/O bus badwidth capacity shared amog all hosts coected to switch example: Gbps bus ca support 5 x 00Mbps ports (i theory) I/O bus
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationIntroduction to Network Technologies & Layered Architecture BUPT/QMUL
Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationThe Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems
The Peta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems Abdulkarim Ayyad Departmet of Computer Egieerig, Al-Quds Uiversity, Jerusalem, P.O. Box 20002 Tel: 02-2797024,
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationMedia Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1
Media Access Protocols Sprig 2018 CS 438 Staff, Uiversity of Illiois 1 Where are We? you are here 00010001 11001001 00011101 A midterm is here Sprig 2018 CS 438 Staff, Uiversity of Illiois 2 Multiple Access
More informationCourse Information. Details. Topics. Network Examples. Overview. Walrand Lecture 1. EECS 228a. EECS 228a Lecture 1 Overview: Networks
Walrad Lecture 1 Course Iformatio Lecture 1 Overview: Networks Jea Walrad www.eecs.berkeley.edu/~wlr Istructor: Jea Walrad Office Hours: M-Tu 1:00-2:00 Time/Place: MW 2:00-3:30 i 285 Cory Home Page: http://wwwist.eecs.berkeley.edu/~ee228a
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationMinimum Spanning Trees
Miimum Spaig Trees Miimum Spaig Trees Spaig subgraph Subgraph of a graph G cotaiig all the vertices of G Spaig tree Spaig subgraph that is itself a (free) tree Miimum spaig tree (MST) Spaig tree of a weighted
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationTransitioning to BGP
Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationComputer Graphics Hardware An Overview
Computer Graphics Hardware A Overview Graphics System Moitor Iput devices CPU/Memory GPU Raster Graphics System Raster: A array of picture elemets Based o raster-sca TV techology The scree (ad a picture)
More informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationCMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access
More informationFundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018
Fudametals of Chapter 1 Microprocessor ad Microcotroller Dr. Farid Farahmad Updated: Tuesday, Jauary 16, 2018 Evolutio First came trasistors Itegrated circuits SSI (Small-Scale Itegratio) to ULSI Very
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationSCI Reflective Memory
Embedded SCI Solutios SCI Reflective Memory (Experimetal) Atle Vesterkjær Dolphi Itercoect Solutios AS Olaf Helsets vei 6, N-0621 Oslo, Norway Phoe: (47) 23 16 71 42 Fax: (47) 23 16 71 80 Mail: atleve@dolphiics.o
More informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationGreedy Algorithms. Interval Scheduling. Greedy Algorithms. Interval scheduling. Greedy Algorithms. Interval Scheduling
Greedy Algorithms Greedy Algorithms Witer Paul Beame Hard to defie exactly but ca give geeral properties Solutio is built i small steps Decisios o how to build the solutio are made to maximize some criterio
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationMessage Integrity and Hash Functions. TELE3119: Week4
Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig
More informationMaster Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationAdaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1
Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationMulti-Threading. Hyper-, Multi-, and Simultaneous Thread Execution
Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationFAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS
SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG
More informationSlides are an edited mashup of two books
Slides are a edited mashup of two books Computer Networks: A Systems Approach, 5e Larry L. Peterso ad Bruce S. Davie Copyright 2010, Elsevier Ic. All rights Reserved Computer Networkig: A Top Dow Approach
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationCMSC22200 Computer Architecture Lecture 9: Out-of-Order, SIMD, VLIW. Prof. Yanjing Li University of Chicago
CMSC22200 Computer Architecture Lecture 9: Out-of-Order, SIMD, VLIW Prof. Yajig Li Uiversity of Chicago Admiistrative Stuff Lab2 due toight Exam I: covers lectures 1-9 Ope book, ope otes, close device
More informationThe CCITT Communication Protocol for Videophone Teleconferencing Equipment
The CCITT Commuicatio Protocol for Videophoe Telecoferecig Equipmet Ralf Hiz Daimler-Bez AG Istitut ffir Iformatiostechik Tcl. 0731 / 505-21 32 Fax. 0731 / 505-41 04 Wilhelm-R.uge-Str. 11 7900 Ulm Abstract
More informationWEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE
WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh
More informationIS-IS in Detail. ISP Workshops
IS-IS i Detail ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 27 th November
More informationProperties and Embeddings of Interconnection Networks Based on the Hexcube
JOURNAL OF INFORMATION PROPERTIES SCIENCE AND AND ENGINEERING EMBEDDINGS OF 16, THE 81-95 HEXCUBE (2000) 81 Short Paper Properties ad Embeddigs of Itercoectio Networks Based o the Hexcube JUNG-SING JWO,
More informationPrivate Key Cryptography. TELE3119: Week2
Private Key Cryptography TELE3119: Week2 Private Key Ecryptio Also referred to as: covetioal ecryptio symmetric key ecryptio secret-key or sigle-key ecryptio Oly alterative before public-key ecryptio i
More informationIntroduction to OSPF. ISP Training Workshops
Itroductio to OSPF ISP Traiig Workshops 1 OSPF p Ope Shortest Path First p Lik state or SPF techology p Developed by OSPF workig group of IETF (RFC 1247) p OSPFv2 stadard described i RFC2328 p Desiged
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationn Learn how resiliency strategies reduce risk n Discover automation strategies to reduce risk
Chapter Objectives Lear how resiliecy strategies reduce risk Discover automatio strategies to reduce risk Chapter #16: Architecture ad Desig Resiliecy ad Automatio Strategies 2 Automatio/Scriptig Resiliet
More informationXiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation
Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio
More informationSystem Overview. Hardware Concept. s Introduction to the Features of MicroAutoBox t
s Itroductio to the Features of MicroAutoBox t System Overview Objective Where to go from here dspace provides the MicroAutoBox i differet variats. This sectio gives you a overview o the MicroAutoBox's
More informationArchitectural styles for software systems The client-server style
Architectural styles for software systems The cliet-server style Prof. Paolo Ciacarii Software Architecture CdL M Iformatica Uiversità di Bologa Ageda Cliet server style CS two tiers CS three tiers CS
More informationTHE WAY OF CALCULATING THE TRAFFIC AND SIGNALING NETWORK DIMENSION OF COMMON CHANNEL SIGNALING NO.7 (CCS7)
The Way of Calculatig The Traffic... THE WAY OF CALCULATIG THE TRAFFIC AD SIGALIG ETWORK DIMESIO OF COMMO CHAEL SIGALIG O.7 (CCS7) Departeme Tekik Elektro, Fakultas Tekik, Uiversitas Sumatera Utara Abstract:
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationEECS 122, Lecture 24 Introduction to the Telephone Network. Kevin Fall Jean Walrand
EECS 122, Lecture 24 Itroductio to the Telephoe Network Kevi Fall kfall@cs.berkeley.edu Jea Walrad wlr@eecs.berkeley.edu Outlie Overview Cocepts Recet History Structure Hierarchical Addressig Ed Systems
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationOn Multicast Scheduling and Routing in Multistage Clos Networks
O Multicast Schedulig ad Routig i Multistage Clos Networks Bi Tag Departmet of Computer Sciece Stoy Brook Uiversity Stoy Brook, NY 794 bitag@cs.suysb.edu Abstract Multicast commuicatio, which ivolves trasmittig
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationCIS 121. Introduction to Trees
CIS 121 Itroductio to Trees 1 Tree ADT Tree defiitio q A tree is a set of odes which may be empty q If ot empty, the there is a distiguished ode r, called root ad zero or more o-empty subtrees T 1, T 2,
More informationDESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO
DESIGN AND ANALYSIS OF LDPC DECODERS FOR SOFTWARE DEFINED RADIO Sagwo Seo, Trevor Mudge Advaced Computer Architecture Laboratory Uiversity of Michiga at A Arbor {swseo, tm}@umich.edu Yumig Zhu, Chaitali
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationSession Initiated Protocol (SIP) and Message-based Load Balancing (MBLB)
F5 White Paper Sessio Iitiated Protocol (SIP) ad Message-based Load Balacig (MBLB) The ability to provide ew ad creative methods of commuicatios has esured a SIP presece i almost every orgaizatio. The
More informationThe Value of Peering
The Value of Peerig ISP/IXP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 25 th
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationTraditional queuing behaviour in routers. Scheduling and queue management. Questions. Scheduling mechanisms. Scheduling [1] Scheduling [2]
Traditioal queuig behaviour i routers Schedulig ad queue maagemet Data trasfer: datagrams: idividual packets o recogitio of flows coectioless: o sigallig Forwardig: based o per-datagram, forwardig table
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationWYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET
WYSE Academic Challege Sectioal Computer Sciece 2005 SOLUTION SET 1. Correct aswer: a. Hz = cycle / secod. CPI = 2, therefore, CPI*I = 2 * 28 X 10 8 istructios = 56 X 10 8 cycles. The clock rate is 56
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationA QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services
A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute
More information