Reference : A Methodology for Handling Data Movements by Anticipation: Position Paper
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
A Methodology for Handling Data Movements by Anticipation: Position Paper
Bleuse, Raphaël mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
Lucarelli, Giorgio mailto [Univ. Grenoble Alpes - UGA > LIG > DataMove]
Trystram, Denis mailto [Univ. Grenoble Alpes > LIG > DataMove]
In press
Euro-Par 2018 Workshops
Euro-Par Workshop
from 2018-08-27 to 2018-08-28
[en] The enhanced capabilities of large scale parallel and distributed platforms produce a continuously increasing amount of data which have to be stored, exchanged and used by various tasks allocated on different nodes of the system. The management of such a huge communication demand is crucial for reaching the best possible performance of the system. Meanwhile, we have to deal with more interferences as the trend is to use a single all-purpose interconnection network whatever the interconnect (tree-based hierarchies or topology-based heterarchies). There are two different types of communications, namely, the flows induced by data exchanges during the computations, and the flows related to Input/Output operations. We propose in this paper a general model for interference-aware scheduling, where explicit communications are replaced by external topological constraints. Specifically, the interferences of both communication types are reduced by adding geometric constraints on the allocation of tasks into machines. The proposed constraints reduce implicitly the data movements by restricting the set of possible allocations for each task. This methodology has been proved to be efficient in a recent study for a restricted interconnection network (a line/ring of processors which is an intermediate between a tree and higher dimensions grids/torus). The obtained results illustrated well the difficulty of the problem even on simple topologies, but also provided a pragmatic greedy solution, which was assessed to be efficient by simulations. We are currently extending this solution for more complex topologies. This work is a position paper which describes the methodology, it does not focus on the solving part.
This work has been partially supported by a DGA-MRIS scholarship, and is partially funded by the joint research programme UL/SnT-ILNAS on Digital Trust for Smart ICT.

File(s) associated to this reference

Fulltext file(s):

Open access
BleuseR2018Methodology.pdfPublisher postprint253.18 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.