Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Task allocation onto a hypercube by recursive mincut bipartitioning
Journal of Parallel and Distributed Computing
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Heuristic Technique for Processor and Link Assignment in Multicomputers
IEEE Transactions on Computers
On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems
IEEE Transactions on Computers
Accurate predictions of parallel program execution time
Journal of Parallel and Distributed Computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Application-level scheduling on distributed heterogeneous networks
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
A Case for NOW (Networks of Workstations)
IEEE Micro
Adaptation Models for Network-Aware Distributed Computations
CANPC '99 Proceedings of the Third International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
Grid Computing: Making the Global Infrastructure a Reality
Grid Computing: Making the Global Infrastructure a Reality
A decoupled scheduling approach for Grid application development environments
Journal of Parallel and Distributed Computing - Special issue on computational grids
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper focuses on the execution of distributed applications on parallel platforms, such as MPPs or homogeneous clusters. These applications are usually formed by individual tasks, which are each mapped to the nodes available in the parallel platform. When these tasks can execute simultaneously, it may be necessary to space-share the nodes available within the application. In this case, partitioning the nodes among the space-sharing tasks is key in obtaining the best performance. This paper presents a polynomial algorithm to provide an optimal partitioning of nodes to parallel tasks, enabling them to execute simultaneously in minimum time.