NDLI: Nearly insensitive bounds on SMART scheduling

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

Coupon replication systems

Internet traffic classification using bayesian analysis techniques

On the performance characteristics of WLANs: revisited

Empirical evaluation of multi-level buffer cache collaboration for storage systems

Optimal insensitive routing and bandwidth sharing in simple data networks

Why is the internet traffic bursty in short time scales?

Network utility maximization with nonconcave, coupled, and reliability-based uilities

A network service curve approach for the stochastic analysis of networks

Efficient algorithms for large-scale topology discovery

Rate-adaptive time synchronization for long-lived sensor networks

Google: or how I learned to love terabytes

Low traffic overlay networks with large routing tables

A data streaming algorithm for estimating subpopulation flow size distribution

Fixed point analysis of single cell IEEE 802.11e WLANs: uniqueness, multistability and throughput differentiation

The performance impact of kernel prefetching on buffer cache replacement algorithms

Nearly insensitive bounds on SMART scheduling

Fundamental bounds on the accuracy of network performance measurements

Optimization model of internet protocols

An analytical model for multi-tier internet services and its applications

On AS-level path inference

Introducing permuted states for analyzing conflict rates in optimistic replication

On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks

Packet classification in large ISPs: design and evaluation of decision tree classifiers

Modeling epidemic information dissemination on mobile devices with finite buffers

Fast data-locality profiling of native execution

Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing

End-to-end estimation of the available bandwidth variation range

Optimization and Control of Communication Networks

Managing server energy and operational costs in hosting centers

Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices

Predicting node availability in peer-to-peer networks

Denial-of-service resilience in peer-to-peer file sharing systems

A robust system for accurate real-time summaries of internet traffic

Algorithmic aspects of capacity in wireless networks

Automatic measurement of memory hierarchy parameters

Classifying scheduling policies with respect to higher moments of conditional response time

An optimization based approach for cross-layer design in wireless communication networks

Evaluating the impact of simultaneous multithreading on network servers using real hardware

Traffic matrices: balancing measurements, inference and modeling

Troubleshooting multihop wireless networks

Achieving fair rates with ingress policing

Fair operation of multi-server and multi-queue systems

Joint pricing-network design and stochastic traffic engineering to manage demand uncertainty

Deadline scheduling for animation rendering

Smooth switching problem in buffered crossbar switches

Prediction of TCP throughput: formula-based and history-based methods

A statistical framework for efficient monitoring of end-to-end network properties

TBBT: scalable and accurate trace replay for file server evaluation

On the use of anycast in DNS

Managing memory access latency in packet processing

Some observations on bitTorrent performance

Theory and practice of cross-traffic estimation

Characterizing the two-tier gnutella topology

Analysis of search and replication in unstructured peer-to-peer networks

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

TurboSMARTS: accurate microarchitecture simulation sampling in minutes

A reactive channel model for expediting wireless network simulation

Message delay in MANET

Nearly insensitive bounds on SMART scheduling

Content Provider	ACM Digital Library
Author	Harchol-Balter, Mor Wierman, Adam Osogami, Takayuki
Abstract	We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.
Starting Page	205
Ending Page	216
Page Count	12
File Format	PDF
ISBN	1595930221
DOI	10.1145/1064212.1064236
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-06-06
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Shortest remaining processing time Ps M/g/1 Srpt Response time Psjf Scheduling Processor sharing Smart Preemptive shortest job first
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