New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Computer Architecture

by: Marian Kertzmann DVM

Computer Architecture CS 6810

Marian Kertzmann DVM
The U
GPA 3.78

Alan Davis

Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Alan Davis
Class Notes
25 ?




Popular in Course

Popular in ComputerScienence

This 16 page Class Notes was uploaded by Marian Kertzmann DVM on Monday October 26, 2015. The Class Notes belongs to CS 6810 at University of Utah taught by Alan Davis in Fall. Since its upload, it has received 45 views. For similar materials see /class/229976/cs-6810-university-of-utah in ComputerScienence at University of Utah.

Similar to CS 6810 at The U

Popular in ComputerScienence


Reviews for Computer Architecture


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/26/15
Lecture 23 Interconnection Networks Topics communication latency centralized and decentralized switches Appendix E Topologies Internet topologies are not very regular they grew incrementally Supercomputers have regular interconnect topologies and trade off cost for high bandwidth Nodes can be connected with gt centralized switch all nodes have input and output wires going to a centralized chip that internally handles all routing gt decentralized switch each node is connected to a switch that routes data to one of a few neighbors Centralized Crossbar Switch Crossbar switch Centralized Crossbar Switch Crossbar Properties Assuming each node has one input and one output a crossbar can provide maximum bandwidth N messages can be sent as long as there are N unique sources and N unique destinations Maximum overhead WN2 internal switches where W is data width and N is number of nodes To reduce overhead use smaller switches as building blocks trade off overhead for lower effective bandwidth Switch with Omega Network 000 001 O10 011 100 101 110 111 Omega Network Properties The switch complexity is now ON log N Contention increases P0 9 P5 and P1 9 P7 cannot happen concurrently this was possible in a crossbar To deal with contention can increase the number of levels redundant paths by mirroring the network we can route from P0 to P5 via N intermediate nodes while increasing complexity by a factor of 2 Tree Network Complexity is ON Can yield low latencies when communicating with neighbors Can build a fat tree by having multiple incoming and outgoing links E E A Bisection Bandwidth Split N nodes into two groups of N2 nodes such that the bandwidth between these two groups is minimum that is the bisection bandwidth Why is it relevant if traffic is completely random the probability of a message going across the two halves is 12 if all nodes send a message the bisection bandwidth will have to be N2 The concept of bisection bandwidth confirms that the tree network is not suited for random traffic patterns but for localized traffic patterns Distributed Switches Ring Each node is connected to a 3x3 switch that routes messages between the node and its two neighbors Effectiver a repeated bus multiple messages in transit Disadvantage bisection bandwidth of 2 and N2 hops on average 39aaaaaaaa Distributed Switch Options Performance can be increased by throwing more hardware at the problem fullyconnected switches every switch is connected to every other switch N2 wiring complexity N2 4 bisection bandwidth Most commercial designs adopt a point between the two extremes ring and fullyconnected gt Grid each node connects with its N E W S neighbors gt Torus connections wrap around gt Hypercube links between nodes whose binary names differ in a single bit Topology Examples Hypercube Criteria Bus 2Dtorus 6cube Fully connected Performance Bisection bandwidth Cost Portsswitch Total links Topology Examples CH 1 Cicicp Hypercube Torus Criteria Bus Ring 2Dtorus 6cube Fully connected Performance Bisection 1 2 16 32 1024 bandwidth Cost Portsswitch 3 5 7 64 Total links 1 128 192 256 2080 13 k ary dcube Consider a kary dcube a ddimension array with k elements in each dimension there are links between elements that differ in one dimension by 1 mod k Number of nodes N kd Number Of SWitCheS 2 Avg routing distance Switch degree Diameter Number Of links 2 Bisection bandwidth PInS per node 2 Switch complexity Should we minimize or maximize dimension k ary dCube Consider a kary dcube a ddimension array with k elements in each dimension there are links between elements that differ in one dimension by 1 mod k Number of nodes N kd with no wraparound Number of switches 2 N Avg routing distance dk12 Switch degree 2d 1 Diameter 2 dk1 Number oflinks 2 Nd Bisection bandwidth 2Wkd1 Pins per node i 2wd Switch complexity 2d 12 Should we minimize or maximize dimension Title Bullet


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Bentley McCaw University of Florida

"I was shooting for a perfect 4.0 GPA this semester. Having StudySoup as a study aid was critical to helping me achieve my goal...and I nailed it!"

Kyle Maynard Purdue

"When you're taking detailed notes and trying to help everyone else out in the class, it really helps you learn and understand the I made $280 on my first study guide!"

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.