walking toward moving goalposts agile management for
play

Walking toward moving goalposts: agile management for evolving - PowerPoint PPT Presentation

Walking toward moving goalposts: agile management for evolving systems Richard Golding, Theodore Wong IBM Almaden Research Center 16 June 2006 1 Main points Bolt-on management considered harmful Proponents of building self-management


  1. Walking toward moving goalposts: agile management for evolving systems Richard Golding, Theodore Wong IBM Almaden Research Center 16 June 2006 1

  2. Main points • Bolt-on management considered harmful • Proponents of building self-management into system • Bolt-on = management separate from and external to system under management • An architecture pattern for building distributed systems: layering and federation • Investigating simplest possible specifications 2

  3. Research direction • Self-management without a central management authority • In a storage system as an example • Can we make a system administratorless? • Almost all storage systems use centralized management • Metadata server • Exception is peer-to-peer... but most of those are limited in function (e.g. read-only) 3

  4. Why is this decentralization worth while? • Some environments require it • Cooperating organizations—no single business authority • On-demand provisioning from competing service bureaux • Possible route to aligning vendor economic incentives • Systems do get smarter over time • Currently: system vendors have incentive for incompatible differentiation • Can a higher-level standardized interface help? 4

  5. Architecture: layering • For any given problem: • Delegate to lower level? • Use global view of higher level? Higher layer Lower layer 5

  6. Simplest possible specification • Desire for human understandability • How well will it go if we start from minimum possible? • Existing storage management started from high-fidelity • Is directionally accurate sufficient? 90% solution? Iterative tuning? • Can we mask local complexity? • Makes global decision algorithms easier • Smart local resource management 6

  7. K2 distributed storage system • Vehicle for research— not a product • No central administration; federate when global view needed • Delegate function to as low a level as possible • Provide support to higher-level application management Node Resource pool AP 7

  8. Resource pools: external view • A virtual collection of storage • One per user or application • Each pool is independent • Specified by: • Capacity, Performance, Reliability • Reserve and limit • Initially: capacity = bytes; performance = IO/s; reliability = MTTDL 8

  9. Implementing pools allocation pool storage server placed resource pool requirements backed on + usage by resource usage requirements physical capacity object performance reliability uses user application requirements + usage virtual object resource (e.g. file) usage physical object • Virtual pool backed by physical allocation pools • Pools contain objects for storing user data • Decision algorithm: how much to put where • Storage server enforces resource allocation 9

  10. Resource allocation decisions: normal Available server resources Pool resource requirement 0.5P P 0.5P Server 1 Server 2 Constraints: at least 2 servers at most 3 servers Server 3 Server 4 • Normal case: online decision for one pool • Creating or modifying a pool’s requirements • Load balancing • Use constrained multidimensional bin packing • Constraints derived from reliability requirements 10

  11. Resource allocation decisions: failure • Multi-pool assignment required • Backtracking search for feasible solution (better is possible) 200 200 200 200 spare 50 50 50 50 pool 1 75 75 (150) pool 2 75 75 (150) pool 3 75 75 (150) pool 4 75 75 (150) 11

  12. Resource allocation decisions: failure • Multi-pool assignment required • Backtracking search for feasible solution (better is possible) 200 200 200 200 spare 50 50 50 50 pool 1 50 75 to 50 75 to 50 50 50 (150) pool 2 75 75 75 (150) pool 3 75 75 (150) pool 4 75 75 75 (150) 12

  13. Making decisions 3. acquire candidate 1. vote allocation allocation manager pool pool 4. heartbeat 2. candidate 1. vote 1. vote wins election candidate allocation manager pool 2. candidate allocation loses election pool • Each resource pool is an independent group • APs elect a manager; manager watches over pool • Manager is disposable • Manager runs decision algorithm • All information in allocation pools 13

  14. Local resource management • Goal: isolation between pools sessions • Capacity: just accounting L R F L R F L R F • Performance: requires scheduler • Tradeoff: performance pools L R F L R F vs. efficiency • Provides reserve and limit, plus fair sharing disk queue • Working to add cache, network disk 14

  15. Contacts and information • Richard Golding rgolding@us.ibm.com http://soe.ucsc.edu/~golding • Theodore Wong theowong@us.ibm.com http://www.tmwong.org 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend