Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T03:21:47.969Z Has data issue: false hasContentIssue false

Un ordonnancement dynamique de tâches stochastiques sur un seul processeur

Published online by Cambridge University Press:  15 July 2003

Ali Derbala*
Affiliation:
Université de Blida, Faculté des Sciences, Département de Mathématiques, BP. 270, route de Soumaa, Blida 009, Algérie; aliderbala@yahoo.com.
Get access

Abstract

We show that a particular dynamic priority given to jobs in a multitasks operating system of computers is a deteriorating jobs or a delaying jobs scheduling. Under some assumptions we also show that it is an index rule. To do this, we present the tool of bandit processes to solve stochastic scheduling problems on a single machine.

Information

Type
Research Article
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable