Disk Drive Architecture Exploration VisualSim Mirabilis Design.

Slides:



Advertisements
Similar presentations
CPU Structure and Function
Advertisements

COMP375 Computer Architecture and Organization Senior Review.
Presenter : Cheng-Ta Wu Kenichiro Anjo, Member, IEEE, Atsushi Okamura, and Masato Motomura IEEE JOURNAL OF SOLID-STATE CIRCUITS, VOL. 39,NO. 5, MAY 2004.
AMD OPTERON ARCHITECTURE Omar Aragon Abdel Salam Sayyad This presentation is missing the references used.
Performance of Cache Memory
Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
Computer Organization and Architecture
Chapter 12 CPU Structure and Function. CPU Sequence Fetch instructions Interpret instructions Fetch data Process data Write data.
Computer Organization and Architecture
Cache Memory Locality of reference: It is observed that when a program refers to memory, the access to memory for data as well as code are confined to.
Data and Computer Communications Updated: 2/9/2009.
CSC 4250 Computer Architectures December 8, 2006 Chapter 5. Memory Hierarchy.
Input/Output Management and Disk Scheduling
Computational Astrophysics: Methodology 1.Identify astrophysical problem 2.Write down corresponding equations 3.Identify numerical algorithm 4.Find a computer.
Network based System on Chip Part A Performed by: Medvedev Alexey Supervisor: Walter Isaschar (Zigmond) Winter-Spring 2006.
Memory Hierarchy.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output.
I/O Hardware n Incredible variety of I/O devices n Common concepts: – Port – connection point to the computer – Bus (daisy chain or shared direct access)
331 Lec20.1Fall :332:331 Computer Architecture and Assembly Language Fall 2003 Week 13 Basics of Cache [Adapted from Dave Patterson’s UCB CS152.
1 CSIT431 Introduction to Operating Systems Welcome to CSIT431 Introduction to Operating Systems In this course we learn about the design and structure.
University College Cork IRELAND Hardware Concepts An understanding of computer hardware is a vital prerequisite for the study of operating systems.
SECTIONS 13.1 – 13.3 Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin SECONDARY STORAGE MANAGEMENT.
Computer System Overview Chapter 1. Basic computer structure CPU Memory memory bus I/O bus diskNet interface.
An Intelligent Cache System with Hardware Prefetching for High Performance Jung-Hoon Lee; Seh-woong Jeong; Shin-Dug Kim; Weems, C.C. IEEE Transactions.
SECTIONS 13.1 – 13.3 Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin SECONDARY STORAGE MANAGEMENT.
Group 5 Alain J. Percial Paula A. Ortiz Francis X. Ruiz.
CH12 CPU Structure and Function
Introduction to Interconnection Networks. Introduction to Interconnection network Digital systems(DS) are pervasive in modern society. Digital computers.
ECE 526 – Network Processing Systems Design Network Processor Architecture and Scalability Chapter 13,14: D. E. Comer.
Computer System Overview Chapter 1. Operating System Exploits the hardware resources of one or more processors Provides a set of services to system users.
1 Secondary Storage Management Submitted by: Sathya Anandan(ID:123)
Microprocessor-based systems Curse 7 Memory hierarchies.
Hardware Definitions –Port: Point of connection –Bus: Interface Daisy Chain (A=>B=>…=>X) Shared Direct Device Access –Controller: Device Electronics –Registers:
Computers organization & Assembly Language Chapter 0 INTRODUCTION TO COMPUTING Basic Concepts.
Ihr Logo Operating Systems Internals & Design Principles Fifth Edition William Stallings Chapter 1 Computer System Overview.
EEE-445 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
Chapter Twelve Memory Organization
August 1, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 9: I/O Devices and Communication Buses * Jeremy R. Johnson Wednesday,
Computer Organization CS224 Fall 2012 Lessons 47 & 48.
Caches Where is a block placed in a cache? –Three possible answers  three different types AnywhereFully associativeOnly into one block Direct mappedInto.
Chapter 13 – I/O Systems (Pgs ). Devices  Two conflicting properties A. Growing uniformity in interfaces (both h/w and s/w): e.g., USB, TWAIN.
Caches Hiding Memory Access Times. PC Instruction Memory 4 MUXMUX Registers Sign Ext MUXMUX Sh L 2 Data Memory MUXMUX CONTROLCONTROL ALU CTL INSTRUCTION.
Overview von Neumann Architecture Computer component Computer function
Processor Memory Processor-memory bus I/O Device Bus Adapter I/O Device I/O Device Bus Adapter I/O Device I/O Device Expansion bus I/O Bus.
COMP541 Memories II: DRAMs
1 Adapted from UC Berkeley CS252 S01 Lecture 18: Reducing Cache Hit Time and Main Memory Design Virtucal Cache, pipelined cache, cache summary, main memory.
DDRIII BASED GENERAL PURPOSE FIFO ON VIRTEX-6 FPGA ML605 BOARD PART B PRESENTATION STUDENTS: OLEG KORENEV EUGENE REZNIK SUPERVISOR: ROLF HILGENDORF 1 Semester:
System Architecture Directions for Networked Sensors.
Contemporary DRAM memories and optimization of their usage Nebojša Milenković and Vladimir Stanković, Faculty of Electronic Engineering, Niš.
CS 1410 Intro to Computer Tecnology Computer Hardware1.
RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;
COMP541 Memories II: DRAMs
Module 12: I/O Systems I/O hardware Application I/O Interface
The Goal: illusion of large, fast, cheap memory
William Stallings Computer Organization and Architecture 8th Edition
Improving Memory Access 1/3 The Cache and Virtual Memory
CS 286 Computer Organization and Architecture
Morgan Kaufmann Publishers Memory & Cache
Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin
Input-output I/O is very much architecture/system dependent
Operating System Concepts
Memory Organization.
If a DRAM has 512 rows and its refresh time is 9ms, what should be the frequency of row refresh operation on the average?
Chapter 13: I/O Systems I/O Hardware Application I/O Interface
Chapter 11 Processor Structure and function
Module 12: I/O Systems I/O hardwared Application I/O Interface
Presentation transcript:

Disk Drive Architecture Exploration VisualSim Mirabilis Design

Purpose Statement System Level development environment to aid in design “what-if” scenario evaluation Tool should reside at the highest abstraction layers, but allow flow down to ESL modeling already underway. 6/7/20162Mirabilis Design Inc.

Design Block Diagram 6/7/20163

VisualSim Model- Top-Level Mirabilis Design Inc. ParameterComponents 6/7/20164

Mirabilis Design Inc. SATA Host Block Characteristics Assume simple data transfer mode only, no command overhead, only data frames Each Frame consists of 8 Bytes of Header, followed by the 8K data packet, followed by 8 Bytes of Trailer. Programmable transfer rates of 1.5/3.0/6.0 Gbps (150/300/600 Mbytes/s resulting from 8b/10b conversion) 8KByte Frame Size though temporary suspension of data allowed through SATA HOLD/HOLDA mechanism Need to monitor how often HOLD is needed. Assume Frame transmission begins after FIFO almost Full signal or no sooner than 1us after last Frame. 6/7/20165

ARM Cortex R4 Characteristics Assume instruction pull only, all instructions reside within the SDRAM Buffer Data accesses are strictly to ITCM (and unspecified) Assume Processor frequency of 200MHz All cache misses result in 32Byte request to SDRAM Buffer Assume average subroutine size is 85 Bytes Assume code address space spans 512KBytes Assume the following code profile (double click on chart to get to the actual numbers on Sheet 1): 6/7/20166Mirabilis Design Inc.

Disc Drive Characteristics Drive transfers 512Byte Blocks, no interruption is allowed (FIFO overflow == lost data). Though transfer rate varies by zone, inter-block time is constant at 800ns. 16 Zones each varying in transfer rate Assume 13ms “seek” latency when switching between zones. 6/7/20167Mirabilis Design Inc.

FIFO Characteristics Host and Disc FIFOs are distinct, and sized separately FIFO width is 32-bits (dWord width) FIFO depth can vary between 8 and 128 dWords, in multiples of 8. FIFO Almost Full threshold is programmable from 1 to size of the FIFO FIFOs do not have any speed dependencies SATA FIFO will request transfer from the Buffer when the FIFO is empty, will stop request when FIFO Almost Full Disc FIFO will request transfer to the Buffer when the FIFO is Almost Full, and stop request when FIFO empty. 6/7/2016Mirabilis Design Inc.8

SDRAM Characteristics Using single 16-bit DDR SDRAM Refresh period set to 16 ms CL=3, tRCD=3, tRP=3 Frequency can be adjusted to 100, 133, or 160 MHz 6/7/2016Mirabilis Design Inc.9

VisualSim- Component Details- SDRAM Mirabilis Design Inc. Mapping Real-Time Viewer Memory Controller 6/7/201610

Client Arbiter Characteristics 3 Clients with programmable priority Client accesses are 32-bits wide (dWord) Client accesses limited to 32Byte bursts Assume zero delay for arbitration (pipeline design) 6/7/2016Mirabilis Design Inc.11

VisualSim- Arbitration Mirabilis Design Inc. RegEx 6/7/201612

Simulation Questions & Experiments Experiment 1: What SDRAM Frequency do we need? Vary the disc data rate through the zones (ignore seek latencies), but allow each zone to reach steady state Vary SDRAM Frequency between its 3 frequencies Set SATA FIFO to 8 dWords, Disc FIFO to 16 dWords FIFO almost full threshhold set to ¾ FIFO depth Set Arbiter Priority to Disc Highest, Processor Lowest. Monitor average processor instruction latency Monitor SATA throughput & HOLDs Monitor FIFO status Mirabilis Design Inc.6/7/201613

Simulation Results- CPI and MIPS for ARM Mirabilis Design Inc. Disk Speed -100 Mhz -133 Mhz -160 Mhz 6/7/201614

Simulation Results- Throughput Mirabilis Design Inc.6/7/201615

Simulation Result- Analysis – The DRAM speed ( MHz) did not have a material impact on the Throughput. For this design, the utilization was 41% for 100 MHz and 49% for 160 MHz – There was a difference in the MIPS at the processor for the different speeds. This was because of the faster response from the DRAM – -Number of Holds in both cases was 19 during the period of the simulation Mirabilis Design Inc.6/7/201616

Simulation Questions & Experiments Experiment 2: Can I lower SDRAM Frequency by adjusting FIFO size? Set the disc data rate to max data rate (zone 1) Set SDRAM Frequency to 133 MHz Set SATA FIFO to 8 dWords FIFO almost full threshhold set to 1/2 FIFO depth Vary Disc FIFO from 8 to 128 dWords incrementing by 8 FIFO almost full threshhold set to 3/4 FIFO depth Set Arbiter Priority to Disc Highest, Processor Lowest. Monitor average processor instruction latency Monitor SATA throughput & HOLDs Monitor FIFO status Mirabilis Design Inc.6/7/201617

Simulation Results: Processor Activity Mirabilis Design Inc. Disk_dWords /7/201618

Simulation Results: Throughput Mirabilis Design Inc.6/7/201619

Simulation Questions & Experiments What libraries was used to construct the simulation? Response: Disk model uses Basic Library, Scripting and Controller A8-R4 Cortex model uses Architecture, Bus-Switch, Power What Blocks did you need to modify to construct the simulation? Response: No modification was required to construct this model What Blocks did you need to create to construct the simulation? Response: Traffic Generator, Randomizer, Database, Probability- based Traffic, Smart Resource, Virtual Machine Script, real- Time plotter and Text display Can we vary two variables to get a “surface plot”? Response: You can vary any number of parameters and combine the results using the Post Processor. 6/7/201620Mirabilis Design Inc.

Disk Drive Architecture Exploration VisualSim Mirabilis Design