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

Authors:
Cheolwhan Lee;Yuan Wang;Tao Yang
Affiliations:
-;-;-
Venue:
Static Global Scheduling for Optimal Computer Vision and Image Processing Operations on Distributed-Memory Multiprocessor
Year:
1994

Citing 0
Cited 6

On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks

IEEE Transactions on Parallel and Distributed Systems
Adaptive data partitioning for ambient multimedia

Proceedings of the 41st annual Design Automation Conference
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

Cluster Computing
Enabling multimedia using resource-constrained video processing techniques: A node-centric perspective

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A new load distribution strategy for linear network with communication delays

Mathematics and Computers in Simulation
Static scheduling with interruption costs for computer vision applications

VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a static global scheduling scheme for mapping computer vision and image processing (CVIP) operations on distributed-memory multiprocessors. Unlike most current parallel image processing research which focuses on parallelizing individual processing algorithms on a particular parallel architecture, our scheduler is for optimizing processor assignment and data partition for an entire image processing pipeline. The scheduler operates on task graphs specified by conventional visual languages such as Khoros and Explorer. A task graph is assumed to be a linear chain of operations with any number of nested loops. The task chain is first decomposed into simpler subchains; each a linear sequence of tasks without loops. The communication and computation costs of the component tasks in the subchains are determined by a taxonomy of CVIP operations. Data redistribution overheads in between tasks can also be tabulated in advance for many popular data partitioning schemes. The scheduler then employs a shortest path algorithm to optimize the parallel time, taking into consideration possible variation in the task and resource parameters (such as the image size and number of processors used), and both the intra-operation and the inter-operation computation and communication times. In this paper, we present the scheduling scheme, and provide analyses and experimental results to verify our approach.