Using MPI-2: Advanced Features of the Message Passing Interface
Using MPI-2: Advanced Features of the Message Passing Interface
Towards Convergence in Job Schedulers for Parallel Supercomputers
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Malleable-Job System for Timeshared Parallel Machines
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Implementing Malleability on MPI Jobs
Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques
On the Combined Scheduling of Malleable and Rigid Jobs
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
A batch scheduler with high level components
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Dynamic Malleability in Iterative MPI Applications
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed
International Journal of High Performance Computing Applications
Malleable applications for scalable high performance computing
Cluster Computing
Evaluations of the Lightweight Grid CIGRI upon the Grid5000 Platform
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Malleable iterative MPI applications
Concurrency and Computation: Practice & Experience - The Best of CCGrid'2007: A Snapshot of an ‘Adolescent’ Area
Scheduling malleable applications in multicluster systems
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
Improving the dynamic creation of processes in MPI-2
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Workload characteristics of a multi-cluster supercomputer
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
A job scheduling approach for multi-core clusters based on virtual malleability
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
Current parallel architectures take advantage of new hardware evolution, like the use of multicore machines in clusters and grids. The availability of such resources may also be dynamic. Therefore, some kind of adaptation is required by the applications and the resource manager to perform a good resource utilization. Malleable applications can provide a certain flexibility, adapting themselves on-the-fly, according to variations in the amount of available resources. However, to enable the execution of this kind of applications, some support from the resource manager is required, thus introducing important complexities like special allocation and scheduling policies. Under this context, we investigate some techniques to provide malleable behavior on MPI applications and the impact of this support upon a resource manager. Our study deals with two approaches to obtain malleability: dynamic CPUSETs mapping and dynamic MPI, using the OAR resource manager. The validation experiments were conducted upon Grid5000 platform. The testbed associates the charge of real workload traces and the execution of MPI benchmarks. Our results show that a dynamic approach using malleable jobs can lead to almost 25% of improvement in the resources utilization, when compared to a non-dynamic approach. Furthermore, the complexity of the malleability support, for the resource manager, seems to be overlapped by the improvement reached.