A hierarchy independent approach (ongoing work) Michael Monerau Chris Hankin Courant Institute, NYU Ecole Normale Supérieure de Paris, France Imperial.

Slides:



Advertisements
Similar presentations
The Personal Statement: Strategies for Supporting Freshman Applicants
Advertisements

Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Copyright © 2006 by The McGraw-Hill Companies,
Dynamic Power Redistribution in Failure-Prone CMPs Paula Petrica, Jonathan A. Winter * and David H. Albonesi Cornell University *Google, Inc.
Gennady Pekhimenko Advisers: Todd C. Mowry & Onur Mutlu
Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-order Processors Onur Mutlu, The University of Texas at Austin Jared Start,
Warm-Up Methodology for HW/SW Co-Designed Processors A. Brankovic, K. Stavrou, E. Gibert, A. Gonzalez.
SE-292 High Performance Computing
Virtual Hierarchies to Support Server Consolidation Michael Marty and Mark Hill University of Wisconsin - Madison.
C SINGH, JUNE 7-8, 2010IWW 2010, ISATANBUL, TURKEY Advanced Computers Architecture, UNIT 2 Advanced Computers Architecture UNIT 2 CACHE MEOMORY Lecture7.
Interactive lesson about operating system
1 Fast Configurable-Cache Tuning with a Unified Second-Level Cache Ann Gordon-Ross and Frank Vahid* Department of Computer Science and Engineering University.
Memory Management and RMAP VM of 2.6 By A.R.Karthick )
Cache and Virtual Memory Replacement Algorithms
A Preliminary Attempt ECEn 670 Semester Project Wei Dang Jacob Frogget Poisson Processes and Maximum Likelihood Estimator for Cache Replacement.
Learning Cache Models by Measurements Jan Reineke joint work with Andreas Abel Uppsala University December 20, 2012.
Virtual Memory 1 Computer Organization II © McQuain Virtual Memory Use main memory as a cache for secondary (disk) storage – Managed jointly.
A Framework for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy J. Zebchuk, E. Safi, and A. Moshovos.
Bypass and Insertion Algorithms for Exclusive Last-level Caches
Duagi Bulent UNIVERSITY POLITEHNICA of BUCHAREST DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY POLITEHNICA of BUCHAREST DEPARTMENT OF COMPUTER SCIENCE.
ITEC 352 Lecture 25 Memory(2). Review RAM –Why it isnt on the CPU –What it is made of –Building blocks to black boxes –How it is accessed –Problems with.
Lucía G. Menezo Valentín Puente José Ángel Gregorio University of Cantabria (Spain) MOSAIC :
An Introduction to Cache View this presentation in slideshow mode.
KAIST Computer Architecture Lab. The Effect of Multi-core on HPC Applications in Virtualized Systems Jaeung Han¹, Jeongseob Ahn¹, Changdae Kim¹, Youngjin.
SE-292 High Performance Computing
CS533 Concepts of Operating Systems Class 14 Virtualization and Exokernels.
HIGH LEVEL PERSPECTIVE ASSESSING CEIOPS’ PROGRESS SO FAR AND IDENTIFYING FUTURE CHALLENGES IN CONJUNCTION WITH THE ASSESSMENT OF THE LAMFALUSSY MODEL Carlos.
OLTP on Hardware Islands Danica Porobic, Ippokratis Pandis*, Miguel Branco, Pınar Tözün, Anastasia Ailamaki Data-Intensive Application and Systems Lab,
Cache Design and Tricks Presenters: Kevin Leung Josh Gilkerson Albert Kalim Shaz Husain.
1 CIS 461 Compiler Design and Construction Fall 2014 Instructor: Hugh McGuire slides derived from Tevfik Bultan, Keith Cooper, and Linda Torczon Lecture-Module.
Target code Generation Made by – Siddharth Rakesh 11CS30036 Date – 12/11/2013.
Computer Maintenance Unit Subtitle: Cache Concepts Excerpted from Copyright © Texas Education Agency, 2011.
Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
1º HARVARD UNIVERSITY - USA 2º UNIVERSITY OF CAMBRIDGE - UK.
1 Memory Systems Virtual Memory Lecture 25 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Memory Hierarchy. Smaller and faster, (per byte) storage devices Larger, slower, and cheaper (per byte) storage devices.
CS533 Concepts of Operating Systems Class 14 Extensible Virtual Memory Management.
SYNAR Systems Networking and Architecture Group CMPT 886: Computer Architecture Primer Dr. Alexandra Fedorova School of Computing Science SFU.
Compilers for Embedded Systems Ram, Vasanth, and VJ Instructor : Dr. Edwin Sha Synthesis and Optimization of High-Performance Systems.
S YMMETRIC S HARED M EMORY A RCHITECTURE Presented By: Rahul M.Tech CSE, GBPEC Pauri.
Lecture#15. Cache Function The data that is stored within a cache might be values that have been computed earlier or duplicates of original values that.
ICC Module 3 Lesson 2 – Memory Hierarchies 1 / 14 © 2015 Ph. Janson Information, Computing & Communication Memory Hierarchies – Clip 5 – Reading School.
Cache Small amount of fast memory Sits between normal main memory and CPU May be located on CPU chip or module.
For each of these, where could the data be and how would we find it? TLB hit – cache or physical memory TLB miss – cache, memory, or disk Virtual memory.
RESULTS AND DISCUSSION
Sample Text for Title of Poster
Materials & Methods Introduction Abstract Results Conclusion
Operating System The OS is JUST A PROGRAM
Materials & Methods Introduction Abstract Results Conclusion
خشنه اتره اهورهه مزدا شيوۀ ارائه مقاله 17/10/1388.
FIGURE 12-1 Memory Hierarchy
Interconnect with Cache Coherency Manager
Cache Memory.
Sample Text for Poster Title
Materials & Methods Introduction Abstract Results Conclusion
Materials & Methods Introduction Abstract Results Conclusion
Sample Text for Poster Title
Sample Text for Poster Title
Sample Text for Title of Poster
Sample Text for Title of Poster
Sample Text for Poster Title
Sample Text for Poster Title
Sample Text for Poster Title
This module covers the following topics.
Sample Text for Poster Title
CS533 Concepts of Operating Systems Class 14
Sample Text for Poster Title
Sample Text for Poster Title
Materials & Methods Introduction Abstract Results Conclusion
Materials & Methods Introduction Abstract Results Conclusion
Conclusion & Discussion Research purposes/ Research hypothesis
Presentation transcript:

A hierarchy independent approach (ongoing work) Michael Monerau Chris Hankin Courant Institute, NYU Ecole Normale Supérieure de Paris, France Imperial College London

Problem description Abstract Interpretation Cache prediction Related & Future work Conclusion 2

Quick introduction: How do cache work? 3

CPUs Cache hierarchy Read / Write L1 L2 L3 Virtual Memory Off-chipOn-chip 4

CPUs Cache hierarchy Read / Write L1 L2 L3 Ask for data Sends data Off-chipOn-chip 5

Cache Level Cache line An example: 4-Way Associative Cache A cache line contains a copy of a Virtual Memory Block VM Address % 3 == 0 VM Address % 3 == 1 VM Address % 3 == 2 6

Cache hierarchies may vary a lot Number of levels Internals of each level Replacement strategies (each level) Write strategies Inter-level strategies Several CPUs, shared/unshared level Combinatorial explosion ! 7

8

A quick overview of Abstract Interpretation 9

CONCRETE WORLDABSTRACT WORLD 10

CONCRETE WORLDABSTRACT WORLD T T T T 11

Soundness is optimal 12

x = Rand(1, 10) y = 1 y = 0 Print y x > 5 x <=

e.g. with intervals: x = Rand(1, 10) y = 1 y = 0 Print y x > 5 x <=

Description of the abstract domain for cache prediction 15

Cache Level Relation Strategy Stock Strategy Stock Management (low-level data organization) Stock Management (low-level data organization) Other level Receive / Forward Requests Report updates Make Address Available Candidate locations 16 L3 L1 L2

17

18

ABSTRACTION FOR A LINES CACHE Galois Connection 19

a4 ChangePriority # (Ad, pr) 20.. a1 a2 a3 a5 a6.... Priority pr.. a1 a2 a3 a5 a6.... Priority pr Ad a4 Ad a7 Ad a4 Moved 0 or 1 down Moved 1 down Soundness Soundness :

CONCRETE WORLD Miss p(Address) Hit p(Address) ABSTRACT WORLD Let Miss Hit/Miss? Hit 21

Virtual Memory CPU Cache hierarchy L1 L2 L3 Scratchpad Hardware managed Analysis gives information: Possible contents of the cache Simulate Scratchpad as a « L0 » cache Heuristic Software managed Scratchpad allocation strategy 22 If (unlikely) y=0 dont put y on the scratchpad If (unlikely) y=0 dont put y on the scratchpad

Related Work [Wilhelm et al. VMCAI10] and [Reineke et al. SAS09]: clever abstract domains, no generic proof, no hierarchy [Marvadel et al.]: profiling (for scratchpad allocation) Future work Safe initial states for some replacement strategies (domino effect, … cf. [SAS09], [Berg 06]) Improvements proposed in [SAS09] Implementation & benchmarks Clever strategies for scratchpads 23

Modular analysis: Hierarchy-independent Replacement strategy-independent Easy-to-build transfer functions Formal and modular proofs of soundness 24