Minimizing mean weighted execution time loss on identical and uniform processors

Błażewicz, Jacek; Finke, Gerd

doi:10.1016/0020-0190(87)90145-1

Cited by 55 publications

(40 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, the preemptive case for identical as well as for a fixed number of uniform processors was considered. Blazewicz and Finke [86] have proposed a strongly polynomial algorithm based on a network flow technique, which minimizes the mean weighted execution time loss for an arbitrary number of identical processors as well as uniform processors. The upper bound on the number of preemptions in each of the cases is also reported.…”

Section: Miscellaneous Problem With Preemptive Jobsmentioning

confidence: 99%

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam¹,

Narayanan²

2010

IIM

View full text Add to dashboard Cite

This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures of performance which are to be optimized in uniform parallel machines scheduling. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time. This paper gives a classification of the literatures of this scheduling problem in three major categories, viz. offline scheduling, online scheduling and miscellaneous scheduling. In total, the available literatures are classified into 17 subgroups. Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs. In the last category, the literatures are discussed under three subgroups, namely non-preemptive jobs, preemptive jobs and periodic jobs.

show abstract

Section: Miscellaneous Problem With Preemptive Jobsmentioning

confidence: 99%

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam¹,

Narayanan²

2010

IIM

View full text Add to dashboard Cite

show abstract

“…These algorithms cannot be applied directly to component tasks whose extension functions are not in the linear form given by (1) and (2). We now describe how to transform a given set of component tasks with arbitrary mandatory and optional extensions to another set with linear mandatory and optional extensions and thus find the error-scaling factors.…”

Section: Extracting Error-scaling Factorsmentioning

confidence: 99%

“…A hard realtime system must remain robust and maintain an acceptable level of performance under a transient overload. The imprecise-computation technique [1], [2], [3], [4], [5] was introduced as a way to deal with transient overloads. The technique is motivated by the fact that one can often trade off precision for timeliness.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for scheduling real-time tasks with input error and end-to-end deadlines

Feng

Liu

1997

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task Index Terms-Real-time systems and applications, scheduling, imprecise computation, error, end-to-end timing constraints.

show abstract

“…Section 2 reduces problem Q|r j , p j − x j , C j ≤ d j , pmtn| α j x j to maximizing a linear function over a generalized polymatroid which allows us to solve the problem in O(mn 4 ) time by network flow techniques, faster than the earlier approaches [3,12]. Section 3 addresses problem Q|p j − x j , C j ≤ d, pmtn| α j x j with equal release dates and a common due date.…”

Section: Introductionmentioning

confidence: 99%

“…If the processing times are controllable, problem Q|r j , p j − x j , C j ≤ d j , pmtn| α j x j as a model of imprecise computation is studied by Błažewicz and Finke [3] and Leung [12] and shown to be solvable in O(m 2 n 4 log mn + m 2 n 3 log 2 mn) and O(m 2 n 4 log mn) time, respectively. Nowicki and Zdrzalka [17] study problem Q|p j − x j , C j ≤ d, pmtn| α j x j with equal release dates and a common due date.…”

Section: Introductionmentioning

confidence: 99%

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

Shakhlevich

Strusevich

2007

Algorithmica

View full text Add to dashboard Cite

In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.

show abstract

Minimizing mean weighted execution time loss on identical and uniform processors

Cited by 55 publications

References 11 publications

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Algorithms for scheduling real-time tasks with input error and end-to-end deadlines

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

Contact Info

Product

Resources

About