Grid'5000 experiment

Jump to: navigation, search

Evaluation of Mapping algorithms for JaceP2P (Middleware)

Conducted by

Raphael Couturier, David Laiymani, Sébastien Miquée


The aim of this experimentation is to evaluate the performance of several mapping algorithms in the JaceP2P middleware on compare them. Algorithms evaluated are : a simple one (basic), a modified version of QM (Quick Quality Map) -- adapted to our model -- and an algorithm based on the edgecuts principles. The application is based on the asynchronous iterations model.




  • Nodes involved: 100
  • Sites involved: >3
  • Minimum walltime: 1h
  • Batch mode: no
  • Use kadeploy: no
  • CPU bound: yes
  • Memory bound: no
  • Storage bound: no
  • Network bound: no
  • Interlink bound: yes

Tools used

Java runtime environment and JaceP2P middleware


First results : gains (in execution time) provided by each mapping algorithm compared to the no mapping version of JaceP2P : simple : 20% QMm : 45%

Shared by: Raphael Couturier, David Laiymani, Sébastien Miquée
Last update: 2010-02-09 11:09:45
Experiment #608