Follow
Philippe Raipin Parvedy
Philippe Raipin Parvedy
Researcher at Orange
Verified email at orange.com
Title
Cited by
Cited by
Year
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering: –Feasibility Study–
X Défago, M Gradinariu, S Messika, P Raipin-Parvédy
Distributed Computing: 20th International Symposium, DISC 2006, Stockholm …, 2006
1392006
iFogStor: an IoT data placement strategy for fog infrastructure
MI Naas, PR Parvedy, J Boukhobza, L Lemarchand
2017 IEEE 1st International Conference on Fog and Edge Computing (ICFEC), 97-104, 2017
1282017
An extension to ifogsim to enable the design of data placement strategies
MI Naas, J Boukhobza, PR Parvedy, L Lemarchand
2018 IEEE 2nd international conference on fog and edge computing (ICFEC), 1-8, 2018
652018
A graph partitioning-based heuristic for runtime IoT data placement strategies in a fog infrastructure
MI Naas, L Lemarchand, J Boukhobza, P Raipin
Proceedings of the 33rd annual ACM symposium on applied computing, 767-774, 2018
552018
Optimal early stopping uniform consensus in synchronous systems with process omission failures
PR Parvédy, M Raynal
Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004
512004
Evaluating the condition-based approach to solve consensus
A Mostéfaoui, E Mourgaya, PR Parvédy, M Raynal
2003 International Conference on Dependable Systems and Networks, 2003 …, 2003
302003
A secure two-phase data deduplication scheme
P Meye, P Raipin, F Tronel, E Anceaume
2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 …, 2014
292014
IoT data replication and consistency management in fog computing
MI Naas, L Lemarchand, P Raipin, J Boukhobza
Journal of Grid Computing 19, 1-25, 2021
272021
Fault and byzantine tolerant self-stabilizing mobile robots gathering-feasibility study
X Défago, MG Potop-Butucaru, J Clément, S Messika, P Raipin-Parvédy, ...
arXiv preprint arXiv:1602.05546, 2016
232016
Self-stabilizing gathering of mobile robots under crash or byzantine faults
X Défago, M Potop-Butucaru, P Raipin-Parvédy
Distributed Computing 33 (5), 393-421, 2020
222020
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures
P Raïpin Parvédy, M Raynal, C Travers
Theory of Computing Systems 47 (1), 259-287, 2010
21*2010
Self-* distributed query region covering in sensor networks
AK Datta, M Gradinariu, P Linga, P Raïpin-Parvédy
Journal of Aerospace Computing, Information, and Communication 3 (8), 437-452, 2006
172006
Uniform agreement despite process omission failures
PR Parvédy, M Raynal
Proceedings International Parallel and Distributed Processing Symposium, 7 pp., 2003
152003
Clock-G: A temporal graph management system with space-efficient storage technique
M Massri, Z Miklos, P Raipin, P Meye
2022 IEEE 38th International Conference on Data Engineering (ICDE), 2263-2276, 2022
142022
A fault-tolerant protocol for resource allocation in a grid dedicated to genomic applications
M Hurfin, JP Le Narzul, J Pley, PR Parvedy
International Conference on Parallel Processing and Applied Mathematics …, 2003
142003
Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes
PR Parvedy, M Raynal, C Travers
International Conference on Parallel Computing Technologies, 49-58, 2005
102005
GDBAlive: a temporal graph database built on top of a columnar data store
M Massri, P Raipin, P Meye
Journal of advances in information technology, 2020
92020
Decision optimal early-stopping k-set agreement in synchronous systems prone to send omission failures
PRA PARVedy, M Raynal, C Travers
11th Pacific Rim International Symposium on Dependable Computing (PRDC'05 …, 2005
92005
WoT graph as multiscale digital-twin for cyber-physical systems-of-systems
G Privat, T Coupaye, S Bolle, P Raipin-Parvedy
Proc., 2nd W3C Web of Things Workshop. Grenoble, France: Gilles Private …, 2019
72019
RTGEN++: A relative temporal graph generator
M Massri, Z Miklos, P Raipin, P Meye, AB Pilet, T Hassan
Future Generation Computer Systems 146, 139-155, 2023
62023
The system can't perform the operation now. Try again later.
Articles 1–20