A Platform Independent Parallelising Tool Based on Graph Theoretic Models

Authors:
Oliver Sinnen;Leonel Sousa
Affiliations:
-;-
Venue:
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
Year:
2000

Citing 14
Cited 1

Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding

IEEE Transactions on Computers
PYRROS: static task scheduling and code generation for message passing multiprocessors

ICS '92 Proceedings of the 6th international conference on Supercomputing
Optimal Scheduling Algorithm for Distributed-Memory Machines

IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines

IEEE Transactions on Parallel and Distributed Systems
Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH

ICPP '97 Proceedings of the international Conference on Parallel Processing
A New Heuristic for Scheduling Parallel Programs on Multiprocessor

PACT '98 Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques
Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
A Comparison of Multiprocessor Scheduling Heuristics

A Comparison of Multiprocessor Scheduling Heuristics
Benchmarking the Task Graph Scheduling Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Parallel Program Design in Visual Environment

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing

A generic parallel processing model for facilitating data mining and integration

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel programming demands, in contrast to sequential programming, sub-task identification, dependence analysis and task-to-processor assignment. This paper presents a new parallelising tool that supports the programmer in these early challenging phases of parallel programming. In contrast to existing parallelising tools, the proposed parallelising tool is based on a new graph theoretic model, called annotated hierarchical graph, that integrates the commonly used graph theoretic models for parallel computing. Part of the parallelising tool is an object oriented framework for the development of scheduling and mapping algorithms, which allows to rapidly adapt and implement new algorithms. The tool achieves platform independence by relying on internal structures that are not bound to any architecture and by implementing the tool in Java.