Article de revue avec comité de lecture (4)
BOSILCA George, BOUTEILLER Aurélien, GUERMOUCHE Amina, HERAULT Thomas, ROBERT Yves, SENS Pierre, DONGARRA Jack
A failure detector for HPC platforms. International journal of high performance computing applications (IJHPCA), january 2018, vol. 32, n° 1, pp. 139-158
URL: https://hal.inria.fr/hal-01453086/document
abstract
Building an infrastructure for exascale applications requires, in addition to many other key components, a stable and efficient failure detector. This article describes the design and evaluation of a robust failure detector that can maintain and distribute the correct list of alive resources within proven and scalable bounds. The detection and distribution of the fault information follow different overlay topologies that together guarantee minimal disturbance to the applications. A virtual observation ring minimizes the overhead by allowing each node to be observed by another single node, providing an unobtrusive behavior. The propagation stage uses a nonuniform variant of a reliable broadcast over a circulant graph overlay network and guarantees a logarithmic fault propagation. Extensive simulations, together with experiments on the Titan Oak Ridge National Laboratory supercomputer, show that the algorithm performs extremely well and exhibits all the desired properties of an exascale-ready algorithm
BOUZID Zohir, RAYNAL Michel, SUTRA Pierre
Anonymous obstruction-free (n,k)-set agreement with n−k+1 atomic read/write registers. Distributed computing, april 2018, vol. 31, n° 2, pp. 99-117
abstract
The k-set agreement problem is a generalization of the consensus problem. Namely, assuming that each pro- cess proposes a value, every non-faulty process must decide one of the proposed values, under the constraint that at most k different values are decided. This is a hard problem in the sense that it cannot be solved in a pure read/write asyn- chronous system, in which k or more processes may crash. One way to sidestep this impossibility result consists in weak- ening the termination property, requiring only that a process decides if it executes alone during a long enough period of time. This is the well-known obstruction-freedom progress condition. Consider a system of n anonymous asynchronous processes that communicate through atomic read/write reg- isters, and such that any number of them may crash. This paper addresses and solves the challenging open problem of designing an obstruction-free k-set agreement algorithm with only (n −k +1) atomic registers. From a shared memory cost point of view, our algorithm is the best algorithm known to date, thereby establishing a new upper bound on the number of registers needed to solve this problem. For the consensus case (k = 1), the proposed algorithm is up to an additive factor of 1 close to the best known lower bound. Further, the paper extends this algorithm to obtain an x-obstruction- free solution to the k-set agreement problem that employs (n − k + x) atomic registers (with 1 ≤ x ≤ k < n), as well as a space-optimal solution for the repeated ver- sion of k-set agreement. Using this last extension, we prove that n registers are enough for every colorless task that is obstruction-free solvable with identifiers and any number of registers
ZHOU Zhangbing , CHENG Zehui, ZHANG Liang-Jie, GAALOUL Walid, NING Ke
Scientific workflow clustering and recommendation leveraging layer hierarchical analysis. IEEE transactions on services computing, january 2018, vol. 11, n° 1, pp. 169-183
abstract
This article proposes an approach for identifying and recommending scientific workflows for reuse and repurposing. Specifically, a scientific work- flow is represented as a layer hierarchy, which specifies hierarchical relations between this workflow, its subworkflows, and activities. Semantic similarity is calculated between layer hierarchies of workflows. A graphskeleton based clustering technique is adopted for grouping layer hierarchies into clusters. Barycenters in each cluster are identified, which refer to core workflows in this cluster, for facilitating cluster identification and workflow ranking and recommendation. Experimental evaluation shows that our technique is efficient and accurate on ranking and recommending appropriate clusters and scientific workflows with respect to specific requirements of scientific experiments
ZHOU Zhangbing , ZHAO Deng, HANCKE Gerhard , SHU Lei , SUN Yunchuan
Cache-aware query optimization in multiapplication sharing wireless sensor networks. IEEE transactions on systems, man, and cybernetics. Systems, march 2018, vol. 48, n° 3, pp. 401-417
abstract
Hosting multiple applications in a shared infrastructure of wireless sensor networks is a trend nowadays, and sharing sensory data for answering concurrent applications is a promising and energy-efficient strategy. To address this challenge, this paper proposes an energy-efficient query optimization mechanism for supporting multiple concurrent applications leveraging our two-tier cooperative caching mechanism. Specifically, query requests for concurrent applications are represented as binary strings, which are reduced to a single one for avoiding the reprocessing of shared subquery requests. This reduced query request is answered through our cooperative caching mechanism, where sensory data, which are highly possible to be reused for answering forthcoming query requests, are cached at the sink node (SN). Besides, the gray model GM(1, 1) is adopted for forecasting sensory data units which may be interested mostly by forthcoming query requests. These units of sensory data may be prefetched from the network and cached at the SN. Experimental evaluation shows that this approach can reduce the energy consumption significantly, and improve the network capacity to an extent, especially when the number of concurrent query requests is relatively large
Communication dans une conférence à comité de lecture (1)
MOHAMED Mohamed, ANYA Obinna, TAKASHI Sakairi, TATA Samir, NAGAPRAMOD Mandagere, HEIKO Ludwig
The rSLA framework : monitoring and enforcement of service level agreements for cloud services. SCC 2016 : 13th International Conference on Services Computing, Los Alamitos : IEEE Computer Society, 27 june - 02 july 2016, San Francisco, United States, 2018, pp. 625-632, ISBN 978-1-5090-2628-9
abstract
Managing service quality in heterogeneous Cloud environments is complex: different Cloud providers expose different management interfaces. To manage Service Level Agreements (SLAs) in this context, we have developed the rSLA framework that enables fast setup of SLA monitoring in dynamic and heterogeneous Cloud environments. The rSLA framework is made up of three main components: the rSLA language to formally represent SLAs, the rSLA Service, which interprets the SLAs and implements the behavior specified in them, and a set of Xlets - lightweight, dynamically bound adapters to monitoring and controlling interfaces. In this paper, we present the rSLA framework, and describe how it enables the monitoring and enforcement of service level agreements for heterogeneous Cloud services
