memory

Memory Philipp Koehn 9 September 2019 Philipp Koehn Computer - PowerPoint PPT Presentation

Apr 13, 2023 •364 likes •640 views

Memory Philipp Koehn 9 September 2019 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019 D-Type Level-Triggered Latch 1 DATA AND Q NOR NOT CLOCK Q NOR AND Philipp Koehn Computer Systems Fundamental: Memory 9

  1. Memory Philipp Koehn 9 September 2019 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  2. D-Type Level-Triggered Latch 1 DATA AND Q NOR NOT CLOCK Q NOR AND Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  3. Slightly Modified 2 DATA IN AND NOR NOT WRITE DATA OUT NOR AND Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  4. Operations 3 • Circuit latches on one bit of memory and keeps it around • Truth table Data-In Write Data-Out 0 1 0 1 1 1 X 0 Data • Can write 1 bit and read content Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  5. 4 multi-bit storage Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  6. 1 Bit Memory 5 DATA IN AND NOR NOT WRITE DATA OUT NOR AND Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  7. 8 Bit Memory 6 DATA IN WRITE DI W DI W DI W DI W DI W DI W DI W DI W DO DO DO DO DO DO DO DO DATA OUT Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  8. Output Selector 7 • 8 Bit Latch contains 8 bits • Now: only read 1 bit at a time • Select the bit with an address • Input: address • Output: bit value Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  9. Output Selector 8 DATA IN WRITE DI W DI W DI W DI W DI W DI W DI W DI W DO DO DO DO DO DO DO DO 8-Bit Selector ADDRESS OUT Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  10. Output Selector 9 • Truth table Address Output A2 A1 A0 OUT 0 0 0 D 0 0 0 1 D 1 0 1 0 D 2 0 1 1 D 3 1 0 0 D 4 1 0 1 D 5 1 1 0 D 6 1 1 1 D 7 • What Boolean operation returns the correct value for address 000? (NOT A2) AND (NOT A1) AND (NOT A0) AND D0 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  11. Output Selector 10 • Full Boolean formula ( (NOT A2) AND (NOT A1) AND (NOT A0) AND D0 ) OR ( (NOT A2) AND (NOT A1) AND A0 AND D1 ) OR ( (NOT A2) AND A1 AND (NOT A0) AND D2 ) OR ( (NOT A2) AND A1 AND A0 AND D3 ) OR ( A2 AND (NOT A1) AND (NOT A0) AND D4 ) OR ( A2 AND (NOT A1) AND A0 AND D5 ) OR ( A2 AND A1 AND (NOT A0) AND D6 ) OR ( A2 AND A1 AND A0 AND D7 ) Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  12. Output Selector 11 D0 AND D1 AND D2 AND D3 AND DATA OUT OR D4 AND D5 AND D6 AND D7 AND A0 A1 A2 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  13. Input Decoder 12 • 8 Bit Latch allows 8 bits to be written at the same time • Now: only write 1 bit at a time • Select the bit with an address • Input – address – write flag – data bit Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  14. Input Decoder 13 WRITE 3-to-8 Decoder ADDRESS DATA IN DI W DI W DI W DI W DI W DI W DI W DI W DO DO DO DO DO DO DO DO DATA OUT Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  15. Input Decoder 14 • Truth table Address Output A2 A1 A0 W7 W6 W5 W4 W3 W2 W1 W0 0 0 0 0 0 0 0 0 0 0 WRITE 0 0 1 0 0 0 0 0 0 WRITE 0 0 1 0 0 0 0 0 0 WRITE 0 0 0 1 1 0 0 0 0 WRITE 0 0 0 1 0 0 0 0 0 WRITE 0 0 0 0 1 0 1 0 0 WRITE 0 0 0 0 0 1 1 0 0 WRITE 0 0 0 0 0 0 1 1 1 WRITE 0 0 0 0 0 0 0 • What Boolean operation returns the correct value for output W0? (NOT A2) AND (NOT A1) AND (NOT A0) AND WRITE Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  16. Input Decoder 15 WRITE W0 AND W1 AND W2 AND W3 AND W4 AND W5 AND W6 AND W7 AND A0 A1 A2 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  17. 8 Bit RAM 16 WRITE 3-to-8 Decoder ADDRESS DATA IN DI W DI W DI W DI W DI W DI W DI W DI W DO DO DO DO DO DO DO DO 8-Bit Selector DATA OUT Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  18. 8 Bit RAM 17 • 8 Bit Random Access Memory (RAM) • Input – address DI W A – write flag – data bit 8x1 Bit RAM • Output DO – data bit Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  19. 8x2 Bit RAM 18 • 8x1 bit RAM allows read/write of 1 bit at a time • What if we want to read/write 2 bits at a time? (and ultimately 8 bits (1 byte) and more) ⇒ Arrange them together Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  20. 8x2 Bit RAM 19 DATA-IN0 WRT ADDR DATA-IN1 DI W A DI W A 8x1 Bit RAM 8x1 Bit RAM DO DO DATA-OUT0 DATA-OUT1 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  21. 8x2 Bit RAM 20 DI W A 8x2 Bit RAM DO Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  22. 8x2 Bit RAM 21 2 3 DI W A 8x2 Bit RAM DO 2 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  23. 64 KB RAM 22 16 8 DI W A 64Kx8 Bit RAM DO 8 • 64KB = 65,536 bytes • 16 bit address space ( 2 16 = 65536 ) • Common memory size in the 1980s: we will use it with 6502 assembly Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  24. Control Panel 23 Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  25. Memories 24 Early 1980s: 64 KB RAM, 16 bit address space Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

  26. Bigger Memories 25 • Early 1980s: 16 bit address space, up to 64 KB • 1990s: 32-bit address space, up to 4 GB • Today: 64-bit address space, up to 16 EB (exa-byte) • Actually supported by Intel/AMD 64-bit processors – 52 bits for physical memory: 4 peta-byte – 48 bits for virtual memory: 256 tera-byte • Actually existing RAM: my lab biggest RAM machine: 768 GB (doubles every ∼ 2 years) Philipp Koehn Computer Systems Fundamental: Memory 9 September 2019

Recommend

Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory

Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory

Main Focus I. Memory as a process Memory II. Memory improvement III. Problems with memory 3 systems/stages of Memory: memory the process by which I. Sensory Memory information is - acquired, II. Short -Term Memory - stored,

169 views • 5 slides
1 Memory SoC Persistent Memory-Driven Memory Memory Processor-Centric Memory SoC SoC

1 Memory SoC Persistent Memory-Driven Memory Memory Processor-Centric Memory SoC SoC

1 Memory SoC Persistent Memory-Driven Memory Memory Processor-Centric Memory SoC SoC Computing Computing + Fabric SoC Memory HYPERCONVERGED Exascale EDGE DEVICE SYSTEM Eliminate data movement via shared

401 views • 11 slides
Networks Computer-Computer Comm CPU CPU CPU CPU Memory Device Device Memory Memory

Networks Computer-Computer Comm CPU CPU CPU CPU Memory Device Device Memory Memory

Networks Computer-Computer Comm CPU CPU CPU CPU Memory Device Device Memory Memory Device Device Memory Computer-Computer Comm CPU CPU CPU CPU Comm Comm Comm Comm Memory Memory Memory Memory Device Device Device Device

629 views • 36 slides
Virtual Memory 1 Memory Hierarchy Memory 4GB Cache 1M Registers 1K Question: What if

Virtual Memory 1 Memory Hierarchy Memory 4GB Cache 1M Registers 1K Question: What if

Virtual Memory 1 Memory Hierarchy Memory 4GB Cache 1M Registers 1K Question: What if we want to run a process that requires 10GB memory? 2 Memory Hierarchy Virtual Memory Memory Cache Registers Answer: Pretend we had something

737 views • 45 slides
Personal SE Computer Memory Addresses C Pointers Computer Memory Organization Memory is a

Personal SE Computer Memory Addresses C Pointers Computer Memory Organization Memory is a

Personal SE Computer Memory Addresses C Pointers Computer Memory Organization Memory is a bucket of bytes . Computer Memory Organization Memory is a bucket of bytes. Each byte is 8 bits wide. Computer Memory Organization Memory

994 views • 42 slides
Memory Memory processing is the ability to: Acquire (Short term memory) Manipulate

Memory Memory processing is the ability to: Acquire (Short term memory) Manipulate

Memory Memory processing is the ability to: Acquire (Short term memory) Manipulate (Working memory) Retain (Long term memory) Memory Retrieve (Long term memory) processing A difficulty with any one or more of these skills

361 views • 6 slides
Memory Management Memory Manager Requirements Minimize primary memory access time

Memory Management Memory Manager Requirements Minimize primary memory access time

Memory Management Memory Manager Requirements Minimize primary memory access time Maximize primary memory size Primary memory must be cost-effective Todays memory manager: Allocates primary memory to processes Maps

637 views • 27 slides
UNIFIED MEMORY IN CUDA 6 MARK HARRIS NVIDIA CONFIDENTIAL Unified Memory Dramatically Lower

UNIFIED MEMORY IN CUDA 6 MARK HARRIS NVIDIA CONFIDENTIAL Unified Memory Dramatically Lower

UNIFIED MEMORY IN CUDA 6 MARK HARRIS NVIDIA CONFIDENTIAL Unified Memory Dramatically Lower Developer Effort Developer View Today Developer View With Unified Memory System GPU Memory Unified Memory Memory Super Simplified Memory Management

766 views • 22 slides
Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated

Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated

Virtual Memory and Virtual Memory and Demand Paging Demand Paging Virtual Memory Illustrated Virtual Memory Illustrated virtual physical backing executable memory memory file storage (big) (small) header text pageout/eviction text

481 views • 12 slides
Dynamic Memory Management 333 Dynamic Memory Management Process Memory Layout Process Memory

Dynamic Memory Management 333 Dynamic Memory Management Process Memory Layout Process Memory

Dynamic Memory Management Dynamic Memory Management 333 Dynamic Memory Management Process Memory Layout Process Memory Layout (1) Each Linux process runs within its own virtual address space tables and the MMU (if available) security due to

1.25k views • 68 slides
Lecture 11: Persistent Memory Databases 1 / 71 Persistent Memory Databases Recap

Lecture 11: Persistent Memory Databases 1 / 71 Persistent Memory Databases Recap

Persistent Memory Databases Lecture 11: Persistent Memory Databases 1 / 71 Persistent Memory Databases Recap Larger-than-Memory Databases Recap 2 / 71 Persistent Memory Databases Recap Larger-than-Memory Databases Larger-than-Memory

892 views • 71 slides
Memory Hierarchy: Caching CSE 141, S2'06 Jeff Brown The memory subsystem Computer Control

Memory Hierarchy: Caching CSE 141, S2'06 Jeff Brown The memory subsystem Computer Control

Memory Hierarchy: Caching CSE 141, S2'06 Jeff Brown The memory subsystem Computer Control Input Memory Output Datapath CSE 141, S2'06 Jeff Brown Memory Locality Memory hierarchies take advantage of memory locality . Memory

337 views • 33 slides
Memory Management Ideally programmers want memory that is large fast non

Memory Management Ideally programmers want memory that is large fast non

Memory Management Virtual Memory Background; key issues Memory allocation schemes Virtual memory Memory management design and implementation issues 1 Memory Management Ideally programmers want memory that is large fast non

411 views • 30 slides
28.05.04 09:50 Memory Management The computer memory is a limited resource so the Memory

28.05.04 09:50 Memory Management The computer memory is a limited resource so the Memory

28.05.04 09:50 Memory Management The computer memory is a limited resource so the Memory Management memory use of programs has to be managed in some way. Memory Management The memory management is usually performed by a runtime system

783 views • 13 slides
Welcome to The Memory Class An Introduction to Memory Problems and the Memory Center Agenda For

Welcome to The Memory Class An Introduction to Memory Problems and the Memory Center Agenda For

Welcome to The Memory Class An Introduction to Memory Problems and the Memory Center Agenda For Todays Class Importance of the Questionnaire Description of the Memory Center Program Advanced Care Planning Lecture about Memory

695 views • 38 slides
Long-Term Memory Introduction STM versus LTM Episodic Memory Semantic Memory

Long-Term Memory Introduction STM versus LTM Episodic Memory Semantic Memory

3/16/17 Long-Term Memory Introduction STM versus LTM Episodic Memory Semantic Memory Procedural Memory Encoding in Long-Term Memory Depth of Processing (or Levels of Processing) Self Reference Effect

863 views • 19 slides
The Multilingual Language Library @ LREC 2012 Lets build it together! Nicoletta Calzolari w ith

The Multilingual Language Library @ LREC 2012 Lets build it together! Nicoletta Calzolari w ith

The Multilingual Language Library @ LREC 2012 Lets build it together! Nicoletta Calzolari w ith Riccardo Del Gratta, Francesca Frontini, Francesco Rubino, Irene Russo Istituto di Linguistica Computazionale - CNR - Pisa glottolo@ilc.cnr.it N.

454 views • 12 slides
Comparative Advantage and Optimal Trade Taxes Arnaud Costinot (MIT), Dave Donaldson (MIT),

Comparative Advantage and Optimal Trade Taxes Arnaud Costinot (MIT), Dave Donaldson (MIT),

Comparative Advantage and Optimal Trade Taxes Arnaud Costinot (MIT), Dave Donaldson (MIT), Jonathan Vogel (Columbia) and Ivn Werning (MIT) June 2014 Motivation Two central questions... 1. Why do nations trade? 2. How should they

966 views • 81 slides
Mike Blows (UK) mike blows@hotmail.c om 20 long ye ar s! 5000 dya ds/ tria ds/ fa milie s the

Mike Blows (UK) mike blows@hotmail.c om 20 long ye ar s! 5000 dya ds/ tria ds/ fa milie s the

T e a c hing me nta l he a lth c olle a g ue s how the ir own a tta c hme nt stra te g ie s ma y distort the ir c linic a l re sponse s a nd judg e me nts, by using vide o c lips portra ying c hild a buse . Mike Blows (UK) mike

248 views • 13 slides
P2P Conversational Services Sipping Peer-to-Peer Ad-Hoc , IETF #64 11-11-2005 Marco Tomsu,

P2P Conversational Services Sipping Peer-to-Peer Ad-Hoc , IETF #64 11-11-2005 Marco Tomsu,

P2P Conversational Services Sipping Peer-to-Peer Ad-Hoc , IETF #64 11-11-2005 Marco Tomsu, Alcatel Research & Innovation marco.tomsu@alcatel.de Outline P2P Services Dilemma Conversational Services Digest P2P SIP Basic Service

512 views • 10 slides
Tractable Representations Inference Probabilistic Learning Models Applications Guy Van den

Tractable Representations Inference Probabilistic Learning Models Applications Guy Van den

Tractable Representations Inference Probabilistic Learning Models Applications Guy Van den Broeck University of California, Los Angeles based on joint AAAI-2020 and UAI-2019 tutorials with Antonio Vergari YooJung Choi University of

2.07k views • 177 slides
ConnectHome Nation Webinar ConnectHome Nation Webinar Digital Inclusion Efforts in Detroit

ConnectHome Nation Webinar ConnectHome Nation Webinar Digital Inclusion Efforts in Detroit

ConnectHome Nation Webinar ConnectHome Nation Webinar Digital Inclusion Efforts in Detroit November 19 th , 2019 1 Agenda Agenda Topic #1 Topic #2 1. Detroit's New Director of Digital Inclusion Q&A Joshua Edmonds, Director of Digital

345 views • 18 slides
Distributed optimization over networks: application to multi-building energy management Maria

Distributed optimization over networks: application to multi-building energy management Maria

Distributed optimization over networks: application to multi-building energy management Maria Prandini Politecnico di Milano, Italy maria.prandini@polimi.it Credit Alessandro Falsone Daniele Ioli Simone Garatti Kostas Margellos 1

783 views • 56 slides
Falkon: optimal and efficient large scale kernel learning Alessandro Rudi INRIA - Ecole

Falkon: optimal and efficient large scale kernel learning Alessandro Rudi INRIA - Ecole

Falkon: optimal and efficient large scale kernel learning Alessandro Rudi INRIA - Ecole Normale Sup erieure joint work with Luigi Carratino (UniGe), Lorenzo Rosasco (MIT - IIT) July, 6th ISMP 2018 Learning problem The problem P Find

602 views • 20 slides

More recommend