Impact of task duplication on static-scheduling performance in multiprocessor systems with variable execution-time tasks

1990 ◽  
Author(s):  
Emilio Luque ◽  
Ana Ripoll ◽  
Porfidio Hernández ◽  
Tomás Margalef
Keyword(s):  
Execution Time ◽  
Multiprocessor Systems ◽  
Static Scheduling ◽  
Task Duplication

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

2011 ◽  
Vol 3 (1) ◽  
pp. 89-97 ◽  
Author(s):  
Amrit Agrawal ◽  
Pranay Chaudhuri
Keyword(s):  
Task Scheduling ◽  
Execution Time ◽  
High Speed ◽  
Critical Path ◽  
Task Assignment ◽  
Directed Acyclic Graphs ◽  
Parallel Tasks ◽  
Schedule Length ◽  
Task Duplication ◽  
Heterogeneous Distributed Systems

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.

scholarly journals Efficient contour detection in binary and label images

2008 ◽  
Author(s):  
Gaetan Lehmann
Keyword(s):  
Execution Time ◽  
Contour Detection ◽  
Binary Image ◽  
Multiprocessor Systems ◽  
Similar Performance ◽  
Performance Improvements ◽  
Structuring Element ◽  
Generic Filter ◽  
Shape And Size

ly in ITK, the only way to find the contour of the objects in a binary image is to use the BinaryErodeImageFilter, with a kernel of radius 1. This filter is a generic filter, made to support any shape and size of structuring element, and thus is not optimized for the particular case needed to detect the contours. Moreover, that filter is not multithreaded, so it can’t get the performance improvements allowed by the multiprocessor systems. As a result, the contour detection can be quite time consuming currently – for example, in SignedMaurerDistanceMapImageFilter, the contour detection takes about 33% of the execution time. This contribution comes with a new filter which highly improve the performance of the contour detection in the binary image, and a second filter which allow the detection of the countours in label images with similar performance.

Static Scheduling Using Clustering and Task Duplication

1997 ◽  
Vol 30 (3) ◽  
pp. 119-124
Author(s):  
Christos Ginis ◽  
Dewi I. Jones
Keyword(s):  
Static Scheduling ◽  
Task Duplication ◽  
And Task

scholarly journals PBench: A Parallel, Real-Time Benchmark Suite

2018 ◽  
Vol 1 (1) ◽  
pp. 178-186 ◽  
Author(s):  
Sevil Serttaş ◽  
Veysel Harun Şahin
Keyword(s):  
Real Time ◽  
Execution Time ◽  
Matrix Multiplication ◽  
Multiprocessor Systems ◽  
Time Analysis ◽  
Worst Case ◽  
Analysis Methods ◽  
Worst Case Execution Time ◽  
Benchmark Suite ◽  
Time Systems

Real-time systems are widely used from the automotive industry to the aerospace industry. The scientists, researchers, and engineers who develop real-time platforms, worst-case execution time analysis methods and tools need to compare their solutions to alternatives. For this purpose, they use benchmark applications. Today many of our computing systems are multicore and/or multiprocessor systems. Therefore, to be able to compare the effectiveness of real-time platforms, worst-case execution time analysis methods and tools, the research community need multi-threaded benchmark applications which scale on multicore and/or multiprocessor systems. In this paper, we present the first version of PBench, a parallel, real-time benchmark suite. PBench includes different types of multi-threaded applications which implement various algorithms from searching to sorting, matrix multiplication to probability distribution calculation. In addition, PBench provides single-threaded versions of all programs to allow side by side comparisons.

Sign in / Sign up

Export Citation Format

Share Document