Weighted Available Space Selection Fixing write pool selection Mattias Wadenstein Gerd Behrmann

Slides:



Advertisements
Similar presentations
Traffic Dynamics at a Commercial Backbone POP Nina Taft Sprint ATL Co-authors: Supratik Bhattacharyya, Jorjeta Jetcheva, Christophe Diot.
Advertisements

Paging: Design Issues. Readings r Silbershatz et al: ,
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Network Bandwidth Allocation (and Stability) In Three Acts.
Sept 23, 2004CS573: Network Protocols and Standards D – Expedited Traffic Network Protocols and Standards Autumn
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
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Applying Control Theory to Stream Processing Systems Wei Xu Bill Kramer Joe Hellerstein.
Routing Protocols Heng Sovannarith
Database Management Systems, R. Ramakrishnan and J. Gehrke1 Tree-Structured Indexes Chapter 9.
PETAL: DISTRIBUTED VIRTUAL DISKS E. K. Lee C. A. Thekkath DEC SRC.
RAMCloud Design Review Recovery Ryan Stutsman April 1,
1 The Google File System Reporter: You-Wei Zhang.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 Distributed Operating Systems and Process Scheduling Brett O’Neill CSE 8343 – Group A6.
Chapter 3.5 Memory and I/O Systems. 2 Memory Management Memory problems are one of the leading causes of bugs in programs (60-80%) MUCH worse in languages.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Copyright © 2006 by Maribeth H. Price 2-1 Chapter 2 Working with ArcMap.
Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel.
Computing Infrastructure for Large Ecommerce Systems -- based on material written by Jacob Lindeman.
D C a c h e Michael Ernst Patrick Fuhrmann Tigran Mkrtchyan d C a c h e M. Ernst, P. Fuhrmann, T. Mkrtchyan Chep 2003 Chep2003 UCSD, California.
Introduction to dCache Zhenping (Jane) Liu ATLAS Computing Facility, Physics Department Brookhaven National Lab 09/12 – 09/13, 2005 USATLAS Tier-1 & Tier-2.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
SRM Monitoring 12 th April 2007 Mirco Ciriello INFN-Pisa.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
AMQP, Message Broker Babu Ram Dawadi. overview Why MOM architecture? Messaging broker like RabbitMQ in brief RabbitMQ AMQP – What is it ?
Lecture 7 Page 1 CS 111 Summer 2013 Another Option Fixed partition allocations result in internal fragmentation – Processes don’t use all of the fixed.
Hashing by Rafael Jaffarove CS157b. Motivation  Fast data access  Search  Insertion  Deletion  Ideal seek time is O(1)
14.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 10 & 11: File-System Interface and Implementation.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—6-1 Scaling Service Provider Networks Scaling IGP and BGP in Service Provider Networks.
1 i206: Lecture 12: Hash Tables (Dictionaries); Intro to Recursion Marti Hearst Spring 2012.
2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
Handling of T1D0 in CCRC’08 Tier-0 data handling Tier-1 data handling Experiment data handling Reprocessing Recalling files from tape Tier-0 data handling,
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Tree-Structured Indexes. Introduction As for any index, 3 alternatives for data entries k*: – Data record with key value k –  Choice is orthogonal to.
DCache.ORG Fuhrman n Wuppertal Atlas GridKa Cloud dCache.ORG dCache best practice additional funding, support or contributions by d-grid DGI.
Memory Management.
Chapter 2 Memory and process management
Threads vs. Events SEDA – An Event Model 5204 – Operating Systems.
Data Structure Interview Question and Answers
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
Abhishek Singh Rana UC San Diego
SRM2 Migration Strategy
CS 425 / ECE 428 Distributed Systems Fall 2017 Nov 16, 2017
Storage Virtualization
Page Replacement.
System Structure and Process Model
CS222/CS122C: Principles of Data Management Notes #07 B+ Trees
CSE 451: Operating Systems Winter 2009 Module 13 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
Bridging the Information Gap in Storage Protocol Stacks
Mark Zbikowski and Gary Kimura
CSE 451: Operating Systems Autumn 2004 Redundant Arrays of Inexpensive Disks (RAID) Hank Levy 1.
CSE 451: Operating Systems Winter 2012 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
VDL Mode 4 Performance Simulator (DLS enhancements) presented by EUROCONTROL Montreal, 26 October 2004.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. I propose ‘extent of resource pooling’
CSE 451: Operating Systems Winter 2004 Module 17 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
CS222/CS122C: Principles of Data Management UCI, Fall 2018 Notes #06 B+ trees Instructor: Chen Li.
CS222P: Principles of Data Management UCI, Fall Notes #06 B+ trees
VDL Mode 4 Performance Simulator (DLS enhancements) presented by EUROCONTROL Montreal, 26 October 2004.
The Design and Implementation of a Log-Structured File System
Presentation transcript:

Weighted Available Space Selection Fixing write pool selection Mattias Wadenstein Gerd Behrmann

Static pool selection By VO By user By type of data By path By protocol By network Static routing table maps transfers to a set of pools

Dynamic pool selection By size By free space By age By load By queue length By queue capacity

Outline Both static and dynamic pool selection is pluggable in dCache. This talk is about dynamic pool selection of write pools. Read pool selection is interesting too, but usually constrained by only having one or few copies of a file. What are the problems with the traditional pool selection in dCache? What can be done to solve them?

Desirable properties Must balance load Avoids temporal clumping of files Is unaffected by disk partioning Work for heterogeneous pools Pool size Throughput Spindles Age Backs off in case of overload Takes age into account for garbage collection Avoids oscilations Is distributed Maintains performance over time (no phase transitions)

Issues with pool selection Difficult to tune

Issues with pool selection Difficult to tune Write clumping

Issues with pool selection Difficult to tune Write clumping Cost linked to concurrency limits Hot reads push away writes

Issues with pool selection Difficult to tune Write clumping Cost linked to concurrency limits Hot reads push away writes Non-linear shift when pool becomes full

Issues with pool selection Difficult to tune Write clumping Cost linked to concurrency limits Hot reads push away writes Non-linear shift when pool becomes full Tends to operate in modes Requires up-to-date information Stability issues

WASS Weighted Available Space Selection

Removable space

Weighted Available Space Selection Exponential decay of removable space

Space cost factor

Weighted Available Space Selection Exponential decay of removable space

Performance cost factor

Parameters Break even Performance cost factor Mover cost factor CPU cost factor Space cost factor

Summary Default in dCache 2.2 for new systems Has been used at NDGF for 8 months (and has worked well) Should work well with default values Accuracy of removable space aging can be improved