Interference-Aware Scheduling using Geometric Constraints - Université Grenoble Alpes Access content directly
Conference Papers Year :

Interference-Aware Scheduling using Geometric Constraints


The large scale parallel and distributed platforms produce a continuously increasing amount of data which have to be stored, exchanged and used by various jobs allocated on dierent nodes of the platform. The management of this huge communication demand is crucial for the performance of the system. Meanwhile, we have to deal with more interferences as the trend is to use a single all-purpose intercon-nection network. In this paper, we consider two dierent types of communications: the ows induced by data exchanges during computations and the ows related to Input/Output operations. We propose a general model for interference-aware scheduling, where explicit communications are replaced by external topological constraints. Specically, we limit the interferences of both communication types by adding geometric constraints on the allocation of jobs into machines. The proposed constraints reduce implicitly the data movements by restricting the set of possible allocations for each job. We present this methodology on the case study of simple network topologies, namely the line and the ring. We propose theoretical lower and upper bounds under dierent assumptions with respect to the platform and jobs characteristics. The obtained results illustrate well the diculty of the problem even on simple topologies.
Fichier principal
Vignette du fichier
convex-llncs.pdf (291.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01884542 , version 1 (01-10-2018)



Raphaël Bleuse, Konstantinos Dogeas, Giorgio Lucarelli, Grégory Mounié, Denis Trystram. Interference-Aware Scheduling using Geometric Constraints. Euro-Par 2018 - European Conference on Parallel Processing, Aug 2018, Torino, Italy. pp.205-217, ⟨10.1007/978-3-319-96983-1_15⟩. ⟨hal-01884542⟩
256 View
217 Download



Gmail Facebook Twitter LinkedIn More