A Heuristic of Scheduling Parallel Tasks and Its Analysis

Wang, Qingzhou; Cheng, Kam-Hoi

doi:10.1137/0221021

Cited by 69 publications

(28 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kwon et al [25] explore preemptive EDF scheduling of parallel task systems with linear-speedup parallelism. Wang et al [26] consider a heuristic for nonpreemptive scheduling. However, this work focuses on metrics like makespan [26] or total work that meets deadline [25], and considers simple task models where a task is executed on up to a given number of processors.…”

Section: Related Workmentioning

confidence: 99%

Multi-core Real-Time Scheduling for Generalized Parallel Task Models

Saifullah

Agrawal

et al. 2011

2011 IEEE 32nd Real-Time Systems Symposium

148

View full text Add to dashboard Cite

Abstract-Multi-core processors offer a significant performance increase over single core processors. Therefore, they have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, most results in traditional multiprocessor real-time scheduling are limited to sequential programming models and ignore intra-task parallelism. In this paper, we address the problem of scheduling periodic parallel tasks with implicit deadlines on multi-core processors. We first consider a synchronous task model where each task consists of segments, each segment having an arbitrary number of parallel threads that synchronize at the end of the segment. We propose a new task decomposition method that decomposes each parallel task into a set of sequential tasks. We prove that our task decomposition achieves a resource augmentation bound of 4 and 5 when the decomposed tasks are scheduled using global EDF and partitioned deadline monotonic scheduling, respectively. Finally, we extend our analysis to directed acyclic graph (DAG) task model where each node in the DAG has unit execution requirement. We show how these tasks can be converted into synchronous tasks such that the same transformation can be applied and the same augmentation bounds hold.

show abstract

Section: Related Workmentioning

confidence: 99%

Multi-core Real-Time Scheduling for Generalized Parallel Task Models

Saifullah

Agrawal

et al. 2011

2011 IEEE 32nd Real-Time Systems Symposium

148

View full text Add to dashboard Cite

show abstract

“…Some polynomial algorithms are still very complex, [70], while others are particular simple algorithms, like list scheduling methods [41,95]. The latter promises to be of the greatest help for the selection of scheduling methods in real systems.…”

Section: Memory Allocationmentioning

confidence: 98%

Theory and practice in parallel job scheduling

Feitelson

Rudolph

Schwiegelshohn

et al. 1997

Lecture Notes in Computer Science

303

204

View full text Add to dashboard Cite

Abstract. The scheduling of jobs on parallel supercomputer is becomhag the subject of much research. However, there is concern about the divergence of theory and practice. We review theoretical research in this area, and recommendations based on recent results. This is contrasted with a proposal for standard interfaces among the components of a scheduling system, that has grown from requirements in the field.

show abstract

“…Off-and on-line heuristics with performance guarantees are often developed for multiprocessor task scheduling problems, see, for example, Wang and Cheng [62,61], Choundhary et al [18], Srinivasa Prasanna and Musicus [53], Blazewicz et al [11], Blazewicz et al [9], Dutot et al [25] and Hunold [31].…”

Section: Problem F Easible(q)mentioning

confidence: 99%

Optimal workforce assignment to operations of a paced assembly line

Dolgui

Kovalev

Kovalyov

et al. 2018

European Journal of Operational Research

View full text Add to dashboard Cite

To cite this version:Alexandre Dolgui, Sergey Kovalev, Mikhail Kovalyov, Sergey Malyutin, Ameur Soukhal. Optimal workforce assignment to operations of a paced assembly line. European Journal of Operational Research, Elsevier, 2018, 264 (1), pp.200-211. 10.1016/j.ejor.2017 Optimal workforce assignment to operations of a paced assembly line AbstractWe study a paced assembly line intended for manufacturing different products. Workers with identical skills perform non-preemptable operations whose assignment to stations is known. Operations assigned to the same station are executed sequentially, and they should follow the given precedence relations. Operations assigned to different stations can be performed in parallel.The operation's processing time depends on the number of workers performing this operation.The problem consists in assigning workers to operations such that the maximal number of workers employed simultaneously in the assembly line is minimized, the line cycle time is not exceeded and the box constraints specifying the possible number of workers for each operation are not violated. We show that the general problem is NP-hard in the strong sense, develop conventional and randomized heuristics, propose a reduction to a series of feasibility problems, present a MILP model for the feasibility problem, show relation of the feasibility problem to multi-mode project scheduling and multiprocessor scheduling, establish computational complexity of several special cases based on this relation and provide computer experiments with real and simulated data.

show abstract

A Heuristic of Scheduling Parallel Tasks and Its Analysis

Cited by 69 publications

References 7 publications

Multi-core Real-Time Scheduling for Generalized Parallel Task Models

Multi-core Real-Time Scheduling for Generalized Parallel Task Models

Theory and practice in parallel job scheduling

Optimal workforce assignment to operations of a paced assembly line

Contact Info

Product

Resources

About