On-Line Partitioning for On-Line Scheduling with Resource Conflicts

Piotr Borowiecki

doi:10.1007/978-3-540-68111-3_104

On-Line Partitioning for On-Line Scheduling with Resource Conflicts

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.

Citations

0

CrossRef
0

Web of Science
2

Scopus

Author (1)

Piotr Borowiecki dr hab. inż.

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Keywords

Details

Category:: Conference activity
Type:: materiały konferencyjne indeksowane w Web of Science
Published in:: LECTURE NOTES IN COMPUTER SCIENCE no. 4967, pages 981 - 990,
ISSN: 0302-9743
Title of issue:: 7th International Conference on Parallel Processing and Applied Mathematics strony 981 - 990
Language:: English
Publication year:: 2008
Bibliographic description:: Borowiecki P..: On-Line Partitioning for On-Line Scheduling with Resource Conflicts, W: 7th International Conference on Parallel Processing and Applied Mathematics , 2008, ,.
DOI:: Digital Object Identifier (open in new tab) 10.1007/978-3-540-68111-3_104
Verified by:: Gdańsk University of Technology