Grid'5000 user report for Jean Noel Quintin

Jump to: navigation, search

User information

Jean Noel Quintin (users, user, grenoble user)
More user information in the user management interface.

Experiments

  • Creation of a hierarchical plateform (Networking) [achieved]
    Description:
    Results:
  • Idhal : Experimentation on hierarchical and heterogeneous platform (Other) [achieved]
    Description:
    Results:
  • WSCOM: online scheduling with communication (Middleware) [in progress]
    Description: Simulate the behavior of the work-stealing on general DAG. And compare the result with the classical list scheduling
    Results:
  • sensibility of off-line scheduling (Other) [in progress]
    Description: The scheduling algorithms are developed and studied in a restricted area. The network congestion is not take into account. We study the impact of the network on the classical heuristics.
    Results:
  • hierarchical work stealing (Middleware) [achieved]
    Description: We study the problem of dynamic load-balancing on hierar- chical platforms. In particular, we consider applications involving heavy communications on a distributed platform. The work-stealing algorithm introduced by Blumofe and Leiserson is a commonly used technique to balance load in a distributed environment but it suffers from poor per- formance with some communication-intensive applications. We describe here several variants of this algorithm found in the literature and in different grid middle-wares like Satin and Kaapi. In addition, we pro- pose two new variations of the work-stealing algorithm : HWS and PWS. These algorithms improve performance by considering the network struc- ture. We conduct a theoretical analysis of HWS in the case of fork-join task graphs and prove that HWS reduces communication overhead. In addition, we present experimental results comparing the most relevant algorithms. Experiments on Grid’5000 show that HWS and PWS allow us to obtain performance gains of up to twenty per cent when compared to the classical work-stealing algorithm. Moreover in some cases, PWS and HWS achieve speedup while classical work-stealing policies result in speed-down.
    Results: two new algorithms of work-stealing with one theoretical proof
    More information here

Publications

Collaborations

    Success stories and benefits from Grid'5000

    last update: 2011-02-02 08:37:10

    Personal tools
    Namespaces

    Variants
    Views
    Actions
    Public Portal
    Users Portal
    Admin portal
    Wiki special pages
    Toolbox