Bianco, Alessandro (2010) Models and Algorithms for Fairness and Priority in Scheduling. [Tesi di dottorato] (Unpublished)
Preview |
PDF
Bianco_Alessandro_23.pdf Download (777kB) | Preview |
| Item Type: | Tesi di dottorato |
|---|---|
| Resource language: | English |
| Title: | Models and Algorithms for Fairness and Priority in Scheduling |
| Creators: | Creators Email Bianco, Alessandro UNSPECIFIED |
| Date: | 30 November 2010 |
| Number of Pages: | 104 |
| Institution: | Università degli Studi di Napoli Federico II |
| Department: | Matematica e applicazioni "Renato Caccioppoli" |
| Scuola di dottorato: | Scienze matematiche e informatiche |
| Dottorato: | Scienze computazionali e informatiche |
| Ciclo di dottorato: | 23 |
| Coordinatore del Corso di dottorato: | nome email Ricciardi, Luigi Maria luigi.ricciardi@unina.it |
| Tutor: | nome email Bonatti, Piero Andrea bonatti@na.infn.it Murano, Aniello murano@na.infn.it Faella, Marco mfaella@na.infn.it |
| Date: | 30 November 2010 |
| Number of Pages: | 104 |
| Keywords: | Scheduling, Games, Fairness, Priority |
| Settori scientifico-disciplinari del MIUR: | Area 01 - Scienze matematiche e informatiche > INF/01 - Informatica |
| Date Deposited: | 02 Dec 2010 15:43 |
| Last Modified: | 30 Apr 2014 19:44 |
| URI: | http://www.fedoa.unina.it/id/eprint/8131 |
| DOI: | 10.6092/UNINA/FEDOA/8131 |
Collection description
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.
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |
