Preemptive RAID Scheduling
نویسندگان
چکیده
Emerging video surveillance, environmental monitoring applications, and constantly evolving large scientific setups require large, high-performance, and reliable storage systems with guaranteed real-time data access. These systems are often implemented using redundant arrays of independent disks (RAID). In this paper we investigate the effectiveness of preemptive disk-scheduling algorithms to achieve better quality of service (QoS) in RAID systems. We present an architecture for QoS-aware RAID systems that use Semi-preemptible IO for servicing internal disk IOs. We show when and how to preempt IOs to improve the overall performance of the RAID system. We evaluate the benefits and estimate the overhead of our approach using a preemptible RAID simulator that we have implemented.
منابع مشابه
The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملScheduling Fixed-Priority Tasks with Preemption Threshold An Attractive Technology?
While it is widely believed that preemptibility is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...
متن کامل