Computer Science and Engineering Parallel and Distributed Processing CSE 8380 February 1 2005 Session 6.

Slides:



Advertisements
Similar presentations
Microprocessors. Von Neumann architecture Data and instructions in single read/write memory Contents of memory addressable by location, independent of.
Advertisements

Computer Organization and Architecture 18 th March, 2008.
1 CS 501 Spring 2002 CS 501: Software Engineering Lecture 19 Performance of Computer Systems.
CS 501: Software Engineering Fall 2000 Lecture 19 Performance of Computer Systems.
1 CS 501 Spring 2005 CS 501: Software Engineering Lecture 22 Performance of Computer Systems.
DCS/2003/1 CENG Distributed Computing Systems Measures of Performance.
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
Energy Model for Multiprocess Applications Texas Tech University.
Computers Central Processor Unit. Basic Computer System MAIN MEMORY ALUCNTL..... BUS CONTROLLER Processor I/O moduleInterconnections BUS Memory.
CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
1 Homework Reading –None (Finish all previous reading assignments) Machine Projects –Continue with MP5 Labs –Finish lab reports by deadline posted in lab.
Introduction CSE 410, Spring 2008 Computer Systems
Introduction Computer Organization and Architecture: Lesson 1.
Computers Are Your Future Eleventh Edition Chapter 2: Inside the System Unit Copyright © 2011 Pearson Education, Inc. Publishing as Prentice Hall1.
Chapter 2 The CPU and the Main Board  2.1 Components of the CPU 2.1 Components of the CPU 2.1 Components of the CPU  2.2Performance and Instruction Sets.
Multi-core Programming Introduction Topics. Topics General Ideas Moore’s Law Amdahl's Law Processes and Threads Concurrency vs. Parallelism.
Lecture 1: Performance EEN 312: Processors: Hardware, Software, and Interfacing Department of Electrical and Computer Engineering Spring 2013, Dr. Rozier.
Sogang University Advanced Computing System Chap 1. Computer Architecture Hyuk-Jun Lee, PhD Dept. of Computer Science and Engineering Sogang University.
2015/10/14Part-I1 Introduction to Parallel Processing.
Chapter 2 Parallel Architecture. Moore’s Law The number of transistors on a chip doubles every years. – Has been valid for over 40 years – Can’t.
1 CS 501 Spring 2006 CS 501: Software Engineering Lecture 22 Performance of Computer Systems.
Message Passing Computing 1 iCSC2015,Helvi Hartmann, FIAS Message Passing Computing Lecture 1 High Performance Computing Helvi Hartmann FIAS Inverted CERN.
Parallel Processing Sharing the load. Inside a Processor Chip in Package Circuits Primarily Crystalline Silicon 1 mm – 25 mm on a side 100 million to.
Chapter 1 — Computer Abstractions and Technology — 1 The Computer Revolution Progress in computer technology – Underpinned by Moore’s Law Makes novel applications.
Computer Engineering Rabie A. Ramadan Lecture 1. 2 Welcome Back.
Computer System Internal components - The processor - Main memory - I / O controllers - Buses External components (peripherals). These include: - keyboard.
Moore’s Law By Cameron Waters. Who’s Law? Gordon Moore Born January 3 rd 1929 Member of Institute of Electrical and Electronics Engineers (IEEE) Co-Founder.
Morgan Kaufmann Publishers
Data Management for Decision Support Session-4 Prof. Bharat Bhasker.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 April 11, 2006 Session 23.
Copyright Hesham El-Rewini1 Speedup S = Speed(new) / Speed(old) S = Work/time(new) / Work/time(old) S = time(old) / time(new) S = time(before improvement)
Computer Science and Engineering Advanced Computer Architecture CSE 8383 February Session 6.
1 EGRE 426 Handout 1 8/25/09. 2 Preliminary EGRE 365 is a prerequisite for this class. Class web page egre426/index.html.
1Thu D. NguyenCS 545: Distributed Systems CS 545: Distributed Systems Spring 2002 Communication Medium Thu D. Nguyen
Performance Tuning John Black CS 425 UNR, Fall 2000.
Computer performance issues* Pipelines, Parallelism. Process and Threads.
1 CS 501 Spring 2003 CS 501: Software Engineering Lecture 23 Performance of Computer Systems.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 13.
The Beauty and Joy of Computing Lecture #10 Concurrency UC Berkeley EECS Lecturer Gerald Friedland Prof Jonathan Koomey looked at 6 decades of data and.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 May 2, 2006 Session 29.
Computer Engineering Rabie A. Ramadan Lecture 2. Table of Contents 2 Architecture Development and Styles Performance Measures Amdahl’s Law.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 April 28, 2005 Session 29.
Hardware Trends CSE451 Andrew Whitaker. Motivation Hardware moves quickly OS code tends to stick around for a while “System building” extends way beyond.
Hardware Trends CSE451 Andrew Whitaker. Motivation Hardware moves quickly OS code tends to stick around for a while “System building” extends way beyond.
Lecture # 10 Processors Microcomputer Processors.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 7.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 11.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 April 6, 2006 Session 22.
Software Design and Development Computer Architecture Computing Science.
History of Computers and Performance David Monismith Jan. 14, 2015 Based on notes from Dr. Bill Siever and from the Patterson and Hennessy Text.
Introduction CSE 410, Spring 2005 Computer Systems
SPRING 2012 Assembly Language. Definition 2 A microprocessor is a silicon chip which forms the core of a microcomputer the concept of what goes into a.
Internal hardware of a computer Learning Objectives Learn how the processor works Learn about the different types of memory and what memory is used for.
DCS/1 CENG Distributed Computing Systems Measures of Performance.
Performance. Moore's Law Moore's Law Related Curves.
Introduction to Computers - Hardware
William Stallings Computer Organization and Architecture 6th Edition
OCR GCSE Computer Science Teaching and Learning Resources
Introduction to Parallel Processing
CS 147 – Parallel Processing
Assembly Language for Intel-Based Computers, 5th Edition
System Architecture 1 Chapter 2.
Parallel Processing Sharing the load.
Performance of computer systems
Chapter 1 Introduction.
Computer Evolution and Performance
Performance of computer systems
Lecture 20 Parallel Programming CSE /27/2019.
Presentation transcript:

Computer Science and Engineering Parallel and Distributed Processing CSE 8380 February Session 6

Computer Science and Engineering Performance Evaluation Grosch’s Law Moore’s Law Von Neumann’s Bottlneck Parallelism Speedup Amdahl’s Law The Gustafson-Barsis Law Benchmarks Contents

Computer Science and Engineering Grosch’s Law (1960s) “To sell a computer for twice as much, it must be four times as fast” Vendors skip small speed improvements in favor of waiting for large ones Buyers of expensive machines would wait for a twofold improvement in performance for the same price.

Computer Science and Engineering Moore’s Law Gordon Moore (cofounder of Intel) Processor performance would double every 18 months This prediction has held for several decades Unlikely that single-processor performance continues to increase indefinitely

Computer Science and Engineering Von Neumann’s bottleneck Great mathematician of the 1940s and 1950s Single control unit connecting a memory to a processing unit Instructions and data are fetched one at a time from memory and fed to processing unit Speed is limited by the rate at which instructions and data are transferred from memory to the processing unit.

Computer Science and Engineering Problem Assume that a switching component such as a transistor can switch in zero time. We propose to construct a disk- shaped computer chip with such a component. The only limitation is the time it takes to send electronic signals from one edge of the chip to the other. Make the simplifying assumption that electronic signals travel 300,000 kilometers per second. What must be the diameter of a round chip so that it can switch 10 9 times per second? What would the diameter be if the switching requirements were time per second?

Computer Science and Engineering Parallelism Multiple CPUs Within the CPU One Pipeline Multiple pipelines

Computer Science and Engineering Superscalar Parallelism Scheduling

Computer Science and Engineering Past Trends in Parallel Architecture (inside the box) Completely custom designed components (processors, memory, interconnects, I/O) Longer R&D time (2-3 years) Expensive systems Quickly becoming outdated Bankrupt companies!!

Computer Science and Engineering New Trends in Parallel Architecture (outside the box) Advances in commodity processors and network technology Network of PCs and workstations connected via LAN or WAN forms a Parallel System Network Computing Compete favorably (cost/performance) Utilize unused cycles of systems sitting idle

Computer Science and Engineering Speedup S = Speed(new) / Speed(old) S = Work/time(new) / Work/time(old) S = time(old) / time(new) S = time(before improvement) / time(after improvement)

Computer Science and Engineering Speedup Time (one CPU): T(1) Time (n CPUs): T(n) Speedup: S S = T(1)/T(n)

Computer Science and Engineering Amdahl’s Law The performance improvement to be gained from using some faster mode of execution is limited by the fraction of the time the faster mode can be used

Computer Science and Engineering 20 hours 200 miles A B Walk 4 miles /hour Bike 10 miles / hour Car-1 50 miles / hour Car miles / hour Car miles /hour must walk Example

Computer Science and Engineering 20 hours 200 miles A B Walk 4 miles /hour  = 70 hours S = 1 Bike 10 miles / hour  = 40 hours S = 1.8 Car-1 50 miles / hour  = 24 hours S = 2.9 Car miles / hour  = hours S = 3.2 Car miles /hour  = hours S = 3.4 must walk Example

Computer Science and Engineering Amdahl’s Law (1967)  : The fraction of the program that is naturally serial (1-  ): The fraction of the program that is naturally parallel

Computer Science and Engineering S = T(1)/T(N) T(N) = T(1)  + T(1)(1-  ) N S = 1  + (1-  ) N = N  N + (1-  )

Computer Science and Engineering Amdahl’s Law

Computer Science and Engineering Gustafson-Barsis Law N &  are not independent from each other T(N) = 1 T(1) =  + (1-  ) N S = N – (N-1)   : The fraction of the program that is naturally serial

Computer Science and Engineering Gustafson-Barsis Law

Computer Science and Engineering

Distributed Computing Performance Single Program Performance Multiple Program Performance

Computer Science and Engineering

Benchmark Performance Serial Benchmarks Parallel Benchmarks PERFECT Benchmarks NAS Kernel The SLALOM The Golden Bell Prize WebSTONE for the Web Performance Comparisons