|
| Recourse Management Using a Fair Share Scheduler
|
|
Full
text: |
 PDF(60.3KB) |
|
|
Source |
International Journal of Computer Science and Security (IJCSS) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(6.58MB) |
|
Volume: 6 Issue: 1 |
| |
Pages: |
|
Publication
Date: February 2012 |
|
ISSN
(Online): 1985-1553 |
|
|
|
|
|
Pages |
29 - 33 |
|
Author(s) |
|
|
|
Published
Date |
21-02-2012 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: Fair Share , Fair Share Scheduling, Resource Allocation |
|
|
| |
|
|
| This Manuscript is indexed in the following databases/websites:- |
|
| 1. Directory of Open Access Journals (DOAJ) |
| 2. Google Scholar |
| 3. Scribd |
| 4. Docstoc |
| 5. Bielefeld Academic Search Engine (BASE) |
| 6. Academic Journals Database |
| |
|
| |
|
|
|
Resource management is a vital task of all operating systems. It is the responsibility of operating system to ensure that all programs requesting resources are getting resources in a timely manner. Various recourse allocation strategies are there which provide guidance for operating systems to make resource allocation decisions. This article describes about the resource management using a fare share scheduler. The fair share scheduler ensures that resources are allocated to programs in an efficient manner and this ensures fairness in resource allocation.
|
| |
|
| |
|
| |
| 1 |
A. Chandra, M.Adler, P. Goyaly and P. Shenoy , “Surplus Fair Scheduling: A Proportional- Share CPU Scheduling Algorithm for Symmetric Multiprocessors “ , (paper presented in Proceedings of fifth symposium on operating system design and implementation at Boston, Massachusetts , December 9-11 2002 )
|
|
|
| 2 |
P. Goyal, X. Guo, and H.M. Vin.” A Hierarchical CPUScheduler for Multimedia Operating Systems. In Proceedingsof Operating System Design and Implementation” (paper presented at OSDI’96, Seattle, pages 107–122, October 28-31 1996.)
|
|
|
| 3 |
K. Duda and D. Cheriton. “Borrowed Virtual Time (BVT)Scheduling: Supporting Lantencysensitive Threads in aGeneral-Purpose Scheduler “.(paper presented in Proceedings of the ACMSymposium on Operating Systems Principles (SOSP’99),Kiawah Island Resort, SC, pages 261–276, December 1999 .)
|
|
|
| 4 |
J. Nieh and M S. Lam.” The Design, Implementation andEvaluation of SMART: A Scheduler for Multimedia Applications “.(paper presented in Proceedings of the sixteenth ACM symposiumon Operating systems principles (SOSP’97), Saint-\Malo, France, pages 184– 197, December 1997.)
|
|
|
| 5 |
Carl A. Waldspurger _ William E. Weihl “Lottery Scheduling: Flexible Proportional-Share Resource Management’”, Comm. ACM 31(1) (Jan 1988.) , pp. 44–55,
|
|
|
| 6 |
A Cray X-MP , Henry, G. J. ''The Fair Share Scheduler'', Bell System Technical Journal, October,( 1984).
|
|
|
| 7 |
Adit Ranadive, Ada Gavrilovska, Karsten Schwan , “FaReS: Fair Resource Scheduling for VMM-Bypass InfiniBand Devices” ,(paper presented in the Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing ,Australia May 2010)
|
|
|
| 8 |
C. A. Waldspurger and W. E. Weihl, “Lotteryscheduling: Flexible proportional-share resource management”.(paper presented in 1st Symp. Operating Systems Design & Implementation, pp. 1–11, USENIX, Nov 1994.)
|
|
|
| 9 |
J. Nieh, C. Vaill, and H. Zhong, “Virtual-Time RoundRobin: An O(1) proportional share scheduler”(paper presented in . USENIX Ann. Technical Conf.at Boston, Massachusetts pp. 245–259, Jun25-30 2001.)
|
|
|
| |
|
| |
|
| |
| 1 |
N. Kaur, H. Kaur and S. P. Ahuja, “Inter-Intra Fairness Schedular for Resource Management in Grid Environment”, International Journal of Advanced Research in Computer Science and Software Engineering, 2(1), January 2012.
|
|
|
| |
|
| |
|
| |
| |
|
| |
|
| |
|
| Suja Cherukullapurath Mana : Colleagues
|
|
