Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Enabling lock-free concurrent workers over temporal graphs composed of multiple time-series
Fouquet, Francois; Hartmann, Thomas; Mosser, Sébastien et al.
2018In 33rd Annual ACM Symposium on Applied Computing (SAC'18)
Peer reviewed
 

Files


Full Text
author-preprint.pdf
Author preprint (658.03 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Distributed computing; Time series; Distributed graphs; Temporal graphs; Data analytics; Lock-free workers
Abstract :
[en] Time series are commonly used to store temporal data, e.g., sensor measurements. However, when it comes to complex analytics and learning tasks, these measurements have to be combined with structural context data. Temporal graphs, connecting multiple time- series, have proven to be very suitable to organize such data and ultimately empower analytic algorithms. Computationally intensive tasks often need to be distributed and parallelized among different workers. For tasks that cannot be split into independent parts, several workers have to concurrently read and update these shared temporal graphs. This leads to inconsistency risks, especially in the case of frequent updates. Distributed locks can mitigate these risks but come with a very high-performance cost. In this paper, we present a lock-free approach allowing to concurrently modify temporal graphs. Our approach is based on a composition operator able to do online reconciliation of concurrent modifications of temporal graphs. We evaluate the efficiency and scalability of our approach compared to lock-based approaches.
Disciplines :
Computer science
Author, co-author :
Fouquet, Francois;  DataThings
Hartmann, Thomas ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Mosser, Sébastien;  Université Côte d'Azur, I3S
Cordy, Maxime  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
External co-authors :
yes
Language :
English
Title :
Enabling lock-free concurrent workers over temporal graphs composed of multiple time-series
Publication date :
April 2018
Event name :
33rd Annual ACM Symposium on Applied Computing (SAC'18)
Event organizer :
Université de Pau et des Pays de l'Adour (UPPA)
Event place :
Pau, France
Event date :
09-04-2018 to 13-04-2018
Audience :
International
Main work title :
33rd Annual ACM Symposium on Applied Computing (SAC'18)
Peer reviewed :
Peer reviewed
Focus Area :
Computational Sciences
Funders :
CNRS (INS2I PEPS JCJC program) through the M4S project
European Commission (FEDER IDEES/CO-INNOVATION)
Creos Luxembourg S.A through the UL/SnT partnership programme
Available on ORBilu :
since 22 June 2018

Statistics


Number of views
101 (5 by Unilu)
Number of downloads
87 (1 by Unilu)

Scopus citations®
 
4
Scopus citations®
without self-citations
2
OpenCitations
 
2

Bibliography


Similar publications



Contact ORBilu