On-line partitioning for on-line scheduling with resource conflicts

Authors:
Piotr Borowiecki
Affiliations:
Department of Discrete Mathematics and Theoretical Computer Science, University of Zielona Góra, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 6
Cited 1

On-line 3-chromatic graphs—II: critical graphs

Discrete Mathematics
Guaranteeing Fair Service to Persistent Dependent Tasks

SIAM Journal on Computing
A Coloring Algorithm for Interval Graphs

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Coloring Graphs On-line

Developments from a June 1996 seminar on Online algorithms: the state of the art
Buffer minimization using max-coloring

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling with conflicts on bipartite and interval graphs

Journal of Scheduling - Special issue: On-line scheduling

Dynamic Coloring of Graphs

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Within this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research is motivated by applications in scheduling multiprocessor jobs on dedicated processors and channel assignment in WDM networks.