Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
ALPES: a tool for the performance evaluation of parallel programs
Environments and tools for parallel scientific computing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
IEEE Transactions on Parallel and Distributed Systems
Allocating Task Interaction Graphs to Processors in Heterogeneous Networks
IEEE Transactions on Parallel and Distributed Systems
Structured development of parallel programs
Structured development of parallel programs
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Optimal use of mixed task and data parallelism for pipelined computations
Journal of Parallel and Distributed Computing
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Video compression with parallel processing
Parallel Computing - Parallel computing in image and video processing
An Evaluation of Parallel Thinning Algorithms for Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Efficient Solutions for Mapping Parallel Programs
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Combining Task- and Data Parallelism to Speed up Protein Folding on a Desktop Grid Platform
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Clustering and Reassignment-Based Mapping Strategy for Message-Passing Architectures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On Task Scheduling Accuracy: Evaluation Methodology and Results
The Journal of Supercomputing
A Novel Algorithm for Mapping Parallel Applications in Computational Grid Environments
HPCASIA '04 Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Parallel calculation of volcanoes for cryptographic uses
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
t(k)-SA: accelerated simulated annealing algorithm for application mapping on networks-on-chip
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Load balancing in distributed applications based on extremal optimization
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Enhancing throughput for streaming applications running on cluster systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Model-based cache-aware dispatching of object-oriented software for multicore systems
Journal of Systems and Software
| Hi-index | 0.00 |
The exploitation of parallelism in a message-passing platform implies a previous modelling phase of the parallel application as a task graph, which properly reflects its temporal behaviour. In this paper, we analyse the classical task graph models of the literature and their drawbacks when modelling message-passing programs with arbitrary task structure. We define a new task graph model called TTIG (Temporal Task Interaction Graph) that integrates the classical models used in the literature. The TTIG allows to explicitly capture the ability of concurrency of adjacent tasks for applications where adjacent tasks can communicate at any point inside them. A mapping strategy is developed from this model, that minimizes the expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proved in different experimentation scopes for a wide range of message-passing applications.