Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.parco.2006.01.002 | Parallel Computing |
Keywords | Field | DocType |
minimum time,space-shared platforms,space-sharing task,homogeneous cluster,optimal partitioning,individual task,parallel task,best performance,distributed applications,polynomial algorithm,grid scheduling,parallel platform,space-sharing parallel tasks,distributed application | Cluster (physics),Computer science,Homogeneous,Parallel computing,Space sharing,Grid scheduling,Polynomial algorithm,Minimum time,Distributed computing | Journal |
Volume | Issue | ISSN |
32 | 4 | Parallel Computing |
Citations | PageRank | References |
2 | 0.49 | 14 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silvia M. Figueira | 1 | 320 | 75.28 |