Scheduling imprecise computation tasks on uniform processors

Document Type

Article

Publication Date

10-16-2007

Abstract

We consider the problem of preemptively scheduling n imprecise computation tasks on m ≥ 1 uniform processors, with each task Ti having two weights wi and wi′. Three objectives are considered: (1) minimizing the maximum w′-weighted error; (2) minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized; (3) minimizing the maximum w′-weighted error subject to the constraint that the total w-weighted error is minimized. For these objectives, we give polynomial time algorithms with time complexity O (m n4), O (m n4) and O (k m n4), respectively, where k is the number of distinct w-weights. We also present alternative algorithms for the three objectives, with time complexity O (c m n3), O (c m n3 + m n4) and O (k c m n3), respectively, where c is a parameter-dependent number. © 2007 Elsevier B.V. All rights reserved.

Identifier

34447642847 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2007.05.004

ISSN

00200190

First Page

45

Last Page

52

Issue

2

Volume

104

Grant

031808

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS