Efficient QoS for Multi-Tiered Storage Systems
|
|
- Dorothy Johnson
- 5 years ago
- Views:
Transcription
1 Efficient QoS for Multi-Tiered Storage Systems Ahmed Elnably Hui Wang Peter Varman Rice University Ajay Gulati VMware Inc
2 Tiered Storage Architecture Client Multi-Tiered Array Client 2 Scheduler SSDs... Client n HDs Problem: How to provide QoS in this environment? 2
3 Fair Scheduling Example Allocate IOs in proportion of client weights w = Client Multi-Tiered Array SSD ms FS w 2 = Client 2 HD 0ms How will Fair Scheduling behave in a multi-tiered storage architecture? 3
4 Fair Scheduling Example Time = 0 ms Client Multi-Tiered Array w = SSD ms FS w 2 = Client HD 0ms 4
5 Fair Scheduling Example Time = ms Client Multi-Tiered Array w = SSD ms FS 2 w 2 = Client HD 0ms 5
6 Fair Scheduling Example Time = 2 ms Client Multi-Tiered Array w = SSD ms FS 2 w 2 = Client HD 0ms Issue: Low utilization SSD will idle for 9 out of 0 ms 6
7 Fair Scheduling in Multi-Tier Is the behavior of FS reasonable? The answer is simply NO! 7
8 Time Slice Schedulers Allocate time quantum in proportion of client weights w = Client Multi-Tiered Array SSD Time Slice w 2 = Client 2 HD 8
9 Time Slice Schedulers Allocate time quantum in proportion of client weights w = Client Multi-Tiered Array SSD Time Slice w 2 = Client 2 HD Issue: Low utilization Both devices will idle for large intervals 9
10 Queue Based Schedulers Allocate queue slots in proportion of client weights w = 2 Client Multi-Tiered Array SSD Queue Based w 2 = Client 2 HD 0
11 Queue Based Schedulers Allocate queue slots in proportion of client weights w = 2 Client Multi-Tiered Array SSD Queue Based w 2 = Client 2 HD Issue: Static queues can cause low utilization Empty slots are not getting re-used
12 Agenda Problem Motivation Reward Scheduling Preliminary Evaluation Open Issues & Conclusion 2
13 Reward Allocation Policy Goals Provide QoS (fairness) Higher system throughput / device utilization 3
14 Reward Scheduling Key Ideas: Reward clients with cheaper IOs Track IO latency of each client separately Try to allocate in the ratio of clients throughput if running alone (entitlement) 4
15 Algorithm Details Tag based scheduling Each client queue has a tag Tag represents scheduling priority Scheduler selects queue with smallest tag Monitor service time of client requests Increment tags using Measured service time of client Weight of the client 5
16 Algorithm Details Φ j : Measured service time of completing request of client j UpdateServiceTime (j, Φ j ) Average of the service time of client j over window 6
17 Reward Scheduling Time = 0 ms Client Multi-Tiered Array w = w 2 = Client RS 2 SSD ms HD 0ms 7
18 Reward Scheduling Time = ms Client Multi-Tiered Array w = w 2 = Client RS SSD ms HD 0ms Higher utilization Client with lower latency gets higher effective weight 8
19 Agenda Problem Motivation Reward Scheduling Preliminary Evaluation Open Issues & Conclusion 9
20 Two implementations Simulation-based Experimental Setup Linux-based evaluation (Interposing a reward scheduler in user space) Three different cases Variable hit ratios Variable read-write ratio Variable weights (In paper) 20
21 Reward Scheduling vs. CFQ 2
22 Reward Scheduling vs. CFQ 22
23 Reward Scheduling vs. CFQ Isolation between workloads Higher system throughput 23
24 Variable Hit Rate Client A Multi-Tiered Array SSD 0.2ms RS Client B HD 0ms 24
25 Variable Hit Rate Simulation system Entitlement of A = 5000 IOPS Entitlement of B = 5000 IOPS Ratio A:B = 5000:5000 : 25
26 Variable Hit Rate Simulation system Entitlement of A = 5000 IOPS Entitlement of B = 200 IOPS Ratio A:B = 5000 : : 26
27 Linux-based evaluation Variable Hit Rate Simulation system 27
28 Variable Read-Write Ratio 28
29 Variable Read-Write Ratio Queue = 29
30 Variable Read-Write Ratio Queue = 8 Differentiation became less due to queuing delay 30
31 Agenda Problem Motivation Reward Scheduling Preliminary Evaluation Open Issues & Conclusion 3
32 Open Issues Better measurement of response time Isolating queuing delay Can we make queue-slot based technique work? Interaction between cache management and scheduling 32
33 Conclusion Existing approaches are insufficient Reward based allocation policy is an alternative Other approaches can potentially work We hope to encourage future work in this area Questions 33
Balancing Fairness and Efficiency in Tiered Storage Systems with Bottleneck-Aware Allocation
Balancing Fairness and Efficiency in Tiered Storage Systems with Bottleneck-Aware Allocation Hui Wang, Peter Varman Rice University FAST 14, Feb 2014 Tiered Storage Tiered storage: HDs and SSDs q Advantages:
More informationPARDA: Proportional Allocation of Resources for Distributed Storage Access
PARDA: Proportional Allocation of Resources for Distributed Storage Access Ajay Gulati, Irfan Ahmad, Carl Waldspurger Resource Management Team VMware Inc. USENIX FAST 09 Conference February 26, 2009 The
More informationBalancing Fairness and Efficiency in Tiered Storage Systems with Bottleneck-Aware Allocation
Balancing Fairness and Efficiency in Tiered Storage Systems with Bottleneck-Aware Allocation Hui Wang and Peter Varman, Rice University https://www.usenix.org/conference/fast14/technical-sessions/presentation/wang
More informationNested QoS: Providing Flexible Performance in Shared IO Environment
Nested QoS: Providing Flexible Performance in Shared IO Environment Hui Wang Peter Varman Rice University Houston, TX 1 Outline Introduction System model Analysis Evaluation Conclusions and future work
More informationOASIS: Self-tuning Storage for Applications
OASIS: Self-tuning Storage for Applications Kostas Magoutis, Prasenjit Sarkar, Gauri Shah 14 th NASA Goddard- 23 rd IEEE Mass Storage Systems Technologies, College Park, MD, May 17, 2006 Outline Motivation
More informationEnlightening the I/O Path: A Holistic Approach for Application Performance
Enlightening the I/O Path: A Holistic Approach for Application Performance Sangwook Kim 13, Hwanju Kim 2, Joonwon Lee 3, and Jinkyu Jeong 3 Apposha 1 Dell EMC 2 Sungkyunkwan University 3 Data-Intensive
More informationCS 326: Operating Systems. CPU Scheduling. Lecture 6
CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating
More informationNetwork Support for Multimedia
Network Support for Multimedia Daniel Zappala CS 460 Computer Networking Brigham Young University Network Support for Multimedia 2/33 make the best of best effort use application-level techniques use CDNs
More informationPerformance Evaluation of Virtualization Technologies
Performance Evaluation of Virtualization Technologies Saad Arif Dept. of Electrical Engineering and Computer Science University of Central Florida - Orlando, FL September 19, 2013 1 Introduction 1 Introduction
More informationImproving Disk I/O Performance on Linux. Carl Henrik Lunde, Håvard Espeland, Håkon Kvale Stensland, Andreas Petlund, Pål Halvorsen
Improving Disk I/O Performance on Linux Carl Henrik Lunde, Håvard Espeland, Håkon Kvale Stensland, Completely Fair Queuing Default scheduler on Linux Ensures complete fairness among I/O-requests in the
More informationImproving Performance using the LINUX IO Scheduler Shaun de Witt STFC ISGC2016
Improving Performance using the LINUX IO Scheduler Shaun de Witt STFC ISGC2016 Role of the Scheduler Optimise Access to Storage CPU operations have a few processor cycles (each cycle is < 1ns) Seek operations
More informationPerformance Implications of Storage I/O Control Enabled NFS Datastores in VMware vsphere 5.0
Performance Implications of Storage I/O Control Enabled NFS Datastores in VMware vsphere 5.0 Performance Study TECHNICAL WHITE PAPER Table of Contents Introduction... 3 Executive Summary... 3 Terminology...
More informationHard Disk Drives. Nima Honarmand (Based on slides by Prof. Andrea Arpaci-Dusseau)
Hard Disk Drives Nima Honarmand (Based on slides by Prof. Andrea Arpaci-Dusseau) Storage Stack in the OS Application Virtual file system Concrete file system Generic block layer Driver Disk drive Build
More informationmclock: Handling Throughput Variability for Hypervisor IO Scheduling
mclock: Handling Throughput Variability for Hypervisor IO Scheduling Ajay Gulati Arif Merchant Peter Varman VMware Inc HP Labs Rice University agulati@vmware.com arif@hpl.hp.com pjv@rice.edu Abstract Virtualized
More informationLies, Damn Lies and Performance Metrics. PRESENTATION TITLE GOES HERE Barry Cooks Virtual Instruments
Lies, Damn Lies and Performance Metrics PRESENTATION TITLE GOES HERE Barry Cooks Virtual Instruments Goal for This Talk Take away a sense of how to make the move from: Improving your mean time to innocence
More informationNested QoS: Providing Flexible Performance in Shared IO Environment
Nested QoS: Providing Flexible Performance in Shared IO Environment Hui Wang Peter Varman hw5@rice.edu pjv@rice.edu Rice University, USA Abstract The increasing popularity of storage and server consolidation
More informationDuy Le (Dan) - The College of William and Mary Hai Huang - IBM T. J. Watson Research Center Haining Wang - The College of William and Mary
Duy Le (Dan) - The College of William and Mary Hai Huang - IBM T. J. Watson Research Center Haining Wang - The College of William and Mary Virtualization Games Videos Web Games Programming File server
More informationCourse Syllabus. Operating Systems
Course Syllabus. Introduction - History; Views; Concepts; Structure 2. Process Management - Processes; State + Resources; Threads; Unix implementation of Processes 3. Scheduling Paradigms; Unix; Modeling
More informationOracle Flash Storage System QoS Plus Operation and Best Practices ORACLE WHITE PAPER OCTOBER 2016
Oracle Flash Storage System QoS Plus Operation and Best Practices ORACLE WHITE PAPER OCTOBER 2016 Table of Contents Introduction 1 When to Use Auto-Tiering 1 Access Skews 1 Consistent Access 2 Recommendations
More informationA Comparison of Capacity Management Schemes for Shared CMP Caches
A Comparison of Capacity Management Schemes for Shared CMP Caches Carole-Jean Wu and Margaret Martonosi Princeton University 7 th Annual WDDD 6/22/28 Motivation P P1 P1 Pn L1 L1 L1 L1 Last Level On-Chip
More informationMethodology for Performance Improvement of Future Request Predicting Disk Scheduler for Virtualization
Methodology for Performance Improvement of Future Request Predicting Disk Scheduler for Virtualization Ashwini Meshram Department of Computer Science and Engineering G.H.Raisoni College of Engineering,
More informationTypical scenario in shared infrastructures
Got control? AutoControl: Automated Control of MultipleVirtualized Resources Pradeep Padala, Karen Hou, Xiaoyun Zhu*, Mustfa Uysal, Zhikui Wang, Sharad Singhal, Arif Merchant, Kang G. Shin University of
More informationCPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University
Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads
More informationManaging Performance Variance of Applications Using Storage I/O Control
Performance Study Managing Performance Variance of Applications Using Storage I/O Control VMware vsphere 4.1 Application performance can be impacted when servers contend for I/O resources in a shared storage
More informationRecovering Disk Storage Metrics from low level Trace events
Recovering Disk Storage Metrics from low level Trace events Progress Report Meeting May 05, 2016 Houssem Daoud Michel Dagenais École Polytechnique de Montréal Laboratoire DORSAL Agenda Introduction and
More informationToward SLO Complying SSDs Through OPS Isolation
Toward SLO Complying SSDs Through OPS Isolation October 23, 2015 Hongik University UNIST (Ulsan National Institute of Science & Technology) Sam H. Noh 1 Outline Part 1: FAST 2015 Part 2: Beyond FAST 2
More information[537] RAID. Tyler Harter
[537] RAID Tyler Harter Review Disks/Devices Device Protocol Variants Status checks: polling vs. interrupts Data: PIO vs. DMA Control: special instructions vs. memory-mapped I/O Disks Doing an I/O requires:
More informationEmpirical Evaluation of Latency-Sensitive Application Performance in the Cloud
Empirical Evaluation of Latency-Sensitive Application Performance in the Cloud Sean Barker and Prashant Shenoy University of Massachusetts Amherst Department of Computer Science Cloud Computing! Cloud
More informationPerformance Evaluation of Scheduling Mechanisms for Broadband Networks
Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph
More informationUsing Transparent Compression to Improve SSD-based I/O Caches
Using Transparent Compression to Improve SSD-based I/O Caches Thanos Makatos, Yannis Klonatos, Manolis Marazakis, Michail D. Flouris, and Angelos Bilas {mcatos,klonatos,maraz,flouris,bilas}@ics.forth.gr
More informationMaking Storage Smarter Jim Williams Martin K. Petersen
Making Storage Smarter Jim Williams Martin K. Petersen Agenda r Background r Examples r Current Work r Future 2 Definition r Storage is made smarter by exchanging information between the application and
More informationIO Priority: To The Device and Beyond
IO Priority: The Device and Beyond Adam Manzanares Filip Blagojevic Cyril Guyot 2017 Western Digital Corporation or its affiliates. All rights reserved. 7/24/17 1 The Relationship of Throughput and Latency
More informationCSCE Operating Systems Scheduling. Qiang Zeng, Ph.D. Fall 2018
CSCE 311 - Operating Systems Scheduling Qiang Zeng, Ph.D. Fall 2018 Resource Allocation Graph describing the traffic jam CSCE 311 - Operating Systems 2 Conditions for Deadlock Mutual Exclusion Hold-and-Wait
More informationPerformance Isolation in Multi- Tenant Relational Database-asa-Service. Sudipto Das (Microsoft Research)
Performance Isolation in Multi- Tenant Relational Database-asa-Service Sudipto Das (Microsoft Research) CREATE DATABASE CREATE TABLE SELECT... INSERT UPDATE SELECT * FROM FOO WHERE App1 App2 App3 App1
More informationOverview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services
Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling
More informationNo Tradeoff Low Latency + High Efficiency
No Tradeoff Low Latency + High Efficiency Christos Kozyrakis http://mast.stanford.edu Latency-critical Applications A growing class of online workloads Search, social networking, software-as-service (SaaS),
More informationSWAP: EFFECTIVE FINE-GRAIN MANAGEMENT
: EFFECTIVE FINE-GRAIN MANAGEMENT OF SHARED LAST-LEVEL CACHES WITH MINIMUM HARDWARE SUPPORT Xiaodong Wang, Shuang Chen, Jeff Setter, and José F. Martínez Computer Systems Lab Cornell University Page 1
More informationOn the Accuracy and Scalability of Intensive I/O Workload Replay
On the Accuracy and Scalability of Intensive I/O Workload Replay Alireza Haghdoost, Weiping He, Jerry Fredin *, David H.C. Du University of Minnesota, * NetApp Inc. Center for Research in Intelligent Storage
More informationComputer Science 4500 Operating Systems
Computer Science 4500 Operating Systems Module 6 Process Scheduling Methods Updated: September 25, 2014 2008 Stanley A. Wileman, Jr. Operating Systems Slide 1 1 In This Module Batch and interactive workloads
More informationSubject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date:
Subject Name: OPERATING SYSTEMS Subject Code: 10EC65 Prepared By: Kala H S and Remya R Department: ECE Date: Unit 7 SCHEDULING TOPICS TO BE COVERED Preliminaries Non-preemptive scheduling policies Preemptive
More information8: Scheduling. Scheduling. Mark Handley
8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by
More informationExample: CPU-bound process that would run for 100 quanta continuously 1, 2, 4, 8, 16, 32, 64 (only 37 required for last run) Needs only 7 swaps
Interactive Scheduling Algorithms Continued o Priority Scheduling Introduction Round-robin assumes all processes are equal often not the case Assign a priority to each process, and always choose the process
More informationVMWARE VREALIZE OPERATIONS MANAGEMENT PACK FOR. Dell EMC VMAX. User Guide
VMWARE VREALIZE OPERATIONS MANAGEMENT PACK FOR Dell EMC VMAX User Guide TABLE OF CONTENTS 1. Purpose...3 2. Introduction to the Management Pack...3 2.1 How the Management Pack Collects Data...3 2.2 Data
More informationForget IOPS: A Proper Way to Characterize & Test Storage Performance Peter Murray SwiftTest
Forget IOPS: A Proper Way to Characterize & Test Storage Performance Peter Murray peter@swifttest.com SwiftTest Storage Performance Validation Rely on vendor IOPS claims Test in production and pray Validate
More informationHigh Performance Solid State Storage Under Linux
High Performance Solid State Storage Under Linux Eric Seppanen, Matthew T. O Keefe, David J. Lilja Electrical and Computer Engineering University of Minnesota April 20, 2010 Motivation SSDs breaking through
More informationLecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.
Lecture 21 Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov. 7 http://money.cnn.com/2011/11/07/technology/juniper_internet_outage/
More informationCascade Mapping: Optimizing Memory Efficiency for Flash-based Key-value Caching
Cascade Mapping: Optimizing Memory Efficiency for Flash-based Key-value Caching Kefei Wang and Feng Chen Louisiana State University SoCC '18 Carlsbad, CA Key-value Systems in Internet Services Key-value
More informationEpisode 5. Scheduling and Traffic Management
Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Keshav Chapter 9.1, 9.2, 9.3, 9.4, 9.5.1, 13.3.4 ECE 1771: Quality
More informationCPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)
CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process
More informationAzor: Using Two-level Block Selection to Improve SSD-based I/O caches
Azor: Using Two-level Block Selection to Improve SSD-based I/O caches Yannis Klonatos, Thanos Makatos, Manolis Marazakis, Michail D. Flouris, Angelos Bilas {klonatos, makatos, maraz, flouris, bilas}@ics.forth.gr
More informationScheduling II. Today. Next Time. ! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling. !
Scheduling II Today! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling Next Time! Memory management Scheduling with multiple goals! What if you want both good turnaround
More informationOPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5
OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:
More informationMQSim: A Framework for Enabling Realistic Studies of Modern Multi-Queue SSD Devices
MQSim: A Framework for Enabling Realistic Studies of Modern Multi-Queue SSD Devices Arash Tavakkol, Juan Gómez-Luna, Mohammad Sadrosadati, Saugata Ghose, Onur Mutlu February 13, 2018 Executive Summary
More informationshaping tomorrow with you Eternus VVOL Matthias Bothe Fujitsu Technology Solutions
shaping tomorrow with you Eternus VVOL Matthias Bothe 0 2015 Fujitsu Technology Solutions Agenda What are Virtual Volumes? Advantages of VVOLs Technical implementation of VVOL for ETERNUS Usage 1 2015
More informationLast class: Today: CPU Scheduling. CPU Scheduling Algorithms and Systems
1 Last class: CPU Scheduling Today: CPU Scheduling Algorithms and Systems 2 Scheduling Algorithms First-come, First-serve (FCFS) Non-preemptive Does not account for waiting time (or much else) Convoy problem
More informationFairness in the IEEE network. Shun Y. Cheung
Fairness in the IEEE 802.11 network Shun Y. Cheung Simple FIFO queueing High data rate flow Output queue (infinite size) Low data rate flow Packets from low data rate flow experience excessive queueing
More informationThe Missing Piece of Virtualization. I/O Virtualization on 10 Gb Ethernet For Virtualized Data Centers
The Missing Piece of Virtualization I/O Virtualization on 10 Gb Ethernet For Virtualized Data Centers Agenda 10 GbE Adapters Built for Virtualization I/O Throughput: Virtual & Non-Virtual Servers Case
More informationSolid State Storage is Everywhere Where Does it Work Best?
Solid State Storage is Everywhere Where Does it Work Best? Dennis Martin, President, Demartek www.storagedecisions.com Agenda Demartek About Us Solid-state storage overview Different places to deploy SSD
More informationComparing Performance of Solid State Devices and Mechanical Disks
Comparing Performance of Solid State Devices and Mechanical Disks Jiri Simsa Milo Polte, Garth Gibson PARALLEL DATA LABORATORY Carnegie Mellon University Motivation Performance gap [Pugh71] technology
More informationDecibel: Isolation and Sharing in Disaggregated Rack-Scale Storage
Decibel: Isolation and Sharing in Disaggregated Rack-Scale Storage Mihir Nanavati, Jake Wires, and Andrew Warfield (Coho Data and University of British Columbia) Redundancy and high availability Transparent
More informationVirtual Storage Tier and Beyond
Virtual Storage Tier and Beyond Manish Agarwal Sr. Product Manager, NetApp Santa Clara, CA 1 Agenda Trends Other Storage Trends and Flash 5 Min Rule Issues for Flash Dedupe and Flash Caching Architectural
More informationEECS750: Advanced Operating Systems. 2/24/2014 Heechul Yun
EECS750: Advanced Operating Systems 2/24/2014 Heechul Yun 1 Administrative Project Feedback of your proposal will be sent by Wednesday Midterm report due on Apr. 2 3 pages: include intro, related work,
More informationRicardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Slides based on the book Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter B. Galvin and Greg Gagne,
More informationDecoupling Datacenter Studies from Access to Large-Scale Applications: A Modeling Approach for Storage Workloads
Decoupling Datacenter Studies from Access to Large-Scale Applications: A Modeling Approach for Storage Workloads Christina Delimitrou 1, Sriram Sankar 2, Kushagra Vaid 2, Christos Kozyrakis 1 1 Stanford
More informationProcess Scheduling. Copyright : University of Illinois CS 241 Staff
Process Scheduling Copyright : University of Illinois CS 241 Staff 1 Process Scheduling Deciding which process/thread should occupy the resource (CPU, disk, etc) CPU I want to play Whose turn is it? Process
More informationUsing Synology SSD Technology to Enhance System Performance Synology Inc.
Using Synology SSD Technology to Enhance System Performance Synology Inc. Synology_WP_ 20121112 Table of Contents Chapter 1: Enterprise Challenges and SSD Cache as Solution Enterprise Challenges... 3 SSD
More informationECE 30 Introduction to Computer Engineering
ECE 0 Introduction to Computer Engineering Study Problems, Set #9 Spring 01 1. Given the following series of address references given as word addresses:,,, 1, 1, 1,, 8, 19,,,,, 7,, and. Assuming a direct-mapped
More informationCPU THREAD PRIORITIZATION USING A DYNAMIC QUANTUM TIME ROUND-ROBIN ALGORITHM
CPU THREAD PRIORITIZATION USING A DYNAMIC QUANTUM TIME ROUND-ROBIN ALGORITHM Maysoon A. Mohammed 1, 2, Mazlina Abdul Majid 1, Balsam A. Mustafa 1 and Rana Fareed Ghani 3 1 Faculty of Computer System &
More informationComputer Networking. Queue Management and Quality of Service (QOS)
Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you
More informationSoftware optimization technique for the reduction page fault to increase the processor performance
Software optimization technique for the reduction page fault to increase the processor performance Jisha P.Abraham #1, Sheena Mathew *2 # Department of Computer Science, Mar Athanasius College of Engineering,
More informationReal-Time Internet of Things
Real-Time Internet of Things Chenyang Lu Cyber-Physical Systems Laboratory h7p://www.cse.wustl.edu/~lu/ Internet of Things Ø Convergence of q Miniaturized devices: integrate processor, sensors and radios.
More informationExporting the DS8000 Performance Summary
Exporting the DS8000 Performance Summary Paul Spagnolo pgspagn@us.ibm.com Storage ATS IBM Washington Systems Center - Storage Agenda What is the DS8000 Performance Summary? Offloading the Performance Summary
More informationIdentifying Performance Bottlenecks with Real- World Applications and Flash-Based Storage
Identifying Performance Bottlenecks with Real- World Applications and Flash-Based Storage TechTarget Dennis Martin 1 Agenda About Demartek Enterprise Data Center Environments Storage Performance Metrics
More informationEpisode 5. Scheduling and Traffic Management
Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling
More informationIBM System Storage DS8870 Release R7.3 Performance Update
IBM System Storage DS8870 Release R7.3 Performance Update Enterprise Storage Performance Yan Xu Agenda Summary of DS8870 Hardware Changes I/O Performance of High Performance Flash Enclosure (HPFE) Easy
More informationKey metrics for effective storage performance and capacity reporting
Key metrics for effective storage performance and capacity reporting Key Metrics for Effective Storage Performance and Capacity Reporting Objectives This white paper will cover the key metrics in storage
More informationModification and Evaluation of Linux I/O Schedulers
Modification and Evaluation of Linux I/O Schedulers 1 Asad Naweed, Joe Di Natale, and Sarah J Andrabi University of North Carolina at Chapel Hill Abstract In this paper we present three different Linux
More informationSwapping. Operating Systems I. Swapping. Motivation. Paging Implementation. Demand Paging. Active processes use more physical memory than system has
Swapping Active processes use more physical memory than system has Operating Systems I Address Binding can be fixed or relocatable at runtime Swap out P P Virtual Memory OS Backing Store (Swap Space) Main
More informationdavidklee.net gplus.to/kleegeek linked.com/a/davidaklee
@kleegeek davidklee.net gplus.to/kleegeek linked.com/a/davidaklee Specialties / Focus Areas / Passions: Performance Tuning & Troubleshooting Virtualization Cloud Enablement Infrastructure Architecture
More informationStressRight: Finding the Right Stress for Accurate In-development System Evaluation
StressRight: Finding the Right Stress for Accurate In-development System Evaluation Jaewon Lee 1, Hanhwi Jang 1, Jae-eon Jo 1, Gyu-Hyeon Lee 2, Jangwoo Kim 2 High Performance Computing Lab Pohang University
More informationMERC. User Guide. For Magento 2.X. Version P a g e
MERC User Guide For Magento 2.X Version 1.0.0 http://litmus7.com/ 1 P a g e Table of Contents Table of Contents... 2 1. Introduction... 3 2. Requirements... 4 3. Installation... 4 4. Configuration... 4
More informationENSC 427 Communication Networks Final Project Presentation Spring Comparison and analysis of FIFO, PQ, and WFQ Disciplines in OPNET
1 ENSC 427 Communication Networks Final Project Presentation Spring 2011 Comparison and analysis of FIFO, PQ, and WFQ Disciplines in OPNET 2 Shadi: Shadi: Presentation Structure Introduction Background
More informationSELF-LEARNING CACHES IRFAN AHMAD CACHEPHYSICS. Copyright 2017 CachePhysics.
SELF-LEARNING CACHES IRFAN AHMAD CACHEPHYSICS Copyright 217 CachePhysics. ABOUT CachePhysics Irfan Ahmad CachePhysics Cofounder CloudPhysics Cofounder VMware (Kernel, Resource Management), Transmeta, 3+
More informationSIMULATION-BASED COMPARISON OF SCHEDULING TECHNIQUES IN MULTIPROGRAMMING OPERATING SYSTEMS ON SINGLE AND MULTI-CORE PROCESSORS *
SIMULATION-BASED COMPARISON OF SCHEDULING TECHNIQUES IN MULTIPROGRAMMING OPERATING SYSTEMS ON SINGLE AND MULTI-CORE PROCESSORS * Hala ElAarag, David Bauschlicher, and Steven Bauschlicher Department of
More informationTDDD82 Secure Mobile Systems Lecture 6: Quality of Service
TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani
More informationEfficient and Adaptive Proportional Share I/O Scheduling
Efficient and Adaptive Proportional Share I/O Scheduling Abstract In most data centers, terabytes of storage are commonly shared among tens to hundreds of hosts for universal access and economies of scaling.
More informationRicardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Slides based on the book Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter B. Galvin and Greg Gagne,
More informationLecture 11: SMT and Caching Basics. Today: SMT, cache access basics (Sections 3.5, 5.1)
Lecture 11: SMT and Caching Basics Today: SMT, cache access basics (Sections 3.5, 5.1) 1 Thread-Level Parallelism Motivation: a single thread leaves a processor under-utilized for most of the time by doubling
More informationCS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University OpenMP compiler directives
More informationIntroduction. Application Performance in the QLinux Multimedia Operating System. Solution: QLinux. Introduction. Outline. QLinux Design Principles
Application Performance in the QLinux Multimedia Operating System Sundaram, A. Chandra, P. Goyal, P. Shenoy, J. Sahni and H. Vin Umass Amherst, U of Texas Austin ACM Multimedia, 2000 Introduction General
More informationò mm_struct represents an address space in kernel ò task represents a thread in the kernel ò A task points to 0 or 1 mm_structs
Last time We went through the high-level theory of scheduling algorithms Scheduling Today: View into how Linux makes its scheduling decisions Don Porter CSE 306 Lecture goals Understand low-level building
More informationWORKLOAD CHARACTERIZATION OF INTERACTIVE CLOUD SERVICES BIG AND SMALL SERVER PLATFORMS
WORKLOAD CHARACTERIZATION OF INTERACTIVE CLOUD SERVICES ON BIG AND SMALL SERVER PLATFORMS Shuang Chen*, Shay Galon**, Christina Delimitrou*, Srilatha Manne**, and José Martínez* *Cornell University **Cavium
More informationScheduling. Don Porter CSE 306
Scheduling Don Porter CSE 306 Last time ò We went through the high-level theory of scheduling algorithms ò Today: View into how Linux makes its scheduling decisions Lecture goals ò Understand low-level
More informationW4118: advanced scheduling
W4118: advanced scheduling Instructor: Junfeng Yang References: Modern Operating Systems (3 rd edition), Operating Systems Concepts (8 th edition), previous W4118, and OS at MIT, Stanford, and UWisc Outline
More informationQUESTION BANK UNIT I
QUESTION BANK Subject Name: Operating Systems UNIT I 1) Differentiate between tightly coupled systems and loosely coupled systems. 2) Define OS 3) What are the differences between Batch OS and Multiprogramming?
More informationCSE 123b Communications Software
CSE 123b Communications Software Spring 2002 Lecture 10: Quality of Service Stefan Savage Today s class: Quality of Service What s wrong with Best Effort service? What kinds of service do applications
More informationAN ALTERNATIVE TO ALL- FLASH ARRAYS: PREDICTIVE STORAGE CACHING
AN ALTERNATIVE TO ALL- FLASH ARRAYS: PREDICTIVE STORAGE CACHING THE EASIEST WAY TO INCREASE PERFORMANCE AND LOWER STORAGE COSTS Bruce Kornfeld, Chief Marketing Officer, StorMagic Luke Pruen, Technical
More informationBlock Device Driver. Pradipta De
Block Device Driver Pradipta De pradipta.de@sunykorea.ac.kr Today s Topic Block Devices Structure of devices Kernel components I/O Scheduling USB Device Driver Basics CSE506: Block Devices & IO Scheduling
More informationCSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling
CSE120 Principles of Operating Systems Prof Yuanyuan (YY) Zhou Scheduling Announcement l Homework 2 due on October 26th l Project 1 due on October 27th 2 Scheduling Overview l In discussing process management
More informationVDBENCH Overview. Steven Johnson. SNIA Emerald TM Training. SNIA Emerald Power Efficiency Measurement Specification, for use in EPA ENERGY STAR
VDBENCH Overview PRESENTATION TITLE GOES HERE Steven Johnson SNIA Emerald TM Training SNIA Emerald Power Efficiency Measurement Specification, for use in EPA ENERGY STAR June 24-27, 2013 Agenda Introduction
More information