NDLI: Providing fairness on shared-memory multiprocessors via process scheduling

Please wait, while we are loading the content...

Performance implications of flash and storage class memories

Delay tails in MapReduce scheduling

Workload analysis of a large-scale key-value store

Energy-efficient congestion control

How well can congestion pricing neutralize denial of service attacks?

Temperature management in data centers: why some (might) like it hot

Rumor centrality: a universal source detector

What is a good buffer cache replacement scheme for mobile flash storage?

Does lean imply green?: a study of the power performance implications of Java runtime bloat

Characterizing continuous time random walks on time varying graphs

Don't let the negatives bring you down: sampling from streams of signed updates

TCAM-based NFA implementation

Micro and macro views of discrete-state markov models and their application to efficient simulation with phase-type distributions

High-performance computing in mobile services

Optimal queue-size scaling in switched networks

A first look at cellular machine-to-machine traffic: large scale measurement and characterization

Uniform approximation of the distribution for the number of retransmissions of bounded documents

Pricing cloud bandwidth reservations under demand uncertainty

Renewable and cooling aware workload management for sustainable data centers

Learning the graph of epidemic cascades

Versatile refresh: low complexity refresh scheduling for high-throughput multi-banked eDRAM

D-factor: a quantitative model of application slow-down in multi-resource shared systems

Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling

Efficient rank aggregation using partial data

Stable and efficient pricing for inter-domain traffic forwarding

POTRA: a framework for building power models for next generation multicore architectures

Minimizing slowdown in heterogeneous size-aware dispatching systems

Bundling practice in BitTorrent: what, how, and why

Fluid limit of an asynchronous optical packet switch with shared per link full range wavelength conversion

Energy storage in datacenters: what, where, and how much?

Network forensics: random infection vs spreading epidemic

ADP: automated diagnosis of performance pathologies using hardware events

Clustered embedding of massive social networks

Fair sampling across network flow measurements

Measuring and characterizing home networks

Basic theory and some applications of martingales

Bipartite graph structures for efficient balancing of heterogeneous loads

Towards optimal error-estimating codes through the lens of Fisher information analysis

Providing fairness on shared-memory multiprocessors via process scheduling

Comparing metro-area cellular and WiFi performance: extended abstract

Applications of machine learning to performance evaluation

Towards a statistical characterization of the competitiveness of oblivious routing

Introduction to network experiments using the GENI cyberinfrastructure

Range tomography

A scalable architecture for maintaining packet latency measurements

Modeling randomness in network traffic

Performance evaluation of the random replacement policy for networks of caches

Saving on cooling: the thermal scheduling problem

Congestion control meets medium access: throughput, delay, and complexity

Optimized cloud placement of virtual clusters using biased importance sampling

Power and energy containers for multicore servers

Characterizing the impact of the workload on the value of dynamic resizing in data centers

Provisioning for large scale cloud computing services

Distributed wide-area traffic management for cloud services

On the efficacy of fine-grained traffic splitting protocols in data center networks

Content-aware traffic engineering

Understanding performance anomalies of SSDs and their impact in enterprise application environment

Classifying internet one-way traffic

Fast cost efficient designs by building upon the plackett and burman method

Multi-hop network tomography: path reconstruction and per-hop arrival time estimation from partial information

Smartphones vs. laptops: comparing web browsing behavior and the implications for caching

Providing fairness on shared-memory multiprocessors via process scheduling

Content Provider	ACM Digital Library
Author	Li, Jianjun Yew, Pen-Chung Xu, Di Wang, Zhenjiang Wu, Chenggang
Abstract	Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbates the need for Quality of Service (QoS) on such systems. In this paper, we propose a fair-progress process scheduling (FPS) policy to improve system fairness. Its strategy is to force the equally-weighted applications to have the same amount of slowdown when they run concurrently. The basic approach is to monitor the progress of all applications at runtime. When we find an application suffered more slowdown and accumulated less effective work than others, we allocate more CPU time to give it a better parity. Our policy also allows different weights to different threads, and provides an effective and robust tuner that allows the OS to freely make tradeoffs between system fairness and higher throughput. Evaluation results show that FPS can significantly improve system fairness by an average of 53.5% and 65.0% on a 4-core processor with a private cache and a 4-core processor with a shared cache, respectively. The penalty is about 1.1% and 1.6% of the system throughput. For memory-intensive workloads, FPS also improves system fairness by an average of 45.2% and 21.1% on 4-core and 8-core system respectively at the expense of a throughput loss of about 2%.
Starting Page	295
Ending Page	306
Page Count	12
File Format	PDF
ISBN	9781450310970
DOI	10.1145/2254756.2254792
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Memory bandwidth Process scheduling Performance fairness
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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