1 Introduction ELG 6158 Digital Systems Architecture Miodrag Bolic.

Slides:



Advertisements
Similar presentations
CPU Structure and Function
Advertisements

Cortex-M3 Implementation Overview. Chapter 6 in the reference book.
AMD OPTERON ARCHITECTURE Omar Aragon Abdel Salam Sayyad This presentation is missing the references used.
Virtual Memory Chapter 18 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S. Dandamudi.
1 Memory Systems Virtual Memory Lecture 25 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Spring 2003CSE P5481 Introduction Why memory subsystem design is important CPU speeds increase 55% per year DRAM speeds increase 3% per year rate of increase.
1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)
S.1 Review: The Memory Hierarchy Increasing distance from the processor in access time L1$ L2$ Main Memory Secondary Memory Processor (Relative) size of.
Review CPSC 321 Andreas Klappenecker Announcements Tuesday, November 30, midterm exam.
1 Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
Csci4203/ece43631 Review Quiz. 1)It is less expensive 2)It is usually faster 3)Its average CPI is smaller 4)It allows a faster clock rate 5)It has a simpler.
1 CSE SUNY New Paltz Chapter Nine Multiprocessors.
Parallel Computer Architectures
ECE669 L16: Interconnection Topology March 30, 2004 ECE 669 Parallel Computer Architecture Lecture 16 Interconnection Topology.
MULTICOMPUTER 1. MULTICOMPUTER, YANG DIPELAJARI Multiprocessors vs multicomputers Interconnection topologies Switching schemes Communication with messages.
Interconnect Networks
Network Topologies Topology – how nodes are connected – where there is a wire between 2 nodes. Routing – the path a message takes to get from one node.
Parallel Computing Basic Concepts Computational Models Synchronous vs. Asynchronous The Flynn Taxonomy Shared versus Distributed Memory Interconnection.
CS668- Lecture 2 - Sept. 30 Today’s topics Parallel Architectures (Chapter 2) Memory Hierarchy Busses and Switched Networks Interconnection Network Topologies.
CSE Advanced Computer Architecture Week-11 April 1, 2004 engr.smu.edu/~rewini/8383.
CSE431 L22 TLBs.1Irwin, PSU, 2005 CSE 431 Computer Architecture Fall 2005 Lecture 22. Virtual Memory Hardware Support Mary Jane Irwin (
Computers organization & Assembly Language Chapter 0 INTRODUCTION TO COMPUTING Basic Concepts.
Course Wrap-Up Miodrag Bolic CEG4136. What was covered Interconnection network topologies and performance Shared-memory architectures Message passing.
1 Dynamic Interconnection Networks Miodrag Bolic.
Chapter 6 Multiprocessor System. Introduction  Each processor in a multiprocessor system can be executing a different instruction at any time.  The.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 January Session 4.
Parallel Programming on the SGI Origin2000 With thanks to Igor Zacharov / Benoit Marchand, SGI Taub Computer Center Technion Moshe Goldberg,
Chapter 8 CPU and Memory: Design, Implementation, and Enhancement The Architecture of Computer Hardware and Systems Software: An Information Technology.
Super computers Parallel Processing By Lecturer: Aisha Dawood.
1 Introduction CEG 4131 Computer Architecture III Miodrag Bolic.
Chapter 8-2 : Multicomputers Multiprocessors vs multicomputers Multiprocessors vs multicomputers Interconnection topologies Interconnection topologies.
Virtual Memory. Virtual Memory: Topics Why virtual memory? Virtual to physical address translation Page Table Translation Lookaside Buffer (TLB)
Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.
Birds Eye View of Interconnection Networks
1 Interconnection Networks. 2 Interconnection Networks Interconnection Network (for SIMD/MIMD) can be used for internal connections among: Processors,
Chapter 1 Introduction to the Systems Approach
1 Chapter Seven CACHE MEMORY AND VIRTUAL MEMORY. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4.
Lecture 17 Final Review Prof. Mike Schulte Computer Architecture ECE 201.
Super computers Parallel Processing
Final Review Prof. Mike Schulte Advanced Computer Architecture ECE 401.
3/12/2013Computer Engg, IIT(BHU)1 INTRODUCTION-2.
Spring EE 437 Lillevik 437s06-l22 University of Portland School of Engineering Advanced Computer Architecture Lecture 22 Distributed computer Interconnection.
Page 1 Computer Architecture and Organization 55:035 Final Exam Review Spring 2011.
CHAPTER 2 Instruction Set Architecture 3/21/
CS203 – Advanced Computer Architecture Virtual Memory.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University
VU-Advanced Computer Architecture Lecture 1-Introduction 1 Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 1.
CDA 3101 Spring 2016 Introduction to Computer Organization Physical Memory, Virtual Memory and Cache 22, 29 March 2016.
1 Lecture 20: OOO, Memory Hierarchy Today’s topics:  Out-of-order execution  Cache basics.
Translation Lookaside Buffer
Parallel Architecture
ECE232: Hardware Organization and Design
Memory COMPUTER ARCHITECTURE
Memory Hierarchy Virtual Memory, Address Translation
Parallel and Multiprocessor Architectures
Directory-based Protocol
Part V Memory System Design
FIGURE 12-1 Memory Hierarchy
Chapter 5 Memory CSE 820.
Interconnect with Cache Coherency Manager
Translation Lookaside Buffer
Lecture 20: OOO, Memory Hierarchy
TLB Performance Seung Ki Lee.
Virtual Memory Overcoming main memory size limitation
Introduction SYSC5603 (ELG6163) Digital Signal Processing Microprocessors, Software and Applications Miodrag Bolic.
Lecture 23: Virtual Memory, Multiprocessors
Main Memory Background
The University of Adelaide, School of Computer Science
Introduction to Computer Systems Engineering
Presentation transcript:

1 Introduction ELG 6158 Digital Systems Architecture Miodrag Bolic

Pipelining Basic pipeline performance and effects of hazards on performance Pipelined version of the MIPS processor Pipeline hazards –Structural hazards –Data hazards –Control hazards –Drawing pipeline diagrams to identify hazards and stalls add $5, $7, $1 add $6, $3, $5, sw $6, 200($0) Show what parts of the datapath are active and what are the values of control signals and buses for various instruction

Pipelined datapath

Memory Hierarchy Concepts of memory hierarchies –Memory close to the processor is faster, smaller, and more expensive –Take advantage of locality Basics of caches –How to access a cache, hit or miss –Determining the size of the byte offset, index, and tags –Determining total number of bits in the cache –Drawing diagrams of different types of caches Improving cache performance –Increasing the size of the cache –Increasing the block size –Increasing associativity –Adding a second level cache

Memory Hierarchies Virtual Memory –Benefits of virtual memory – Address tranlation processes: virtual address -> physical address –Page tables –Translation lookaside buffers –Handling page faults

Vector processors Vector processor architecture Basic vector processing program Execution time with and without chaining for the given architecture

Superscalar processor Data dependencies in the program Superscalar architecture Understanding terminology: dispatch buffer, reorder buffer Execution of programs on superscalar processors Show the pipeline activity for the given program on the given processor

VLIW processor VLIW architecture The role of the compiler Concept of loop unrolling and software pipelining The example of scheduling of the instructions to the functional units

Dynamic Interconnection Networks Properties –Network latency –Hardware complexity –Blocking/Nonblocking Switches –Permutations and legitimate states Multistage Interconnection networks –Omega network: »topology, »number of switches, stages and permutations, »routing protocol Crossbar

Static Interconnection Networks Network properties –Node degree d –Diameter D –Bisection width Complete Star Tree Linear array Ring Mesh Torus Hypercube –routing protocol k-ary n-cubes To prepare for dynamic and static interconnection networks use –slides, –assignment and –text book Chapter 2 and chapter 3 only text that goes with tables 3.1 and 3.2.

Shared Memory Systems Cache coherence policies –Snooping protocols –Directory protocols

12 System-on-chip architectures 32-Bit Nios Processor ROM (with Monitor) Address (32) Read Write Data In (32) Data Out (32) IRQ IRQ #(6) Avalon Bus Nios Processor Tri-State Bridge SDRAM Controller Tri-State Bridge Compact Flash PIOs Button PIO 7-Segment LED PIO LCD PIOLED PIO General Purpose Timer Periodic Timer UART Reconfig PIO

13

14

15

16

17