Operating systems
Modern operating systems
Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Load-balancing heuristics and process behavior
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Operating System Concepts
Scheduling Strategy to improve Response Time for Web Applications
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Analysis of M/G/1/SRPT under transient overload
ACM SIGMETRICS Performance Evaluation Review
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Analysis of methods for scheduling low priority disk drive tasks
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling flows with unknown sizes: approximate analysis
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Evaluation of packet scheduling algorithms in mobile ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Modeling and performance analysis of QoS-aware load balancing of web-server clusters
Computer Networks: The International Journal of Computer and Telecommunications Networking
SRPT Scheduling for Web Servers
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Resource Allocation with Persistent and Transient Flows
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fairness and efficiency in web server protocols
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Wireless downlink data channels: user performance and cell dimensioning
Proceedings of the 9th annual international conference on Mobile computing and networking
Mixed scheduling disciplines for network flows
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Revisiting correlations and scheduling in Web servers
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
Understanding web server configuration issues
Software—Practice & Experience - Special issue: Web technologies
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
On the relationship between coefficient of variation and the performance of M/G/1-FB queues
ACM SIGMETRICS Performance Evaluation Review
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair operation of multi-server and multi-queue systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Resource allocation between persistent and transient flows
IEEE/ACM Transactions on Networking (TON)
Looking at the server side of peer-to-peer systems
LCR '04 Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
Queueing Systems: Theory and Applications
Online feedback-based estimation of dynamic page service time
ACM SIGBED Review
Revisiting unfairness in web server scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sojourn times in (discrete) time shared systems and their continuous time limits
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Tail equivalence for some time-shared systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Comparing FB and PS scheduling policies
ACM SIGMETRICS Performance Evaluation Review
Task assignment with work-conserving migration
Parallel Computing
Channel time allocation scheme based on feedback information in IEEE 802.11e wireless LANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SQF: A slowdown queueing fairness measure
Performance Evaluation
Towards Scheduling Virtual Machines Based On Direct User Input
VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
Hardware counter driven on-the-fly request signatures
Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Asymptotic properties of sojourn times in multiclass time-shared systems
Probability in the Engineering and Informational Sciences
Coscheduled distributed-Web servers on system area network
Journal of Parallel and Distributed Computing
Improving peer-to-peer performance through server-side scheduling
ACM Transactions on Computer Systems (TOCS)
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications
Dynamic thread assignment in web server performance optimization
Performance Evaluation
Hardware task scheduling and placement in operating systems for dynamically reconfigurable SoC
Journal of Embedded Computing - Selected papers of EUC 2005
Quantifying fairness in queuing systems: Principles, approaches, and applicability
Probability in the Engineering and Informational Sciences
State-dependent response times via fluid limits in shortest remaining processing time queues
ACM SIGMETRICS Performance Evaluation Review
Analysis of round-robin variants: favoring newly arrived jobs
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Multi-service load sharing for resource management in the cellular/WLAN integrated network
IEEE Transactions on Wireless Communications
Fluid Limits for Shortest Remaining Processing Time Queues
Mathematics of Operations Research
Differential equation models of flow-size based priorities in internet routers
International Journal of Systems, Control and Communications
Design and implementation of a generic resource sharing virtual time dispatcher
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Capacity estimation in HPC systems: simulation approach
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Review: Task assignment policies in distributed server systems: A survey
Journal of Network and Computer Applications
Principles of fairness quantification in queueing systems
Network performance engineering
Impact of file arrivals and departures on buffer sizing in core routers
IEEE/ACM Transactions on Networking (TON)
Balancing HTTP traffic using dynamically updated weights, an implementation approach
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Hardware task scheduling and placement in operating systems for dynamically reconfigurable soc
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Queueing Systems: Theory and Applications
Unfairness metrics for space-sharing parallel job schedulers
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Novel isolation technology and remote display protocol for mobile thin client computing
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Analysis and control of correlated web server queues
Computer Communications
Finishing flows quickly with preemptive scheduling
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Server-assisted latency management for wide-area distributed systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Completion time scheduling and the WSRPT algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Finishing flows quickly with preemptive scheduling
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
pFabric: minimal near-optimal datacenter transport
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
| Hi-index | 0.00 |
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal for minimizing mean response time (sojourn time). Despite this fact, SRPT scheduling is rarely used in practice. It is believed that the performance improvements of SRPT over other scheduling policies stem from the fact that SRPT unfairly penalizes the large jobs in order to help the small jobs. This belief has led people to instead adopt "fair" scheduling policies such as Processor-Sharing (PS), which produces the same expected slowdown for jobs of all sizes.This paper investigates formally the problem of unfairness in SRPT scheduling as compared with PS scheduling. The analysis assumes an M/G/1 model, and emphasizes job size distributions with a heavy-tailed property, as are characteristic of empirical workloads. The analysis shows that the degree of unfairness under SRPT is surprisingly small.The M/G/1/SRPT and M/G/1/PS queues are also analyzed under overload and closed-form expressions for mean response time as a function of job size are proved in this setting.