PAPER: influence of deterministic customers in time sharing scheduler

Authors:
Patricia Pascal;Thierry Monteil
Affiliations:
LAAS - CNRS, 7 avenue du Colonel Roche 31077 Toulouse Cedex 4 France;LAAS - CNRS, 7 avenue du Colonel Roche 31077 Toulouse Cedex 4 France
Venue:
ACM SIGOPS Operating Systems Review
Year:
2003

Citing 5
Cited 1

On the Geo/D/1 and Geo/D/1/n queues

Performance Evaluation
High-performance communication networks (2nd ed.)

High-performance communication networks (2nd ed.)
Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System

Journal of the ACM (JACM)
Task Allocation Using Processor Load Prediction on Multiprocessors Cluster

IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Process Mapping Given by Processor and Network Dynamic Load Prediction

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Tasks mapping with quality of service for coarse grain parallel applications

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach to study the influence of deterministic customers in queueing system. This is used to make real time decision to manage resources. This method is applied to the scheduler of multiprocessor machines with round robin model. The transient probabilities which take care of the deterministic events are given. They are used to express a relation for the variation of the expectation of the number of processes. This relation is simplified with a general method called fluid approximation and used to predict the execution time of the deterministic events.