ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Fairness in processor scheduling in time sharing systems

Haldar, S and Subramanian, DK (1991) Fairness in processor scheduling in time sharing systems. In: ACM SIGOPS Operating Systems Review, 25 (1). pp. 4-18.

Full text not available from this repository. (Request a copy)

Abstract

Loosely, fairness is the assurance of granting each request from a set of requests within a predetermined bounded time, even though the request scheduling primitives are unfair or random. The fairness property has been studied, in olutions to the mutual exclusion problem, from a theoretical point of view. Many fair solutions to the mutual exclusion roblem have been proposed in recent years. The authors present one illustration to show how the concepts of fairness could be incorporated in processor scheduling in time sharing stems. They look at some shortcomings associated with the round robin scheduler used in the time sharing systems and resent a fair version of the round robin scheduler

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Association for Computing Machinery (ACM).
Keywords: processor scheduling;Time sharing systems;Predetermined bounded time;Request scheduling primitives;Fairness property;Mutual exclusion problem;Theoretical;Fair solutions;Round robin scheduler;Time-sharing systems
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 19 Oct 2006
Last Modified: 27 Aug 2008 12:21
URI: http://eprints.iisc.ernet.in/id/eprint/8518

Actions (login required)

View Item View Item