SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers

Size: px
Start display at page:

Download "SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers"

Transcription

1 SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers Feng Chen 1 Song Jiang 2 Xiaodong Zhang 1 The Ohio State University, USA Wayne State University, USA

2 Disks Cost High Energy in Mobile Computers Battery life is always limited to mobile computers. Hard disks account for a considerable amount of energy consumption in mobile computers, such as laptops. Efforts to save disk energy is limited by its mechanics High disk energy consumption mainly stems from rotational disk platters.

3 Hard Disk Energy Consumption States Four power consumption states Active reading/writing/seeking Idle disk platters keep spinning, electricity is partially powered down Standby disk platters are spun down, and disk arms are parked Sleep remaining components powered off How to save disk energy? Switch from high energy consumption state (Active/idle) to lower energy consumption state (standby).

4 Energy Consuming Cycles Once the hard disk is idle for a specific period (timeout threshold), disk is spun down to save energy Upon arrival of a request, disk is spun up to serve the requests. Spin up/down disk raises substantial energy and time overhead Energy Consumption (W) Active State Idle State Receive request #1 Standby State Disk is idle for 20 seconds, spin it down Disk sleeps Receive and energy request is saved #2, spin up disk Standby State Time (second) Active State Idle State

5 Flash Drive is Low Energy Device A portable storage device for almost every mobile computer user on the road Features Low cost Compact size Nonvolatile storage not as dynamic as main memory Our goal --- using the low-cost and low energy flash drive to save disk energy No mechanical components not as slow as disk Low power consumption E.g. Active Power: 0.024w (flash) vs w (disk): 26 times! The power difference for standby mode is 2500 times. Unfortunately, the flash drive is still mainly used for file transfer and temporary storage.

6 Main idea SmartSaver uses flash memory to cache and prefetch disk data to be reused and used later. Two-fold goals Effectively extend disk idle periods and save disk energy Optimize flash drive usage by effectively caching and prefetching the useful data.

7 Outline Issues and Challenges Scheme Design Performance Evaluation Conclusion

8 Issues and Considerations Two characteristics of the flash drive Low write bandwidth Only 8MB/sec for Transcend TS1GJF2A flash drive Limited erasure/rewrite cycles Typically 100,000 overwrites Design considerations These two specifics are in our design consideration

9 Related work Disk energy-saving schemes Selecting good timeout threshold Fixed[4] / adaptive[5,6] timeout threshold Cons Only passively monitor disk I/O operations w/o extending disk idle time on purpose Extending disk idle time by customizing system or application software for energy saving [3][7] Cons significant changes to existing buffer cache management New hardware design DRPM[8] Tunable disk rotational speed on the fly Cons inavailable in mainstream commercial market.

10 Related work Flash memory for energy saving Using flash memory as a new layer between main memory and the hard disk[9] Cons inefficiently cache every byte transferred between main memory and the hard disk Using flash memory as a write only cache when disk is idle[10] Only deals with write-back traffic to avoid spinning up standby disk, no prefetching and caching. Some other work[11][12] also notices the low-power features of flash memory, but no further discussion on how to save disk energy w/ efficient use of flash.

11 An Intuitive Idea Baseline (MarSh 94) Insert the flash drive between main memory and the hard disk as a new layer in the storage hierarchy. Cache every byte loaded from disk or evicted from main memory Uses LRU to free space when the flash drive is full Accesses to disks are hoped to be absorbed by flash drive Main memory Main memory Flash drive Disk Disk

12 Four Ignored Issues in ``Baseline Flash drive does not fit well in the storage hierarchy. Flash drive w/ low write bandwidth would become a bottleneck One-time access data should not be cached at all It caches everything including one-time accessed data. Data should be selectively cached in flash drive Data w/ good locality frequently reused data Data w/ high energy consumption data that move slowly from/to the disk and keep disk active for a long period Data should be replaced carefully Hold data w/ good locality or high energy consumption

13 Two principles Always keep the two specific characteristics of the flash drive in mind during our scheme design low write bandwidth limited erasure cycles Always identify and store only the most valuable data in the flash drive for energy saving Benefit how much energy could be saved Cost how much flash space would be demanded

14 SmartSaver Design A flash drive is into three areas for: Main memory Caching Prefetching Writeback Caching Prefetching writeback The data allocations to the areas are balanced and adaptive. Disk read write

15 Busy Period and Quiet Period Busy period between the disk spin-up and its consecutive spin-down Quiet period between the disk spin-down and its consecutive spin-up Busy period quiet period Energy Consumption (W) Active State 1 2 Idle State Active State Idle State Standby State Time (second)

16 SmartSaver Extends Disk Quiet Period The goal is to minimize busy periods by serving requests using data in the flash drive The longer busy periods are reduced, the more energy could be saved. Busy period quiet period quiet period Energy Consumption (W) Active State 1 2 Idle State Active State Idle State Standby State Time (second)

17 SmartSaver Task 1: Caching Caching two types of data in flash drive Frequently used data Disk data with high thinking time. Comparisons of thinking times Gzip 10 seconds to compress one file Glimpse 1 minute to build index for the same file Caching the file generated by Glimpse can save more energy than that by gzip.

18 Energy Saving Rate (ESR) E s = Energy (Jr) that could be saved if one busy period is avoided (proportional to the thinking time) B d = Data bytes accessed during the busy period ESR = E s / B d (energy consumption per Byte) For example, ESR (Glimpse) > ESR (gzip) ESR describes how much energy could be saved by caching one chunk of data in flash drive by avoiding its busy period.

19 Envelope: A Mechanism to Monitor Disk Energy Usage Envelope a data structure to monitor accessed data blocks during a busy period. An envelope is created in each completed busy period. Upon a completion of a busy period, its ESR value is calculated for its envelope. Blocks accessed during a busy period are recorded in its envelope in the LRU order. If one envelope is selected based on two factors, all its data blocks are written to the flash drive. Cached envelopes are placed in a queue, called envelope stack.

20 Enevelope Busy period quiet period Busy period Logic Block Number Envelope Time (second) Envelope 6 LRU LRU

21 Flash Drive Replacement Energy-saving-oriented Replacement A block s value for energy saving How much energy could be saved How likely it is to be reassessed Challenge how to evaluate and compare two blocks values for energy saving simultaneously using these two orthogonal metrics? Envelope stack is used to achieve the goals.

22 43 9 Envelope (ESR=25) 9 L= Envelope (H=85, ESR=45, L=40) Envelope (H=75, ESR=50, L=25) Envelope (H=70, ESR=60, L=10) Envelope (H=55, ESR=50, L=5) 5 A global inflation value w/ initial value 0 and keeps inflated, (the H value of the last replaced envelop). Step 1: use the H value of Envelop 5 Envelope Stack H = ESR + Envelope s L Global ESR value inflation value L Envelopes (how sorted much in (how energy likely could the envelope ascending Replace be order saved) Envelope of H could 5 be reaccessed) at the stack bottom to inflate L value

23 Step 4: insert envelope 9 into the envelope stack according to its H value 43 9 Envelope (ESR=25) 9 H= ESR+L=80 L=55 Step 3: Calculate H value of new envelope 9 using the up-to-date L Envelope (H=85, ESR=45, L=40) Envelope (H=75, ESR=50, L=25) 95 9 (H=80, ESR=55, L=55) Envelope (H=70, ESR=60, L=10) Envelope (H=55, ESR=50, L=5) 11 5 Step 2: reclaim envelope 5 Envelope Stack

24 SmartSaver Task 2: Prefetching Goal Preload long sequential disk accesses (such as video streams) in the beginning of the sessions. Issues Enlarge the disk quiet periods. How to identify sequential access patterns How to avoid inefficient prefetching decisions How to coordinate prefetching with other concurrent disk events

25 Identifying Sequential Access Patterns Objective Avoid intrusive changes to existing performancecritical buffer cache management in OS kernels Existing Linux file-level prefetching mechanism Two read-ahead windows to detect the sequential file accesses Windows are expanded, if accesses is sequential Windows are shrunk, if accesses become random Indirect pattern detection mechanism Monitor changes of window sizes If windows are enlarged to its maximum size (32 pages), initiate a prefetching stream If windows are shrunk, terminate a prefetching stream

26 Avoiding Inefficient Prefetching Goal Considering the low write bandwidth and limited erasure cycles, we have to avoid inefficient prefetching to reduce the amount of data written to the flash drive Rate-based applications Applications holding a steady rate of data consumption, such as xmms and mplayer.

27 How to avoid inefficient prefetching Two factors Data consumption rate (DCR) DCR < flash write bandwidth DCR < Size prefetching-area / Time break-even Prefetching time Lower bound disk break-even time Upper bound too aggressive prefetching brings diminishing benefits

28 Coordinating with Concurrent Disk Events Long disk idle period created by prefetching could be foiled by concurrent disk events. For example, Prefetching 4 minutes movie clips Running virus-scanning program on background We must coordinate our prefetching mechanism with other concurrent disk events to avoid overshooting prefetching

29 How to coordinate with concurrent disk events Two types of disk events spinning up a standby disk Bumps when a stream uses up its prefetched data blocks Holes other disk events, such as cold misses Coordinating bumps and holes If one bump appears, it means prefetching is too conservative. Double current prefetching time to make it more aggressive If one hole appears, it means prefetching is overshot. Reduce current prefetching time to the interval of two most recent holes. Double prefetching time = 20*2=40 Disk Events Bumps Holes Shrink prefetching time = Time (second)

30 Task 3: Writeback via Flash Drive Goal In most OS kernels, dirty blocks are periodically flushed back to the disk to avoid losing data in volatile memory Linux writes dirty blocks older than 30 sec back every 5 sec. Such periodical disk accesses conflict with disk energy saving Solutions: If the disk is in the standby state, SmartSaver redirect writeback traffic to the flash drive; otherwise, dirty blocks are directly written to the disk. If the disk is back to the active state and 90% of the writeback area is full, all the dirty blocks are written back to the disk. If the writeback area is overflowed, the disk is spun up to write back all the dirty blocks.

31 Balancing the three areas Goal As the flash drive is partitioned into three areas, tuning the sizes of three areas on-line is desired to achieve optimal energy saving Solution SmartSaver monitors accesses to each area and periodically evaluates the amount of energy saved due to the addition of N blocks. Each time N blocks are reclaimed from the least productive area, where adding N more blocks can achieve less increased energy saving than adding them to other areas, and allocated to the most productive one.

32 Trace-driven Simulation Evaluation Simulating major linux kernel components 2Q-like memory page replacement algorithm Two-window file prefetching scheme I/O request clustering mechanism Three disk energy-saving schemes are simulated Linux laptop mode (Linux) Baseline flash-memory-based scheme (Baseline) Our disk energy-saving scheme (SmartSaver)

33 Simulated disk HITACHI-DK23DA hard disk 30GB 4200RPM 35MB/sec peak bandwidth Avg. seek time: 13.0 ms Avg. rotation time: 7.1 ms Timeout threshold: 20 sec Table 1. Energy-related parameters

34 Simulated Flash drive Transcend TS1GJF2A flash drive Read bandwidth: 12MB/sec Write bandwidth: 8MB/sec Active power consumption: 0.365W Sleep power consumption: 0.6mW

35 Traces Strace utility Modified strace utility can intercept all fileoperation related system calls, e.g. read(). Collected info: PID, file descriptor, inode number, offset, size, type, timestamp, and duration Blocks of traced files are sequentially mapped to a simulated disk with small random distance between files

36 Traces 8 traces of 7 typical applications used in a mobile computing environment are collected. 5 single-application traces 2 multi-application traces 2 typical mobile computing senarios are generated by concatenating individual application traces one by one Programming Networking Table 2. Description of traces

37 Case-1 : programming The Programming scenario is composed of eight stages Make, Grep, xmms, make, grep, Scp-r, make, grep

38 Case-1 : programming Linux w/ 64MB memory Linux 89.1% w/ 128MB disk idle memory periods are % not long idle enough periods are (<16sec shorter than ) for 16 saving sec. disk energy Baseline w/ 64MB memory and 128MB flash 79.3% idle periods are shorter than 16 sec. SmartSaver w/ 64MB memory and 128MB flash drive only 30.8% disk idle periods are invalid for energy saving Disk break-even time (16 seconds) if disk is idle < 16 sec, NO energy could be saved. Unusable Idleness Percentage (UIP) the lower a UIP is, the more energy could be saved SmartSaver can effectively extend disk idle time longer than the disk breakeven time.

39 Case-1 : programming SmartSaver saves 41.0% more energy than Linux SmartSaver writes 46.6% less data to the flash drive than Baseline, but reads 50% more data from the flash drive. SmartSaver achieves better energy conservation SmartSaver uses the flash drive more efficiently

40 Case-1 : programming Linux cannot accommodate the working-set in memory, thus, Linux has disk accesses at all eight stages Baseline flushes working-set of make and caches the working-set of scp-r in the flash drive. Baseline caches the working-set of make in the flash drive, thus, disk is idle for 822 seconds at stage 4 and 5. Disk has to be spun up for make again. Disk I/O activities of three schemes w/ 64MB memory and/or 128MB flash drive SmartSaver starts prefetching for xmms. SmartSaver caches the working-set of make. SmartSaver protects the working-set of make from being evicted by scp-r. Disk is idle and make is satisfied in the flash drive.

41 Case-2 : networking The networking scenario is composed of three stages Thunderbird, Scp-mplayer, ftp-mplayer

42 Case-2 : networking Linux & Baseline around 73% disk idle times are too short to save disk energy SmartSaver w 128MB flash drive only 16.7% disk idle times are shorter than 16 sec. Baseline cannot extend disk idle time, as the disk activities are dominated by one-time accesses. SmartSaver effectively extends disk idle time through prefetching

43 Case-2 : networking SmartSaver saves 41.8% more energy than Linux SmartSaver writes 22.8% less data to the flash drive than Baseline, but reads 707.6% more data from the flash drive. SmartSaver achieves better energy conservation SmartSaver uses the flash drive more efficiently

44 Case-2 : networking Baseline cannot deal with the one-time access dominated workload. SmartSaver does not prefetch for both scp, whose data consumption rate is 8MB/sec, and mplayer, since disk keeps active. After scp completes, SmartSaver prefetches for mplayer. Disk I/O activities of three schemes w/ 64MB memory and/or 128MB flash drive In contrast, SmartSaver prefetches for ftp and mplayer, both of which have a low consumption rate.

45 Implementation Related Discussion Overhead of inserting envelope into the stack Only one insert sort operation per busy period, which is usually minutes long. Overhead is amortized over all accessed data blocks Wear-leveling SmartSaver does not conduct its own wear-leveling SmartSaver saves limited erasure cycles by reducing amount of data written to the flash drive, rather than creating even distribution of data written over the flash drive. SmartSaver is complementary to existing wear-leveling techs Data integrity Dirty blocks could be flushed back to the disk when disk is active Mandatory write back of dirty blocks before detaching flash drive

46 Conclusion We identify some critical issues involved in using the flash drive for saving disk energy We designed a comprehensive set of solutions to maintain an effective use of the flash drive to achieve three goals Accommodating the unique prosperities of the flash drive Minimizing intrusive OS kernel changes Significantly improving disk energy saving Trace driven simulations for typical mobile computing scenarios show SmartSaver can save up to 41.8% disk energy compared with existing policies in Linux.

SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers

SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers Feng Chen The Ohio State University Columbus, OH 4321, USA fchen@cse.ohiostate.edu Song Jiang Wayne State University Detroit,

More information

Flash Memory Based Storage System

Flash Memory Based Storage System Flash Memory Based Storage System References SmartSaver: Turning Flash Drive into a Disk Energy Saver for Mobile Computers, ISLPED 06 Energy-Aware Flash Memory Management in Virtual Memory System, islped

More information

Feng Chen and Xiaodong Zhang Dept. of Computer Science and Engineering The Ohio State University

Feng Chen and Xiaodong Zhang Dept. of Computer Science and Engineering The Ohio State University Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically Feng Chen and Xiaodong Zhang Dept. of Computer Science and Engineering The Ohio State University Power Management in Hard

More information

FlexFetch: A History-Aware Scheme for I/O Energy Saving in Mobile Computing

FlexFetch: A History-Aware Scheme for I/O Energy Saving in Mobile Computing : A History-Aware Scheme for I/O Energy Saving in Mobile Computing Feng Chen 1, Song Jiang 2, Weisong Shi 3, and Weikuan Yu 4 1 Dept. of Computer Science & Engineering 2 Dept. of Electrical & Computer

More information

PS-BC: Power-saving Considerations in Design of Buffer Caches Serving Heterogeneous Storage Devices

PS-BC: Power-saving Considerations in Design of Buffer Caches Serving Heterogeneous Storage Devices PS-BC: Power-saving Considerations in Design of Buffer Caches Serving Heterogeneous Storage Devices Feng Chen and Xiaodong Zhang Department of Computer Science & Engineering The Ohio State University Columbus,

More information

Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically

Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically Feng Chen and Xiaodong Zhang Dept. of Computer Science & Engineering The Ohio State University Columbus, OH 4321, USA {fchen,zhang}@cse.ohio-state.edu

More information

L9: Storage Manager Physical Data Organization

L9: Storage Manager Physical Data Organization L9: Storage Manager Physical Data Organization Disks and files Record and file organization Indexing Tree-based index: B+-tree Hash-based index c.f. Fig 1.3 in [RG] and Fig 2.3 in [EN] Functional Components

More information

Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically

Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically Caching for Bursts (C-Burst): Let Hard Disks Sleep Well and Work Energetically ABSTRACT High energy consumption has become a critical challenge in all kinds of computer systems. Hardware-supported Dynamic

More information

Operating Systems Design Exam 2 Review: Spring 2011

Operating Systems Design Exam 2 Review: Spring 2011 Operating Systems Design Exam 2 Review: Spring 2011 Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 CPU utilization tends to be lower when: a. There are more processes in memory. b. There are fewer processes

More information

A Comparison of File. D. Roselli, J. R. Lorch, T. E. Anderson Proc USENIX Annual Technical Conference

A Comparison of File. D. Roselli, J. R. Lorch, T. E. Anderson Proc USENIX Annual Technical Conference A Comparison of File System Workloads D. Roselli, J. R. Lorch, T. E. Anderson Proc. 2000 USENIX Annual Technical Conference File System Performance Integral component of overall system performance Optimised

More information

CS 416: Opera-ng Systems Design March 23, 2012

CS 416: Opera-ng Systems Design March 23, 2012 Question 1 Operating Systems Design Exam 2 Review: Spring 2011 Paul Krzyzanowski pxk@cs.rutgers.edu CPU utilization tends to be lower when: a. There are more processes in memory. b. There are fewer processes

More information

STORING DATA: DISK AND FILES

STORING DATA: DISK AND FILES STORING DATA: DISK AND FILES CS 564- Spring 2018 ACKs: Dan Suciu, Jignesh Patel, AnHai Doan WHAT IS THIS LECTURE ABOUT? How does a DBMS store data? disk, SSD, main memory The Buffer manager controls how

More information

File System Internals. Jo, Heeseung

File System Internals. Jo, Heeseung File System Internals Jo, Heeseung Today's Topics File system implementation File descriptor table, File table Virtual file system File system design issues Directory implementation: filename -> metadata

More information

Presented by: Nafiseh Mahmoudi Spring 2017

Presented by: Nafiseh Mahmoudi Spring 2017 Presented by: Nafiseh Mahmoudi Spring 2017 Authors: Publication: Type: ACM Transactions on Storage (TOS), 2016 Research Paper 2 High speed data processing demands high storage I/O performance. Flash memory

More information

Disks & Files. Yanlei Diao UMass Amherst. Slides Courtesy of R. Ramakrishnan and J. Gehrke

Disks & Files. Yanlei Diao UMass Amherst. Slides Courtesy of R. Ramakrishnan and J. Gehrke Disks & Files Yanlei Diao UMass Amherst Slides Courtesy of R. Ramakrishnan and J. Gehrke DBMS Architecture Query Parser Query Rewriter Query Optimizer Query Executor Lock Manager for Concurrency Access

More information

CS 3733 Operating Systems:

CS 3733 Operating Systems: CS 3733 Operating Systems: Topics: Memory Management (SGG, Chapter 08) Instructor: Dr Dakai Zhu Department of Computer Science @ UTSA 1 Reminders Assignment 2: extended to Monday (March 5th) midnight:

More information

6.033 Computer System Engineering

6.033 Computer System Engineering MIT OpenCourseWare http://ocw.mit.edu 6.033 Computer System Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.033 2009 Lecture

More information

CS 4284 Systems Capstone

CS 4284 Systems Capstone CS 4284 Systems Capstone Disks & File Systems Godmar Back Disks & Filesystems Disk Schematics Source: Micro House PC Hardware Library Volume I: Hard Drives 3 Tracks, Sectors, Cylinders 4 Hard Disk Example

More information

ASEP: An Adaptive Sequential Prefetching Scheme for Second-level Storage System

ASEP: An Adaptive Sequential Prefetching Scheme for Second-level Storage System ASEP: An Adaptive Sequential Prefetching Scheme for Second-level Storage System Xiaodong Shi Email: shixd.hust@gmail.com Dan Feng Email: dfeng@hust.edu.cn Wuhan National Laboratory for Optoelectronics,

More information

Database Systems. November 2, 2011 Lecture #7. topobo (mit)

Database Systems. November 2, 2011 Lecture #7. topobo (mit) Database Systems November 2, 2011 Lecture #7 1 topobo (mit) 1 Announcement Assignment #2 due today Assignment #3 out today & due on 11/16. Midterm exam in class next week. Cover Chapters 1, 2,

More information

Virtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili

Virtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili Virtual Memory Lecture notes from MKP and S. Yalamanchili Sections 5.4, 5.5, 5.6, 5.8, 5.10 Reading (2) 1 The Memory Hierarchy ALU registers Cache Memory Memory Memory Managed by the compiler Memory Managed

More information

Computer Systems Laboratory Sungkyunkwan University

Computer Systems Laboratory Sungkyunkwan University File System Internals Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics File system implementation File descriptor table, File table

More information

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2004 Lecture 18: Naming, Directories, and File Caching 18.0 Main Points How do users name files? What is a name? Lookup:

More information

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2002 Lecture 18: Naming, Directories, and File Caching 18.0 Main Points How do users name files? What is a name? Lookup:

More information

Operating Systems. Lecture File system implementation. Master of Computer Science PUF - Hồ Chí Minh 2016/2017

Operating Systems. Lecture File system implementation. Master of Computer Science PUF - Hồ Chí Minh 2016/2017 Operating Systems Lecture 7.2 - File system implementation Adrien Krähenbühl Master of Computer Science PUF - Hồ Chí Minh 2016/2017 Design FAT or indexed allocation? UFS, FFS & Ext2 Journaling with Ext3

More information

Operating Systems Design Exam 2 Review: Spring 2012

Operating Systems Design Exam 2 Review: Spring 2012 Operating Systems Design Exam 2 Review: Spring 2012 Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 Under what conditions will you reach a point of diminishing returns where adding more memory may improve

More information

Disk Scheduling COMPSCI 386

Disk Scheduling COMPSCI 386 Disk Scheduling COMPSCI 386 Topics Disk Structure (9.1 9.2) Disk Scheduling (9.4) Allocation Methods (11.4) Free Space Management (11.5) Hard Disk Platter diameter ranges from 1.8 to 3.5 inches. Both sides

More information

Disks, Memories & Buffer Management

Disks, Memories & Buffer Management Disks, Memories & Buffer Management The two offices of memory are collection and distribution. - Samuel Johnson CS3223 - Storage 1 What does a DBMS Store? Relations Actual data Indexes Data structures

More information

Chapter-6. SUBJECT:- Operating System TOPICS:- I/O Management. Created by : - Sanjay Patel

Chapter-6. SUBJECT:- Operating System TOPICS:- I/O Management. Created by : - Sanjay Patel Chapter-6 SUBJECT:- Operating System TOPICS:- I/O Management Created by : - Sanjay Patel Disk Scheduling Algorithm 1) First-In-First-Out (FIFO) 2) Shortest Service Time First (SSTF) 3) SCAN 4) Circular-SCAN

More information

Memory Management. Chapter 4 Memory Management. Multiprogramming with Fixed Partitions. Ideally programmers want memory that is.

Memory Management. Chapter 4 Memory Management. Multiprogramming with Fixed Partitions. Ideally programmers want memory that is. Chapter 4 Memory Management Ideally programmers want memory that is Memory Management large fast non volatile 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms

More information

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts Memory management Last modified: 26.04.2016 1 Contents Background Logical and physical address spaces; address binding Overlaying, swapping Contiguous Memory Allocation Segmentation Paging Structure of

More information

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Database Management Systems need to:

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Database Management Systems need to: Storing : Disks and Files base Management System, R. Ramakrishnan and J. Gehrke 1 Storing and Retrieving base Management Systems need to: Store large volumes of data Store data reliably (so that data is

More information

CHAPTER 8: MEMORY MANAGEMENT. By I-Chen Lin Textbook: Operating System Concepts 9th Ed.

CHAPTER 8: MEMORY MANAGEMENT. By I-Chen Lin Textbook: Operating System Concepts 9th Ed. CHAPTER 8: MEMORY MANAGEMENT By I-Chen Lin Textbook: Operating System Concepts 9th Ed. Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the

More information

EECS 482 Introduction to Operating Systems

EECS 482 Introduction to Operating Systems EECS 482 Introduction to Operating Systems Winter 2018 Baris Kasikci Slides by: Harsha V. Madhyastha OS Abstractions Applications Threads File system Virtual memory Operating System Next few lectures:

More information

Memory Management. Dr. Yingwu Zhu

Memory Management. Dr. Yingwu Zhu Memory Management Dr. Yingwu Zhu Big picture Main memory is a resource A process/thread is being executing, the instructions & data must be in memory Assumption: Main memory is infinite Allocation of memory

More information

Chapter 4 Memory Management. Memory Management

Chapter 4 Memory Management. Memory Management Chapter 4 Memory Management 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms 4.5 Modeling page replacement algorithms 4.6 Design issues for paging systems 4.7

More information

Disks and Files. Storage Structures Introduction Chapter 8 (3 rd edition) Why Not Store Everything in Main Memory?

Disks and Files. Storage Structures Introduction Chapter 8 (3 rd edition) Why Not Store Everything in Main Memory? Why Not Store Everything in Main Memory? Storage Structures Introduction Chapter 8 (3 rd edition) Sharma Chakravarthy UT Arlington sharma@cse.uta.edu base Management Systems: Sharma Chakravarthy Costs

More information

CS252 S05. Main memory management. Memory hardware. The scale of things. Memory hardware (cont.) Bottleneck

CS252 S05. Main memory management. Memory hardware. The scale of things. Memory hardware (cont.) Bottleneck Main memory management CMSC 411 Computer Systems Architecture Lecture 16 Memory Hierarchy 3 (Main Memory & Memory) Questions: How big should main memory be? How to handle reads and writes? How to find

More information

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes?

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes? Storing and Retrieving Storing : Disks and Files base Management Systems need to: Store large volumes of data Store data reliably (so that data is not lost!) Retrieve data efficiently Alternatives for

More information

File Systems. ECE 650 Systems Programming & Engineering Duke University, Spring 2018

File Systems. ECE 650 Systems Programming & Engineering Duke University, Spring 2018 File Systems ECE 650 Systems Programming & Engineering Duke University, Spring 2018 File Systems Abstract the interaction with important I/O devices Secondary storage (e.g. hard disks, flash drives) i.e.

More information

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Chapter 7

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Chapter 7 Storing : Disks and Files Chapter 7 base Management Systems, R. Ramakrishnan and J. Gehrke 1 Storing and Retrieving base Management Systems need to: Store large volumes of data Store data reliably (so

More information

Chapter 8: Memory-Management Strategies

Chapter 8: Memory-Management Strategies Chapter 8: Memory-Management Strategies Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and

More information

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes?

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes? Storing and Retrieving Storing : Disks and Files Chapter 9 base Management Systems need to: Store large volumes of data Store data reliably (so that data is not lost!) Retrieve data efficiently Alternatives

More information

Cache Performance (H&P 5.3; 5.5; 5.6)

Cache Performance (H&P 5.3; 5.5; 5.6) Cache Performance (H&P 5.3; 5.5; 5.6) Memory system and processor performance: CPU time = IC x CPI x Clock time CPU performance eqn. CPI = CPI ld/st x IC ld/st IC + CPI others x IC others IC CPI ld/st

More information

Background. 20: Distributed File Systems. DFS Structure. Naming and Transparency. Naming Structures. Naming Schemes Three Main Approaches

Background. 20: Distributed File Systems. DFS Structure. Naming and Transparency. Naming Structures. Naming Schemes Three Main Approaches Background 20: Distributed File Systems Last Modified: 12/4/2002 9:26:20 PM Distributed file system (DFS) a distributed implementation of the classical time-sharing model of a file system, where multiple

More information

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Memory Management 1 Hardware background The role of primary memory Program

More information

Computer Architecture and System Software Lecture 09: Memory Hierarchy. Instructor: Rob Bergen Applied Computer Science University of Winnipeg

Computer Architecture and System Software Lecture 09: Memory Hierarchy. Instructor: Rob Bergen Applied Computer Science University of Winnipeg Computer Architecture and System Software Lecture 09: Memory Hierarchy Instructor: Rob Bergen Applied Computer Science University of Winnipeg Announcements Midterm returned + solutions in class today SSD

More information

CS 525M Mobile and Ubiquitous Computing Seminar. Michael Theriault

CS 525M Mobile and Ubiquitous Computing Seminar. Michael Theriault CS 525M Mobile and Ubiquitous Computing Seminar Michael Theriault Software Strategies for Portable Computer Energy Management Paper by Jacob R. Lorch and Alan J. Smith at the University of California In

More information

Storing Data: Disks and Files

Storing Data: Disks and Files Storing Data: Disks and Files Chapter 7 (2 nd edition) Chapter 9 (3 rd edition) Yea, from the table of my memory I ll wipe away all trivial fond records. -- Shakespeare, Hamlet Database Management Systems,

More information

Basic Memory Management

Basic Memory Management Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester 10/15/14 CSC 2/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it

More information

CHAPTER 8 - MEMORY MANAGEMENT STRATEGIES

CHAPTER 8 - MEMORY MANAGEMENT STRATEGIES CHAPTER 8 - MEMORY MANAGEMENT STRATEGIES OBJECTIVES Detailed description of various ways of organizing memory hardware Various memory-management techniques, including paging and segmentation To provide

More information

Chapter 8: Main Memory

Chapter 8: Main Memory Chapter 8: Main Memory Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and 64-bit Architectures Example:

More information

Multimedia Streaming. Mike Zink

Multimedia Streaming. Mike Zink Multimedia Streaming Mike Zink Technical Challenges Servers (and proxy caches) storage continuous media streams, e.g.: 4000 movies * 90 minutes * 10 Mbps (DVD) = 27.0 TB 15 Mbps = 40.5 TB 36 Mbps (BluRay)=

More information

Quiz for Chapter 6 Storage and Other I/O Topics 3.10

Quiz for Chapter 6 Storage and Other I/O Topics 3.10 Date: 3.10 Not all questions are of equal difficulty. Please review the entire quiz first and then budget your time carefully. Name: Course: 1. [6 points] Give a concise answer to each of the following

More information

Virtual Memory Design and Implementation

Virtual Memory Design and Implementation Virtual Memory Design and Implementation To do q Page replacement algorithms q Design and implementation issues q Next: Last on virtualization VMMs Loading pages When should the OS load pages? On demand

More information

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. Motivation: Why Care About I/O? CPU Performance:

More information

Chapter 8: Main Memory. Operating System Concepts 9 th Edition

Chapter 8: Main Memory. Operating System Concepts 9 th Edition Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel

More information

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. CPU performance keeps increasing 26 72-core Xeon

More information

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced?

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced? Chapter 10: Virtual Memory Questions? CSCI [4 6] 730 Operating Systems Virtual Memory!! What is virtual memory and when is it useful?!! What is demand paging?!! When should pages in memory be replaced?!!

More information

Basic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1

Basic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it to be run Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Mono-programming

More information

ECE331: Hardware Organization and Design

ECE331: Hardware Organization and Design ECE331: Hardware Organization and Design Lecture 29: an Introduction to Virtual Memory Adapted from Computer Organization and Design, Patterson & Hennessy, UCB Overview Virtual memory used to protect applications

More information

File System Internals. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

File System Internals. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University File System Internals Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics File system implementation File descriptor table, File table

More information

Chapter 8: Main Memory

Chapter 8: Main Memory Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel

More information

Performance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit

Performance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit Memory Management All data in memory before and after processing All instructions in memory in order to execute Memory management determines what is to be in memory Memory management activities Keeping

More information

OS and Hardware Tuning

OS and Hardware Tuning OS and Hardware Tuning Tuning Considerations OS Threads Thread Switching Priorities Virtual Memory DB buffer size File System Disk layout and access Hardware Storage subsystem Configuring the disk array

More information

Chapter 9 Memory Management

Chapter 9 Memory Management Contents 1. Introduction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threads 6. CPU Scheduling 7. Process Synchronization 8. Deadlocks 9. Memory Management 10. Virtual

More information

Chapter 17: Distributed-File Systems. Operating System Concepts 8 th Edition,

Chapter 17: Distributed-File Systems. Operating System Concepts 8 th Edition, Chapter 17: Distributed-File Systems, Silberschatz, Galvin and Gagne 2009 Chapter 17 Distributed-File Systems Background Naming and Transparency Remote File Access Stateful versus Stateless Service File

More information

A Simulation: Improving Throughput and Reducing PCI Bus Traffic by. Caching Server Requests using a Network Processor with Memory

A Simulation: Improving Throughput and Reducing PCI Bus Traffic by. Caching Server Requests using a Network Processor with Memory Shawn Koch Mark Doughty ELEC 525 4/23/02 A Simulation: Improving Throughput and Reducing PCI Bus Traffic by Caching Server Requests using a Network Processor with Memory 1 Motivation and Concept The goal

More information

2. PICTURE: Cut and paste from paper

2. PICTURE: Cut and paste from paper File System Layout 1. QUESTION: What were technology trends enabling this? a. CPU speeds getting faster relative to disk i. QUESTION: What is implication? Can do more work per disk block to make good decisions

More information

Review 1-- Storing Data: Disks and Files

Review 1-- Storing Data: Disks and Files Review 1-- Storing Data: Disks and Files Chapter 9 [Sections 9.1-9.7: Ramakrishnan & Gehrke (Text)] AND (Chapter 11 [Sections 11.1, 11.3, 11.6, 11.7: Garcia-Molina et al. (R2)] OR Chapter 2 [Sections 2.1,

More information

Deploy a High-Performance Database Solution: Cisco UCS B420 M4 Blade Server with Fusion iomemory PX600 Using Oracle Database 12c

Deploy a High-Performance Database Solution: Cisco UCS B420 M4 Blade Server with Fusion iomemory PX600 Using Oracle Database 12c White Paper Deploy a High-Performance Database Solution: Cisco UCS B420 M4 Blade Server with Fusion iomemory PX600 Using Oracle Database 12c What You Will Learn This document demonstrates the benefits

More information

Principles of Data Management. Lecture #2 (Storing Data: Disks and Files)

Principles of Data Management. Lecture #2 (Storing Data: Disks and Files) Principles of Data Management Lecture #2 (Storing Data: Disks and Files) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Today s Topics v Today

More information

Storing Data: Disks and Files

Storing Data: Disks and Files Storing Data: Disks and Files Chapter 9 CSE 4411: Database Management Systems 1 Disks and Files DBMS stores information on ( 'hard ') disks. This has major implications for DBMS design! READ: transfer

More information

Chapter 5. Large and Fast: Exploiting Memory Hierarchy

Chapter 5. Large and Fast: Exploiting Memory Hierarchy Chapter 5 Large and Fast: Exploiting Memory Hierarchy Principle of Locality Programs access a small proportion of their address space at any time Temporal locality Items accessed recently are likely to

More information

OS and HW Tuning Considerations!

OS and HW Tuning Considerations! Administração e Optimização de Bases de Dados 2012/2013 Hardware and OS Tuning Bruno Martins DEI@Técnico e DMIR@INESC-ID OS and HW Tuning Considerations OS " Threads Thread Switching Priorities " Virtual

More information

CS510 Operating System Foundations. Jonathan Walpole

CS510 Operating System Foundations. Jonathan Walpole CS510 Operating System Foundations Jonathan Walpole File System Performance File System Performance Memory mapped files - Avoid system call overhead Buffer cache - Avoid disk I/O overhead Careful data

More information

Topics: Memory Management (SGG, Chapter 08) 8.1, 8.2, 8.3, 8.5, 8.6 CS 3733 Operating Systems

Topics: Memory Management (SGG, Chapter 08) 8.1, 8.2, 8.3, 8.5, 8.6 CS 3733 Operating Systems Topics: Memory Management (SGG, Chapter 08) 8.1, 8.2, 8.3, 8.5, 8.6 CS 3733 Operating Systems Instructor: Dr. Turgay Korkmaz Department Computer Science The University of Texas at San Antonio Office: NPB

More information

Systems Architecture II

Systems Architecture II Systems Architecture II Topics Interfacing I/O Devices to Memory, Processor, and Operating System * Memory-mapped IO and Interrupts in SPIM** *This lecture was derived from material in the text (Chapter

More information

CS6401- Operating System UNIT-III STORAGE MANAGEMENT

CS6401- Operating System UNIT-III STORAGE MANAGEMENT UNIT-III STORAGE MANAGEMENT Memory Management: Background In general, to rum a program, it must be brought into memory. Input queue collection of processes on the disk that are waiting to be brought into

More information

Chapter 8: Memory- Management Strategies. Operating System Concepts 9 th Edition

Chapter 8: Memory- Management Strategies. Operating System Concepts 9 th Edition Chapter 8: Memory- Management Strategies Operating System Concepts 9 th Edition Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation

More information

ECE 650 Systems Programming & Engineering. Spring 2018

ECE 650 Systems Programming & Engineering. Spring 2018 ECE 650 Systems Programming & Engineering Spring 2018 File Systems Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) File Systems Disks can do two things: read_block and write_block

More information

I/O Device Controllers. I/O Systems. I/O Ports & Memory-Mapped I/O. Direct Memory Access (DMA) Operating Systems 10/20/2010. CSC 256/456 Fall

I/O Device Controllers. I/O Systems. I/O Ports & Memory-Mapped I/O. Direct Memory Access (DMA) Operating Systems 10/20/2010. CSC 256/456 Fall I/O Device Controllers I/O Systems CS 256/456 Dept. of Computer Science, University of Rochester 10/20/2010 CSC 2/456 1 I/O devices have both mechanical component & electronic component The electronic

More information

CMSC 424 Database design Lecture 12 Storage. Mihai Pop

CMSC 424 Database design Lecture 12 Storage. Mihai Pop CMSC 424 Database design Lecture 12 Storage Mihai Pop Administrative Office hours tomorrow @ 10 Midterms are in solutions for part C will be posted later this week Project partners I have an odd number

More information

Conoscere e ottimizzare l'i/o su Linux. Andrea Righi -

Conoscere e ottimizzare l'i/o su Linux. Andrea Righi - Conoscere e ottimizzare l'i/o su Linux Agenda Overview I/O Monitoring I/O Tuning Reliability Q/A Overview File I/O in Linux READ vs WRITE READ synchronous: CPU needs to wait the completion of the READ

More information

CS 31: Intro to Systems Caching. Kevin Webb Swarthmore College March 24, 2015

CS 31: Intro to Systems Caching. Kevin Webb Swarthmore College March 24, 2015 CS 3: Intro to Systems Caching Kevin Webb Swarthmore College March 24, 205 Reading Quiz Abstraction Goal Reality: There is no one type of memory to rule them all! Abstraction: hide the complex/undesirable

More information

Chapter 8 & Chapter 9 Main Memory & Virtual Memory

Chapter 8 & Chapter 9 Main Memory & Virtual Memory Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array

More information

L7: Performance. Frans Kaashoek Spring 2013

L7: Performance. Frans Kaashoek Spring 2013 L7: Performance Frans Kaashoek kaashoek@mit.edu 6.033 Spring 2013 Overview Technology fixes some performance problems Ride the technology curves if you can Some performance requirements require thinking

More information

Topics. File Buffer Cache for Performance. What to Cache? COS 318: Operating Systems. File Performance and Reliability

Topics. File Buffer Cache for Performance. What to Cache? COS 318: Operating Systems. File Performance and Reliability Topics COS 318: Operating Systems File Performance and Reliability File buffer cache Disk failure and recovery tools Consistent updates Transactions and logging 2 File Buffer Cache for Performance What

More information

Operating Systems. Week 9 Recitation: Exam 2 Preview Review of Exam 2, Spring Paul Krzyzanowski. Rutgers University.

Operating Systems. Week 9 Recitation: Exam 2 Preview Review of Exam 2, Spring Paul Krzyzanowski. Rutgers University. Operating Systems Week 9 Recitation: Exam 2 Preview Review of Exam 2, Spring 2014 Paul Krzyzanowski Rutgers University Spring 2015 March 27, 2015 2015 Paul Krzyzanowski 1 Exam 2 2012 Question 2a One of

More information

Outlines. Chapter 2 Storage Structure. Structure of a DBMS (with some simplification) Structure of a DBMS (with some simplification)

Outlines. Chapter 2 Storage Structure. Structure of a DBMS (with some simplification) Structure of a DBMS (with some simplification) Outlines Chapter 2 Storage Structure Instructor: Churee Techawut 1) Structure of a DBMS 2) The memory hierarchy 3) Magnetic tapes 4) Magnetic disks 5) RAID 6) Disk space management 7) Buffer management

More information

Embedded Systems Dr. Santanu Chaudhury Department of Electrical Engineering Indian Institute of Technology, Delhi

Embedded Systems Dr. Santanu Chaudhury Department of Electrical Engineering Indian Institute of Technology, Delhi Embedded Systems Dr. Santanu Chaudhury Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 13 Virtual memory and memory management unit In the last class, we had discussed

More information

Operating Systems. Operating Systems Professor Sina Meraji U of T

Operating Systems. Operating Systems Professor Sina Meraji U of T Operating Systems Operating Systems Professor Sina Meraji U of T How are file systems implemented? File system implementation Files and directories live on secondary storage Anything outside of primary

More information

The Google File System

The Google File System October 13, 2010 Based on: S. Ghemawat, H. Gobioff, and S.-T. Leung: The Google file system, in Proceedings ACM SOSP 2003, Lake George, NY, USA, October 2003. 1 Assumptions Interface Architecture Single

More information

SRM-Buffer: An OS Buffer Management SRM-Buffer: An OS Buffer Management Technique toprevent Last Level Cache from Thrashing in Multicores

SRM-Buffer: An OS Buffer Management SRM-Buffer: An OS Buffer Management Technique toprevent Last Level Cache from Thrashing in Multicores SRM-Buffer: An OS Buffer Management SRM-Buffer: An OS Buffer Management Technique toprevent Last Level Cache from Thrashing in Multicores Xiaoning Ding The Ohio State University dingxn@cse.ohiostate.edu

More information

Introduction to OpenMP. Lecture 10: Caches

Introduction to OpenMP. Lecture 10: Caches Introduction to OpenMP Lecture 10: Caches Overview Why caches are needed How caches work Cache design and performance. The memory speed gap Moore s Law: processors speed doubles every 18 months. True for

More information

APP: MINIMIZING INTERFERENCE USING AGGRESSIVEPIPELINED PREFETCHING IN MULTI-LEVEL BUFFER CACHES

APP: MINIMIZING INTERFERENCE USING AGGRESSIVEPIPELINED PREFETCHING IN MULTI-LEVEL BUFFER CACHES APP: MINIMIZING INTERFERENCE USING AGGRESSIVEPIPELINED PREFETCHING IN MULTI-LEVEL BUFFER CACHES Christina M. Patrick Pennsylvania State University patrick@cse.psu.edu Nicholas Voshell Pennsylvania State

More information

FILE SYSTEMS, PART 2. CS124 Operating Systems Fall , Lecture 24

FILE SYSTEMS, PART 2. CS124 Operating Systems Fall , Lecture 24 FILE SYSTEMS, PART 2 CS124 Operating Systems Fall 2017-2018, Lecture 24 2 Last Time: File Systems Introduced the concept of file systems Explored several ways of managing the contents of files Contiguous

More information

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568 UNIVERSITY OF MASSACHUSETTS Dept of Electrical & Computer Engineering Computer Architecture ECE 568 art 5 Input/Output Israel Koren ECE568/Koren art5 CU performance keeps increasing 26 72-core Xeon hi

More information

Parser. Select R.text from Report R, Weather W where W.image.rain() and W.city = R.city and W.date = R.date and R.text.

Parser. Select R.text from Report R, Weather W where W.image.rain() and W.city = R.city and W.date = R.date and R.text. Select R.text from Report R, Weather W where W.image.rain() and W.city = R.city and W.date = R.date and R.text. Lifecycle of an SQL Query CSE 190D base System Implementation Arun Kumar Query Query Result

More information

Virtual Memory Management

Virtual Memory Management Virtual Memory Management CS-3013 Operating Systems Hugh C. Lauer (Slides include materials from Slides include materials from Modern Operating Systems, 3 rd ed., by Andrew Tanenbaum and from Operating

More information