Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
A Framework for Resource-Constrained Rate-Optimal Software Pipelining
IEEE Transactions on Parallel and Distributed Systems
Analyzing Asynchronous Pipeline Schedules
International Journal of Parallel Programming
A closer look at coscheduling approaches for a network of workstations
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Scheduling best-effort and real-time pipelined applications on time-shared clusters
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A Case for NOW (Networks of Workstations)
IEEE Micro
Automatic Scheduler for Real-Time Vision Applications
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The EASY - LoadLeveler API Project
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Message transmission with timing constraints in ring networks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Design of an ASIC for Straight Line Detection in an Image
VLSID '00 Proceedings of the 13th International Conference on VLSI Design
An automatic scheduler for real-time vision applications
An automatic scheduler for real-time vision applications
Macro pipelining based scheduling on high performance heterogeneousmultiprocessor systems
IEEE Transactions on Signal Processing
Task-level timing models for guaranteed performance in multiprocessor networks-on-chip
Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems
Real-time video content analysis: QoS-aware application composition and parallel processing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Dynamic Pipeline Mapping (DPM)
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Scheduling Recurrent Precedence-Constrained Task Graphs on a Symmetric Shared-Memory Multiprocessor
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Optimizing latency and throughput of application workflows on clusters
Parallel Computing
Load balancing in homogeneous pipeline based applications
Parallel Computing
Exploiting throughput for pipeline execution in streaming image processing applications
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Toward optimizing latency under throughput constraints for application workflows on clusters
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Network Of Workstations (NOW) platforms put together with off-the-shelf workstations and networking hardware have become a cost effective, scalable, and flexible platform for video processing applications. Still, one has to manually schedule an algorithm to the available processors of the NOW to make efficient use of the resources. However, this approach is time-consuming and impractical for a video processing system that must perform a variety of different algorithms, with new algorithms being constantly developed. Improved support for program development is absolutely necessary before the full benefits of parallel architectures can be realized for video processing applications. Toward this goal, an automatic compile-time scheduler has been developed to schedule input tasks of video processing applications with precedence constraints onto available processors. The scheduler exploits both spatial (parallelism) and temporal (pipelining) concurrency to make the best use of machine resources. Two important scheduling problems are addressed. First, given a task graph and a desired throughput, a schedule is constructed to achieve the desired throughput with the minimum number of processors. Second, given a task graph and a finite set of available resources, a schedule is constructed such that the throughput is maximized while meeting the resource constraints. Results from simulations show that the scheduler and proposed optimization techniques effectively tackle these problems by maximizing processor utilization. A code generator has been developed to generate parallel programs automatically. The tools developed in this paper make it much easier for a programmer to develop video processing applications on these parallel architectures.