Static scheduling with interruption costs for computer vision applications

Authors:
Francisco A. Candelas;Fernando Torres;Pablo Gil;Santiago T. Puente
Affiliations:
Physics, Systems Engineering and Signal Theory Department, University of Alicante, Spain;Physics, Systems Engineering and Signal Theory Department, University of Alicante, Spain;Physics, Systems Engineering and Signal Theory Department, University of Alicante, Spain;Physics, Systems Engineering and Signal Theory Department, University of Alicante, Spain
Venue:
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Year:
2002

Citing 8
Cited 0

Preemptive scheduling under time and resource constraints

IEEE Transactions on Computers - Special Issue on Real-Time Systems
A Heuristic Approach to the Multitask-Multiprocessor AssignmentProblem using the Empty-Slots Method and Rate Monotonic Scheduling

Real-Time Systems
Realtime systems

Realtime systems
Global optimization for mapping parallel image processing tasks on distributed memory machines

Journal of Parallel and Distributed Computing
Real-Time Systems

Real-Time Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems

IEEE Transactions on Software Engineering
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor

Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is very difficult to find pre-emptive scheduling algorithms that consider all the main characteristics of computer vision systems. Moreover, there is no generic algorithm that considers interruption costs for such systems. Taking the interruption of tasks into account scheduling results can be improved. But it is also very important to take the costs that arise from interruptions into account because they not only increase the total execution time, but also because the scheduler can evaluate whether it is adequate to interrupt certain tasks or not. Thus, the result can be more realistic. Therefore, we present an extension to the static algorithm SASEPA for computer vision which considers interruption costs.