NDLI: Interposed proportional sharing for a storage service utility

Content Provider	ACM Digital Library
Author	Kaur, Jasleen Chase, Jeffrey S. Jin, Wei
Abstract	This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resource control makes it possible to share a server among multiple request flows with probabilistic assurance that each flow receives a specified minimum share of a server's capacity to serve requests. This assurance is important for safe outsourcing of services to shared utilities such as Storage Service Providers.Our approach interposes share-based request dispatching on the network path between the server and its clients. Two new scheduling algorithms are designed to run within an intermediary (e.g., a network switch), where they enforce fair sharing by throttling request flows and reordering requests; these algorithms are adaptations of Start-time Fair Queuing (SFQ) for servers with a configurable degree of internal concurrency. A third algorithm, Request Windows (RW), bounds the outstanding requests for each flow independently; it is amenable to a decentralized implementation, but may restrict concurrency under light load. The analysis and experimental results show that these new algorithms can enforce shares effectively when the shares are not saturated, and that they provide acceptable performance isolation under saturation. Although the evaluation uses a storage service as an example, interposed request scheduling is non-intrusive and views the server as a black box, so it is useful for complex services with no internal support for differentiated service quality.
Starting Page	37
Ending Page	48
Page Count	12
File Format	PDF
ISSN	01635999
DOI	10.1145/1012888.1005694
Journal	ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number	32
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Multiprocessor scheduling Differentiated service Quality of service Utility computing Weighted fair queuing Storage services Fair sharing Performance isolation Proportional sharing
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Interposed proportional sharing for a storage service utility

Weighted fair sharing for dynamic virtual clusters

An interposed 2-Level I/O scheduling framework for performance virtualization

Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling

Supporting Differentiated Services with Fairness by an Urgency Fair Queuing Scheduling Scheme in EPONs

Web switch support for differentiated services

A case for relative differentiated services and the proportional differentiation model

Weighted proportional allocation

Interposed proportional sharing for a storage service utility

Similar Documents

Interposed proportional sharing for a storage service utility

Weighted fair sharing for dynamic virtual clusters

An interposed 2-Level I/O scheduling framework for performance virtualization

Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling

Supporting Differentiated Services with Fairness by an Urgency Fair Queuing Scheduling Scheme in EPONs

Web switch support for differentiated services

A case for relative differentiated services and the proportional differentiation model

Weighted proportional allocation

Interposed proportional sharing for a storage service utility