K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP'99), pages 261--276, Kiawah Island Resort, SC, Dec. 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....schedulers in handling best effort processes, and sometimes outperforms both. Section 2 discusses the design and implementation of BEST, Section 3 presents our preliminary results, and Section 4 presents some concluding remarks. 2 Design and Implementation Soft real time schedulers exist [1, 3, 4, 5, 6, 9, 11, 12], but they impose constraints on developers and users that limit their practicality in generic desktop environments; they require applications to interface with special purpose routines and, like most real time systems, they generally require specifications of application resource usage and ....

Kenneth J. Duda and David R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating System Principals, December 1999. 4

....modifications to the kernel to get better information for resource management. For example, if an operating system could inform the virtual machine monitor that it is executing a real time application. The monitor could then adapt its scheduling policy to provide real time behavior such as the BVT [21] scheduler in instead of the default priority based gang scheduling. Alternatively, the application could specify scheduling constraints directly to the virtual machine monitor, or the virtual machine monitor could intercept the scheduling system calls already present in the applications before ....

Kenneth J. Duda and David R. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP), pages 261--276, December 1999.

....of AOP based techniques to other OS kernel modules. 1 Introduction Over the recent years, there has been a continuous demand for new scheduling policies to address specific requirements of modern OSes and emerging applications. Examples include policies for multimedia and real time applications [2, 3, 6, 10, 14] and energybased policies so as to increase the mission time of portable devices [8, 12, 11] While the need for new scheduling policies is well recognized, their implementation within an existing OS kernel raises many problems. Based on an analysis of several OS kernels such as RT Linux, Linux ....

K. Duda and D. Cheriton. Borrowed-virtualtime (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP'99), pages 261--276, December 1999.

.... Work Our work is closely related to four groups of previous work: large scale resource management infrastructures [22, 11, 23] SLA enforcement in server farms [1, 13] request schedulers for cluster based network services [9, 10, 12, 14, 20, 28, 25, 29] and queue based network QoS algorithms [19, 27, 24, 21]. Grid infrastructures such as Globus [22] Legion [11] and Condor [23] need to respect sharing agreements when pooling together resources belonging to multiple domains. However, existing solutions in these infrastructures have ei Maximize income 0 100 200 300 400 500 600 A: 2, 1, 0 ....

....longer lived requests would require support similar to Cluster Reserves. Finally, our queuing strategy builds upon the same virtual time notion for proportional resource sharing that has been used in the context of network queuing algorithms [19, 27] and real time multimedia CPU scheduling [24, 21]. However, unlike the explicit queue structures in these systems, we have found an alternative credit based implementation more suitable to our distributed context. Another important difference is the fact that our decisions involve a more complex agreement structure and need to be coordinated ....

K. Duda and D. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of 17th ACM Symposium on Operating Systems Principles, 1999.

....for real time features, and to the fact that multimedia applications consume signi cant CPU resources themselves. The common solution to this problem has been to design specialized programming APIs that enable applications to request special treatment, and schedulers that respect these requests [19, 8, 22]. For example, applications may be required to specify timing constraints such as deadlines. To support such deadlines, the conventional operating system scheduler has to be modi ed, or a real time system can be used. While this approach solves the problem, it su ers from two drawbacks. One is ....

K. J. Duda and D. R. Cheriton, \Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler". In 17th Symp. Operating Systems Principles, pp. 261-276, Dec 1999.

....indicates is not trivial. We do not introduce the complexity of multiple levels in BeRate. However, using the BeRate scheduler does not preclude integration into multi level schemes. Proportional share schedulers assign processing bandwidth so that processes receive CPU within bounded rates [4, 10, 17, 20, 23, 27, 28, 29]. To meet deadlines, a proportional scheduler must know the rate requirements of processes. This information is usually fed to the scheduler through system APIs. However, it may be difficult to determine rate if the performance of the target processor is unknown [14] The BeRate scheduler does not ....

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating System Principals, Dec. 1999.

....strategy. Here we briefly mention some systems; this list is not comprehensive. EEVDF [34] calculates a virtual deadline for each process as a function of measured and allotted share, and schedules according to EDF; Stride Scheduling [36] uses a similar notion of virtual time. Systems such as BVT [14] 8 and BERT [4] provide enhanced fair sharing algorithms aimed at increasing the throughput of deadline sensitive processes by dynamically reallocating shares on a short term basis. Some systems utilize admission control: processes reserve shares, and the scheduler denies admission when requested ....

Kenneth J. Duda and David R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating System Principals, December 1999.

....schedulers in handling best effort processes, and sometimes outperforms both. Section 2 discusses the design and implementation of BEST, Section 3 presents our preliminary results, and Section 4 presents some concluding remarks. 2. Design and Implementation Soft real time schedulers exist [1, 3, 4, 5, 6, 9, 11, 12], but they impose constraints on developers and users that limit their practicality in generic desktop environments; they require applications to interface with special purpose routines and, like most real time systems, they generally require specifications of application resource usage and ....

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating System Principals, Dec. 1999.

....provide additional information so as to enhance the decision heuristics of the scheduler. To overcome these problems, several research projects have introduced innovative scheduling infrastructures. These approaches provided specific scheduling properties as well as adaptive scheduling strategies [9, 20, 26]. For example, fair share schedulers [11, 14] enable unbiased CPU distribution and cumulative service guarantees [4] Hierarchical [10] and proportional share schedulers [23, 34] enforce load insulation, which allows for firewall protection among different schedulers. Beyond properties, other ....

K. Duda and D. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In SOSP99 [27], pages 261--276.

....than the guaranteed amount, it releases the processor and does not request it again until the start of the next period. Proportional Share The PS scheduler that was implemented for HLS implements the start time fair queuing (SFQ) 8] algorithm with a warp extension similar to the one in BVT [6]. When the warp of all virtual processors is zero, it behaves as an SFQ scheduler. Goyal et al. showed that an SFQ scheduler provides fair resource allocation in a hierarchical scheduling environment where it does not receive the full CPU bandwidth. Therefore, the conversion PS ## PS is ....

Kenneth J. Duda and David C. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a generalpurpose scheduler. In Proc. of the 17th ACM Symposium on Operating Systems Principles, Kiawah Island, SC, December 1999.

....share from its latency requirement without actually providing any guarantee. SMART [67] is in this category: it supports a mixed programming model in which applications receiving proportional share scheduling can meet real time requirements using the deadline based time constraint abstraction. BVT [20] associates a warp value with each application; non zero warp values allow a thread to build up credit while blocked, increasing the chances that it will be scheduled when it wakes up. 1 Applications with high 1 Nemesis provides a latency hint that is similar to warp: it brings the effective ....

....than the guaranteed amount, it releases the processor and does not request it again until the start of the next period. 5.3.1. 4 Proportional Share The PS scheduler that was implemented for HLS implements the start time fair queuing (SFQ) algorithm with a warp extension similar to the one in BVT [20]. When the warp of all virtual processors is zero, it behaves as an SFQ scheduler. Goyal et al. showed that an SFQ scheduler provides fair resource allocation in a hierarchical scheduling environment where it does not receive the full CPU bandwidth. This result was derived in the context of ....

[Article contains additional citation context not shown here]

Kenneth J. Duda and David C. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proc. of the 17th ACM Symposium on Operating Systems Principles, Kiawah Island, SC, December 1999.

....service to applications, resource reservations are used, giving hard or soft guarantees for resource allocations. Typically, reservations for temporal resources, in particular the CPU, are either based on real time scheduling algorithms [18, 13, 20, 8] or on proportional share algorithms [4, 23, 2]. The latter are often used in conjunction with a hierarchical scheduling framework which partitions the available resources between tasks, with reservations and tasks sharing resources in a weighted fair fashion. Resource reservation schemes in general face two related problems: resource ....

K. Duda and D. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proc. of the 17th Symposium on Operating Systems Principles (SOSP'99), pages 261--276, Kiawah Island Resort, SC, USA, December 1999.

....clients to individually make the tradeoff between allocation accuracy and scheduling overhead. SMART [17] supports a mixed programming model in which applications receiving proportional share scheduling can meet real time requirements using the deadlinebased time constraint abstraction. BVT [6] associates a warp value with each application; positive warp values allow a thread to build up credit while blocked, increasing the chances that it will be scheduled when it wakes up. Nemesis provides a latency hint that is similar to warp: it brings the effective deadline of an unblocking ....

Kenneth J. Duda and David C. Cheriton. BorrowedVirtual -Time (BVT) scheduling: supporting latencysensitive threads in a general-purpose scheduler. In Proc. of the 17th ACM Symposium on Operating Systems Principles, Kiawah Island, SC, December 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP'99), pages 261--276, Kiawah Island Resort, SC, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proc. 17th ACM Symp. on Op. Sys. Princ., 1999.

No context found.

K. Duda and D. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general purpose scheduler. In Proc. of 17th Symposium on Operating Systems Principles, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles, pages 261--276. ACM Press, 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP '99), Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM SIGOPS Symposium on Operating Systems Principles, volume 33(5) of ACM Operating Systems Review, pages 261--276, Kiawah Island Resort, SC, USA, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the Seventeenth ACM Symposium on Operating Systems Principles, Kiawah Island, SC, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latencysensitive threads in a general-purpose scheduler. In Proceedings of the Seventeenth ACM Symposium on Operating Systems Principles, Kiawah Island, SC, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-Virtual-Time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM SIGOPS Symposium on Operating Systems Principles, volume 33(5) of ACM Operating Systems Review, pages 261--276, Kiawah Island Resort, SC, USA, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler. In Proceedings of the 17th ACM Symposium on Operating System Principals, Dec. 1999.

No context found.

K. J. Duda and D. R. Cheriton, \Borrowed-virtual-time (BVT) scheduling: Supporting latency-sensitive threads in a general-purpose scheduler," in Proceedings of the 17th ACM Symposium on Operating System Principals, Dec. 1999.

No context found.

K. Duda and D. R. Cheriton. Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler. In Proc ACM SOSP, Dec 1999.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC