Flash Translation Layer (FTL) Paper Review
|
|
|
- Myron Henderson
- 6 years ago
- Views:
Transcription
1 Flash Translation Layer (FTL) Paper Review Yeongjae Woo omputer Systems Laboratory Sungkyunkwan University
2 ontents Log lock Scheme Fully ssociative Sector Translation ynamic ata lustering Janus FTL ontent-ware FTL I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 2
3 Log lock Scheme Reference: Space-fficient Flash Translation Layer for ompactflash Systems (2002)
4 Log lock ata lock lock level mapping ata Log LPN 0 LPN 1 LPN 2 LPN 3 Log lock LN 0 LN 1 LN 2 LN 3 Page level mapping Temporal block for small size writes to the dedicated data block W = <{0}, {1,2}, {10}, {9}> LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
5 Merge Merge happens when ll the pages of log block are written No available log block to be allocate for data block - Maintain at least one free block for full merge operation Types of merge Switch / Partial / Full I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
6 Switch Merge (1) W = <{0}, {1,2}, {10}, {9}, {3}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
7 Switch Merge (2) W = <{0}, {1,2}, {10}, {9}, {3}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) Write ({3}, F) LN 0 LN 1 LN 2 LN 3 ata Log F LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
8 Switch Merge (3) W = <{0}, {1,2}, {10}, {9}, {3}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) Write ({3}, F) LN 0 LN 1 LN 2 LN 3 ata F Log Free LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
9 Partial Merge (1) W = <{0}, {1,2}, {10}, {9}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 9
10 Partial Merge (2) W = <{0}, {1,2}, {10}, {9}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log 3 LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 10
11 Partial Merge (3) W = <{0}, {1,2}, {10}, {9}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
12 Full Merge (1) W = <{0}, {1,2}, {10}, {9}, {12}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 12
13 Full Merge (2) W = <{0}, {1,2}, {10}, {9}, {12}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN 9 LPN 10 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 13
14 Full Merge (3) W = <{0}, {1,2}, {10}, {9}, {12}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN 0 LPN 1 LPN 2 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 1
15 Full Merge () W = <{0}, {1,2}, {10}, {9}, {12}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN 0 LPN 1 LPN 2 LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 1
16 Full Merge () W = <{0}, {1,2}, {10}, {9}, {12}> Write ({0}, ) Write ({1,2}, ) Write ({10}, ) Write ({9}, ) Write ({12}, F) LN 0 LN 1 LN 2 LN 3 ata Log Free LPN 0 LPN 1 LPN 2 LPN F LPN 12 LPN 13 LPN 1 LPN 1 I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 1
17 FST (Fully ssociative Sector Translation) Reference: Log uffer based Flash Translation Layer using Fully ssociative Sector Translation (200)
18 FST (1) lock ssociative Sector Translation logical sector to be overwritten can be placed in a dedicated log block Fully ssociative Sector Translation logical sector to be overwritten can be placed in any log block I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 1
19 FST (2) W = <{0}, {1}, {}, {}> ata Log ata Log LPN 0 LPN 1 LPN 2 LPN LPN 0 LPN 1 LPN LPN LN 0 LN 1 LN 2 LN 3 LPN LPN LPN LPN LN 0 LN 1 LN 2 LN ST FST I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 19
20 Log locks in FST Sequential Write Log lock One log block is used for sequential write Switch merge occurs Random Write Log locks I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 20
21 w/o SW Log lock (1) W = <{}, {0,1,2}, {}, {3}, {}, {1}, {0}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) Write ({}, G) Write ({1}, H) LN 0 LN 1 LN 2 LN 3 ata RW Log F G H LPN LPN 0 LPN 1 LPN 2 LPN LPN 3 LPN LPN 1 I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 21
22 w/o SW Log lock (2) W = <{}, {0,1,2}, {}, {3}, {}, {1}, {0}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) Write ({}, G) Write ({1}, H) LN 0 LN 1 LN 2 LN 3 ata RW Log F G H LPN LPN 0 LPN 1 LPN 2 LPN LPN 3 LPN LPN 1 Full merge Free F I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 22
23 w/o SW Log lock (3) W = <{}, {0,1,2}, {}, {3}, {}, {1}, {0}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) Write ({}, G) Write ({1}, H) LN 0 LN 1 LN 2 LN 3 ata F 9 10 RW Log F G H LPN LPN 0 LPN 1 LPN 2 LPN LPN 3 LPN LPN 1 Full merge Free I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 23
24 w/o SW Log lock () W = <{}, {0,1,2}, {}, {3}, {}, {1}, {0}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) Write ({}, G) Write ({1}, H) LN 0 LN 1 LN 2 LN 3 ata F 9 10 RW Log F G H Free LPN LPN 3 LPN LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 2
25 w/o SW Log lock () W = <{}, {0,1,2}, {}, {3}, {}, {1}, {0}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) Write ({}, G) Write ({1}, H) LN 0 LN 1 LN 2 LN 3 ata F 9 10 RW Log I LPN 0 F G H Free LPN LPN 3 LPN LPN I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 2
26 w/ SW Log lock (1) W = <{}, {0,1,2,}, {}, {3}, {}, {1}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) LN 0 LN 1 LN 2 LN 3 ata RW Log SW Log LPN LPN F LPN 0 LPN 1 LPN 2 LPN 3 I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 2
27 w/ SW Log lock (2) W = <{}, {0,1,2,}, {}, {3}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) LN 0 LN 1 LN 2 LN 3 ata F RW Log LPN LPN 9 10 SW Log I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 2
28 w/ SW Log lock (2) W = <{}, {0,1,2,}, {}, {3}> Write ({}, ) Write ({0,1,2}, ) Write ({}, ) Write ({3}, F) LN 0 LN 1 LN 2 LN 3 ata F RW Log LPN LPN 9 10 SW Log I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 2
29 (ynamic dta lustering) Reference: Using ata lustering to Improve leaning Performance for Flash Memory (1999)
30 Separating Hot/old data Separating hot data from cold data can reduce garbage collection overhead To make 1 free page, 3 pages should be copied To make 3 free pages, only one page should be copied old Hot I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 30
31 (1) Top region (Hot) ottom region (old) I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 31
32 (2) Moved data toward the Top region Update frequencies increase When the data is updated within a time threshold Moved data toward the ottom region Update frequencies decrease When the cleaning(garbage collection) the data after a time threshold I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 32
33 Janus FTL Reference: Janus-FTL Finding the Optimal Point on the Spectrum etween Page and lock Mapping Schemes (2010)
34 Two asic Mapping Scheme lock Mapping Scheme Small RM usage Work well for sequential writes Page Mapping Scheme fficient handling for random writes Sensitive to the amount of reserved I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 3
35 Janus FTL Provides a spectrum between page and block mapping schemes lock Mapping rea Page Mapping rea Two operations that move between M and PM Fusion / efusion I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 3
36 Fusion / efusion (1) Lower the utilization of PM can lead to lower the garbage collection cost Lower the utilization of PM can be done by Fusion, Recycling wasted space in M efusion, vict from PM I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 3
37 Fusion / efusion (2) Reference: mbedded Software 강의자료 - File system considerations for flash memory (2009, Jongmoo hoi) I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 3
38 Implementation Results I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 3
39 FTL (ontent-ware FTL) Reference: FTL - ontent-ware FTL nhancing the Lifespan of Flash Memory based Solid State rives (20)
40 FTL eduplication Reduce write traffic to flash memory by removing unnecessary duplicate writes I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 0
41 Identify duplicate Fingerprint yte-by-byte comparison is slow Identify duplicate by comparing SH-1 hash values Fingerprint Store Store and search in the most likely-to-beduplicated fingerprints I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 1
42 rchitecture I302: mbedded Systems esign (Spring 20) Jin-Soo Kim 2
43 Two-level indirect mapping Mapping Table Flash Memory Primary Map Secondary Map Flash Memory LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN LPN LPN LPN LPN 9 LPN 10 LPN LPN 12 LPN 13 LPN 1 LPN 1 F T I L L T T F H W R Z LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN LPN LPN LPN LPN 9 LPN 10 LPN LPN 12 LPN 13 LPN 1 LPN 1 VPN 0 VPN 1 VPN 2 VPN 3 VPN VPN F T H Z L R I W onventional FTL FTL I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu) 3
44 xample (1) W = <{1}, {2}, {0}, {}, {}, {}> write ({1}, F) write ({2}, F) write ({0}, ) write ({}, ) Primary Map LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN LPN LPN LPN LPN 9 LPN 10 LPN LPN 12 LPN 13 LPN 1 LPN 1 Secondary Map VPN 0 VPN 1 VPN 2 VPN 3 VPN VPN Flash Memory F I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
45 xample (2) W = <{1}, {2}, {0}, {}, {}, {}> write ({1}, F) write ({2}, F) write ({0}, ) write ({}, ) write ({}, T) Primary Map LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN LPN LPN LPN LPN 9 LPN 10 LPN LPN 12 LPN 13 LPN 1 LPN 1 Secondary Map VPN 0 VPN 1 VPN 2 VPN 3 VPN VPN Flash Memory F T I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
46 xample (3) W = <{1}, {2}, {0}, {}, {}, {}> write ({1}, F) write ({2}, F) write ({0}, ) write ({}, ) write ({}, T) write ({}, T) Primary Map LPN 0 LPN 1 LPN 2 LPN 3 LPN LPN LPN LPN LPN LPN 9 LPN 10 LPN LPN 12 LPN 13 LPN 1 LPN 1 Secondary Map VPN 0 VPN 1 VPN 2 VPN 3 VPN VPN Flash Memory F T I302: mbedded Systems esign (Spring 20) Jin-Soo Kim (jinsookim@skku.edu)
47 Performance valuation I302: mbedded Systems esign (Spring 20) Jin-Soo Kim
data block data block log block log block group 0 group 1 group 0 group 1
US008261010B2 (12) Unlted States Patent (10) Patent N0.2 US 8,261,010 B2 Eom et al. (45) Date of Patent: Sep. 4, 2012 (54) METHODS FOR DISTRIBUTING LOG (56) References Cited BLOCK ASSOCIATIVITY FOR REAL-TIME
Overview. Design Example: Automobile Lock
Overview Last Lecture: What is the course all about & why is it important? What is a digital system? What is a binary digital system? Boolean lgebra, Truth tables Operators: inversion, and, or, xor, xnor
SRC Language Conventions. Class 6: Intro to SRC Simulator Register Transfers and Logic Circuits. SRC Simulator Demo. cond_br.asm.
Fall 2006 S333: omputer rchitecture University of Virginia omputer Science Michele o SR Language onventions lass 6: Intro to SR Simulator Register Transfers and Logic ircuits hapter 2, ppendix.5 2 SR Simulator
Analyses of Energy Consumption Changes by Loop Transformations in Log Blocks-based FTL
Analyses of Energy Consumption Changes by Loop Transformations in Log Blocks-based FTL Memory Architecture and Organization Workshop 2013 (MeAOW 2013) 2013. 10. 3 Joon-Young Paik*, Tae-Sun Chung**, Eun-Sun
Chapter 2. Introduction. Chapter 2 :: Topics. Circuits. Nodes. Circuit elements. Introduction
hapter 2 Introduction igital esign and omputer rchitecture, 2 nd Edition avid Money Harris and Sarah L. Harris logic circuit is composed of: Inputs Outputs Functional specification Timing specification
NEC PerforCache. Influence on M-Series Disk Array Behavior and Performance. Version 1.0
NEC PerforCache Influence on M-Series Disk Array Behavior and Performance. Version 1.0 Preface This document describes L2 (Level 2) Cache Technology which is a feature of NEC M-Series Disk Array implemented
CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 5 Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly Language What a pain! Understand
Module 9: Addendum to Module 6: Shared Memory Multiprocessors Lecture 18: Sharing Patterns and Cache Coherence Protocols. The Lecture Contains:
The Lecture Contains: Invalidation vs. Update Sharing Patterns Migratory Hand-off States of a Cache Line Stores MSI Protocol State Transition MSI Example MESI Protocol MESI Example MOESI Protocol MOSI
On the Power of Asymmetry and Memory in Flash-based SSD Garbage Collection
On the Power of Asymmetry and Memory in Flash-based SSD Garbage Collection B. Van Houdt Department of Mathematics and Computer Science University of Antwerp - iminds Abstract The power of d random choices
EE141- Spring 2007 Digital Integrated Circuits
EE141- Spring 27 igital Integrated Circuits Lecture 19 Sequential Circuits 1 Administrative Stuff Project Ph. 2 due Tu. 5pm 24 Cory box + email ee141- project@bwrc.eecs.berkeley.edu Hw 8 Posts this Fr.,
COMP2611: Computer Organization. Introduction to Digital Logic
1 OMP2611: omputer Organization ombinational Logic OMP2611 Fall 2015 asics of Logic ircuits 2 its are the basis for binary number representation in digital computers ombining bits into patterns following
Chapter # 3: Multi-Level Combinational Logic
hapter # 3: Multi-Level ombinational Logic ontemporary Logic esign Randy H. Katz University of alifornia, erkeley June 993 No. 3- hapter Overview Multi-Level Logic onversion to NN-NN and - Networks emorgan's
Designing Sequential Logic Circuits
igital Integrated Circuits (83-313) Lecture 5: esigning Sequential Logic Circuits Semester B, 2016-17 Lecturer: r. Adam Teman TAs: Itamar Levi, Robert Giterman 26 April 2017 isclaimer: This course was
Module 9: "Introduction to Shared Memory Multiprocessors" Lecture 17: "Introduction to Cache Coherence Protocols" Invalidation vs.
Invalidation vs. Update Sharing patterns Migratory hand-off States of a cache line Stores MSI protocol MSI example MESI protocol MESI example MOESI protocol Hybrid inval+update file:///e /parallel_com_arch/lecture17/17_1.htm[6/13/2012
On the Impact of Garbage Collection on flash-based SSD Endurance
On the Impact of Garbage Collection on flash-based Robin Verschoren and Benny Van Houdt Dept. Math and Computer Science University of Antwerp, Belgium Abstract Garbage collection has a profound impact
CMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 6 nnouncement: no office hours today. Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly
Unit 9. Multiplexers, Decoders, and Programmable Logic Devices. Unit 9 1
Unit 9 Multiplexers, ecoders, and Programmable Logic evices Unit 9 Outline Multiplexers Three state buffers ecoders Encoders Read Only Memories (ROMs) Programmable logic devices ield Programmable Gate
Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR
TOPIS: Logic Logic Expressions Logic Gates Simplifying Logic Expressions Sequential Logic (Logic with a Memory) George oole (85-864), English mathematician, oolean logic used in digital computers since
Motivation for Lecture. For digital design we use CMOS transistors. Gate Source. CMOS symboler. MOS transistor. Depletion. A channel is created
Motivation for Lecture igital Integrated ircuits iktor Öwall o see how standard gates are implemented with transistors? How does technology affect the performance, e.g. speed and power consumption? What
Mechanical Translational Systems
QUESTION 1 For the system in Figure 1.1, the springs are at their free lengths when the mass displacements are zero. Complete the following: Figure 1.1 QUESTION 2 For the system in Figure 2.1, the mass
18.13 Review & Summary
5/2/10 10:04 PM Print this page 18.13 Review & Summary Temperature; Thermometers Temperature is an SI base quantity related to our sense of hot and cold. It is measured with a thermometer, which contains
I/O Devices. Device. Lecture Notes Week 8
I/O Devices CPU PC ALU System bus Memory bus Bus interface I/O bridge Main memory USB Graphics adapter I/O bus Disk other devices such as network adapters Mouse Keyboard Disk hello executable stored on
L4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
Sequential Logic. Handouts: Lecture Slides Spring /27/01. L06 Sequential Logic 1
Sequential Logic Handouts: Lecture Slides 6.4 - Spring 2 2/27/ L6 Sequential Logic Roadmap so far Fets & voltages Logic gates Combinational logic circuits Sequential Logic Voltage-based encoding V OL,
15-451/651: Design & Analysis of Algorithms September 13, 2018 Lecture #6: Streaming Algorithms last changed: August 30, 2018
15-451/651: Design & Analysis of Algorithms September 13, 2018 Lecture #6: Streaming Algorithms last changed: August 30, 2018 Today we ll talk about a topic that is both very old (as far as computer science
Neural Networks. Prof. Dr. Rudolf Kruse. Computational Intelligence Group Faculty for Computer Science
Neural Networks Prof. Dr. Rudolf Kruse Computational Intelligence Group Faculty for Computer Science kruse@iws.cs.uni-magdeburg.de Rudolf Kruse Neural Networks 1 Hopfield Networks Rudolf Kruse Neural Networks
416 Distributed Systems
416 Distributed Systems RAID, Feb 26 2018 Thanks to Greg Ganger and Remzi Arapaci-Dusseau for slides Outline Using multiple disks Why have multiple disks? problem and approaches RAID levels and performance
Lecture #4: Potpourri
Lecture #4: Potpourri Paul Hartke Phartke@stanford.edu Stanford EE183 April 15, 2002 Tutorial/Verilog Questions? Tutorial is mostly done, right? Due tonight at Midnight (Mon 4/14/02) Turn in copies of
Chapter 7: Digital Components. Oregon State University School of Electrical Engineering and Computer Science. Review basic digital design concepts:
hapter 7: igital omponents Prof. en Lee Oregon tate University chool of Electrical Engineering and omputer cience hapter Goals Review basic digital design concepts: esigning basic digital components using
Digital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
Processor Design & ALU Design
3/8/2 Processor Design A. Sahu CSE, IIT Guwahati Please be updated with http://jatinga.iitg.ernet.in/~asahu/c22/ Outline Components of CPU Register, Multiplexor, Decoder, / Adder, substractor, Varity of
7600 Series Routers Adjacency Allocation Method
7600 Series Routers Adjacency Allocation Method Document ID: 118393 Contributed by Amit Goyal and Ruchir Jain, Cisco TAC Engineers. Nov 06, 2014 Contents Introduction Background Information Adjacency Entry
Performance Models of Flash-based Solid-State Drives for Real Workloads
Performance Models of Flash-based Solid-State Drives for Real Workloads Simona Boboila Northeastern University 360 Huntington Ave. Boston, MA 02115 simona@ccs.neu.edu Peter Desnoyers Northeastern University
These are special traffic patterns that create more stress on a switch
Myths about Microbursts What are Microbursts? Microbursts are traffic patterns where traffic arrives in small bursts. While almost all network traffic is bursty to some extent, storage traffic usually
L4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements:., Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University
Module 10: Sequential Circuit Design
Module : Sequential Circuit esign Wakerly: Chapter 7 (Part 3) : ECE 3233 r. Keith A. eague Spring 23 REA Chapter 7 (skipping references to HL) 23 -Machine esign and Synthesis he creative part, like writing
Arithmetic Building Blocks
rithmetic uilding locks Datapath elements dder design Static adder Dynamic adder Multiplier design rray multipliers Shifters, Parity circuits ECE 261 Krish Chakrabarty 1 Generic Digital Processor Input-Output
IO-Link Data Reference Guide: K50 Pro Touch Button with IO-Link
IO-Link Data Reference Guide: K50 Pro Touch Button with IO-Link IO-Link Data Map This document refers to the following IODD file: Banner_Engineering-K50PTKQ-20180829-IODD1.1.xml. The IODD file and support
Reducing NVM Writes with Optimized Shadow Paging
Reducing NVM Writes with Optimized Shadow Paging Yuanjiang Ni, Jishen Zhao, Daniel Bittman, Ethan L. Miller Center for Research in Storage Systems University of California, Santa Cruz Emerging Technology
Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
COSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
CS5314 Randomized Algorithms. Lecture 15: Balls, Bins, Random Graphs (Hashing)
CS5314 Randomized Algorithms Lecture 15: Balls, Bins, Random Graphs (Hashing) 1 Objectives Study various hashing schemes Apply balls-and-bins model to analyze their performances 2 Chain Hashing Suppose
Hashing. Data organization in main memory or disk
Hashing Data organization in main memory or disk sequential, binary trees, The location of a key depends on other keys => unnecessary key comparisons to find a key Question: find key with a single comparison
1 st Semester 2007/2008
Chapter 17: System Departamento de Engenharia Informática Instituto Superior Técnico 1 st Semester 2007/2008 Slides baseados nos slides oficiais do livro Database System c Silberschatz, Korth and Sudarshan.
Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set MAS 6J/1.16J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
Digital Integrated Circuits A Design Perspective
rithmetic ircuitsss dapted from hapter 11 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 Generic Digital Processor MEMORY INPUT-OUTPUT ONTROL
Application: Bucket Sort
5.2.2. Application: Bucket Sort Bucket sort breaks the log) lower bound for standard comparison-based sorting, under certain assumptions on the input We want to sort a set of =2 integers chosen I+U@R from
Chapter 2. Review of Digital Systems Design
x 2-4 = 42.625. Chapter 2 Review of Digital Systems Design Numbering Systems Decimal number may be expressed as powers of 10. For example, consider a six digit decimal number 987654, which can be represented
A General-Purpose Counting Filter: Making Every Bit Count. Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro Stony Brook University, NY
A General-Purpose Counting Filter: Making Every Bit Count Prashant Pandey, Michael A. Bender, Rob Johnson, Rob Patro Stony Brook University, NY Approximate Membership Query (AMQ) insert(x) ismember(x)
Administrivia. Course Objectives. Overview. Lecture Notes Week markem/cs333/ 2. Staff. 3. Prerequisites. 4. Grading. 1. Theory and application
Administrivia 1. markem/cs333/ 2. Staff 3. Prerequisites 4. Grading Course Objectives 1. Theory and application 2. Benefits 3. Labs TAs Overview 1. What is a computer system? CPU PC ALU System bus Memory
14.1. Unit 14. State Machine Design
4. Unit 4 State Machine Design 4.2 Outcomes I can create a state diagram to solve a sequential problem I can implement a working state machine given a state diagram STATE MACHINES OVERVIEW 4.3 4.4 Review
Building a Computer. Quiz #2 on 10/31, open book and notes. (This is the last lecture covered) I wonder where this goes? L16- Building a Computer 1
Building a Computer I wonder where this goes? B LU MIPS Kit Quiz # on /3, open book and notes (This is the last lecture covered) Comp 4 Fall 7 /4/7 L6- Building a Computer THIS IS IT! Motivating Force
CPE/EE 427, CPE 527 VLSI Design I L07: CMOS Logic Gates, Pass Transistor Logic. Review: CMOS Circuit Styles
PE/EE 427, PE 527 VLI esign I L07: MO Logic Gates, Pass Transistor Logic epartment of Electrical and omputer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka
XR Analog Clock - Manual Setting Model Troubleshooting Guide
Primex XR 72MHz Synchronized Time Solution XR Analog Clock - Manual Setting Model Troubleshooting Guide 2018 Primex. All Rights Reserved. The Primex logo is a registered trademark of Primex. All other
:3 2 D e c o de r S ubs ys te m "0 " One "1 " Ze ro "0 " "0 " One I 1 "0 " One "1 " Ze ro "1 " Ze ro "0 " "0 "
dvanced igital Logic esign EES 303 http://ziyang.eecs.northwestern.edu/eecs303/ 5:32 decoder/demultiplexer Teacher: Robert ick Office: L477 Tech Email: dickrp@northwestern.edu Phone: 847 467 2298 \EN 5:32
The Challenge of Mining Billions of Transactions
Faculty of omputer Science The hallenge of Mining illions of Transactions Osmar R. Zaïane International Workshop on lgorithms for Large-Scale Information Processing in Knowledge iscovery Laboratory ata
Simple Improved Equations for Arc Flash Hazard Analysis
Simple mproved Equations for Arc Flash Hazard Analysis Dr. obert Wilkins Electrical Engineering Consultant, Heswall, UK, bob@overdee.demon.co.uk Keywords: Arc flash analysis, arcing current, incident energy
Lecture Note #6: More on Task Scheduling EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan
Lecture Note #6: More on Task Scheduling EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan Note 6-1 Mars Pathfinder Timing Hiccups? When: landed on the
Storage Management in the Tektronix 32-Bit Smalltalk
Storage Management in the Tektronix 32-Bit Smalltalk Pat Caudill Computer Research Laboratoiy Tektronix, Inc. ABSTRACT This describes the planned storage management of the new Smalltalk Interpreter. This
Latches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
5. Sequential Logic x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
5. Sequential Logic 6.004x Computation Structures Part 1 igital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L5: Sequential Logic, Slide #1 Something We Can t Build (Yet) What if you were
RAID+: Deterministic and Balanced Data Distribution for Large Disk Enclosures
RAID+: Deterministic and Balanced Data Distribution for Large Disk Enclosures Guangyan Zhang, Zican Huang, Xiaosong Ma SonglinYang, Zhufan Wang, Weimin Zheng Tsinghua University Qatar Computing Research
Jin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering. Jungli, Taiwan
Chapter 7 Sequential Circuits Jin-Fu Li Advanced Reliable Systems (ARES) Lab. epartment of Electrical Engineering National Central University it Jungli, Taiwan Outline Latches & Registers Sequencing Timing
14:332:231 DIGITAL LOGIC DESIGN
14:332:231 IGITL LOGI ESIGN Ivan Marsic, Rutgers University Electrical & omputer Engineering all 2013 Lecture #17: locked Synchronous -Machine nalysis locked Synchronous Sequential ircuits lso known as
Prioritized Garbage Collection Using the Garbage Collector to Support Caching
Prioritized Garbage Collection Using the Garbage Collector to Support Caching Diogenes Nunez, Samuel Z. Guyer, Emery D. Berger Tufts University, University of Massachusetts Amherst November 2, 2016 D.
Efficient Spatial Data Structure for Multiversion Management of Engineering Drawings
Efficient Structure for Multiversion Management of Engineering Drawings Yasuaki Nakamura Department of Computer and Media Technologies, Hiroshima City University Hiroshima, 731-3194, Japan and Hiroyuki
Efficient discovery of the top-k optimal dependency rules with Fisher s exact test of significance
Efficient discovery of the top-k optimal dependency rules with Fisher s exact test of significance Wilhelmiina Hämäläinen epartment of omputer Science University of Helsinki Finland whamalai@cs.helsinki.fi
CS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 3: Query Processing Query Processing Decomposition Localization Optimization CS 347 Notes 3 2 Decomposition Same as in centralized system
Logic design? Transistor as a switch. Layered design approach. CS/COE1541: Introduction to Computer Architecture. Logic Design Review.
Logic design? CS/COE54: Introduction to Computer rchitecture Digital hardware is implemented by way of logic design Digital circuits process and produce two discrete values: and Example: -bit full adder
Analytic Models of SSD Write Performance
Analytic Models of SSD Write Performance PETER DESNOYERS, Northeastern University Solid state drives (SSDs) update data by writing a new copy, rather than overwriting old data, causing prior copies of
Energy Unit Test * Required
Energy Unit Test * Required 1. First and Last Name 2. Class Period 2nd 4th Forms of Energy Standard 6.PS3.1 Analyze the properties and compare sources of kinetic, elastic potential, gravitational potential,
Lecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines Reminder: midterm on Tue 2/28 will cover Chapters 1-3, App A, B if you understand all slides, assignments,
Introduction to Digital Logic
Introduction to Digital Logic Lecture 17: Latches Flip-Flops Problem w/ Bistables Output should have been at end of sequence Problem: Glitch was remembered Need some way to ignore inputs until they are
Introduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
The PANDA Experiment
High Precision Hadron Physics at FIR Lars chmitt GI, armstadt First FIR FEE Workshop, October 2005 Outline 1 PN Overview Introduction Physics Program 2 Overview Highlights PN Q and Trigger PN Overview
Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
Digital Integrated Circuits A Design Perspective
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning Sequential Logic Circuits November 2002 Naming Conventions In our text: a latch is level sensitive
Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
Bloom Filters, general theory and variants
Bloom Filters: general theory and variants G. Caravagna caravagn@cli.di.unipi.it Information Retrieval Wherever a list or set is used, and space is a consideration, a Bloom Filter should be considered.
CSCI-564 Advanced Computer Architecture
CSCI-564 Advanced Computer Architecture Lecture 8: Handling Exceptions and Interrupts / Superscalar Bo Wu Colorado School of Mines Branch Delay Slots (expose control hazard to software) Change the ISA
Parallelization of the QC-lib Quantum Computer Simulator Library
Parallelization of the QC-lib Quantum Computer Simulator Library Ian Glendinning and Bernhard Ömer VCPC European Centre for Parallel Computing at Vienna Liechtensteinstraße 22, A-19 Vienna, Austria http://www.vcpc.univie.ac.at/qc/
Dictionary: an abstract data type
2-3 Trees 1 Dictionary: an abstract data type A container that maps keys to values Dictionary operations Insert Search Delete Several possible implementations Balanced search trees Hash tables 2 2-3 trees
Bayesian Inference and Traffic Analysis
ayesian Inference and Traffic nalysis armela Troncoso George Danezis September-November 008 Microsoft Research ambridge/ KU Leuven(OSI nonymous ommunications Tell me who your friends are... => nonymous
Bit-Sliced Design. EECS 141 F01 Arithmetic Circuits. A Generic Digital Processor. Full-Adder. The Binary Adder
it-liced Design Control EEC 141 F01 rithmetic Circuits Data-In Register dder hifter it 3 it 2 it 1 it 0 Data-Out Tile identical processing elements Generic Digital Processor Full-dder MEMORY Cin Full adder
CPS 104 Computer Organization and Programming Lecture 11: Gates, Buses, Latches. Robert Wagner
CPS 4 Computer Organization and Programming Lecture : Gates, Buses, Latches. Robert Wagner CPS4 GBL. RW Fall 2 Overview of Today s Lecture: The MIPS ALU Shifter The Tristate driver Bus Interconnections
Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks
Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks Marco Moretti, Andrea Abrardo Dipartimento di Ingegneria dell Informazione, University of Pisa, Italy
SAMPLE SAMPLE SAMPLE SAMPLE
UPTE FOR GREEN PPLE MTH GRE 8 GREEN PPLE EUTIONL PROUTS opyright infringement is a violation of Federal Law. 2011 by Green pple Educational Products, Inc., La Vernia, TX. No part of this document (printed
Simple Proofs of Sequential Work
Simple Proofs of Sequential Work Bram Cohen Krzysztof Pietrzak Eurocrypt 2018, Tel Aviv, May 1st 2018 Outline What How Why Proofs of Sequential Work Sketch of Construction & Proof Sustainable Blockchains
Lab 5 RC Circuits. What You Need To Know: Physics 212 Lab
Lab 5 R ircuits What You Need To Know: The Physics In the previous two labs you ve dealt strictly with resistors. In today s lab you ll be using a new circuit element called a capacitor. A capacitor consists
Hash tables. Hash tables
Dictionary Definition A dictionary is a data-structure that stores a set of elements where each element has a unique key, and supports the following operations: Search(S, k) Return the element whose key
CMP N 301 Computer Architecture. Appendix C
CMP N 301 Computer Architecture Appendix C Outline Introduction Pipelining Hazards Pipelining Implementation Exception Handling Advanced Issues (Dynamic Scheduling, Out of order Issue, Superscalar, etc)
Introduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison
Introduction to Computer Engineering CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison Chapter 3 Digital Logic Structures Slides based on set prepared by
9/18/2008 GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
GMU, ECE 680 Physical VLSI Design
ECE680: Physical VLSI esign Chapter IV esigning Sequential Logic Circuits (Chapter 7) 1 Sequential Logic Inputs Current State COMBINATIONAL LOGIC Registers Outputs Next state 2 storage mechanisms positive
Digital Integrated Circuits A Design Perspective
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL LOGIC
Digital Integrated Circuits A Design Perspective. Arithmetic Circuits
Digital Integrated Circuits Design Perspective rithmetic Circuits Reference: Digital Integrated Circuits, 2nd edition, Jan M. Rabaey, nantha Chandrakasan and orivoje Nikolic Disclaimer: slides adapted
CS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 32
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 32 CS 473: Algorithms, Spring 2018 Universal Hashing Lecture 10 Feb 15, 2018 Most
! Energy Optimization. ! Design Space Exploration. " Example. ! P tot P static + P dyn + P sc. ! Steady-State: V in =V dd. " PMOS: subthreshold
ESE 570: igital Integrated ircuits and VLSI undamentals Lec 17: March 26, 2019 Energy Optimization & esign Space Exploration Lecture Outline! Energy Optimization! esign Space Exploration " Example 3 Energy
Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic. November Digital Integrated Circuits 2nd Sequential Circuits
igital Integrated Circuits A esign Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic esigning i Sequential Logic Circuits November 2002 Sequential Logic Inputs Current State COMBINATIONAL
Analytic Modeling of SSD Write Performance
nalytic Modeling of SSD Write Performance Peter Desnoyers Northeastern University Boston, Massachusetts, US pjd@ccs.neu.edu bstract Solid state drives (SSDs) update data by writing a new copy, rather than