Information and Control in Gray-Box Systems Arpaci-Dusseau and Arpaci-Dusseau SOSP 18, 2001 John Otto Wi06 CS 395/495 Autonomic Computing Systems.

Slides:



Advertisements
Similar presentations
Chapter 6: Memory Management
Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Operating Systems ECE344 Ding Yuan Final Review Lecture 13: Final Review.
File System Analysis.
CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.
File System Implementation CSCI 444/544 Operating Systems Fall 2008.
CS 104 Introduction to Computer Science and Graphics Problems
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.
Performance Evaluation
Chapter 1 and 2 Computer System and Operating System Overview
Chapter 13 Reduced Instruction Set Computers (RISC) Pipelining.
CS 524 (Wi 2003/04) - Asim LUMS 1 Cache Basics Adapted from a presentation by Beth Richardson
1.1 CAS CS 460/660 Introduction to Database Systems File Organization Slides from UC Berkeley.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.
Secondary Storage Management Hank Levy. 8/7/20152 Secondary Storage • Secondary Storage is usually: –anything outside of “primary memory” –storage that.
Basics of Operating Systems March 4, 2001 Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard.
Graybox NFS Caching Proxy By: Paul Cychosz and Garrett Kolpin.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
Chapter 3 Memory Management: Virtual Memory
Caching for Sustainability Alex Bunch. Agenda Intro Overview Background Analysis Implementation Future.
Performance of Web Applications Introduction One of the success-critical quality characteristics of Web applications is system performance. What.
CS 153 Design of Operating Systems Spring 2015 Final Review.
Introduction and Overview Questions answered in this lecture: What is an operating system? How have operating systems evolved? Why study operating systems?
Firewall and Internet Access Mechanism that control (1)Internet access, (2)Handle the problem of screening a particular network or an organization from.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems CSCI-6140 – Computer Operating Systems David Goldschmidt, Ph.D.
March 16 & 21, Csci 2111: Data and File Structures Week 9, Lectures 1 & 2 Indexed Sequential File Access and Prefix B+ Trees.
Chapter 21 Virtual Memoey: Policies Chien-Chung Shen CIS, UD
CE Operating Systems Lecture 3 Overview of OS functions and structure.
ICOM 6115: Computer Systems Performance Measurement and Evaluation August 11, 2006.
Exploiting Gray-Box Knowledge of Buffer Cache Management Nathan C. Burnett, John Bent, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau University of.
Deconstructing Storage Arrays Timothy E. Denehy, John Bent, Florentina I. Popovici, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau University of Wisconsin,
CS 153 Design of Operating Systems Spring 2015 Lecture 21: File Systems.
Distributed System Concepts and Architectures Services
Virtual Memory The memory space of a process is normally divided into blocks that are either pages or segments. Virtual memory management takes.
A BRIEF INTRODUCTION TO CACHE LOCALITY YIN WEI DONG 14 SS.
Operating Systems: Wrap-Up Questions answered in this lecture: What is an Operating System? Why are operating systems so interesting? What techniques can.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
1 Rutgers UniversityCS 416: Operating Systems Final exam details December 22, pm-3pm. Venue: SEC 118. Tips: Spend time reading the questions before.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
An Accurate and Detailed Prefetching Simulation Framework for gem5 Martí Torrents, Raúl Martínez, and Carlos Molina Computer Architecture.
Storage Systems CSE 598d, Spring 2007 OS Support for DB Management DB File System April 3, 2007 Mark Johnson.
Transforming Policies into Mechanisms with Infokernel Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Nathan C. Burnett, Timothy E. Denehy, Thomas J.
DMBS Internals I February 24 th, What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
NETW3005 Virtual Memory. Reading For this lecture, you should have read Chapter 9 (Sections 1-7). NETW3005 (Operating Systems) Lecture 08 - Virtual Memory2.
Operating Systems: Summary INF1060: Introduction to Operating Systems and Data Communication.
I/O Software CS 537 – Introduction to Operating Systems.
Mike Switlick. Overview What is a covert channel? Storage / Timing Requirements Bunratty attack Covert_tcp Questions.
1 Chapter 2: Operating-System Structures Services Interface provided to users & programmers –System calls (programmer access) –User level access to system.
CS222: Principles of Data Management Lecture #4 Catalogs, Buffer Manager, File Organizations Instructor: Chen Li.
Lecture 16: Data Storage Wednesday, November 6, 2006.
Ramya Kandasamy CS 147 Section 3
Computer Architecture
File System Implementation
Data Analysis in Particle Physics
Economics, Administration & Information system
Chapter 11: File System Implementation
O.S Lecture 13 Virtual Memory.
External Sorting The slides for this text are organized into chapters. This lecture covers Chapter 11. Chapter 1: Introduction to Database Systems Chapter.
Memory Allocation CS 217.
Massachusetts Institute of Technology
Secondary Storage Management Brian Bershad
Memory management Explain how memory is managed in a typical modern computer system (virtual memory, paging and segmentation should be described.
Secondary Storage Management Hank Levy
Virtual Memory: Working Sets
Lecture Topics: 11/20 HW 7 What happens on a memory reference Traps
What Are Performance Counters?
CS222/CS122C: Principles of Data Management UCI, Fall 2018 Notes #03 Row/Column Stores, Heap Files, Buffer Manager, Catalogs Instructor: Chen Li.
Presentation transcript:

Information and Control in Gray-Box Systems Arpaci-Dusseau and Arpaci-Dusseau SOSP 18, 2001 John Otto Wi06 CS 395/495 Autonomic Computing Systems

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective

What is Gray-Box? Premise  Operating systems cannot be easily modified without performance risks Goal  Incorporate new, “special application” OS ideas into systems without modifying the OS itself Method  Using knowledge of OS algorithms, observe the OS “state” and present an optimized interface for the user (the Information and Control Layer, ICL)

General Capabilities Applications do not necessarily need to be designed to interface with the ICL Easy to port—ICLs usually assume an algorithm and perform general tests to determine the OS state.

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective

Gaining Information Obtain Algorithmic Knowledge  Trade-off between generality and optimization Monitor Outputs  Information in “covert channels” implies state Use Statistical Methods  Generate a “system profile” to distinguish normal and abnormal system performance Use Microbenchmarks  Judiciously conduct performance tests on the system Insert Probes  Probes help obtain, but also modify, the system state

Asserting Control Exploit algorithmic knowledge to simply achieve a goal  e.g. prefetching a file Move the system to a known state Implement feedback systems  Repeated use should optimize the ICL  Design should keep OS in known state

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective

Existing Microbenchmarks Typically run in a controlled environment Collect static data Time restrictions are not imposed Hence, they do not offer insight into the unknown state of a system—only static parameters

Existing Gray-Box Systems Capabilities  TCP: diagnose network congestion  Implicit Coscheduling: run communicating processes concurrently  MS Manners: optimize resource (CPU) availability for important processes

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective

Detailed Case Studies

File-Cache Content Detector Goal  Order data accesses to maximize cache hits, minimize disk accesses Methods  Internal Simulation vs. Inference by Observation Simulation expensive, requires all processes to cooperate  Exploit spatial locality (page loading algorithms) Probing one region of a file can indicate whether that region of the file is in cache Limitations  Probing small files significantly alters the cache state of that file

FCCD: Exploiting Spatial Locality

FCCD: Implementation and Interface Resilient Interface  Library: built-in application ICL functionality  Command line: orders a list of files passed to command line tool Implementation  Differentiation between cache hit and miss Sort files/regions of a file by shortest probe access time  Choice of Access Unit size—minimize disk seek time  Choice of Prediction Unit size—minimize probe use Perform a few probes per access unit (prediction unit smaller than access unit) Select random byte in prediction unit

FCCD: In Action

File Layout Detector and Controller Goal  To ascertain the layout on disk of a set of files “Gray-Box” Knowledge  Most file systems localize contents of a directory on the same set of disk cylinders Methods  Refresh directory structure  Use knowledge of i-node assignment to order file accesses Implementation 1. Call stat() on each file 2. Refresh the directory 3. Return list of files sorted by i-node Limitations  UNIX-oriented optimization (i-nodes!)  Dependence of other running applications on i-node numbers

FLDC: In Action

Memory-based Admission Control Goal  Prevent overuse of memory resources Methods  Measure amount of memory that can be referenced without causing a page replacement  Applications are notified when there is not enough free memory for an allocation request Limitations  Accuracy limited by page-replacement algorithm  Just because the MAC application is “nice” doesn’t mean that other applications can’t cause thrashing.

MAC: In Action

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective

Gray Toolbox Microbenchmark results stored in common repository for use by ICLs at system level Overhead-sensitive operations use system-optimized “plug-in” functionality  e.g. timers Provide tools for simple statistical calculations

Overview OS and Gray-Box Advantages Techniques Previous Approaches Case-Studies Gray Toolbox Autonomic Perspective?

Autonomic Perspective—Observations Knowledge: In order for an autonomic tool to function well, the state of the system must be well-known.  Hence, keeping the system in a known state is an important objective for autonomic tools. Trust: If a system can provide evidence and reasons for its actions, a user is more likely to trust the system.  A user interface detailing decisions and the benchmarks leading to an action would be beneficial. Simplicity: Autonomic systems should operate based on known algorithms; actions would be predictable and explainable.

Information and Control in Gray-Box Systems Arpaci-Dusseau and Arpaci-Dusseau SOSP 18, 2001 John Otto Wi06 CS 395/495 Autonomic Computing Systems