Shared processor scheduling - Publication - Bridge of Knowledge

Search

Shared processor scheduling

Abstract

We study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class of instances in which non-decreasing order of jobs with respect to processing times provides a non-increasing order with respect to weights—this instance generalizes the unweighted case of the problem. This algorithm also leads to a 1/2-approximation algorithm for the general weighted problem. The complexity of the weighted problem remains open.

Citations

  • 2

    CrossRef

  • 0

    Web of Science

  • 2

    Scopus

Authors (2)

Keywords

Details

Category:
Articles
Type:
artykuł w czasopiśmie wyróżnionym w JCR
Published in:
JOURNAL OF SCHEDULING no. 21, edition 6, pages 583 - 593,
ISSN: 1094-6136
Language:
English
Publication year:
2018
Bibliographic description:
Dereniowski D., Kubiak W.: Shared processor scheduling// JOURNAL OF SCHEDULING. -Vol. 21, iss. 6 (2018), s.583-593
DOI:
Digital Object Identifier (open in new tab) 10.1007/s10951-018-0566-0
Verified by:
Gdańsk University of Technology

seen 80 times

Recommended for you

Meta Tags