Performance evaluation of two new disk scheduling algorithms for real-time systems

Chen, S.; Stankovic, John A.; Kurose, James F.; Towsley, D.

doi:10.1007/bf00364960

Cited by 96 publications

(47 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recall that EDF only prioritizes requests based on the proximity to the deadline. Therefore, requests might make little progress until it is too late [14]. On the other hand, LSTF also factors in the remaining service time which can be estimated because of Wisp's progress metrics.…”

Section: System Evaluationmentioning

confidence: 99%

Distributed resource management across process boundaries

Suresh

Bodík

Menache

et al. 2017

Proceedings of the 2017 Symposium on Cloud Computing

View full text Add to dashboard Cite

Multi-tenant distributed systems composed of small services, such as Service-oriented Architectures (SOAs) and Micro-services, raise new challenges in attaining high performance and efficient resource utilization. In these systems, a request execution spans tens to thousands of processes, and the execution paths and resource demands on different services are generally not known when a request first enters the system. In this paper, we highlight the fundamental challenges of regulating load and scheduling in SOAs while meeting end-to-end performance objectives on metrics of concern to both tenants and operators. We design Wisp, a framework for building SOAs that transparently adapts rate limiters and request schedulers systemwide according to operator policies to satisfy end-to-end goals while responding to changing system conditions. In evaluations against production as well as synthetic workloads, Wisp successfully enforces a range of end-to-end performance objectives, such as reducing average latencies, meeting deadlines, providing fairness and isolation, and avoiding system overload.

show abstract

Section: System Evaluationmentioning

confidence: 99%

Distributed resource management across process boundaries

Suresh

Bodík

Menache

et al. 2017

Proceedings of the 2017 Symposium on Cloud Computing

View full text Add to dashboard Cite

show abstract

“…Most traditional disk scheduling algorithms, such as FCFS, SCAN, C-SCAN, LOOK, C-LOOK, and SSTF are designed to reduce disk-seek time and increase its throughput [2,3,4]. FCFS algorithm performs operations in order the task arrives.…”

Section: Related Workmentioning

confidence: 99%

A Genetic Based Approach For Multiobjective Optimization Of Disk Scheduling To Reduce Completion Time And Missed Task

Selvi¹,

Rajaram²

2011

IJITCS

View full text Add to dashboard Cite

show abstract

“…Chen et al [12] present a model for a scheduling algorithm that only minimises seek time. Shriver et al [13] define the distance (in terms of number of bytes) between two random requests with minimised positioning time as no of Cylinders × Bytes per Cylinder…”

Section: B Models Of Disk Head Positioning Optimisationmentioning

confidence: 99%

A Performance Model of Zoned Disk Drives with I/O Request Reordering

Lebrecht

Dingle

Knottenbelt

2009

2009 Sixth International Conference on the Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Abstract-Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim to reduce disk head positioning time by dynamically reordering queueing requests. An analytical model of this phenomenon is best represented by an M/G/1 queue with queue length dependent service times. However, there is no general exact result for the response time distribution of this variety of queue with generalised service time distributions. In this paper, we present a novel approximation for the response time distribution of such a queue. We then apply this method to the specific case of a zoned disk drive which implements I/O request reordering. A key contribution is the derivation of realistic service time distributions with minimised positioning time. We derive analytical results for calculating not only the mean but also higher moments and the full distribution of I/O request response time. We validate our model against measurements from a real disk to demonstrate the accuracy of our approximation.

show abstract

Performance evaluation of two new disk scheduling algorithms for real-time systems

Cited by 96 publications

References 10 publications

Distributed resource management across process boundaries

Distributed resource management across process boundaries

A Genetic Based Approach For Multiobjective Optimization Of Disk Scheduling To Reduce Completion Time And Missed Task

A Performance Model of Zoned Disk Drives with I/O Request Reordering

Contact Info

Product

Resources

About