BACK TO INDEX

All publications sorted by year
2018
  1. Eddy Caron, Laurent Lefevre, and Issam Raïs. Thermal aware scheduling on distributed computing water heaters. In IEEE Consumer Communications and Networking Conference (CCNC 2018), WiP/Special-Sessions, Las Vegas, January 2018. IEEE.
    Note: To appear.
    Keywords: Cloud, Scheduling, Energy. [bibtex-key = InProceedingsCaron.CLR_18] [bibtex-entry]


2017
  1. Daniel Balouek-Thomert, Eddy Caron, Pascal Gallard, and Laurent Lefevre. Nu@ge : A container-based cloud computing service federation. Concurrency and Computation: Practice and Experience, pp e4049--n/a, January 2017.
    Keywords: cloud federation, energy-aware scheduling, IaaS.
    Abstract: The adoption of cloud computing is still limited by several legal concerns that customers may 68 have, such as data sovereignty. In cloud computing, data can be physically hosted in sensible loca- 69 tions, resulting in a lack of control for companies. In this context, we present the Nu@ge project, 70 which aims at building a federation of container-sized datacenters in the French territory. Nu@ge 71 provides a software stack that enables companies to interconnect independent datacenters in 72 a national mesh. A software architecture is presented and implemented as a federation of small 73 datacenters deployed in France. The proposed architecture enables cooperation between local 74 customized-cloud managers and a federation-wide middleware. It uses monitoring information 75 from facilities and performance indicators from physical servers for managing the system, pre- 76 venting incidents and considering energy efficiency. Additionally, a prototype of a container-sized 77 datacenter has been validated and patented.
    [bibtex-key = ArticleBalouek-Thomert.BCGL_CCPE17] [bibtex-entry]


  2. Yves Caniou, Eddy Caron, Aurélie Kong Win Chang, and Yves Robert. Budget-aware scheduling algorithms for scientific workflows on IaaS Cloud platforms. In WORKS 2017. Workshop Workflows in Support of Large-Scale Science., Denver - Colorado, November 2017. In conjunction with SC'17.
    Note: Lightning talk session (1 page).
    Keywords: Cloud, Workflow. [bibtex-key = Con-Caniou.CCK-W-CR_17] [bibtex-entry]


  3. Eddy Caron and Hadrien Croubois. Communication aware task placement for workflow scheduling on DaaS-based Cloud. In Workshop PDCO 2017. Parallel / Distributed Computing and Optimization, Orlando, FL. USA, May 2017. In conjunction with IPDPS 2017, The 31st IEEE International Parallel & Distributed Processing Symposium.
    Keywords: Cloud, DaaS, Workflow. [bibtex-key = InProceedingsCaron.CC_17] [bibtex-entry]


2016
  1. Eddy Caron, Ajoy K. Datta, Cédric Tedeschi, and Franck Petit. Self-Stabilizing Prefix Tree Based Overlay Networks. International Journal of Foundations of Computer Science, 2016.
    Note: Hal-01347457. [bibtex-key = ArticleCaron.CDTP_IJFCS16] [bibtex-entry]


  2. Eddy Caron, Maurice Djibril Faye, and Ousmane Thiaré. Un algorithme auto-stabilisant pour le déploiement auto-adaptatif d'un intergiciel hiérarchique : spécification, preuve, simulations. ARIMA (Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées), Volume 25(Special Issue CNRIA 2015):1-20, 2016.
    Note: Hal-01311153.
    Keywords: DIET, Deployment, Self-stabilization. [bibtex-key = ArticleCaron.CD-FT_ARAREIMA16] [bibtex-entry]


  3. Daniel Balouek-Thomert, Arya Bhattacharya, Eddy Caron, Karunakar Gadireddy, and Laurent Lefevre. Parallel Differential Evolution approach for Cloud workflow placements under simultaneous optimization of multiple objectives. In IEEE Congress on Evolutionary Computation (IEEE CEC 2016), July 2016. In conjunction with the bi-annual IEEE World Congress on Computational Intelligence (IEEE WCCI), IEEE.
    Note: Hal-01289176.
    Keywords: Cloud, Green, DIET, Multiple-objective. [bibtex-key = InProceedingsBalouek-Thomert.BBCGL_16] [bibtex-entry]


  4. Eddy Caron and Marcos D. Assuncao. Multi-Criteria Malleable Task Management for Hybrid-Cloud Platforms. In 2nd International Conference on Cloud Computing Technologies and Applications (CloudTech'16), Marrakesh, Morocco, 2016.
    Note: Hal-01355682.
    Keywords: Cloud, Scheduling. [bibtex-key = InProceedingsCaron.CA_16] [bibtex-entry]


  5. Eddy Caron, Arnaud Lefray, and Jonathan Rouzaud-Cornabas. Secured Systems in Clouds with Model-Driven Orchestration. In The 2nd IEEE Workshop on Security and Privacy in the Cloud (SPC 2016), October 17-19 2016. In conjunction with the IEEE CNS conference.
    Note: Hal-01355681.
    Keywords: Security, Cloud, Seed4C. [bibtex-key = InProceedingsCaron.CLR_16] [bibtex-entry]


2015
  1. Daniel Balouek-Thomert, Eddy Caron, Pascal Gallard, and Laurent Lefevre. Nu@ge: Towards a solidary and responsible Cloud Computing service. In CLOUDTECH 2015: The International Conference of Cloud Computing Technologies and Applications, Marrakesh (Morocco), june 2015. IEEE.
    Note: Best Paper Award. hal-01196898.
    Keywords: Green, Energy, DIET. [bibtex-key = InProceedingsBalouek-Thomert.BCGL_15] [bibtex-entry]


  2. Daniel Balouek-Thomert, Eddy Caron, and Laurent Lefevre. Energy-Aware Server Provisioning by Introducing Middleware-Level Dynamic Green Scheduling. In Workshop HPPAC'15. High-Performance, Power-Aware Computing, Hyderabad, India, May 2015. In conjunction with IPDPS 2015.
    Note: Hal-01196908.
    Keywords: DIET, Green, Energy. [bibtex-key = InProceedingsBalouek-Thomert.BCL_15] [bibtex-entry]


  3. Aline Bousquet, Jérémy Briffaut, Eddy Caron, Eva Maria Dominguez, Javier Franco, Arnaud Lefray, Oscar Lopez, Saioa Ros, Jonathan Rouzaud-Cornabas, Christian Toinard, and Uriate Mikel. Enforcing Security and Assurance Properties in Cloud Environment. In IEEE/ACM Utility & Cloud Computing (UCC 2015), December 2015. IEEE.
    Note: Hal-01240557.
    Keywords: Seed4C. [bibtex-key = InProceedingsBousquet.BBCDFLLRRTM_15] [bibtex-entry]


  4. Eddy Caron, Maurice Djibril Faye, and Ousmane Thiaré. Autonomic Management using Self-Stabilization for Hierarchical and Distributed Middleware. In The 2015 International Symposium on Advances in Autonomic and Secure Computing and Communications (ASCC-2015), Liverpool (UK), 26-28 Oct 2015. In conjunction with DASC-15.
    Note: Hal-01239792. [bibtex-key = InProceedingsCaron.CD-FT_15] [bibtex-entry]


  5. Eddy Caron, Maurice Djibril Faye, and Ousmane Thiaré. Modélisation d'un intergiciel de grille pour le déploiement auto-adaptatif. In Colloque National sur la Recherche en Informatique et ses Applications (CNRIA'2015), Thiès (EPT), Sénégal, October 28-30 2015.
    Note: Hal-01240566. [bibtex-key = InProceedingsCaron.CD-FT_15*1] [bibtex-entry]


  6. Arnaud Lefray, Eddy Caron, Jonathan Rouzaud-Cornabas, and Christian Toinard. Microarchitecture-aware Virtual Machine Placement Under Information Leakage Constraints. In 8th IEEE International Conference on Cloud Computing, New York, NY, USA, June 27-July 2 2015. IEEE Computer Society.
    Note: Hal-01240573.
    Keywords: Security, Seed4C, Cloud. [bibtex-key = InProceedingsLefray.LCRT_15] [bibtex-entry]


2014
  1. Eddy Caron, Frédéric Desprez, and Jonathan Rouzaud-Cornabas. Smart Resources Allocation to improve Cloud Security. In Springer Berlin / Heidelberg, editor,Security, Privacy and Trust in Cloud Systems, volume Part 1, pages 103-143. Springer, 2014.
    Note: Hal-00931144.
    Keywords: Security, Seed4C, Cloud. [bibtex-key = InCollectionCaron.CDR_14] [bibtex-entry]


  2. Daniel Balouek-Thomert, Eddy Caron, and Laurent Lefèvre. Gestion adaptative de l'énergie pour les infrastructures de type grappe ou nuage. In ComPAS'2014. Conférence en Parallélisme, Architecture et Système, Neuchâtel, Suisse Romande, April 2014.
    Note: Hal-01018238.
    Keywords: Green, Cloud. [bibtex-key = InProceedingsBalouek-Thomert.BCL_14] [bibtex-entry]


  3. Laurent Bobelin, Aline Bousquet, Jérémy Briffaut, Eddy Caron, Jean-François Couturier, Arnaud Lefray, Jonathan Rouzaud-Cornabas, and Christian Toinard. An Advanced Security-Aware Cloud Architecture. In International Conference on High Performance Computing & Simulation (HPCS), Bologna, Italy, July 2014. IEEE.
    Note: Hal-01063852.
    Keywords: Cloud, Security, Seed4C. [bibtex-key = InProceedingsBobelin.BBBCCLRT_14] [bibtex-entry]


  4. Eddy Caron, Benjamin Depardon, and Adela Neacsu. How to bring the power of Cloud and Distributed Infrastructures to Scilab?. In SCILABTEC. 6th International Scilab Users Conference, May 2014.
    Note: Hal-01240664.
    Keywords: DIET, Scilab. [bibtex-key = InProceedingsCaron.CDN_14] [bibtex-entry]


  5. Eddy Caron and Jonathan Rouzaud-Cornabas. Improving users' isolation in IaaS: Virtual Machine Placement with Security Constraints. In IEEE CLOUD 2014. 7th IEEE International Conference on Cloud Computing, Anchorage, USA, June 27-July 2 2014. IEEE Computer Society.
    Note: Hal-01240592.
    Keywords: Security, Seed4C, Cloud. [bibtex-key = InProceedingsCaron.CR_14] [bibtex-entry]


  6. Yves Caniou, Eddy Caron, Gaël Le Mahec, and Hidemoto Nakada. Data Management API within the GridRPC. Technical report, Institut National de Recherche en Informatique et en Automatique (INRIA), 2014.
    Note: Hal-01009375.
    Keywords: GridRPC, Data Management. [bibtex-key = Tec-Caniou.CCL-MN_14] [bibtex-entry]


  7. Eddy Caron and Jonathan Rouzaud-Cornabas. Improving users' isolation in IaaS: Virtual Machine Placement with Security Constraints. Research Report RR-8444, INRIA, January 2014.
    Note: Hal-00924296.
    Keywords: Cloud, IaaS, Security, Isolation, Constraint, Heuristics. [bibtex-key = TechReportRR-INRIA-RR-8444] [bibtex-entry]


2013
  1. Bertrand Marquet, Guy-Betrand Kamga, Stéphane Betgé-Brezetz, Marie-Pascale Dupont, Laurent Clevy, Benjamin Venelle, Aline Bousquet, Jérémy Briffaut, Christian Toinard, Jean-Marc Lambert, Eddy Caron, Arnaud Lefray, Lamiel Toch, and Jonathan Rouzaud-Cornabas. Seeding the Cloud: An Innovative Approach to Grow Trust in Cloud Based Infrastructures. In The Future Internet. Future Internet Assembly 2013: Validated Results and New Horizons, volume 7858 of Lecture Notes in Computer Science (LNCS)., pages 153-158. FIA Book 2013 Publisher, Springer edition, 2013.
    Note: Hal-00840730.
    Keywords: Seed4C, Cloud, Security. [bibtex-key = InCollectionMarquet.MKBDCVBBTLCLTR_13] [bibtex-entry]


  2. Eddy Caron, Florent Chuffart, and Cédric Tedeschi. When Self-Stabilization Meets Real Platforms: an Experimental Study of a Peer-to-Peer Service Discovery System. Future Generation Computer Systems, 29(6):1533-1543, August 2013.
    Note: Hal-00762693.
    Abstract: In the days of large scale, heterogeneous computing infrastructures gathering myriads of services, service discovery has become a critical feature that has to deal with the scale and dynamic nature of such platforms. The SPADES project (Servicing Petascale Architectures and DistributEd System, 08-ANR-SEGI-025) is a consortium whose purpose is to promote new solutions to deal with a very large number of volatile and heterogeneous computing resources. For the aforementioned reasons, at the project's core, the service discovery has been envisioned as fully decentralized. More precisely, the proposed P2P service discovery system proposed within the SPADES project is based on the DLPT approach (Distributed Lexicographic Placement Table) providing distributed structures and algorithms for such a feature. In this paper, an implementation of the DLPT concepts into the middleware developed within the SPADES project, called SBAM (Spades BAsed Middleware), is devised. Furthermore, its actual deployment over a nation-wide grid system, as well as its performance are detailed.
    [bibtex-key = ArticleCaron.CCT_FGCS13] [bibtex-entry]


  3. Aline Bousquet, Jérémy Briffaut, Eddy Caron, Arnaud Lefray, Jonathan Rouzaud-Cornabas, Christian Toinard, and Yulin Zhang Huaxi. Security-Aware Models for Clouds. In ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC 22), June 2013.
    Note: Open Call Posters. hal-00840734.
    Keywords: Security, Cloud, Seed4C. [bibtex-key = InProceedingsBousquet.BBCLRTZ-H_13] [bibtex-entry]


  4. Eddy Caron, Maurice Djibril Faye, Jonathan Rouzaud-Cornabas, and Ousmane Thiaré. Grid Middleware Modelling for Self-Adaptive Deployment. In The International Symposium on Autonomous Decentralized System (ISADS 2013), Mexico City, pages 51-56, March 6-8 2013. Universidad Panamerica, IEEE Computer Society.
    Note: IEEE Catalog Number: CFP13099-PRT. hal-00932400.
    Keywords: Deployment, DIET. [bibtex-key = InProceedingsCaron.CD-FRT_13] [bibtex-entry]


  5. Eddy Caron, Anh Dung Le, Arnaud Lefray, and Christian Toinard. Definition of security metrics for the Cloud Computing and security-aware virtual machine placement algorithms. In Proceedings of International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC 2013), Beijing, China., pages 125-131, October 10-12 2013. IEEE Computer Society.
    Note: Hal-00932401.
    Keywords: Seed4C, Cloud, Security. [bibtex-key = InProceedingsCaron.CLLT_13] [bibtex-entry]


  6. Cristian Klein, Frédéric Camillo, Eddy Caron, Ronan Guivarch, Aurélie Hurault, and Christian Pérez. Resource Management Architecture for Fair Scheduling of Optional Computations. In 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Compiegne, France, October 2013. IEEE, IEEE CPS.
    Note: Hal-00865668.
    Keywords: Scheduling, DIET, COOP. [bibtex-key = InProceedingsKlein.KCCGHP_13] [bibtex-entry]


  7. Eddy Caron, Jonathan Rouzaud-Cornabas, and Lamiel Toch. Comparison on OpenStack and OpenNebula performance to improve multi-Cloud architecture on cosmological simulation use case. Research report RR-8421, Inria, December 2013.
    Note: Hal-00916908.
    Keywords: Cloud, IaaS, OpenNebula, Multi-Clouds, DIET, OpenStack, RAMSES, cosmology.
    Abstract: With the increasing numbers of Cloud Service Providers and the migration of the Grids to the Cloud paradigm, it is necessary to be able to leverage these new resources. Moreover, a large class of High Performance Computing (HPC) applications can run these resources without (or with minor) modifications. But using these resources come with the cost of being able to interact with these new resource providers. In this paper we introduce the design of a HPC middleware that is able to use resources coming from an environment that compose of multiple Clouds as well as classical \hpc resources. Using the \diet middleware, we are able to deploy a large-scale, distributed HPC platform that spans across a large pool of resources aggregated from different providers. Furthermore, we hide to the end users the difficulty and complexity of selecting and using these new resources even when new Cloud Service Providers are added to the pool. Finally, we validate the architecture concept through cosmological simulation RAMSES. Thus we give a comparison of 2 well-known Cloud Computing Software: OpenStack and OpenNebula.
    [bibtex-key = TechReportRR-Inria-RR-8421] [bibtex-entry]


2012
  1. Eddy Caron, Frédéric Desprez, Adrian Muresan, and Luis Rodero-Merino. Using Clouds to Scale Grid Resources: An Economic Model. Future Generation Computer Systems, Volume 28(Issue 4):633--646, April 2012.
    Note: Hal-00758595.
    Keywords: Cloud, DIET.
    Abstract: Infrastructure as a Service clouds are a flexible and fast way to obtain (virtual) resources as demand varies. Grids, on the other hand, are middleware platforms able to combine resources from different administrative domains for tasks ex- ecution. Clouds can be used as providers of devices such as virtual machines by grids so they only use the resources they need at every moment, but this requires grids to be able to decide when to allocate and release those resources. Here we analyze by simulations an economic approach to set resource prices and resolve when to scale resources depending on the users demand. Our simula- tor is based on the well-known GridSim software for grid simulation, which we expand. The results show how the proposed system can successfully adapt the amount of allocated resources to the demand, while at the same time ensuring that resources are fairly shared among users.
    [bibtex-key = ArticleCaron.CDMR_FGCS12] [bibtex-entry]


  2. Yves Caniou, Eddy Caron, Gaël Le Mahec, and Hidemoto Nakada. Transparent Collaboration of GridRPC Middleware using the OGF Standardized GridRPC Data Management API. In The International Symposium on Grids and Clouds (ISGC), pages 12p, February 26 - March 2 2012. Proceedings of Science.
    Note: Hal-01009373. [bibtex-key = InProceedingsCaniou.CCL-MN_12] [bibtex-entry]


  3. Eddy Caron, Florent Chuffart, Anissa Lamani, and Franck Petit. Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems. In Andréa W. Richa and Christian Scheideler, editors, 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), number 7596 of Lecture Notes in Computer Science, Toronto, Canada, pages 239-252, October 2012. Springer.
    Note: Hal-00758597. [bibtex-key = InProceedingsCaron.CCLP_12] [bibtex-entry]


  4. Eddy Caron, Frédéric Desprez, Adrian Muresan, and Frédéric Suter. Budget Constrained Resource Allocation for Non-Deterministic Workflows on an IaaS Cloud. In 12th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2012), Fukuoka (Japan), September 4-7 2012. Springer.
    Note: Hal-00758598. [bibtex-key = InProceedingsCaron.CDMS_12] [bibtex-entry]


  5. Eddy Caron and Matthieu Imbert. Dynamic Network Forecasting using SimGrid Simulations. In Cluster 2012. IEEE International Conference on Cluster Computing., China, September 2012.
    Note: Hal-00854083. [bibtex-key = InProceedingsCaron.CI_12] [bibtex-entry]


  6. Frédéric Camillo, Eddy Caron, Ronan Guivarch, Aurélie Hurault, Cristian Klein, and Christian Perez. Diet-ethic: Fair Scheduling of Optional Computations in GridRPC Middleware. Technical report RR-7959 (2012), Institut National de Recherche en Informatique et en Automatique (INRIA), May 2012.
    Note: Hal-00696104. [bibtex-key = TechReportRR-Institut-RR-7959-2012] [bibtex-entry]


  7. Eddy Caron, Florent Chuffart, Alain Cournier, Anissa Lamani, Franck Petit, Cédric Tedeschi, and Vincent Villain. Fault-Tolerant and Dynamic Service Discovery System. Technical report 1.2, ANR SPADES. 08-ANR-SEGI-025, January 2012.
    Note: Hal-01427718.
    Keywords: SPADES. [bibtex-key = TechReportRR-ANR-1.2] [bibtex-entry]


  8. Eddy Caron, Florent Chuffart, Anissa Lamani, and Franck Petit. Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems. Research report, Institut National de Recherche en Informatique et en Automatique (INRIA), October 2012.
    Note: Hal-00714775. [bibtex-key = Tec-Caron.CCLP_12] [bibtex-entry]


  9. Eddy Caron, Frédéric Desprez, Adrian Muresan, and Frédéric Suter. Budget Constrained Resource Allocation for Non-Deterministic Workflows on a IaaS Cloud. Rapport de recherche RR-7962, INRIA, May 2012.
    Note: Hal-00697032.
    Keywords: resource allocation, scheduling, PTG, workflow.
    Abstract: Many scientific applications are described through workflow structures. Due to the increasing level of parallelism offered by modern computing infrastructures, workflow applications now have to be composed not only of sequential programs, but also of parallel ones. Cloud platforms bring on-demand resource provisioning and pay-as-you-go payment charging. Then the execution of a workflow corresponds to a certain budget. The current work addresses the problem of resource allocation for non-deterministic workflows under budget constraints. We present a way of transforming the initial problem into sub-problems that have been studied before. We propose two new allocation algorithms that are capable of determining resource allocations under budget constraints and we present ways of using them to address the problem at hand.
    [bibtex-key = TechReportRR-INRIA-RR-7962] [bibtex-entry]


  10. Eddy Caron, Frédéric Desprez, Luis Rodero-Merino, and Adrian Muresan. Auto-scaling, load balancing and monitoring in commercial and open-source clouds. Technical report RR-7857, Institut National de Recherche en Informatique et en Automatique (INRIA), September 2012.
    Note: Hal-00668713.
    Keywords: Cloud. [bibtex-key = TechReportRR-Institut-RR-7857] [bibtex-entry]


  11. Florent Chuffart, Eddy Caron, and Gael Yvert. Natural Functional Diversity of the Yeast Galactose Network. Poster at the Joint EMBL-EBI-Wellcome Trust Course: In silico Systems Biology, April 2012.
    Note: Hal-01427716.
    Keywords: SPADES.
    Abstract: Systems biology can now be considered an established and fundamental field in life sciences. It has facilitated the move from the identification of molecular `parts lists' for living organisms towards synthesising information from different `omics'-based approaches to generate and test new hypotheses about how biological systems work. This joint EMBL-EBI-Wellcome Trust course will combine lectures and led discussions to identify the key challenges, opportunities and bottlenecks, with practical sessions on network analysis and network-based modelling.
    [bibtex-key = Mis-Chuffart.CCY_12] [bibtex-entry]


2011
  1. Eddy Caron, Frédéric Desprez, Luis Rodero-Merino, and Adrian Muresan. Auto-scaling, load balancing and monitoring in commercial and open-source clouds. In Lizhe Wang, Rajiv Ranjan, Jinjun Chen, and Boualem Benatallah, editors,Cloud Computing: Methodology, Systems, and Applications, chapter 14, pages 301--324. Taylor and Francis Group, LLC, September 2011.
    Note: ISBN: 9781439856413. hal-01426839.
    Keywords: Cloud. [bibtex-key = InCollectionCaron.CDRM_11] [bibtex-entry]


  2. Eddy Caron, Frédéric Desprez, and Adrian Muresan. Pattern Matching Based Forecast of Non-periodic Repetitive Behavior for Cloud Clients. Journal of Grid Computing, 9(1):49-64, March 2011.
    Note: Hal-01426826.
    Keywords: Cloud. [bibtex-key = ArticleCaron.CDM_JGC11] [bibtex-entry]


  3. Luis Rodero-Merino, Luis M. Vaquero, Eddy Caron, Adrian Muresan, and Frédéric Desprez. Building safe PaaS clouds: A survey on security in multitenant software platforms. Computer and Security, pp 13, 2011.
    Note: Article in press. Available online 2 November 2011. hal-00854655.
    Keywords: Security, Cloud, PaaS, Multitenancy, Container, Java, .NET.
    Abstract: This paper surveys the risks brought by multitenancy in software platforms, along with the most prominent solutions proposed to address them. A multitenant platform hosts and executes software from several users (tenants). The platform must ensure that no malicious or faulty code from any tenant can interfere with the normal execution of other users? code or with the platform itself. This security requirement is specially relevant in Platform-as-a-Service (PaaS) clouds. PaaS clouds offer an execution environment based on some software platform. Unless PaaS systems are deemed as safe environments users will be reluctant to trust them to run any relevant application. This requires to take into account how multitenancy is handled by the software platform used as the basis of the PaaS offer. This survey focuses on two technologies that are or will be the platform-of-choice in many PaaS clouds: Java and .NET. We describe the security mechanisms they provide, study their limitations as multitenant platforms and analyze the research works that try to solve those limitations. We include in this analysis some standard container technologies (such as Enterprise Java Beans) that can be used to standardize the hosting environment of PaaS clouds. Also we include a brief discussion of Operating Systems (OSs) traditional security capacities and why OSs are unlikely to be chosen as the basis of PaaS offers. Finally, we describe some research initiatives that reinforce security by monitoring the execution of untrusted code, whose results can be of interest in multitenant systems.
    [bibtex-key = ArticleRodero-Merino.RVCMD_CS11] [bibtex-entry]


  4. Anestis Antoniadis, Eddy Caron, Benjamin Depardon, Hubert Gallee, Celine Helbert, Clémentine Prieur, and Laurence Viry. Spatio-temporal modeling of Western African monsoon. In Les Ateliers de Modélisation de l'Atmosphère, Toulouse, February 2011.
    Note: Hal-00766783. [bibtex-key = Con-Antoniadis.ACDGHPV_11] [bibtex-entry]


  5. Yves Caniou, Eddy Caron, Gaël Le Mahec, and Hidemoto Nakada. Standardized Data Management in GridRPC Environments. In 6th International Conference on Computer Sciences and Convergence Information Technology, ICCIT'11, Jeju Island, Korea, pages 8, Nov. 29 - Dec. 1 2011. IEEE.
    Note: Hal-00766782.
    Keywords: GridRPC, DIET. [bibtex-key = InProceedingsCaniou.CCL-MN_11] [bibtex-entry]


  6. Eddy Caron, Florent Chuffart, Haiwu He, Anissa Lamani, Philippe Le Brouster, and Olivier Richard. Large Scale P2P Discovery Middleware Demonstration. In IEEE International Conference on Peer-to-Peer Computing (P2P'11), Kyoto, pages 152-153, 31 August - 2 September 2011. IEEE.
    Note: Hal-00687561.
    Keywords: P2P, Service discovery, SPADES. [bibtex-key = InProceedingsCaron.CCHLL-BR_11] [bibtex-entry]


  7. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. On-Line Optimization of Publish/Subscribe Overlays. In Workshop PCO'11. Parallel Computing and Optimization, Anchorage, USA, May 2011. In conjunction with IPDPS 2011.
    Note: Hal-00758593.
    Keywords: R-tree, DR-tree, work function, on-line, competitiveness. [bibtex-key = InProceedingsCaron.CDDL_11] [bibtex-entry]


  8. Eddy Caron, Benjamin Depardon, and Frédéric Desprez. Multiple Services Throughput Optimization in a Hierarchical Middleware. In The 11th International Symposium on Cluster, Cloud and Grid Computing, Newport Beach, CA, USA., pages 94 - 103, May 23-26 2011. IEEE/ACM.
    Note: Hal-00767479. [bibtex-key = InProceedingsCaron.CDD_11] [bibtex-entry]


  9. Eddy Caron, Frédéric Desprez, Adrian Muresan, and Luis Rodero-Merino. Using Clouds to Scale Grid Resources: An Economic Model. Research report RR-7837, Institut National de Recherche en Informatique et en Automatique (INRIA), 2011.
    Note: Hal-00657309.
    Keywords: Cloud, DIET.
    Abstract: Infrastructure as a Service clouds are a flexible and fast way to obtain (virtual) resources as demand varies. Grids, on the other hand, are middleware platforms able to combine resources from different administrative domains for tasks ex- ecution. Clouds can be used as providers of devices such as virtual machines by grids so they only use the resources they need at every moment, but this requires grids to be able to decide when to allocate and release those resources. Here we analyze by simulations an economic approach to set resource prices and resolve when to scale resources depending on the users demand. Our simula- tor is based on the well-known GridSim software for grid simulation, which we expand. The results show how the proposed system can successfully adapt the amount of allocated resources to the demand, while at the same time ensuring that resources are fairly shared among users.
    [bibtex-key = TechReportRR-Institut-RR-7837] [bibtex-entry]


  10. Eddy Caron and Cédric Tedeschi. Service Discovery system: Load balancing mechanisms. Technical report 1.1, ANR SPADES. 08-ANR-SEGI-025, July 2011.
    Note: Hal-01427722. [bibtex-key = TechReportRR-ANR-1.1] [bibtex-entry]


  11. Luis Rodero-Merino, Luis M. Vaquero, Eddy Caron, Adrian Muresan, and Frédéric Desprez. Building safe PaaS clouds: A survey on security in multitenant software platforms. Technical report RR-7838, Institut National de Recherche en Informatique et en Automatique (INRIA), 2011.
    Note: Article in press. Available online 2 November 2011. hal-00657306.
    Keywords: Security, Cloud, PaaS, Multitenancy, Container, Java, .NET.
    Abstract: This paper surveys the risks brought by multitenancy in software platforms, along with the most prominent solutions proposed to address them. A multitenant platform hosts and executes software from several users (tenants). The platform must ensure that no malicious or faulty code from any tenant can interfere with the normal execution of other users? code or with the platform itself. This security requirement is specially relevant in Platform-as-a-Service (PaaS) clouds. PaaS clouds offer an execution environment based on some software platform. Unless PaaS systems are deemed as safe environments users will be reluctant to trust them to run any relevant application. This requires to take into account how multitenancy is handled by the software platform used as the basis of the PaaS offer. This survey focuses on two technologies that are or will be the platform-of-choice in many PaaS clouds: Java and .NET. We describe the security mechanisms they provide, study their limitations as multitenant platforms and analyze the research works that try to solve those limitations. We include in this analysis some standard container technologies (such as Enterprise Java Beans) that can be used to standardize the hosting environment of PaaS clouds. Also we include a brief discussion of Operating Systems (OSs) traditional security capacities and why OSs are unlikely to be chosen as the basis of PaaS offers. Finally, we describe some research initiatives that reinforce security by monitoring the execution of untrusted code, whose results can be of interest in multitenant systems.
    [bibtex-key = TechReportRR-Institut-RR-7838] [bibtex-entry]


  12. Yves Caniou, Eddy Caron, Gaël Le Mahec, and Hidemoto Nakada. Data Management API within the GridRPC. Open Grid Forum, July 2011.
    Note: OGF Reference: GFD 186. hal-01427708.
    Keywords: GridRPC, Data Management. [bibtex-key = Man-Caniou.CCL-MN_11] [bibtex-entry]


2010
  1. Eddy Caron. Contribution to the management of large scale platforms: the DIET experience. HDR (Habilitation à Diriger les Recherches), École Normale Supérieure de Lyon, oct # 6 2010.
    Note: Hal number tel-00629060.
    Keywords: DIET, SPADES, LEGO. [bibtex-key = PhDThesisPhD-Caron_10] [bibtex-entry]


  2. Eddy Caron, Ajoy K. Datta, Benjamin Depardon, and Lawrence L. Larmore. A Self-Stabilizing K-clustering algorithm for weighted graphs. Journal of Parallel and Distributed Computing, 70(11):1159-1173, November 2010.
    Note: Hal-00758590.
    Keywords: k-clustering, Self-stabilization, Weighted graph, SPADES. [bibtex-key = ArticleCaron.CDDL_JPDC10] [bibtex-entry]


  3. Eddy Caron, Frédéric Desprez, Adrian Muresan, and Luis Rodero-Merino. Recent development in DIET: from Grid to Cloud. ERCIM News. Special Theme: Cloud Computing. Platforms, Software, and Applications, No. 83:25-26, October 2010.
    Note: Hal-01427723.
    Keywords: DIET, Cloud Computing. [bibtex-key = ArticleCaron.CDMR_ENSTCCPSA10] [bibtex-entry]


  4. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems. Parallel Processing Letters, 20(1):15-30, March 2010.
    Note: Hal-01427726.
    Keywords: DLPT, SPADES. [bibtex-key = ArticleCaron.CDPT_PPL10] [bibtex-entry]


  5. Vlad Acretoaie, Eddy Caron, and Cédric Tedeschi. A Practical Study of Self-Stabilization for Prefix-Tree Based Overlay Networks. In MOSPAS 2010. Workshop on MOdeling and Simulation of Peer-to-Peer Architectures and Systems. As part of The International Conference on High Performance Computing and Simulation (HPCS 2010), Caen. France., pages 341-347, June 28-July 2 2010. IEEE.
    Note: Hal-01427728.
    Keywords: DLPT, SPADES.
    Abstract: Service discovery is crucial in the development of fully decentralized computational grids. Among the significant amount of work produced by the convergence of peer- to-peer (P2P) systems and grids, a new kind of overlay networks, based on prefix trees (a.k.a., tries), has emerged. In particular, the Distributed Lexicographic Placement Table (DLPT) approach is a decentralized and dynamic service discovery service. Fault-tolerance within the DLPT approach is achieved through best-effort policies relying on formal self-stabilization results. Self-stabilization means that the tree can become transiently inconsistent, but is guaranteed to autonomously converge to a correct topology after arbitrary crashes, in a finite time. However, during convergence, the tree may not be able to process queries correctly. In this paper, we present some simula- tion results having several objectives. First, we investigate the interest of self-stabilization for such architectures. Second, we explore, still based on simulation, a simple Time-To-Live policy to avoid useless processing during convergence time.
    [bibtex-key = InProceedingsAcretoaie.ACT_10] [bibtex-entry]


  6. Nicolas Bard, Raphaël Bolze, Eddy Caron, Frédéric Desprez, Michaël Heymann, Anne Friedrich, Luc Moulinier, Ngoc-Hoan Nguyen, Olivier Poch, and Thierry Toursel. Décrypthon Grid - Grid Resources Dedicated to Neuromuscular Disorders. In The 8th HealthGrid conference, Paris, France, June 2010.
    Note: Hal-01427727.
    Keywords: DIET, Décrypthon.
    Abstract: Thanks to the availability of Grids and their middleware, a seamless access to computation and storage resource is provided to application developers and scientists. The D{\'e}crypthon project is one example of such high performance platform. In this paper, we present the architecture of the platform, the middleware developed to ease the access to several servers deployed over France and an example of an application taking advantage of its capacity.
    [bibtex-key = InProceedingsBard.BBCDHFMNPT_10] [bibtex-entry]


  7. Eddy Caron, Benjamin Depardon, and Frédéric Desprez. Deployment of a hierarchical middleware. In LNCS, editor, Euro-Par 2010, volume 6271 Part I, Ischia - Naples, Italy, pages 343-354, August 31 to September 3 2010. Institute for High Performance Computing and Networking of the Italian National Research Council.
    Note: Hal-00758591.
    Keywords: DIET, Deployment.
    Annotation: Acceptance rate: 35.1 Acceptance rate: 35.1% 256 submitted papers, 90 acceptedubmitted papers, 90 accepted
    [bibtex-key = InProceedingsCaron.CDD_10*1] [bibtex-entry]


  8. Eddy Caron, Benjamin Depardon, and Frédéric Desprez. Modelization and Performance Evaluation of the DIET Middleware. In ICPP 2010, 39th International Conference on Parallel Processing, San Diego, CA, pages 375-384, September 13-16 2010.
    Note: Hal-00690625.
    Keywords: DIET, Deployment. [bibtex-key = InProceedingsCaron.CDD_10] [bibtex-entry]


  9. Eddy Caron, Frédéric Desprez, Tristan Glatard, Maheshwari Ketan, Johan Montagnat, and Damien Reimert. Workflow-based comparison of two Distributed Computing Infrastructures. In Workflows in Support of Large-Scale Science (WORKS10), New Orleans, November 14 2010. In Conjunction with Supercomputing 10 (SC'10), IEEE.
    Note: Hal-00677820. [bibtex-key = InProceedingsCaron.CDGKMR_10] [bibtex-entry]


  10. Eddy Caron, Frédéric Desprez, and Adrian Muresan. Forecasting for Grid and Cloud Computing On-Demand Resources Based on Pattern Matching. In IEEE CloudCom 2010, 456-463, Indianapolis, Indiana, USA, November 2010. IEEE.
    Note: Hal-00758592.
    Keywords: Cloud Computing, SPADES. [bibtex-key = InProceedingsCaron.CDM_10] [bibtex-entry]


  11. Vlad Acretoaie, Eddy Caron, and Cédric Tedeschi. A Practical Study of Self-Stabilization for Prefix-Tree Based Overlay Networks. Research report RR-7252, Institut National de Recherche en Informatique et en Automatique (INRIA), June 28-July 2 2010.
    Note: Hal number inria-00474376.
    Keywords: DLPT, SPADES.
    Abstract: Service discovery is crucial in the development of fully decentralized computational grids. Among the significant amount of work produced by the convergence of peer- to-peer (P2P) systems and grids, a new kind of overlay networks, based on prefix trees (a.k.a., tries), has emerged. In particular, the Distributed Lexicographic Placement Table (DLPT) approach is a decentralized and dynamic service discovery service. Fault-tolerance within the DLPT approach is achieved through best-effort policies relying on formal self-stabilization results. Self-stabilization means that the tree can become transiently inconsistent, but is guaranteed to autonomously converge to a correct topology after arbitrary crashes, in a finite time. However, during convergence, the tree may not be able to process queries correctly. In this paper, we present some simula- tion results having several objectives. First, we investigate the interest of self-stabilization for such architectures. Second, we explore, still based on simulation, a simple Time-To-Live policy to avoid useless processing during convergence time.
    [bibtex-key = TechReportRR-Institut-RR-7252] [bibtex-entry]


  12. Eddy Caron, Florent Chuffart, Haiwu He, Olivier Richard, and Frédéric Suter. Communication between LRMS and service/resource discovering system. Technical report 1.4, ANR SPADES. 08-ANR-SEGI-025, Mars 2010.
    Note: Hal-01427730. [bibtex-key = TechReportRR-ANR-1.4] [bibtex-entry]


  13. Eddy Caron, Florent Chuffart, Haiwu He, and Frédéric Suter. Communication between co-scheduler and service/resource discovering system. Technical report 1.5, ANR SPADES. 08-ANR-SEGI-025, Mars 2010.
    Note: Hal-01427731. [bibtex-key = TechReportRR-ANR-1.5] [bibtex-entry]


  14. Eddy Caron, Frédéric Desprez, and Adrian Muresan. Forecasting for Cloud computing on-demand resources based on pattern matching. Research Report RR-7217, Institut National de Recherche en Informatique et en Automatique (INRIA), http://hal.archives-ouvertes.fr/docs/00/49/69/89/PDF/RR-7217.pdf, July 2010.
    Note: Hal number: inria-00460393.
    Keywords: Cloud Computing, auto-scaling, pattern matching.
    Abstract: The Cloud phenomenon brings along the cost-saving benefit of dynamic scaling. Knowledge in advance is necessary as the virtual resources that Cloud computing uses have a setup time that is not negligible. We propose a new approach to the problem of workload prediction based on identifying similar past occurrences to the current short-term workload history. We present in detail the auto-scaling algorithm that uses the above approach as well as experimental results by using real-world data and an overall evaluation of this approach, its potential and usefulness.
    [bibtex-key = TechReportRR-Institut-RR-7217] [bibtex-entry]


2009
  1. Vincent Breton, Eddy Caron, Frédéric Desprez, and Gaël Le Mahec. High Performance BLAST Over the Grid. In Handbook of Research on Computational Grid Technologies for Life Sciences, Biomedicine and Healthcare, pages 121-148. IGI Global, 2009.
    Note: Hal number in2p3-00365202. [bibtex-key = InCollectionBreton.BCDL-M_09] [bibtex-entry]


  2. Yves Caniou, Eddy Caron, Frédéric Desprez, Hidemoto Nakada, Keith Seymour, and Yoshio Tanaka. High performance GridRPC middleware. In G.A. Gravvanis, J.P Morrison, H.R. Arabnia, and D.A. Power, editors,Grid Technology and Applications: Recent Developments. Nova Science Publishers, 2009.
    Note: At Prepress. Pub. Date: 2009, 2nd quarter. ISBN 978-1-60692-768-7. hal-00751672.
    Keywords: DIET, GridRPC, LEGO. [bibtex-key = InCollectionCaniou.CCDNST_09] [bibtex-entry]


  3. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. DLPT: A P2P tool for Service Discovery in Grid Computing. In Nick Antonopoulos, Georgios Exarchakos, Maozhen Li, and Antonio Liotta, editors,Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications. IGI Global, December 2009.
    Note: Released: December 2009. ISBN-13: 978-1615206865. hal-00758589.
    Keywords: DLPT, P2P, Service discovery. [bibtex-key = InCollectionCaron.CDPT_09] [bibtex-entry]


  4. Jeremy Blaizot, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Frédéric Desprez. Cosmological Simulations on a Grid of Computers. In Conference of the Invisible Universe, volume 1241, pages 816-825, June 2009. American Institute of Physics, AIP Conference Proceedings.
    Note: Hal number in2p3-00631723.
    Keywords: Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO.
    Abstract: The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users.
    [bibtex-key = InProceedingsBlaizot.BCCDD_09] [bibtex-entry]


  5. Yves Caniou, Eddy Caron, Ghislain Charrier, and Frédéric Desprez. Meta-Scheduling and Task Reallocation in a Grid Environment. In The Third IEEE International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2009), Sliema, Malta, pages 6p., October 2009.
    Note: Hal-00751680. [bibtex-key = InProceedingsCaniou.CCCD_09] [bibtex-entry]


  6. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. In Euro-Par 2009, volume LNCS 5704, Delft, The Netherlands, pages 602-614, August 25-28 2009. TU Delft.
    Note: Hal-01427994.
    Keywords: LEGO. [bibtex-key = InProceedingsCaron.CDDL_09] [bibtex-entry]


  7. Eddy Caron, Frédéric Desprez, David Loureiro, and Adrian Muresan. Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus. In IEEE International Conference on Cloud Computing (CLOUD 2009), Bangalore, India, Septembre 2009. IEEE.
    Note: Published In the Work-in-Progress Track from the CLOUD-II 2009 Research Track. hal-01427879.
    Keywords: Cloud Computing, DIET.
    Abstract: The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform.
    [bibtex-key = InProceedingsCaron.CDLM_09] [bibtex-entry]


  8. Eddy Caron, Cristian Klein, and Christian Pérez. Efficient Grid Resource Selection for a CEM Application. In RenPar'19. 19ème Rencontres Francophones du Parallélisme, Toulouse, 2009.
    Note: Hal number inria-00564612. [bibtex-key = InProceedingsCaron.CKP_09] [bibtex-entry]


  9. Jeremy Blaizot, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Frédéric Desprez. Cosmological Simulations on a Grid of Computers. Technical report RR-7093, Institut National de Recherche en Informatique et en Automatique (INRIA), November 2009.
    Note: Hal number inria-00431637.
    Keywords: Cosmology, N-body simulations, Parallel computing, Local universe, Middleware, GridRPC, DIET, LEGO.
    Abstract: The work presented in this paper aims at restricting the input parameter values of the semi-analytical model used in Galics and MoMaF, so as to derive which parameters influence the most the results, e.g., star forma- tion, feedback and halo recycling efficiencies, etc. Our approach is to proceed empirically: we run lots of simulations and derive the correct ranges of values. The computation time needed is so large, that we need to run on a grid of com- puters. Hence, we model Galics and MoMaF execution time and output files size, and run the simulation using a grid middleware: Diet. All the complexity of accessing resources, scheduling simulations and managing data is harnessed by Diet and hidden behind a web portal accessible to the users.
    [bibtex-key = TechReportRR-Institut-RR-7093] [bibtex-entry]


  10. Yves Caniou, Eddy Caron, Ghislain Charrier, Frédéric Desprez, Eric Maisonnave, and Vincent Pichon. Ocean-Atmosphere Application Scheduling within DIET. Technical report RR-6836, Institut National de Recherche en Informatique et en Automatique (INRIA), February 2009.
    Note: Hal number inria-00359972.
    Keywords: DIET, LEGO. [bibtex-key = TechReportRR-Institut-RR-6836] [bibtex-entry]


  11. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing K-clustering algorithm using an arbitrary metric. Research report RR-7146, Institut National de Recherche en Informatique et en Automatique (INRIA), December 2009.
    Note: 41 pages. Also available as LIP Research Report RR2009-33. hal number: inria-00440276.
    Keywords: k-clustering, self-stabilization, weighted graph, LEGO.
    Abstract: {M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs.
    [bibtex-key = TechReportRR-Institut-RR-7146] [bibtex-entry]


  12. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing K-clustering algorithm using an arbitrary metric. Research report RR2009-33, Laboratoire de l'Informatique du Parallélisme (LIP), December 2009.
    Note: 32 pages. (revised version of RR2008-31). Also available as INRIA Research Report 7146. hal number: ensl-00440266.
    Keywords: k-clustering, self-stabilization, weighted graph, LEGO.
    Abstract: {M}obile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. {C}ommunication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. {A} k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. {A} self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique {ID}s and weighted edges. {T}he algorithm is comparison-based, takes {O}(nk) time, and uses {O}(log n + log k) space per process, where n is the size of the network. {T}his is the first distributed solution to the k-clustering problem on weighted graphs.
    [bibtex-key = TechReportRR-Laboratoire-RR2009-33] [bibtex-entry]


  13. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. Research report RR-7146, Institut National de Recherche en Informatique et en Automatique (INRIA), 2009.
    Note: Also available as LIP Research Report 2009-33. Hal number inria-00440276.
    Keywords: LEGO. [bibtex-key = TechReportRR-Institut-RR-7146*1] [bibtex-entry]


  14. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing k-Clustering Algorithm Using an Arbitrary Metric. Research report RRLIP2009-33, Laboratoire de l'Informatique du Parallélisme (LIP), 2009.
    Note: Also available as INRIA Research Report 7146. Hal number ensl-00440266.
    Keywords: LEGO. [bibtex-key = TechReportRR-Laboratoire-RRLIP2009-33] [bibtex-entry]


  15. Eddy Caron, Frédéric Desprez, David Loureiro, and Adrian Muresan. Cloud Computing Resource Management through a Grid Middleware: A Case Study with DIET and Eucalyptus. Technical report RR-7096, Institut National de Recherche en Informatique et en Automatique (INRIA), 2009.
    Note: Hal number inria-00435785.
    Keywords: Cloud Computing, DIET.
    Abstract: The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This paper proposes the use of a Cloud system as a raw computational on-demand resource for a Grid middleware. We illustrate a proof of concept by considering the DIET-Solve Grid middleware and the Eucalyptus open-source Cloud platform.
    [bibtex-key = TechReportRR-Institut-RR-7096] [bibtex-entry]


  16. Eddy Caron and Cédric Tedeschi. Service Discovery system: architecture and algorithms. Technical report 1.3, ANR SPADES. 08-ANR-SEGI-025, Septembre 2009.
    Note: Hal-01428031. [bibtex-key = TechReportRR-ANR-1.3] [bibtex-entry]


2008
  1. Abelkader Amar, Raphaël Bolze, Yves Caniou, Eddy Caron, Benjamin Depardon, Frédéric Desprez, Jean-Sébastien Gay, Gaël Le Mahec, and David Loureiro. Tunable Scheduling in a GridRPC Framework. Concurrency and Computation: Practice and Experience, 20(9):1051--1069, 2008.
    Note: Hal-01428209.
    Keywords: Scheduling, DIET, LEGO. [bibtex-key = ArticleAmar.ABCCDDGL-ML_CCPE08] [bibtex-entry]


  2. Eddy Caron, Andréea Chis, Frédéric Desprez, and Alan Su. Design of plug-in schedulers for a GridRPC environment. Future Generation Computer Systems, 24(1):46-57, January 2008.
    Note: Hal-01428216.
    Keywords: Scheduling, DIET, LEGO. [bibtex-key = ArticleCaron.CCDS_FGCS08] [bibtex-entry]


  3. Hrachya Astsatryan, Vladimir Sahakyan, Yuri Shoukouryan, Michel Daydé, Aurélie Hurault, Marc Pantel, and Eddy Caron. A Grid-Aware Web Interface with Advanced Service Trading for Linear Algebra Calculations. In 8th International Meeting High Performance Computing for Computational Science (VECPAR'08), Toulouse, pages 106-113, June 2008.
    Note: Hal-00689914.
    Keywords: DIET, LEGO. [bibtex-key = InProceedingsAstsatryan.ASSDHPC_08] [bibtex-entry]


  4. Yves Caniou, Eddy Caron, Ghislain Charrier, Andréea Chis, Frédéric Desprez, and Eric Maisonnave. Ocean-Atmosphere Modelization over the Grid. In Wu-chi Feng and Yuanyuan Yang, editors, The 37th International Conference on Parallel Processing (ICPP 2008), Portland, Oregon. USA, pages 206-213, September 2008. IEEE.
    Note: Hal-01428737.
    Keywords: LEGO, DIET. [bibtex-key = InProceedingsCaniou.CCCCDM_08] [bibtex-entry]


  5. Yves Caniou, Eddy Caron, Ghislain Charrier, Frédéric Desprez, Eric Maisonnave, and Vincent Pichon. Ocean-Atmosphere Application Scheduling within DIET. In APDCT-08 Symposium. International Symposium on Advanced in Parallel and Distributed Computing Techniques, Sydney. Australia., pages 675-680, December 2008. In conjunction with ISPA'2008, IEEE Computer Society.
    Note: Invited paper from the reviewed process of ISPA'08. hal-01428060.
    Keywords: DIET, LEGO. [bibtex-key = InProceedingsCaniou.CCCDMP_08] [bibtex-entry]


  6. Eddy Caron, Pushpinder Kaur Chouhan, and Frédéric Desprez. Automatic Middleware Deployment Planning on Heterogeneous Platfoms. In The 17th Heterogeneous Computing Workshop (HCW'08), Miami, Florida, April 2008. In conjunction with IPDPS 2008.
    Note: Hal-01428310.
    Keywords: Deployment, ASP, Grid computing, DIET, LEGO. [bibtex-key = InProceedingsCaron.CCD_08] [bibtex-entry]


  7. Eddy Caron, Ajoy Datta, Franck Petit, and Cédric Tedeschi. Self-stabilization in tree-structured P2P Service Discovery Systems. In 27th International Symposium on Reliable Distributed Systems (SRDS 2008), Napoli, Italy, pages 207-216, October 2008. IEEE.
    Note: Hal-01428529.
    Keywords: LEGO, DLPT, Self-stabilization. [bibtex-key = InProceedingsCaron.CDPT_08] [bibtex-entry]


  8. Eddy Caron, Frédéric Desprez, and Gaël Le Mahec. Parallelization and Distribution Strategies of Large Bioinformatics Requests over the Grid. In Springer Berlin / Heidelberg, editor, Algorithms and Architectures for Parallel Processing. 8th International Conference, ICA3PP., volume Volume 5022/2008 of Lecture Notes in Computer Science, Cyprus,, pages 257-260, June 9-11 2008.
    Note: Hal-01428318. [bibtex-key = InProceedingsCaron.CDL-M_08] [bibtex-entry]


  9. Eddy Caron, Frédéric Desprez, and Gaël Le Mahec. DAGDA: Data Arrangement for the Grid and Distributed Applications. In AHEMA 2008. International Workshop on Advances in High-Performance E-Science Middleware and Applications. In conjunction with eScience 2008, Indianapolis, Indiana, USA, pages 680-687, December 2008. IEEE.
    Note: Hal-01428409.
    Keywords: DIET, DAGDA, LEGO. [bibtex-key = InProceedingsCaron.CDL-M_08*1] [bibtex-entry]


  10. Eddy Caron, Frédéric Desprez, and David Loureiro. All-in-one Graphical Tool for the management of DIET a GridRPC Middleware. In Norbert Meyer, Domenico Talia, and Ramin Yahyapour, editors, Grid and Services Evolution, Barcelona, Spain, pages 169-187, June 2008. CoreGRID Workshop on Grid Middleware (in conjunction with OGF'23), Springer.
    Note: Hal-01428518.
    Keywords: DIET, LEGO, GWENDIA.
    Abstract: Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management.
    [bibtex-key = InProceedingsCaron.CDL_08] [bibtex-entry]


  11. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Efficiency of Tree-structured Peer-to-peer Service Discovery Systems. In Fifth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P), Miami, Florida, April 2008. In conjunction with IPDPS 2008.
    Note: Hal-01428782.
    Abstract: The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.
    [bibtex-key = InProceedingsCaron.CDT_08] [bibtex-entry]


  12. Philippe Combes, Eddy Caron, Frédéric Desprez, Bastien Chopard, and Julien Zory. Relaxing Synchronization in a Parallel SystemC Kernel. In ISPA 2008. International Symposium on Parallel and Distributed Processing with Applications, Sydney. Australia, pages 180-187, December 2008. IEEE Computer Society.
    Note: Hal-01428323. [bibtex-key = InProceedingsCombes.CCDCZ_08] [bibtex-entry]


  13. Yves Caniou, Eddy Caron, Ghislain Charrier, Andréea Chis, Frédéric Desprez, and Eric Maisonnave. Ocean-Atmosphere Modelization over the Grid. Technical report RR-6695, Institut National de Recherche en Informatique et en Automatique (INRIA), October 2008.
    Note: Hal number inria-00332571.
    Abstract: In this report, we tackle the problem of scheduling an Ocean-Atmosphere ap- plication used for climate prediction on the grid. An experiment is composed of several 1D-meshes of identical DAGs composed of parallel tasks. To obtain a good completion time, we divide groups of processors into sets each working on parallel tasks. The group sizes are chosen by computing the best makespan for several grouping possibilities. We improved this heuristic method by different means. The improvement yielding to the best makespan is the representation of the problem as an instance of the Knapsack problem. As this heuristic is firstly designed for homogeneous platforms, we present its adaptation to heterogeneous platforms. Simulations show improvements of the makespan up to 12
    [bibtex-key = TechReportRR-Institut-RR-6695] [bibtex-entry]


  14. Eddy Caron, Pushpinder Kaur Chouhan, and Frédéric Desprez. Automatic Middleware Deployment Planning on Heterogeneous Platfoms. Technical report RR-2008-23, Laboratoire de l'Informatique du Parallélisme (LIP), June 2008.
    Note: Also available as INRIA Research Report 6566. hal-01428306.
    Keywords: Deployment, ASP, Grid computing, DIET, LEGO.
    Abstract: The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalability and how middleware services can be mapped on the available resources. Optimizing deployment is a difficult problem with no existing general solutions. In this paper, we address the following problem: how to perform out an adapted deployment for a hierarchy of servers and resource brokers on a heterogeneous system? Our objective is to generate a best platform from the available nodes so as to fulfill the clients demands. However, finding the best deployment among heterogeneous resources is a hard problem since it is close to find the best broadcast tree in a general graph, which is known to be NP-complete. Thus, in this paper, we present a heuristic for middleware deployment on heterogeneous resources. We apply our heuristic to automatically deploy a distributed Problem Solving Environment on a large scale grid. We present experiments comparing the automatically generated deployment against a number of other reasonable deployments.
    [bibtex-key = TechReportRR-Laboratoire-RR-2008-23] [bibtex-entry]


  15. Eddy Caron, Pushpinder Kaur Chouhan, and Frédéric Desprez. Automatic Middleware Deployment Planning on Heterogeneous Platfoms. Technical report 6566, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2008.
    Note: Also available as LIP Research Report 2008-23. hal number inria-00291515.
    Keywords: Deployment, ASP, Grid computing, DIET, LEGO.
    Abstract: The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalability and how middleware services can be mapped on the available resources. Optimizing deployment is a difficult problem with no existing general solutions. In this paper, we address the following problem: how to perform out an adapted deployment for a hierarchy of servers and resource brokers on a heterogeneous system? Our objective is to generate a best platform from the available nodes so as to fulfill the clients demands. However, finding the best deployment among heterogeneous resources is a hard problem since it is close to find the best broadcast tree in a general graph, which is known to be NP-complete. Thus, in this paper, we present a heuristic for middleware deployment on heterogeneous resources. We apply our heuristic to automatically deploy a distributed Problem Solving Environment on a large scale grid. We present experiments comparing the automatically generated deployment against a number of other reasonable deployments.
    [bibtex-key = TechReportRR-Institut-6566] [bibtex-entry]


  16. Eddy Caron, Ajoy Datta, Benjamin Depardon, and Lawrence Larmore. A Self-Stabilizing K-clustering algorithm using an arbitrary metric. Research report RR2008-31, Laboratoire de l'Informatique du Parallélisme (LIP), October 2008.
    Note: Hal-01428795.
    Keywords: k-clustering, self-stabilization, weighted graph, LEGO. [bibtex-key = TechReportRR-Laboratoire-RR2008-31] [bibtex-entry]


  17. Eddy Caron, Frédéric Desprez, and David Loureiro. All-in-one Graphical Tool for the management of DIET a GridRPC Middleware. Technical report RR2008-24, Laboratoire de l'Informatique du Parallélisme (LIP), June 2008.
    Note: Hal-01428434.
    Keywords: DIET, LEGO, GWENDIA.
    Abstract: Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management.
    [bibtex-key = TechReportRR-Laboratoire-RR2008-24] [bibtex-entry]


  18. Eddy Caron, Frédéric Desprez, and David Loureiro. All-in-one Graphical Tool for the management of DIET a GridRPC Middleware. Technical report, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2008.
    Note: Also available as LIP Research Report 2001-24. Hal number inria-00292575.
    Keywords: DIET, LEGO, GWENDIA.
    Abstract: Grid middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the grid environment itself can be a hard task when no dedicated (and integrated) tool exist. Some can be used through nice graphical interfaces, but they are usually dedicated to one or some limited tasks. They do not fulfill all the needs of a grid end-user who wants to deploy grid applications easily and rapidly. The aim of this paper is to present the case study of an all-in-one software system, designed for the management of a grid middleware and gathering user-friendly graphical interfaces answering to the various needs of end-users. Moreover the software system eases the use of the grid by avoiding the scripting layer under a nice GUI enabling the user a faster and more efficient use of the grid environment. By this means we demonstrate how the \ddb fulfills all the needs of a unified tool for grid management. This paper gives a comparison with existing and well-known tools dedicated to some specific tasks such as grid resources management, grid monitoring or middleware management.
    [bibtex-key = Tec-Caron.CDL_08] [bibtex-entry]


  19. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Efficiency of Tree-structured Peer-to-peer Service Discovery Systems. Technical report RR-6557, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2008.
    Note: Also available as LIP Research Report 2008-18. hal number inria-00287800.
    Keywords: Service discovery, computational grids, peer-to-peer, prefix trees, mapping, load balancing, LEGO.
    Abstract: The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.
    [bibtex-key = TechReportRR-Institut-RR-6557] [bibtex-entry]


  20. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Efficiency of Tree-Structured Peer-to-peer Service Discovery Systems. Technical report RR2008-18, Laboratoire de l'Informatique du Parallélisme (LIP), June 2008.
    Note: Also available as INRIA Research Report 6557. hal-01428771.
    Keywords: Service discovery, computational grids, peer-to-peer, prefix trees, mapping, load balancing, LEGO.
    Abstract: The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.
    [bibtex-key = TechReportRR-Laboratoire-RR2008-18] [bibtex-entry]


2007
  1. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery. Journal of Grid Computing, 5(3):337-360, September 2007.
    Note: Hal-01429565.
    Keywords: DLPT, LEGO, P2P.
    Abstract: Within computational Grids, some services (typically software components, e.g., linear algebra libraries) are made available by some servers to some clients. In spite of the growing popularity of such Grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation.
    [bibtex-key = ArticleCaron.CDT_JGC07] [bibtex-entry]


  2. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. Definition, modelling and simulation of a grid computing scheduling system for high throughput computing. Future Generation Computer Systems, 23(Issue 8):968-976, November 2007.
    Note: ISSN:0167-739X. hal number in2p3-00421380.
    Abstract: In this paper, we study and compare grid and global computing systems and outline the benefits of having a hybrid system called DIRAC. To evaluate the DIRAC scheduling for high throughput computing, a new model is presented and a simulator was developed for many clusters of heterogeneous nodes belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. Next, we do the comparison with a real batch system and we obtain an average error of 10.5-0.000000or the response time and 12 0.000000or the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called DIRAC in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context.
    [bibtex-key = ArticleCaron.CGT_FGCS07] [bibtex-entry]


  3. Gabriel Antoniu, Eddy Caron, Frédéric Desprez, Aurélia Fèvre, and Mathieu Jan. Towards a Transparent Data Access Model for the GridRPC Paradigm. In S. Aluru et al. (Eds), editor, HiPC'2007. 14th International Conference on High Performance Computing., number 4873 of LNCS, Goa. India, pages 269-284, December 2007. Springer Verlag Berlin Heidelberg.
    Note: Hal number inria-00447931.
    Keywords: DIET, JuxMem, LEGO. [bibtex-key = InProceedingsAntoniu.ACDFJ_07] [bibtex-entry]


  4. Hrachya Astsatryan, Michel Daydé, Aurélie Hurault, Marc Pantel, and Eddy Caron. On defining a Web Interface for Linear Algebra Tasks over Computational Grids. In International Conference on Computer Science and Information Technologies (CSIT'07), Yerevan (Arménie), September 2007.
    Note: Hal-01429567.
    Keywords: LEGO. [bibtex-key = InProceedingsAstsatryan.ADHPC_07] [bibtex-entry]


  5. Yves Caniou, Eddy Caron, Hélène Courtois, Benjamin Depardon, and Romain Teyssier. Cosmological Simulations using Grid Middleware. In Fourth High-Performance Grid Computing Workshop (HPGrid'07), Long Beach, California, USA, March 2007. IEEE.
    Note: Hal-01429585.
    Keywords: DIET, LEGO. [bibtex-key = InProceedingsCaniou.CCCDT_07] [bibtex-entry]


  6. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. Snap-stabilizing Prefix Tree for Peer-to-peer Systems. In 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, volume 4838 of Lecture Notes in Computer Science, Paris, France, pages 82-96, November 2007. Springer Verlag Berlin Heidelberg.
    Note: Hal-01429571. [bibtex-key = InProceedingsCaron.CDPT_07] [bibtex-entry]


  7. Yves Caniou, Eddy Caron, Benjamin Depardon, Hélène Courtois, and Romain Teyssier. Cosmological Simulations using Grid Middleware. Technical report RR2007-11, Laboratoire de l'Informatique du Parallélisme (LIP), March 2007.
    Note: Also available as INRIA Research Report 6139. hal-01429584.
    Keywords: Grid computing, cosmological simulations, DIET, LEGO.
    Abstract: Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets.
    [bibtex-key = TechReportRR-Laboratoire-RR2007-11] [bibtex-entry]


  8. Yves Caniou, Eddy Caron, Benjamin Depardon, Hélène Courtois, and Romain Teyssier. Cosmological Simulations using Grid Middleware. Technical report 6139, Institut National de Recherche en Informatique et en Automatique (INRIA), March 2007.
    Note: Also available as LIP Research Report 2007-11. hal number inria-00135189v3.
    Keywords: Grid computing, cosmological simulations, DIET, LEGO.
    Abstract: Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets.
    [bibtex-key = TechReportRR-Institut-6139] [bibtex-entry]


  9. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. Snap-stabilizing Prefix Tree for Peer-to-peer Systems. Technical report RR-6297, Institut National de Recherche en Informatique et en Automatique (INRIA), September 2007.
    Note: Hal number: inria-00173050.
    Keywords: TPLD, Peer-to-peer systems, Fault-tolerance, Self-stabilization, Snap-stabilization, Grid computing.
    Abstract: Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Prefix Trees appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h+h') rounds, where h and h' are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n^2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice.
    [bibtex-key = TechReportRR-Institut-RR-6297] [bibtex-entry]


  10. Yusuke Tanimura, Keith Seymour, Eddy Caron, Abelkader Amar, Hidemoto Nakada, Yoshio Tanaka, and Frédéric Desprez. Interoperability Testing for The GridRPC API Specification. Open Grid Forum, May 2007.
    Note: OGF Reference: GFD.102. hal-01429586.
    Keywords: DIET. [bibtex-key = Man-Tanimura.TSCANTD_07] [bibtex-entry]


2006
  1. Gabriel Antoniu, Marin Bertier, Luc Bougé, Eddy Caron, Frédéric Desprez, Mathieu Jan, Sébastien Monnet, and Pierre Sens. GDS: An Architecture Proposal for a Grid Data-Sharing Service. In Vladimir Getov, Domenico Laforenza, and Alexander Reinefeld, editors,Future Generation Grids, volume XVIII, CoreGrid Series of Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany. Springer Verlag, 2006.
    Note: Hal number inria-00000983.
    Keywords: JuxMem, DIET. [bibtex-key = InCollectionAntoniu.ABBCDJMS_06] [bibtex-entry]


  2. Eddy Caron, Frédéric Desprez, Christophe Hamerling, Jean-Yves L'Excellent, Marc Pantel, and Puglisi-Amestoy C.. Use of A Network Enabled Server System for a Sparse Linear Algebra Application. In Vladimir Getov, Domenico Laforenza, and Alexander Reinefeld, editors,Future Generation Grids, volume XVIII, CoreGrid Series of Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany. Springer Verlag, 2006.
    Note: Hal-00688781.
    Keywords: DIET. [bibtex-key = InCollectionCaron.CDHLPC_06] [bibtex-entry]


  3. Raphaël Bolze, Franck Cappello, Eddy Caron, Michel Daydé, Frederic Desprez, Emmanuel Jeannot, Yvon Jégou, Stéphane Lanteri, Julien Leduc, Noredine Melab, Guillaume Mornet, Raymond Namyst, Pascale Primet, Benjamin Quetier, Olivier Richard, El-Ghazali Talbi, and Touché Irena. Grid'5000: a large scale and highly reconfigurable experimental Grid testbed.. International Journal of High Performance Computing Applications, 20(4):481-494, November 2006.
    Note: Hal-00684943.
    Keywords: Grid'5000, DIET. [bibtex-key = ArticleBolze.BCCDDJJLLMMNPQRTI_IJHPCA06] [bibtex-entry]


  4. Eddy Caron and Frédéric Desprez. DIET: A Scalable Toolbox to Build Network Enabled Servers on the Grid. International Journal of High Performance Computing Applications, 20(3):335-352, 2006.
    Note: Hal-01429867.
    Keywords: Grid Computing, Network Enabled Servers, Client-servers computing, DIET.
    Abstract: Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classical client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of a middleware developed by the GRAAL team called DIET (for Distributed Interactive Engineering Tool-box). DIET is a hierarchical set of components used for the development of applications based on computational servers on the grid.
    [bibtex-key = ArticleCaron.CD_IJHPCA06] [bibtex-entry]


  5. Pushpinder Kaur Chouhan, Holly Dail, Eddy Caron, and Frédéric Vivien. Automatic Middleware Deployment Planning on Clusters. International Journal of High Performance Computing Applications, 20(4):517-530, November 2006.
    Note: Hal-01429834.
    Keywords: Deployment, DIET. [bibtex-key = ArticleChouhan.CDCV_IJHPCA06] [bibtex-entry]


  6. Abelkader Amar, Raphaël Bolze, Aurélien Bouteiller, Pushpinder Kaur Chouhan, Andréea Chis, Yves Caniou, Eddy Caron, Holly Dail, Benjamin Depardon, Frédéric Desprez, Jean-Sébastien Gay, Gaël Le Mahec, and Alan Su. DIET: New Developments and Recent Results. In Lehner et al. (Eds.), editor, CoreGRID Workshop on Grid Middleware (in conjunction with EuroPar2006), number 4375 of LNCS, Dresden, Germany, pages 150-170, August 28-29 2006. Springer.
    Note: Hal-01429979.
    Keywords: DIET, LEGO.
    Abstract: Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classic client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers (NES) implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of an NES middleware developed in the GRAAL team called DIET and to describe recent developments. DIET (Distributed Interactive Engineering Toolbox) is a hierarchical set of components used for the development of applications based on computational servers on the grid.
    [bibtex-key = InProceedingsAmar.ABBCCCCDDDGL-MS_06] [bibtex-entry]


  7. Raphaël Bolze, Eddy Caron, Frédéric Desprez, Georg Hoesch, and Cyril Pontvieux. A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform. In M. Gavrilova, editor, Computational Science and Its Applications - ICCSA 2006, volume 3984 of LNCS, Glasgow, UK., pages 202--213, May 8-11 2006. Springer.
    Note: Hal-01430514.
    Keywords: Monitoring, Visualization, DIET. [bibtex-key = InProceedingsBolze.BCDHP_06] [bibtex-entry]


  8. Eddy Caron, Andréea Chis, Frédéric Desprez, and Alan Su. Plug-in Scheduler Design for a Distributed Grid Environment. In ACM/IFIP/USENIX, editor, 4th International Workshop on Middleware for Grid Computing - MGC 2006, Melbourne, Australia, November 2006.
    Note: In conjunction with ACM/IFIP/USENIX 7th International Middleware Conference 2006. hal number hal-01430509.
    Keywords: DIET, Scheduling. [bibtex-key = InProceedingsCaron.CCDS_06] [bibtex-entry]


  9. Eddy Caron, Pushpinder Kaur Chouhan, and Holly Dail. GoDIET: A Deployment Tool for Distributed Middleware on Grid'5000. In EXPGRID workshop. Experimental Grid Testbeds for the Assessment of Large-Scale Distributed Applications and Tools. In conjunction with HPDC-15., Paris, France, pages 1-8, June 2006. IEEE.
    Note: Hal-01430520.
    Keywords: Deployment, GoDIET, DIET. [bibtex-key = InProceedingsCaron.CCD_06] [bibtex-entry]


  10. Eddy Caron, Frédéric Desprez, Charles Fourdrignier, Franck Petit, and Cédric Tedeschi. A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. In Yves Robert, Manish Parashar, Ramamurthy Badrinath, and Viktor K. Prasanna, editors, HiPC'2006. 13th International Conference on High Performance Computing., volume 4297 of LNCS, Bangalore. India, pages 171-182, December 18-21 2006. Springer-Verlag Berlin Heidelberg.
    Note: Hal-01430039.
    Keywords: P2P, Fault Tolerance, TPLD. [bibtex-key = InProceedingsCaron.CDFPT_06] [bibtex-entry]


  11. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids. In A. Montresor, A. Wierzbicki, and N. Shahmehri, editors, The Sixth IEEE International Conference on Peer-to-Peer Computing, P2P2006, Cambridge, UK., pages 106-113, September 2006. IEEE.
    Note: Hal-01429999.
    Keywords: TPLD. [bibtex-key = InProceedingsCaron.CDT_06] [bibtex-entry]


  12. Eddy Caron, Charles Fourdrignier, Franck Petit, and Cédric Tedeschi. Mécanisme de réparations pour un système P2P de découverte de services. In Perpi'2006 - Conférences conjointes RenPar'17 / SympA'2006 / CFSE'5 / JC'2006, Canet en Roussillon, pages 252-259, October 4-6 2006.
    Note: Hal-01430510. [bibtex-key = InProceedingsCaron.CFPT_06] [bibtex-entry]


  13. Pushpinder Kaur Chouhan, Holly Dail, Eddy Caron, and Frédéric Vivien. How should you structure your hierarchical scheduler?. In HPDC-15. 15th IEEE International Symposium on High Performance Distributed Computing, Paris, France, pages 339-340 (Poster), June 2006. IEEE.
    Note: Hal-01430511.
    Keywords: Deployment, DIET. [bibtex-key = InProceedingsChouhan.CDCV_06] [bibtex-entry]


  14. Abelkader Amar, Raphaël Bolze, Aurélien Bouteiller, Andréea Chis, Yves Caniou, Eddy Caron, Pushpinder Kaur Chouhan, Gaël Le Mahec, Holly Dail, Benjamin Depardon, Frédéric Desprez, Jean-Sébastien Gay, and Alan Su. DIET: New Developments and Recent Results. Technical report RR2006-31, Laboratoire de l'Informatique du Parallélisme (LIP), October 2006.
    Note: Also available as INRIA Research Report 6027. hal-01429988.
    Keywords: Grid Computing, Network Enabled Servers, Client-servers computing, DIET.
    Abstract: Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classic client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers (NES) implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of an NES middleware developed in the GRAAL team called DIET and to describe recent developments. DIET (Distributed Interactive Engineering Toolbox) is a hierarchical set of components used for the development of applications based on computational servers on the grid.
    [bibtex-key = TechReportRR-Laboratoire-RR2006-31] [bibtex-entry]


  15. Abelkader Amar, Raphaël Bolze, Aurélien Bouteiller, Andréea Chis, Yves Caniou, Eddy Caron, Pushpinder Kaur Chouhan, Gaël Le Mahec, Holly Dail, Benjamin Depardon, Frédéric Desprez, Jean-Sébastien Gay, and Alan Su. DIET: New Developments and Recent Results. Research Report 6027, INRIA, November 2006.
    Note: Also available as LIP Research Report 2006-31. hal number inria-00115569.
    Keywords: Grid Computing, Network Enabled Servers, Client-servers computing, DIET.
    Abstract: Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classic client-server or Remote Procedure Call (RPC) paradigm. Network Enabled Servers (NES) implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. The aim of this paper is to give an overview of an NES middleware developed in the GRAAL team called DIET and to describe recent developments. DIET (Distributed Interactive Engineering Toolbox) is a hierarchical set of components used for the development of applications based on computational servers on the grid.
    [bibtex-key = TechReportRR-INRIA-6027] [bibtex-entry]


  16. Gabriel Antoniu, Eddy Caron, Frédéric Desprez, and Mathieu Jan. Towards a Transparent Data Access Model for the GridRPC Paradigm. Technical report RR-6009, INRIA, November 2006.
    Note: Also available as IRISA Research Report PI1823. hal number inria-00110967.
    Keywords: GridRPC, Data Sharing, Persistency, JUXMEM, DIET.
    Abstract: As grids become more and more attractive for solving complex problems with high computational and storage requirements, the need for adequate grid programming models is considerable. To this purpose, the GridRPC model has been proposed as a grid version of the classical RPC paradigm, with the goal to build NES (Network-Enabled Server) environments. Paradoxically enough, in this model, data management has not been defined and is now explicitly left at the user's charge. The contribution of this paper is to enhance data management in NES by introducing a transparent data access model, available through the concept of grid data-sharing service. Data management (persistent storage, transfer, consistent replication) is totally delegated to the service, whereas the applications simply access shared data via global identifiers. We illustrate our approach using the DIET GridRPC middleware and the JUXMEM data-sharing service. Experiments performed on the Grid'5000 testbed demonstrate the benefits of the proposed approach.
    [bibtex-key = TechReportRR-INRIA-RR-6009] [bibtex-entry]


  17. Gabriel Antoniu, Eddy Caron, Frédéric Desprez, and Mathieu Jan. Towards a Transparent Data Access Model for the GridRPC Paradigm. Technical report PI1823, IRISA, November 2006.
    Note: Also available as INRIA Research Report 6009. hal number inria-00110902.
    Keywords: GridRPC, Data Sharing, Persistency, JUXMEM, DIET.
    Abstract: As grids become more and more attractive for solving complex problems with high computational and storage requirements, the need for adequate grid programming models is considerable. To this purpose, the GridRPC model has been proposed as a grid version of the classical RPC paradigm, with the goal to build NES (Network-Enabled Server) environments. Paradoxically enough, in this model, data management has not been defined and is now explicitly left at the user's charge. The contribution of this paper is to enhance data management in NES by introducing a transparent data access model, available through the concept of grid data-sharing service. Data management (persistent storage, transfer, consistent replication) is totally delegated to the service, whereas the applications simply access shared data via global identifiers. We illustrate our approach using the DIET GridRPC middleware and the JUXMEM data-sharing service. Experiments performed on the Grid'5000 testbed demonstrate the benefits of the proposed approach.
    [bibtex-key = TechReportRR-IRISA-PI1823] [bibtex-entry]


  18. Alexis Ballier, Eddy Caron, Dick Epema, and Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. Technical report RR-5815, Institut National de Recherche en Informatique et en Automatique (INRIA), January 2006.
    Note: Also available as LIP Research Report 2006-01 and CoreGRID Technical Report TR-0061. hal number inria-00077051. [bibtex-key = TechReportRR-Institut-RR-5815] [bibtex-entry]


  19. Alexis Ballier, Eddy Caron, Dick Epema, and Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. Technical report 2006-01, Laboratoire de l'Informatique du Parallélisme (LIP), January 2006.
    Note: Also available as INRIA Research Report RR-5815 and CoreGRID Technical Report TR-0061. hal number hal-01430521. [bibtex-key = TechReportRR-Laboratoire-2006-01] [bibtex-entry]


  20. Alexis Ballier, Eddy Caron, Dick Epema, and Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. Technical report TR-0061, CoreGRID, October 2006.
    Note: Also available as LIP Research Report 2006-01 and INRIA Research Report RR-5815. hal-01430523.
    Abstract: One of the true challenges in resource management in grids is to provide support for co-allocation, that is, the allocation of resources in multiples autonomous subsystems of a grid to single jobs. With reservation-based local schedulers, a grid scheduler can reserve processors with these schedulers to achieve simultaneous processor availability. However, with queuing-based local schedulers, it is much more difficult to guarantee this. In this paper we present mechanisms and policies for working around the lack of reservation mechanisms for jobs with deadlines that require co-allocation, and simulations of these mechanisms and policies.
    [bibtex-key = TechReportRR-CoreGRID-TR-0061] [bibtex-entry]


  21. Raphaël Bolze, Eddy Caron, Frédéric Desprez, Georg Hoesch, and Cyril Pontvieux. A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform. Technical report RR-5879, Institut National de Recherche en Informatique et en Automatique (INRIA), April 2006.
    Note: Also available as LIP Research Report 2006-14. hal number inria-00071389.
    Keywords: Monitoring, Visualization, DIET. [bibtex-key = TechReportRR-Institut-RR-5879] [bibtex-entry]


  22. Raphaël Bolze, Eddy Caron, Frédéric Desprez, Georg Hoesch, and Cyril Pontvieux. A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform. Technical report RR-2006-14, Laboratoire de l'Informatique du Parallélisme (LIP), April 2006.
    Note: Also available as INRIA Research Report 5879. hal-01430516.
    Keywords: Monitoring, Visualization, DIET. [bibtex-key = TechReportRR-Laboratoire-RR-2006-14] [bibtex-entry]


  23. Eddy Caron, Andréea Chis, Frédéric Desprez, and Alan Su. Plug-in Scheduler Design for a Distributed Grid Environment.. Technical report RR2006-41, Laboratoire de l'Informatique du Parallélisme (LIP), November 2006.
    Note: Also available as INRIA Research Report 6030. hal number hal-01430508.
    Keywords: Grid Computing, Scheduling, Performance Prediction, DIET.
    Abstract: This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a GridRPC environment to allow a resource broker to be tuned for specific application classes. Our design allows the use of generic or application dependent performance measures in a simple and seamless way.
    [bibtex-key = TechReportRR-Laboratoire-RR2006-41] [bibtex-entry]


  24. Eddy Caron, Andréea Chis, Frédéric Desprez, and Alan Su. Plug-in Scheduler Design for a Distributed Grid Environment.. Technical report RR-6030, INRIA, November 2006.
    Note: Also available as LIP Research Report 2006-41. hal number inria-00115949.
    Keywords: Grid Computing, Scheduling, Performance Prediction, DIET.
    Abstract: This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a GridRPC environment to allow a resource broker to be tuned for specific application classes. Our design allows the use of generic or application dependent performance measures in a simple and seamless way.
    [bibtex-key = TechReportRR-INRIA-RR-6030] [bibtex-entry]


  25. Eddy Caron, Pushpinder Kaur Chouhan, and Holly Dail. GoDIET: A Deployment Tool for Distributed Middleware on Grid 5000. Technical report RR-5886, Institut National de Recherche en Informatique et en Automatique (INRIA), April 2006.
    Note: Also available as LIP Research Report 2006-17. hal number inria-00071382.
    Keywords: Deployment, ASP, Grid computing, DIET. [bibtex-key = TechReportRR-Institut-RR-5886] [bibtex-entry]


  26. Eddy Caron, Pushpinder Kaur Chouhan, and Holly Dail. GoDIET: A Deployment Tool for Distributed Middleware on Grid 5000. Technical report RR-5886, Laboratoire de l'Informatique du Parallélisme (LIP), April 2006.
    Note: Also available as INRIA Research Report 5886. hal number inria-00071382.
    Keywords: Deployment, ASP, Grid computing, DIET. [bibtex-key = TechReportRR-Laboratoire-RR-5886] [bibtex-entry]


  27. Eddy Caron, Frédéric Desprez, Charles Fourdrignier, Franck Petit, and Cédric Tedeschi. A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. Technical report RR2006-34, Laboratoire de l'Informatique du Parallélisme (LIP), October 2006.
    Note: Also available as INRIA Research Report 6029. hal-01430504.
    Keywords: Fault tolerance, peer-to-peer, prefix trees.
    Abstract: Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.
    [bibtex-key = TechReportRR-Laboratoire-RR2006-34] [bibtex-entry]


  28. Eddy Caron, Frédéric Desprez, Charles Fourdrignier, Franck Petit, and Cédric Tedeschi. A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems. Technical report RR6029, Institut National de Recherche en Informatique et en Automatique (INRIA), October 2006.
    Note: Also available as LIP Research Report 2001-34. hal number inria-00115997.
    Keywords: Fault tolerance, peer-to-peer, prefix trees.
    Abstract: Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a fault-tolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.
    [bibtex-key = TechReportRR-Institut-RR6029] [bibtex-entry]


  29. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids. Technical report RR2006-33, Laboratoire de l'Informatique du Parallélisme (LIP), October 2006.
    Note: Hal-01430005. Also available as INRIA Research Report 6028.
    Keywords: Service discovery, Computational grids, Peer-to-peer, Prefix trees.
    Abstract: Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets.
    [bibtex-key = TechReportRR-Laboratoire-RR2006-33] [bibtex-entry]


  30. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids. Technical report RR-6028, Institut National de Recherche en Informatique et en Automatique (INRIA), October 2006.
    Note: Also available as LIP Research Report 2001-33. hal number inria-00116111.
    Keywords: Service discovery, Computational grids, Peer-to-peer, Prefix trees.
    Abstract: Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets.
    [bibtex-key = TechReportRR-Institut-RR-6028] [bibtex-entry]


2005
  1. Eddy Caron, Bruno Del-Fabbro, Frédéric Desprez, Emmanuel Jeannot, and Jean-Marc Nicod. Managing Data Persistence in Network Enabled Servers. Scientific Programming Journal, 13(4):333-354, 2005.
    Note: Special Issue on Dynamic Grids and Worldwide Computing. hal number inria-00000281.
    Keywords: DIET, Data Management. [bibtex-key = ArticleCaron.CDDJN_SPJ05] [bibtex-entry]


  2. Eddy Caron, Frédéric Desprez, Michel Daydé, Aurélie Hurault, and Marc Pantel. On Deploying Scientific Software within the Grid-TLSE Project. Computing Letters (CoLe), 1(3):1-5, 2005.
    Note: Hal-00688802.
    Keywords: DIET. [bibtex-key = ArticleCaron.CDDHP_CLC05] [bibtex-entry]


  3. Alexis Ballier, Eddy Caron, Dick Epema, and Hashim Mohamed. Simulating Grid Schedulers with Deadlines and Co-Allocation. In CoreGRID integration workshop, Pisa, Italy, November 2005. Network of Excellence CoreGRID.
    Note: Hal-01430525. [bibtex-key = InProceedingsBallier.BCEM_05] [bibtex-entry]


  4. Franck Cappello, Eddy Caron, Michel Dayde, Frederic Desprez, Emmanuel Jeannot, Yvon Jegou, Stephane Lanteri, Julien Leduc, Nouredine Melab, Guillaume Mornet, Raymond Namyst, Pascale Primet, and Olivier Richard. Grid'5000: a large scale, reconfigurable, controlable and monitorable Grid platform. In SC'05: Proc. The 6th IEEE/ACM International Workshop on Grid Computing Grid'2005, Seattle, USA, pages 99--106, November 2005. IEEE/ACM.
    Note: Hal number inria-00000284.
    Keywords: Grid Computing, DIET, Grid'5000. [bibtex-key = InProceedingsCappello.CCDDJJLLMMNPR_05] [bibtex-entry]


  5. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. A Peer-to-Peer Extension of Network-Enabled Server Systems. In e-Science 2005. First IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia, pages 430-437, 5-8 December 2005.
    Note: Hal-01431481.
    Keywords: Grid Computing, DIET, P2P. [bibtex-key = InProceedingsCaron.CDPT_05] [bibtex-entry]


  6. Eddy Caron, Frédéric Desprez, and Frédéric Suter. Out-of-Core and Pipeline Techniques for Wavefront Algorithms. In Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS'05), Denver - Colorado, 3-8 # apr 2005.
    Note: Hal-00008798.
    Keywords: Out-of-Core. [bibtex-key = InProceedingsCaron.CDS_05] [bibtex-entry]


  7. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. Étude d'architectures de méta-ordonnancement pour le calcul intensif en régime permanent et saturé. In RenPar 2005. 16ème Rencontres Francophones du Parallélisme, Croisic, 5-8 # apr 2005.
    Note: Hal-01431485.
    Keywords: Scheduling, Grid Computing. [bibtex-key = InProceedingsCaron.CGT_05] [bibtex-entry]


  8. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. A study of meta-scheduling architectures for high throughput computing: Pull vs. Push. In ISPDC 2005. The 4th International Symposium on Parallel and Distributed Computing, Lille. France, July 2005. University of Lille 1.
    Note: Hal-01431484. [bibtex-key = InProceedingsCaron.CGT_05*1] [bibtex-entry]


  9. Gabriel Antoniu, Marin Bertier, Luc Bougé, Eddy Caron, Frédéric Desprez, Mathieu Jan, Sébastien Monnet, and Pierre Sens. GDS: an Architecture Proposal for a Grid Data-Sharing Service. Technical report 2005-28, Laboratoire de l'Informatique du Parallélisme (LIP), June 2005.
    Note: Also available as INRIA Research Report RR-5593. hal number hal-01431487.
    Keywords: Data sharing, grid computing, transparent access, mutable data, P2P, fault tolerance, consistency protocols, DIET. [bibtex-key = TechReportRR-Laboratoire-2005-28] [bibtex-entry]


  10. Gabriel Antoniu, Marin Bertier, Luc Bougé, Eddy Caron, Frédéric Desprez, Mathieu Jan, Sébastien Monnet, and Pierre Sens. GDS: an Architecture Proposal for a Grid Data-Sharing Service. Technical report RR-5593, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2005.
    Note: Also available as LIP Research Report 2005-28. hal number inria-00071239.
    Keywords: Data sharing, grid computing, transparent access, mutable data, P2P, fault tolerance, consistency protocols, DIET. [bibtex-key = TechReportRR-Institut-RR-5593] [bibtex-entry]


  11. Eddy Caron, Pushpinder Kaur Chouhan, Holly Dail, and Frédéric Vivien. Automatic Middleware Deployment Planning on Clusters. Research report 2005-50, Laboratoire de l'Informatique du Parallélisme (LIP), October 2005.
    Note: Revised version of LIP Research Report 2005-26. hal-01429842.
    Keywords: Deployment, Cluster, Middleware, Modeling, DIET. [bibtex-key = TechReportRR-Laboratoire-2005-50] [bibtex-entry]


  12. Eddy Caron, Pushpinder Kaur Chouhan, and Holly Dail. Automatic Middleware Deployment Planning on Clusters. Technical report 2005-26, Laboratoire de l'Informatique du Parallélisme (LIP), May 2005.
    Note: Also available as INRIA Research Report RR-5573. hal-01429846.
    Keywords: Deployment, DIET. [bibtex-key = TechReportRR-Laboratoire-2005-26] [bibtex-entry]


  13. Eddy Caron, Pushpinder Kaur Chouhan, and Holly Dail. Automatic Middleware Deployment Planning on Clusters. Technical report RR-5573, Institut National de Recherche en Informatique et en Automatique (INRIA), May 2005.
    Note: Also available as LIP Research Report 2005-26. hal number inria-00070433.
    Keywords: Deployment, Cluster, Middleware, Modeling, DIET. [bibtex-key = TechReportRR-Institut-RR-5573] [bibtex-entry]


  14. Eddy Caron and Holly Dail. GoDIET: a tool for managing distributed hierarchies of DIET agents and servers.. Research report RR-5520, Institut National de Recherche en Informatique et en Automatique (INRIA), March 2005.
    Note: Also available as LIP Research Report 2005-06. hal number inria-00070486.
    Keywords: DIET, Deployment. [bibtex-key = TechReportRR-Institut-RR-5520] [bibtex-entry]


  15. Eddy Caron and Holly Dail. GoDIET: a tool for managing distributed hierarchies of DIET agents and servers.. Research report 2005-06, Laboratoire de l'Informatique du Parallélisme (LIP), February 2005.
    Note: Also available as INRIA Research Report RR-5520. hal-01430518.
    Keywords: DIET, Deployment. [bibtex-key = TechReportRR-Laboratoire-2005-06] [bibtex-entry]


  16. Eddy Caron, Bruno Del-Fabbro, Frédéric Desprez, Emmanuel Jeannot, and Jean-Marc Nicod. Managing Data Persistence in Network Enabled Servers. Research Report 5725, INRIA, October 2005.
    Note: Hal number inria-00071216. [bibtex-key = TechReportRR-INRIA-5725] [bibtex-entry]


  17. Eddy Caron, Frédéric Desprez, Christophe Hamerling, Jean-Yves L'Excellent, Marc Pantel, and Chiara Puglisi-Amestoy. Use of A Network Enabled Server System for a Sparse Linear Algebra Grid Application. Technical report 2005-30, Laboratoire de l'Informatique du Parallélisme (LIP), June 2005.
    Note: Also available as INRIA Research Report RR-5595. hal-01429873.
    Keywords: DIET. [bibtex-key = TechReportRR-Laboratoire-2005-30] [bibtex-entry]


  18. Eddy Caron, Frédéric Desprez, Christophe Hamerling, Jean-Yves L'Excellent, Marc Pantel, and Chiara Puglisi-Amestoy. Use of A Network Enabled Server System for a Sparse Linear Algebra Grid Application. Technical report RR-5595, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2005.
    Note: Also available as LIP Research Report 2005-30. hal number inria-00070412.
    Keywords: DIET. [bibtex-key = TechReportRR-Institut-RR-5595] [bibtex-entry]


  19. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Service discovery in a peer-to-peer environment for computational grids. Technical report RR-5679, Institut National de Recherche en Informatique et en Automatique (INRIA), September 2005.
    Note: Also available as LIP Research Report 2005-42. hal number inria-00070334.
    Keywords: grid computing, peer-to-peer technology, service discovery. [bibtex-key = TechReportRR-Institut-RR-5679] [bibtex-entry]


  20. Eddy Caron and Frédéric Desprez. DIET: A Scalable Toolbox to Build Network Enabled Servers on the Grid. Technical report RR-5601, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2005.
    Note: Also available as LIP Research Report 2005-23. hal number inria-00070406.
    Keywords: Grid Computing, Network Enabled Servers, Client-servers computing, DIET. [bibtex-key = TechReportRR-Institut-RR-5601] [bibtex-entry]


  21. Eddy Caron, Frédéric Desprez, and Cédric Tedeschi. Service Discovery in a peer-to-peer environment for Computational Grids. Research Report RR2005-42, LIP, ENS Lyon, France, September 2005.
    Note: Also available as INRIA Research Report RR-5679. hal-01431488. [bibtex-key = TechReportRR-LIP-RR2005-42] [bibtex-entry]


  22. Eddy Caron and Frédéric Desprez. DIET: A Scalable Toolbox to Build Network Enabled Servers on the Grid. Technical report 2005-23, Laboratoire de l'Informatique du Parallélisme (LIP), June 2005.
    Note: Also available as INRIA Research Report RR-5601. hal-01429861.
    Keywords: Grid Computing, Network Enabled Servers, Client-servers computing, DIET. [bibtex-key = TechReportRR-Laboratoire-2005-23] [bibtex-entry]


  23. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. Evaluation of Meta-scheduler Architectures and Task Assignment Policies for High Throughput Computing.. Technical report 2005-27, Laboratoire de l'Informatique du Parallélisme (LIP), May 2005.
    Note: Also available as INRIA Research Report RR-5576. hal-01431486.
    Keywords: Simulation, Model, Multi-clusters platform, Meta-scheduling, Grid Computing.. [bibtex-key = TechReportRR-Laboratoire-2005-27] [bibtex-entry]


  24. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. A study of meta-scheduling architectures for high throughput computing.. Technical report 2005-13, Laboratoire de l'Informatique du Parallélisme (LIP), May 2005.
    Note: Hal number inria-00070430.
    Keywords: Metascheduler, Grid computing.. [bibtex-key = TechReportRR-Laboratoire-2005-13] [bibtex-entry]


  25. Eddy Caron, Vincent Garonne, and Andreï Tsaregorodtsev. Evaluation of Meta-scheduler Architectures and Task Assignment Policies for High Throughput Computing.. Technical report RR-5576, Institut National de Recherche en Informatique et en Automatique (INRIA), May 2005.
    Note: Also available as LIP Research Report 2005-27. hal number inria-00070430.
    Keywords: Simulation, Model, Multi-clusters platform, Meta-scheduling, Grid Computing.. [bibtex-key = TechReportRR-Institut-RR-5576] [bibtex-entry]


  26. Pushpinder Kaur Chouhan, Holly Dail, Eddy Caron, and Frédéric Vivien. Automatic Middleware Deployment Planning on Clusters. Technical report RR-5765, Institut National de Recherche en Informatique et en Automatique (INRIA), May 2005.
    Note: Also available as LIP Research Report 2005-26. hal number inria-00070256.
    Keywords: Deployment, Cluster, Middleware, Modeling, DIET. [bibtex-key = TechReportRR-Institut-RR-5765] [bibtex-entry]


2004
  1. Eddy Caron, Frédéric Desprez, Martin Quinson, and Frédéric Suter. Performance Evaluation of Linear Algebra Routines. International Journal of High Performance Computing Applications, 18(3):373-390, 2004.
    Note: Special issue on Clusters and Computational Grids for Scientific Computing (CCGSC'02). hal number inria-00000234. [bibtex-key = ArticleCaron.CDQS_IJHPCA04] [bibtex-entry]


  2. Eddy Caron and Gil Utard. On the Performance of Parallel Factorization of Out-of-Core Matrices. Parallel Computing, 30(3):357-375, February 2004.
    Note: Hal-01431496.
    Keywords: Out-of-core. [bibtex-key = ArticleCaron.CU_PC04] [bibtex-entry]


  3. Eddy Caron, Pushpinder Kaur Chouhan, and Frederic Desprez. Deadline scheduling with priority for client-server systems on the Grid. In Rajkumar Buyya, editor, Grid Computing 2004. IEEE International Conference On Grid Computing. Super Computing 2004, Pittsburgh, Pennsylvania, pages 410-414, October 2004.
    Note: Short Paper. hal-01431492. [bibtex-key = InProceedingsCaron.CCD_04] [bibtex-entry]


  4. Eddy Caron, Pushpinder Kaur Chouhan, and Arnaud Legrand. Automatic Deployment for Hierarchical Network Enabled Server. In The 13th Heterogeneous Computing Workshop (HCW 2004), Santa Fe. New Mexico, pages 109b (10 pages), April 2004.
    Note: Hal-00789445.
    Keywords: Deployment, Grid Computing, Network Enabled Servers, Steady-state scheduling, Resource localization and selection, DIET. [bibtex-key = InProceedingsCaron.CCL_04] [bibtex-entry]


  5. Eddy Caron, Frédéric Desprez, Bruno Del-Fabbro, and Antoine Vernois. Gestion de données dans les NES. In DistRibUtIon de Données à grande Echelle. DRUIDE 2004, Domaine du Port-aux-Rocs, Le Croisic. France, pages 23-32, 24-28 # may 2004. IRISA.
    Note: Hal-01431495.
    Keywords: Grid Computing, DIET, Data Management. [bibtex-key = Con-Caron.CDDV_04] [bibtex-entry]


  6. Eddy Caron and Frédéric Desprez. DIET, tour d'horizon. In Ecole thématique sur la Globalisation des Ressources Informatiques et des Données : Utilisation et Services. GridUSe 2004, Metz. France, pages 61-81, 21-25 # jun 2004. Supélec.
    Note: Hal-01431493.
    Keywords: DIET. [bibtex-key = Con-Caron.CD_04] [bibtex-entry]


  7. Eddy Caron, Pushpinder Kaur Chouhan, and Frederic Desprez. Deadline scheduling with Priority for client-server systems on the Grid. Research report 2004-33, Laboratoire de l'Informatique du Parallélisme (LIP), July 2004.
    Note: Also available as INRIA Research Report RR-5335. hal-01431491.
    Keywords: Deployment, DIET. [bibtex-key = TechReportRR-Laboratoire-2004-33] [bibtex-entry]


  8. Eddy Caron, Pushpinder Kaur Chouhan, and Frederic Desprez. Deadline scheduling with Priority for client-server systems on the Grid. Research report RR-5335, INRIA, October 2004.
    Note: Also available as LIP Research Report 2004-33. hal number inria-00070666.
    Keywords: Deployment, DIET. [bibtex-key = TechReportRR-INRIA-RR-5335] [bibtex-entry]


  9. Eddy Caron, Pushpinder Kaur Chouhan, and Arnaud Legrand. Automatic Deployment for Hierarchical Network Enabled Server. Research report RR-5146, Institut National de Recherche en Informatique et en Automatique (INRIA), March 2004.
    Note: Also available as LIP Research Report 2003-51. hal number inria-00071437.
    Keywords: Deployment, Grid Computing, Network Enabled Servers, Steady-state scheduling, Resource localization and selection, DIET. [bibtex-key = TechReportRR-Institut-RR-5146] [bibtex-entry]


  10. Eddy Caron, Frédéric Desprez, Franck Petit, and Cédric Tedeschi. Resource Localization Using Peer-To-Peer Technology for Network Enabled Servers. Research report 2004-55, Laboratoire de l'Informatique du Parallélisme (LIP), December 2004.
    Note: Hal-01431498.
    Keywords: Grid Computing, DIET, P2P. [bibtex-key = TechReportRR-Laboratoire-2004-55] [bibtex-entry]


  11. Eddy Caron, Frédéric Desprez, and Frédéric Suter. Overlapping Computations and Communications with I/O in Wavefront Algorithms. Technical report RR2004-58, Laboratoire de l'Informatique du Parallélisme (LIP), December 2004.
    Note: Also available as INRIA Research Report RR-5410. hal-01431497.
    Keywords: Out-of-Core. [bibtex-key = TechReportRR-Laboratoire-RR2004-58] [bibtex-entry]


  12. Eddy Caron, Frédéric Desprez, and Frédéric Suter. Overlapping Computations and Communications with I/O in Wavefront Algorithms. Technical report RR-5410, Institut National de Recherche en Informatique et en Automatique (INRIA), December 2004.
    Note: Also available as LIP Research Report RR2004-58. hal number inria-00071247.
    Keywords: Out-of-Core. [bibtex-key = TechReportRR-Institut-RR-5410] [bibtex-entry]


  13. Holly Dail and Eddy Caron. GoDIET: Un outil pour le déploiement de DIET. Technical report 2004-49, Laboratoire de l'Informatique du Parallélisme (LIP), November 2004.
    Note: Hal-01430517.
    Keywords: Grid Computing, DIET. [bibtex-key = TechReportRR-Laboratoire-2004-49] [bibtex-entry]


  14. Raphaël Bolze, Eddy Caron, Philippe Combes, Holly Dail, and Christophe Pera. DIET Tutorial. Ecole thématique sur la Globalisation des Ressources Informatiques et des Données : Utilisation et Services. GridUSe 2004, 21-25 # jun 2004.
    Note: Hal-01431494.
    Keywords: DIET. [bibtex-key = Mis-Bolze.BCCDP_04] [bibtex-entry]


2003
  1. Eddy Caron, Frédéric Desprez, and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. Parallel and Distributed Computing Practices (PDCP), 6(1):57-69, March 2003.
    Note: Special Isue: Internet-Based Computing. hal number hal-01431504. [bibtex-key = ArticleCaron.CDS_PDCPP03] [bibtex-entry]


  2. Eddy Caron. Client-Server Approach for Simulation over the GRID. In Korea-France joint Workshop on GRID computing, editor, Application and Middleware systems, December 2003. Seoul National University.
    Note: Hal-01431503.
    Keywords: Grid Computing, DIET. [bibtex-key = Con-Caron.C_03*1] [bibtex-entry]


  3. Eddy Caron. Activities around Client-Server Computing over the Grid. In French/Japan Workshop on Grid Computing, March 2003. CNRS.
    Note: Hal-01431502.
    Keywords: Grid Computing, DIET. [bibtex-key = Con-Caron.C_03] [bibtex-entry]


  4. Eddy Caron, Frédéric Desprez, Franck Petit, and Vincent Villain. A Hierarchical Resource Reservation Algorithm for Network Enabled Servers. In IPDPS'03. The 17th International Parallel and Distributed Processing Symposium, Nice - France, April 2003.
    Note: Hal-01431499.
    Keywords: Grid Computing, DIET, Scheduling. [bibtex-key = InProceedingsCaron.CDPV_03] [bibtex-entry]


  5. Eddy Caron, Pushpinder Kaur Chouhan, and Arnaud Legrand. Automatic Deployment for Hierarchical Network Enabled Server. Research report 2003-51, Laboratoire de l'Informatique du Parallélisme (LIP), November 2003.
    Note: Also available as INRIA Research Report RR-5146. hal-01431490.
    Keywords: Deployment, Grid Computing, Network Enabled Servers, Steady-state scheduling, Resource localization and selection, DIET.
    Abstract: This paper focus on the deployment of grid infrastructures, more specifically Problem Solving Environments (PSE) for numerical applications on the grid. Even if the deployment of such an architecture is forced by physical constraints (firewall, access permission, security,...) its efficiency heavily depends on the quality of the mapping between its different components and the grid resources. This paper proposes a new model based on linear programming to estimate the performance of a deployment of a hierarchical PSE. The advantages of the modeling approach in this case are multiple: evaluate a virtual deployment before an actual deployment, provide a decision builder tool (i.e., designed to compare different architectures or buy new resource), take into account the platform scalability. Using this modeling, it is possible to determine the bottleneck of the platform and thus to know whether a given deployment can be improved or not. We illustrate this modeling by applying this results to an existing hierarchical PSE called DIET.
    [bibtex-key = TechReportRR-Laboratoire-2003-51] [bibtex-entry]


  6. Eddy Caron, Frédéric Desprez, Franck Petit, and Vincent Villain. A Hierarchical Resource Reservation Algorithm for Network Enabled Servers. Research report LaRIA-2003-14, November 2003.
    Note: Also available as INRIA Research Report RR-4701 and LIP Research Report 2003-03. hal-01431501.
    Keywords: Grid Computing, DIET. [bibtex-key = Tec-Caron.CDPV_03] [bibtex-entry]


  7. Eddy Caron, Frédéric Desprez, Franck Petit, and Vincent Villain. A Hierarchical Resource Reservation Algorithm for Network Enabled Servers. Research report 2003-03, Laboratoire de l'Informatique du Parallélisme (LIP), January 2003.
    Note: Also available as INRIA Research Report RR-4701 and LaRIA Research Report LaRIA-2003-14. hal-01431500.
    Keywords: Grid Computing, DIET, Scheduling. [bibtex-key = TechReportRR-Laboratoire-2003-03] [bibtex-entry]


  8. Eddy Caron, Frédéric Desprez, Franck Petit, and Vincent Villain. A Hierarchical Resource Reservation Algorithm for Network Enabled Servers. Research report RR-4701, Institut National de Recherche en Informatique et en Automatique (INRIA), January 2003.
    Note: Also available as LIP Research Report 2003-03 and LaRIA Research Report LaRIA-2003-14. hal number inria-00071885.
    Keywords: Grid Computing, DIET. [bibtex-key = TechReportRR-Institut-RR-4701] [bibtex-entry]


2002
  1. Eddy Caron, Frédéric Desprez, Eric Fleury, Frédéric Lombard, Jean-Marc Nicod, Martin Quinson, and Frédéric Suter. Une approche hiérarchique des serveurs de calculs. In Françoise Baude, editor,Calcul réparti à grande échelle, pages 129-151. Hermès Science Paris, 2002.
    Note: ISBN 2-7462-0472-X. hal number hal-01431513.
    Keywords: DIET. [bibtex-key = InCollectionCaron.CDFLNQS_02] [bibtex-entry]


  2. Eddy Caron, Frédéric Desprez, Frédéric Lombard, Jean-Marc Nicod, Martin Quinson, and Frédéric Suter. A Scalable Approach to Network Enabled Servers. In B. Monien and R. Feldmann, editors, Proceedings of the 8th International EuroPar Conference, volume 2400 of Lecture Notes in Computer Science, Paderborn, Germany, pages 907-910, August 2002. Springer-Verlag.
    Note: Hal-01431508.
    Keywords: Grid computing, DIET. [bibtex-key = InProceedingsCaron.CDLNQS_02] [bibtex-entry]


  3. Eddy Caron and Frédéric Desprez. GridRPC: Approche RPC pour la simulation sur la grille: Approche RPC pour la simulation sur la grille. In Actes de l'Ecole thématique sur la globalisation des ressources informatiques et des données, Aussois, France, pages 87-98, December 2002.
    Note: Hal-01431510.
    Keywords: Grid Computing GridRPC, DIET. [bibtex-key = Con-Caron.CD_02] [bibtex-entry]


  4. Eddy Caron and Frédéric Suter. Extension parallèle d'un outil de prédiction dynamique de performances. In 14e Rencontres Francophones du Parallélisme, Hammamet, Tunisie, pages 69-74, 10-13 # apr 2002.
    Note: Hal-01431509.
    Keywords: Performance Forecasting, FAST, Metacomputing, Scheduling. [bibtex-key = InProceedingsCaron.CS_02*1] [bibtex-entry]


  5. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. In Proceedings of the International Symposium on Parallel and Distributed Computing, Iasi, Romania, pages 80-93, July 2002.
    Note: Hal-01431505.
    Keywords: Performance Forecasting, FAST. [bibtex-key = InProceedingsCaron.CS_02] [bibtex-entry]


  6. Eddy Caron and Gil Utard. Parallel Out-of-Core Matrix Inversion. In IPDPS'02. The 16th International Parallel and Distributed Processing Symposium, Fort Lauderdale, 15-18 # apr 2002.
    Note: Hal-01431511.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CU_02] [bibtex-entry]


  7. Eddy Caron, Philippe Combes, Sylvain Contassot-Vivier, Frédéric Desprez, Frédéric Lombard, Jean-Marc Nicod, Martin Quinson, and Frédéric Suter. A Scalable Approach to Network Enabled Servers. Research report RR-4501, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2002.
    Note: Also available as LIP Research Report 2002-21. hal number inria-00072087.
    Keywords: Grid Computing, DIET. [bibtex-key = TechReportRR-Institut-RR-4501] [bibtex-entry]


  8. Eddy Caron, Philippe Combes, Sylvain Contassot-Vivier, Frédéric Desprez, Frédéric Lombard, Jean-Marc Nicod, Martin Quinson, and Frédéric Suter. A Scalable Approach to Network Enabled Servers. Research report 2002-21, Laboratoire de l'Informatique du Parallélisme (LIP), May 2002.
    Note: Also available as INRIA Research Report RR-4501. hal-01431507.
    Keywords: Grid Computing, DIET. [bibtex-key = TechReportRR-Laboratoire-2002-21] [bibtex-entry]


  9. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. Research report 2002-19, Laboratoire de l'Informatique du Parallélisme (LIP), May 2002.
    Note: Hal-01431506.
    Keywords: Performance Forecasting, FAST, Metacomputing, Modeling, Parallel routines. [bibtex-key = TechReportRR-Laboratoire-2002-19] [bibtex-entry]


  10. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. Research report RR-4470, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2002.
    Note: Also available as LIP Research Report 2002-19. hal number inria-00072118.
    Keywords: Performance Forecasting, FAST. [bibtex-key = TechReportRR-Institut-RR-4470] [bibtex-entry]


  11. Eddy Caron and Gil Utard. Parallel Out-of-Core Matrix Inversion.. Research report 2002-04, Laboratoire de l'Informatique du Parallélisme (LIP), January 2002.
    Note: Hal-01431512.
    Keywords: Out-of-core. [bibtex-key = TechReportRR-Laboratoire-2002-04] [bibtex-entry]


2001
  1. Eddy Caron, Serge Chaumette, Sylvain Contassot-Vivier, Frédéric Desprez, Eric Fleury, Claude Gomez, Maurice Goursat, Emmanuel Jeannot, Dominique Lazure, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe, Martin Quinson, Pierre Ramet, Jean Roman, Franck Rubi, Serge Steer, Frédéric Suter, and Gil Utard. Scilab to Scilab//, the OURAGAN Project. Parallel Computing, 11(27):1497-1519, October 2001.
    Note: Hal number inria-00000277.
    Keywords: Scilab//, Metacomputing.
    Abstract: In this paper, we present the developments realized in the OURAGAN project around the parallelization of a MATLAB-like tool called SCILAB. These developments use high-performance numerical libraries and different approaches based either on the duplication of SCILAB processes or on computational servers. This tool, SCILAB//, allows users to perform high-level operations on distributed matrices in a metacomputing environment. We also present performance results on different architectures.
    [bibtex-key = ArticleCaron.CCCDFGGJLLNPQRRRS_PC01] [bibtex-entry]


  2. Eddy Caron. Inversion matricielle parallèle de grande taille. In RenPar'13. 13èmes Rencontres francophones du Parallélisme des Architectures et des Systèmes. Paris, Cité des Sciences et de l'Industrie de la Vilette. France, pages 1-6, April 2001.
    Note: Hal-01436407.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.C_01] [bibtex-entry]


  3. Eddy Caron, Serge Chaumette, Sylvain Contassot-Vivier, Frédéric Desprez, Eric Fleury, Claude Gomez, Maurice Goursat, Emmanuel Jeannot, Dominique Lazure, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe, Martin Quinson, Pierre Ramet, Jean Roman, Franck Rubi, Serge Steer, Frédéric Suter, and Gil Utard. Scilab to Scilab//: the OURAGAN Project.. Research report RR4203, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2001.
    Note: Also available as LIP Research Report 2001-24. hal number inria-00072419.
    Keywords: Scilab//. [bibtex-key = TechReportRR-Institut-RR4203] [bibtex-entry]


  4. Eddy Caron, Serge Chaumette, Sylvain Contassot-Vivier, Frédéric Desprez, Eric Fleury, Claude Gomez, Maurice Goursat, Emmanuel Jeannot, Dominique Lazure, Frédéric Lombard, Jean-Marc Nicod, Laurent Philippe, Martin Quinson, Pierre Ramet, Jean Roman, Franck Rubi, Serge Steer, Frédéric Suter, and Gil Utard. Scilab to Scilab// - The OURAGAN Project.. Research report 2001-24, Laboratoire de l'Informatique du Parallélisme (LIP), June 2001.
    Note: Also available as INRIA Research Report RR-4203. hal-01436419.
    Keywords: Scilab//. [bibtex-key = TechReportRR-Laboratoire-2001-24] [bibtex-entry]


2000
  1. Eddy Caron. Calcul numérique sur données de grande taille. Thèse, Université de Picardie Jules Verne, 14 # dec 2000.
    Note: Hal number: tel-01444591.
    Keywords: Out-of-core.
    Abstract: La recherche en parall{\'e}lisme s'est concentr{\'e}e avec succ{\`e}s sur les aspects calcul et communication, on peut aujourd'hui pr{\'e}tendre {\`a} des puissances de calcul de l'ordre du T{\'e}ra-flops (milliard d'op{\'e}ration par seconde). Les applications qui requi{\`e}rent de telle puissance de calcul sont en g{\'e}n{\'e}rales celles qui ont {\`a} traiter des masses de donn{\'e}es qui se mesurent en Giga-octects, voir en T{\'e}ra-octets. Or, dans la pratique les capacit{\'e}s m{\'e}moire fixent la taille maximale du probl{\`e}me que l'utilisateur pourra traiter. L'utilisateur consid{\'e}rera qu'il est inconcevable de recourir au syst{\`e}me de pagination ou aux disques du fait de l'importante chute des performances. Et pourtant, le paradoxe est l{\`a} d'un c{\^o}t{\'e} des capacit{\'e}s m{\'e}moire rapide mais de petite taille et co{\^u}teuses, de l'autre des capacit{\'e}s m{\'e}moire {\`a} bon march{\'e} et de grande taille, plusieurs T{\'e}ra-octets, mais tr{\`e}s lente d'acc{\`e}s. Le concept du calcul out-of-core r{\'e}ponds {\`a} ces attentes en proposant d'utiliser au mieux les ressources des m{\'e}moires externes. Cette th{\`e}se d{\'e}veloppe une {\'e}tude sur le calcul num{\'e}rique hautes performances out-of-core et propose des m{\'e}canismes de traitement des donn{\'e}es de tr{\`e}s grande taille. Pour r{\'e}soudre efficacement le probl{\`e}me de la gestion m{\'e}moire, deux approches diff{\'e}rentes sont trait{\'e}es. Une approche syst{\`e}me dans laquelle nous {\'e}tudions les m{\'e}canismes de pagination. Nous d{\'e}montrons que ces syst{\`e}mes ne sont pas adapt{\'e}s au calcul num{\'e}rique intensif, et qu'il est alors important de r{\'e}ordonnancer les flux d'ex{\'e}cution. Nous pr{\'e}sentons une nouvelle biblioth{\`e}que de gestion de la m{\'e}moire virtuelle au niveau utilisateur. Une optimisation de la factorisation LU de tr{\`e}s grandes matrices illustre l'utilisation de cette biblioth{\`e}que. La seconde approche est bas{\'e}e sur l'algorithmique out-of-core. En pr{\'e}ambule, nous pr{\'e}sentons la biblioth{\`e}que de calcul d'alg{\`e}bre lin{\'e}aire ScaLAPACK, en offrant une description de ses diff{\'e}rentes composantes. Un soin particulier est port{\'e} sur la pr{\'e}sentation du prototype out-of-core et les d{\'e}veloppements que nous avons effectu{\'e} au sein de ce prototype. Nous proposons, ensuite, une {\'e}tude d{\'e}taill{\'e}e de deux algorithmes out-of-core d{\'e}velopp{\'e}s dans cette biblioth{\`e}que : - la factorisation LU : nous pr{\'e}sentons un mod{\`e}le analytique permettant d'{\'e}valuer les performances de la factorisation LU parall{\`e}le out-of-core left-looking. L'objectif de cette mod{\'e}lisation est de d{\'e}celer des optimisations pour l'algorithme en question et de mettre en {\'e}vidence les surco{\^u}ts out-of-core. Le mod{\`e}le de pr{\'e}diction des performances est valid{\'e} de mani{\`e}re exp{\'e}rimentale. Nous prouverons ainsi qu'une distribution de la matrice correctement effectu{\'e}e et la mise en place d'un syst{\`e}me de recouvrement du surco{\^u}t des E/S par le calcul, il est possible d'obtenir des performances proches de l'algorithme en m{\'e}moire. De plus, nous d{\'e}terminons la taille m{\'e}moire minimale n{\'e}cessaire pour permettre ce recouvrement. - l'inversion matricielle : Nous proposons un algorithme d'inversion matricielle out-of-core par extension des travaux r{\'e}alis{\'e}s sur la factorisation LU out-of-core. Par extension du mod{\`e}le de pr{\'e}diction des performances de la factorisation LU, nous avons {\'e}labor{\'e} un mod{\`e}le analytique pour l'inversion. Ce mod{\`e}le permet de mettre en {\'e}vidence les surco{\^u}ts dus au traitement out-of-core. Nous montrons comment r{\'e}duire ces surco{\^u}ts afin d'obtenir une inversion out-of-core pouvant atteindre des performances proches d'une r{\'e}solution en m{\'e}moire. Afin d'exploiter ces r{\'e}sultats nous avons r{\'e}alis{\'e} pour ces deux algorithmes une version effectuant le recouvrement des acc{\`e}s disques par les temps de calcul. La technique utilis{\'e}e pour effectuer les recouvrements est bas{\'e}e sur le clonage de processus, apr{\`e}s avoir {\'e}voqu{\'e} le principe de mise en oeuvre, nous exposons les difficult{\'e}s rencontr{\'e}es pour obtenir un r{\'e}el recouvrement des entr{\'e}es/sorties. Par extension, nous pr{\'e}sentons alors la factorisation LU out-of-core et l'inversion matricielle out-of-core dans lesquelles nous avons mis en place le syst{\`e}me de recouvrement ainsi que les r{\'e}sultats obtenus. Une derni{\`e}re partie pr{\'e}sente l'int{\'e}gration de ces travaux dans Scilab//, un outil de calcul num{\'e}rique. La participation {\`a} ce projet de l'INRIA, permet d'utiliser la biblioth{\`e}que out-of-core de ScaLAPACK avec une interface conviviale, et, d'accro{\^\i}tre ainsi le champ d'application de Scilab//. Nous pr{\'e}sentons Scilab et les techniques permettant d'interfacer des modules externes compil{\'e}s. Nous pr{\'e}sentons ensuite Scilab//, et exposons l'extension que nous avons r{\'e}alis{\'e} afin de proposer une version out-of-core de Scilab. Nous menons ensuite une {\'e}tude afin de proposer des optimisations pour les traitements out-of-core.
    [bibtex-key = PhDThesisPhD-Caron_00] [bibtex-entry]


  2. Eddy Caron, Dominique Lazure, and Frédéric Suter. Manipulation de données de grande taille dans Scilab//. In Douzièmes Rencontres Francophones du Parallélisme, Besançon, June 2000.
    Note: Hal-01444360.
    Keywords: Scilab//. [bibtex-key = InProceedingsCaron.CLS_00] [bibtex-entry]


  3. Eddy Caron, Dominique Lazure, and Gil Utard. Inversion of Huge Matrix on Cluster. In Cluster 2000. IEEE International Conference on Cluster Computing. Technische Universität Chemnitz, Saxony, Germany. (Poster), November 2000.
    Note: Hal-01444355.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CLU_00*1] [bibtex-entry]


  4. Eddy Caron, Dominique Lazure, and Gil Utard. Modélisation et analyse des performances de la factorisation parallel LU out-of-core. In RenPar 2000. 12èmes Rencontres francophones du parallélisme. Besançon., Besançon. France, June 2000.
    Note: Hal-01444359.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CLU_00] [bibtex-entry]


  5. Eddy Caron, Dominique Lazure, and Gil Utard. Performance Modeling and Analysis of Parallel Out-of-Core Matrix Factorization. In HiPC'2000. 7th International Conference on High Performance Computing. Bangalore, India, December 2000.
    Note: Hal-01444358.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CLU_00*2] [bibtex-entry]


1999
  1. Eddy Caron, Olivier Cozette, Dominique Lazure, and Gil Utard. Virtual Memory Management in Data Parallel Applications. In Springer Berlin / Heidelberg, editor, Proc. of HPCN'99 (High Performance Computing and Networking). Workshop: High Performance Computing on Very Large Datasets, volume 1593 of LNCS, pages 1107-1116, April 1999. Springer.
    Note: Hal-01444354.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CCLU_99] [bibtex-entry]


  2. Eddy Caron, Olivier Cozette, Dominique Lazure, and Gil Utard. Mémoire virtuelle et parallélisme de données. In 11èmes Rencontres francophones du parallélisme des architectures et des systèmes. Rennes. France, pages 49-54, June 1999.
    Note: Hal-01444356.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CCLU_99*1] [bibtex-entry]


  3. Eddy Caron, Dominique Lazure, and Gil Utard. Inversion matricielle out-of-core par factorisation LU. In ParDi'99. Oujda. Maroc, October 1999.
    Note: Hal-01444357.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CLU_99] [bibtex-entry]


1998
  1. Eddy Caron, Dominique Lazure, and Gil Utard. Génération de code pour le traitement de grandes données (Présentation sur affiche). In 10èmes Rencontres Francophones du Parallélisme. Strasbourg. France, June 1998.
    Note: Hal-01444353.
    Keywords: Out-of-core. [bibtex-key = InProceedingsCaron.CLU_98] [bibtex-entry]


  2. Eddy Caron, Dominique Lazure, and Gil Utard. Mémoire Virtuelle et Génération de Code pour le traitement de Grandes Données. Research report, Laboratoire de Recherche en Informatique d'Amiens, January 1998.
    Note: Hal-01444164.
    Keywords: Out-of-core. [bibtex-key = Tec-Caron.CLU_98] [bibtex-entry]


1997
  1. Eddy Caron and Dominique Lazure. Towards a sparse dedicated programming environment : an analyses of several data-compression formats. Research report 97-21, Laboratoire de Recherche en Informatique d'Amiens, 1997.
    Note: Hal-01444157.
    Keywords: Creux. [bibtex-key = TechReportRR-Laboratoire-97-21] [bibtex-entry]


  2. Eddy Caron, Dominique Lazure, and Gil Utard. Towards a sparse dedicated programming environment : an analyses of several data-compression formats. Research report 97-25, Laboratoire de Recherche en Informatique d'Amiens, December 1997.
    Note: Revised version of Technical Report LaRIA 97-21. hal-01444156.
    Keywords: Creux. [bibtex-key = TechReportRR-Laboratoire-97-25] [bibtex-entry]


1996
  1. Eddy Caron. Faisabilité d'un compilateur de langage data-parallèle traitant les matrices creuses. Mémoire de D.E.A., Université de Picardie Jules Vernes Amiens, July 1996.
    Note: Hal-01430032.
    Keywords: Creux. [bibtex-key = MastersThesisMSc-Caron_96] [bibtex-entry]



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Tue Oct 10 23:35:55 2017
Author: ecaron.


This document was translated from BibTEX by bibtex2html