Bianco, Alessandro (2010) Models and Algorithms for Fairness and Priority in Scheduling. [Tesi di dottorato] (Unpublished)

[img]
Preview
PDF
Bianco_Alessandro_23.pdf

Download (777kB) | Preview
Item Type: Tesi di dottorato
Uncontrolled Keywords: Scheduling, Games, Fairness, Priority
Date Deposited: 02 Dec 2010 15:43
Last Modified: 30 Apr 2014 19:44
URI: http://www.fedoa.unina.it/id/eprint/8131

Abstract

In this thesis we address the problem of fair and priority scheduling. We focus our attention on systems characterized by an infinite computation, a discrete decomposition of tasks into atomic operation and a known-a-priori set of precedence-constraints among the activities to be performed. We analyze two fairness and two priority specifications related to the frequency of occurrence of activities. We solve the scheduling problem both when the scheduler has complete control upon the system's execution and when the environment can influence the outcome of a scheduling plan.

Actions (login required)

View Item View Item