A dual criteria preemptive scheduling problem for minimax error of imprecise computation tasks

Authors

Kevin I.J. Ho, Chung Shan Medical University
Joseph Y.T. Leung, Department of Computer Science

Document Type

Article

Publication Date

12-1-2004

Abstract

We consider a hierarchical optimization problem for imprecise computation tasks, where each task is weighted with two weights, w and w'. The primary criterion is to minimize the total w-weighted error of all optional parts of tasks and the secondary criterion is to minimize the maximum w'-weighted error. An algorithm is given with time complexity O(kn³ log² n) for parallel and identical processors and O(kn²) for a single processor, where k is the number of distinct w-weights. © 2004 World Scientific Publishing Company.

Identifier

34447631913 (Scopus)

Publication Title

International Journal of Foundations of Computer Science

External Full Text Location

https://doi.org/10.1142/S0129054104002716

ISSN

01290541

First Page

717

Last Page

731

Issue

5

Volume

15

Recommended Citation

Ho, Kevin I.J. and Leung, Joseph Y.T., "A dual criteria preemptive scheduling problem for minimax error of imprecise computation tasks" (2004). Faculty Publications. 20104.
https://digitalcommons.njit.edu/fac_pubs/20104