Scheduling imprecise computation tasks with 01-constraint

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling imprecise computation tasks on uniform processors

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 w ′ i . 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 er...

متن کامل

Scheduling Imprecise Computation Tasks with Intra-task / Inter-task Dependence

This work presents two heuristics to be used as admission policy in imprecise task systems. It is assumed that imprecise tasks have intra-task and inter-task dependence and a 0/1 constraint. These heuristics are supposed to be used combined with off-line schedulability tests and on-line acceptance tests already described in the literature. The objective of the admission policy is to maximize sy...

متن کامل

Optimal Scheduling of Imprecise Computation Tasks in the Presence

With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision” trade-off are becoming increasingly popular. In the Imprecise Computation model, a task is divided into a mandatory part and an optional part. The mandatory part should be completed by the deadline even under worst-case s...

متن کامل

Optimal scheduling of imprecise computation tasks in the presence of multiple faults

With the advance of applications such as multimedia, image/speech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision” trade-off are becoming increasingly popular. In the Imprecise Computation model, a task is divided into a mandatory part and an optional part. The mandatory part should be completed by the deadline even under worst-case s...

متن کامل

Dynamic CPU Scheduling with Imprecise Knowledge of Computation-Time

The majority of the studies conducted in scheduling real-time transactions mostly concentrate on concurrency control protocols, while overlooking the CPU as being the primary resource. Consequently, there are various techniques for scheduling the CPU in conventional time-critical systems; meanwhile, there does not seem to be any technique that is adequately designed for scheduling such a resour...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1997

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(97)00024-3