qos support for intelligent storage devices
play

QoS support for Intelligent Storage Devices Joel Wu Scott Brandt - PowerPoint PPT Presentation

QoS support for Intelligent Storage Devices Joel Wu Scott Brandt Department of Computer Science University of California Santa Cruz ISW 04 UC Santa Cruz Background Motivation Mixed-Workload Requirement Traffic Shaping Results General


  1. QoS support for Intelligent Storage Devices Joel Wu Scott Brandt Department of Computer Science University of California Santa Cruz ISW 04 UC Santa Cruz

  2. Background Motivation Mixed-Workload Requirement Traffic Shaping Results � General purpose systems today expected to handle heterogeneous workloads • best-effort • soft real-time (multimedia) � Existing systems employ best-effort resource management � Requirements are met by over-provisioning � Lots of research on mixed-workload CPU scheduling • Processor Capacity Reserve • Hierarchical Scheduling • SMART • Rialto • RBED � Having QoS-aware CPU scheduler alone is not sufficient 2

  3. Background Motivation Storage as bottleneck Traffic Shaping Results � Many soft real-time applications are storage-bound • Large data needs • Must access storage continuously and timely • Toleration of some missed deadlines � Storage may become bottleneck � Storage can dictate progress of soft real-time applications � Question: How to support storage-bound SRT applications in a mixed-workload environment? � Lots of research on real-time storage • Disk scheduling • Admission Control • Data Placement • File System 3

  4. Background Storage QoS through Motivation Traffic Shaping Disk Scheduling Results � Most work on QoS for direct-attached storage focused on the use of QoS-aware disk schedulers � Disk scheduling: ordering of disk requests • balance between response time and throughput • access time = seek time + rotational latency + transfer time • Exploit geometric property of disk � More detailed knowledge allows more aggressive utilization � Disk scheduling is NP-Complete, stateful, and non- preemptable. � Three types of disk schedulers: • Best-Effort: SCAN, LOOK, C-SCAN/LOOK, V-SCAN • Real-Time: EDF, SCAN-EDF • Mixed-Workloads: Cello 4

  5. Background Motivation Issues with disk scheduling Traffic Shaping Results � Effective scheduling of disk requests with deadlines require fine-grained knowledge of disk drive internals • Disk model needed for accurate prediction of service time. • Accuracy of model determines effectiveness of scheduler. � Disk profiling: Required parameters must be extracted from the disk drive � Trends in drive design • Increasing intelligence and autonomy • Encapsulation of internal complexities • Evolving interface 5

  6. Background Motivation Problems Traffic Shaping Results � Challenges faced by external disk scheduler [Lumb02]: • Coarse observation • Rotational offset • Onboard caching • Drive internal scheduling • Autonomous internal disk activities � Complexity of external disk scheduler increases � Disk drives are becoming intelligent and autonomous units, but fine-grained external disk schedulers still try to retain control over every step of its operation � Fine-grained external disk scheduling possible now, but may become infeasible in future as drives become ever more intelligent � Alternative way to provide QoS for storage? 6

  7. Background Motivation Traffic Shaping: Concept Traffic Shaping Results � Our Proposal: Traffic shaping above external disk scheduler � By adjusting resource usage, best-effort scheduler can provide reasonable soft real-time performance if resource usage is less than 100% [Brandt98] File System File System Block Driver Block Driver traffic shaper QoS-aware disk vs. Best-Effort disk scheduler scheduler internal internal scheduler scheduler disk disk QoS through disk scheduling QoS through traffic shaping 7

  8. Background Motivation Traffic Shaping: Detail Traffic Shaping Results � Bandwidth management above external disk scheduler • Coarse-grained view. • Treats disk drive as a black box • Can work with any underlying best-effort disk scheduler • Simple. Clean. • Independent of disk properties � Components • Bandwidth Control Mechanism – traffic shaping • Policy: reservation/feedback based 8

  9. Background Motivation Traffic Shaping: Implementation Traffic Shaping Results r � Use token bucket filter (TBF), a technique for traffic shaping in networking, to control disk bandwidth. Each unit of data needs a token in B order to pass � Differentiate disk requests: • Best-effort (BE) • Soft real-time (SRT) data data � Associate disk request with type of issuing process • Explicit: API • Implicit: BEST heuristic � BE pipe: aggregate disk traffic from all BE processes � SRT pipe: aggregate disk traffic from all SRT processes 9

  10. Background Motivation Missed Deadline Notification Traffic Shaping Results � Give SRT requests preferential handling by throttling the rate BE processes can issue requests � When to throttle BE request rate? � Missed Deadline Notification (MDN) • Signify the inability to access data on disk in time. • Reduce BE pipe size in order to boost SRT pipe size. 10

  11. Background Motivation Missed Deadline Notification Traffic Shaping Results soft real-time processes external Missed Deadline disk disk Notification scheduler best-effort TBF processes 11

  12. Background Motivation Increasing token rate Traffic Shaping Results � MDN decreases BE pipe size and increases SRT pipe size. � Also need a way to decrease SRT pipe size and increase BE pipe size � Two options considered: • Optimistic: Continuously increase token rate over time. Pessimistic: Increase only when the aggregate SRT bandwidth changes. 12

  13. Background Motivation Implementation Traffic Shaping Results � Implemented on Linux 2.6 � One TBF and wait queue for each block device request queue � Kernel thread to handle token replenishment � API for SRT declaration and MDN � Associate request with issuing process. � Synthetic application for testing 13

  14. Background Motivation Normal Linux behavior Traffic Shaping Results Four 8 MB/s streams – no boosting CR stream 1 (8 MB/s) 14 CR stream 2 (8 MB/s) CR stream 3 (8 MB/s) CR stream 4 (8 MB/s) 12 10 Throughput (MB/s) 8 6 4 2 0 0 20 40 60 80 100 120 140 160 180 Time (s) 14

  15. Background Motivation Fixed token rate Traffic Shaping Results Four 8 MB/s streams - stream 1 boosted, cap BE token rate (90 req/s) SRT boosted CR stream 1 (8 MB/s) 14 CR stream 2 (8 MB/s) CR stream 3 (8 MB/s) CR stream 4 (8 MB/s) 12 10 Throughput (MB/s) 8 6 4 2 0 0 20 40 60 80 100 120 140 160 180 Time (s) 15

  16. Background Motivation Fixed token rate Traffic Shaping Results Four 8 MB/s streams - stream 1 boosted, cap BE token rate (50 req/s) SRT boosted CR stream 1 (8 MB/s) 14 CR stream 2 (8 MB/s) CR stream 3 (8 MB/s) CR stream 4 (8 MB/s) 12 10 Throughput (MB/s) 8 6 4 2 0 0 20 40 60 80 100 120 140 160 180 Time (s) 16

  17. Background Motivation Feedback based - optimistic Traffic Shaping Results Four 8 MB/s streams – stream 1 boosted SRT boosted CR stream 1 (8 MB/s) 14 CR stream 2 (8 MB/s) CR stream 3 (8 MB/s) CR stream 4 (8 MB/s) 12 10 Throughput (MB/s) 8 6 4 2 0 0 20 40 60 80 100 120 140 160 180 Time (s) 17

  18. Background Motivation Feedback based - pessimistic Traffic Shaping Results Four 8 MB/s streams – stream 1 boosted SRT boosted CR stream 1 (8 MB/s) 14 CR stream 2 (8 MB/s) CR stream 3 (8 MB/s) CR stream 4 (8 MB/s) 12 10 Throughput (MB/s) 8 6 4 2 0 0 20 40 60 80 100 120 140 160 180 Time (s) 18

  19. Background Motivation Result (1) – Total Throughput Traffic Shaping Results Max throughput of disk ~ 27.59 MB/s for sequential read Method Total Throughput No boosting – normal Linux behavior 16.80 MB/s Fixed token rate – 90 tokens per second 17.25 MB/s +3% Fixed token rate – 50 tokens per second 14.71 MB/s -12% Feedback-based, optimistic 15.85 MB/s -5.65% Feedback-based, pessimistic 14.48 MB/s -13.8% � Traffic shaping can actually increase total throughput in some situations � Pessimistic method is more aggressive at boosting SRT stream, resulting in less total throughput 19

  20. Conclusion � Future intelligent disks invalidate the use of external disk schedulers for QoS � Traffic shaping is a feasible alternative • Avoids complexity of fine-grained disk scheduling • Feedback scheme requires no a-priori knowledge on resource requirements • Small loss of throughput 20

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