Abstract: Scheduling is a central activity of a computer system, usually performed by the operating system. Fixed-priority scheduler is the Polling-server in rate monotonic scheduling algorithm, which assigns higher priorities to tasks with shorter relative deadlines. It is intuitive to see that if every task’s period is the same as its deadline, then the RM and DM scheduling algorithms are equivalent. Hard real-time systems have been defined as those containing processes that have deadlines that cannot be missed. Such deadlines have been termed hard: they must be met under all circumstances otherwise catastrophic system failure may result. To meet hard deadlines implies constraints upon the way in which system resources are allocated at runtime. This includes both physical and logical resources. Conventionally, resource allocation is performed by scheduling algorithms whose purpose is to interleave the executions of processes in the system to achieve a pre-determined goal. For hard real-time systems the obvious goal is that no deadline is missed. Polling Server monotonic priority ordering is similar in concept to rate monotonic priority ordering. Priorities assigned to processes are inversely proportional to the length of the deadline. Thus, the process with the shortest deadline is assigned the highest priority, the longest deadline process the lowest priority. This priority ordering defaults to a rate monotonic ordering when period=deadline.
Keyword: scheduling, priority, monotonic, catastrophic.
Title: IMPLEMENTATION OF ‘POLLING SERVER’ IN RT SCHEDULING
Author: Prof.G.K.Gaikwad, Prof.B.S.Chaudhary
International Journal of Computer Science and Information Technology Research
ISSN 2348-120X (online), ISSN 2348-1196 (print)
Research Publish Journals
