Seguir
Julien Sopena
Julien Sopena
Associate Professor, Sorbonne UPMC - CNRS/INRIA
Dirección de correo verificada de lip6.fr - Página principal
Título
Citado por
Citado por
Año
SLA guarantees for cloud services
D Serrano, S Bouchenak, Y Kouki, FA de Oliveira Jr, T Ledoux, J Lejeune, ...
Future Generation Computer Systems 54, 233-246, 2016
1412016
Towards qos-oriented sla guarantees for online cloud services
D Serrano, S Bouchenak, Y Kouki, T Ledoux, J Lejeune, J Sopena, ...
2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid …, 2013
1222013
NumaGiC: A garbage collector for big data on big NUMA machines
L Gidra, G Thomas, J Sopena, M Shapiro, N Nguyen
ACM SIGARCH Computer Architecture News 43 (1), 661-673, 2015
932015
A study of the scalability of stop-the-world garbage collectors on multicores
L Gidra, G Thomas, J Sopena, M Shapiro
ACM SIGPLAN Notices 48 (4), 229-240, 2013
922013
PaInleSS: a framework for parallel SAT solving
L Le Frioux, S Baarir, J Sopena, F Kordon
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
702017
{BMC}: Accelerating memcached using safe in-kernel caching and pre-stack processing
Y Ghigoff, J Sopena, K Lazri, A Blin, G Muller
18th USENIX Symposium on Networked Systems Design and Implementation (NSDI …, 2021
682021
Assessing the scalability of garbage collectors on many cores
L Gidra, G Thomas, J Sopena, M Shapiro
ACM SIGOPS Operating Systems Review 45 (3), 15-19, 2012
532012
The battle of the schedulers:{FreeBSD}{ULE} vs. linux {CFS}
J Bouron, S Chevalley, B Lepers, W Zwaenepoel, R Gouicem, J Lawall, ...
2018 USENIX Annual Technical Conference (USENIX ATC 18), 85-96, 2018
482018
Towards a solution avoiding Vendor Lock-in to enable Migration Between Cloud Platforms.
A Beslic, R Bendraou, J Sopenal, JY Rigolet
MDHPCL@ MoDELS, 5-14, 2013
382013
A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree
J Sopena, L Arantes, M Bertier, P Sens
Euro-Par 2005 Parallel Processing: 11th International Euro-Par Conference …, 2005
302005
Modular and efficient divide-and-conquer SAT solver on top of the painless framework
L Le Frioux, S Baarir, J Sopena, F Kordon
Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019
292019
2w-fd: A failure detector algorithm with qos
A Tomsic, P Sens, J Garcia, L Arantes, J Sopena
2015 IEEE International Parallel and Distributed Processing Symposium, 885-893, 2015
272015
Service level agreement for distributed mutual exclusion in cloud computing
J Lejeune, L Arantes, J Sopena, P Sens
2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid …, 2012
272012
Provable multicore schedulers with Ipanema: application to work conservation
B Lepers, R Gouicem, D Carver, JP Lozi, N Palix, MV Aponte, ...
Proceedings of the Fifteenth European Conference on Computer Systems, 1-16, 2020
212020
Maximizing parallelism without exploding deadlines in a mixed criticality embedded system
A Blin, C Courtaud, J Sopena, J Lawall, G Muller
2016 28th Euromicro Conference on Real-Time Systems (ECRTS), 109-119, 2016
202016
Fair comparison of gossip algorithms over large-scale random topologies
R Hu, J Sopena, L Arantes, P Sens, I Demeure
2012 IEEE 31st Symposium on Reliable Distributed Systems, 331-340, 2012
192012
A composition approach to mutual exclusion algorithms for grid applications
J Sopena, F Legond-Aubry, L Arantes, P Sens
2007 International Conference on Parallel Processing (ICPP 2007), 65-65, 2007
192007
Batchqueue: Fast and memory-thrifty core to core communication
T Preud'Homme, J Sopena, G Thomas, B Folliot
2010 22nd International Symposium on Computer Architecture and High …, 2010
182010
Making hadoop mapReduce byzantine fault-tolerant
AN Bessani, VV Cogo, M Correia, P Costa, M Pasin, F Silva, L Arantes, ...
DSN, Fast abstract, 2010
182010
Improving prediction accuracy of memory interferences for multicore platforms
C Courtaud, J Sopena, G Muller, DG Pérez
2019 IEEE Real-Time Systems Symposium (RTSS), 246-259, 2019
152019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20