1. Y. Robert, M. Parashar, R. Badrinath, and V. Prasanna, editors. High Performance Computing (HiPC) 2006, LNCS 4297, 2006. Springer Verlag.
   

   @Proceedings{ ProceedingsRobert.RPBP_06,
   editor = {Y. Robert and M. Parashar and R. Badrinath and V. Prasanna},
   publisher = {Springer Verlag},
   series = {LNCS 4297},
   title = {{High Performance Computing (HiPC) 2006}},
   year = {2006} 
   }
   




2. L. Carter, H. Casanova, F. Desprez, J. Ferrante, and Y. Robert, editors. Special issue on Scheduling techniques for large-scale distributed platforms, 2006. Int. J. High Performance Computing Applications 20(1).
   

   @Proceedings{ ProceedingsCarter.CCDFR_06,
   editor = {L. Carter and H. Casanova and F. Desprez and J. Ferrante and Y. Robert},
   publisher = {Int. J. High Performance Computing Applications 20(1)},
   title = {Special issue on {\em Scheduling techniques for large-scale distributed platforms}},
   year = {2006} 
   }
   




3. Jack Dongarra and Bernard Tourancheau, editors. Cluster and Computational Grids for Scientific Computing, Special Issue on Tools, 2006. International Journal of High Performance Computing Applications 20(3).
   

   @Proceedings{ ProceedingsDongarra.DT_06,
   title = {Cluster and Computational Grids for Scientific Computing, Special Issue on Tools},
   year = 2006,
   editor = {Dongarra, Jack and Tourancheau, Bernard},
   publisher = {International Journal of High Performance Computing Applications 20(3)} 
   }
   




4. H. Casanova, Y. Robert, and H.J. Siegel, editors. Special issue on Algorithm design and scheduling techniques (realistic platform models) for heterogeneous clusters, 2006. IEEE Trans. Parallel Distributed Systems 17(2).
   

   @Proceedings{ ProceedingsCasanova.CRS_06,
   editor = {H. Casanova and Y. Robert and H.J. Siegel},
   publisher = {IEEE Trans. Parallel Distributed Systems 17(2)},
   title = {Special issue on {\em Algorithm design and scheduling techniques (realistic platform models) for heterogeneous clusters}},
   year = {2006} 
   }
   




5. L. Carter, H. Casanova, F. Desprez, J. Ferrante, and Y. Robert, editors. Special issue on Scheduling techniques for large-scale distributed platforms, 2006. Int. J. High Performance Computing Applications 20(4).
   

   @Proceedings{ ProceedingsCarter.CCDFR_06*1,
   editor = {L. Carter and H. Casanova and F. Desprez and J. Ferrante and Y. Robert},
   publisher = {Int. J. High Performance Computing Applications 20(4)},
   title = {Special issue on {\em Scheduling techniques for large-scale distributed platforms}},
   year = {2006} 
   }
   

1. Pushpinder Kaur Chouhan. Automatic Deployment for Application Service Provider Environments. PhD thesis, École normale supérieure de Lyon, France, September 2006.
   

   @PhDThesis{ PhDThesisPhD-Chouhan_06,
   author = {Chouhan, Pushpinder Kaur},
   address = {France},
   month = sep,
   school = {\'Ecole normale sup\'erieure de Lyon},
   title = {Automatic Deployment for Application Service Provider Environments},
   year = {2006} 
   }
   




2. Loris Marchal. Communications collectives et ordonnancement en régime permanent sur plates-formes hétérogènes. PhD thesis, École Normale Supérieure de Lyon, France, October 2006.
   

   @PhDThesis{ PhDThesisPhD-Marchal_06,
   author = "Loris Marchal",
   month = oct,
   school = "\'Ecole {N}ormale {S}up\'erieure de {L}yon",
   title = "Communications collectives et ordonnancement en r\'egime permanent sur plates-formes h\'et\'erog\`enes",
   address = {France},
   year = "2006" 
   }
   




3. Antoine Vernois. Ordonnancement et réplication de données bioinformatiques dans un contexte de grille de calcul. PhD thesis, École normale supérieure de Lyon, France, October 2006.
   

   @PhDThesis{ PhDThesisPhD-Vernois_06,
   author = {Vernois, Antoine},
   address = {France},
   month = oct,
   school = {\'Ecole normale sup\'erieure de Lyon},
   title = {Ordonnancement et r\'eplication de donn\'ees bioinformatiques dans un contexte de grille de calcul},
   year = {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.
   Keywords: JuxMem, DIET.
   

   @InCollection{ InCollectionAntoniu.ABBCDJMS_06,
   author = {Gabriel Antoniu and Marin Bertier and Luc Boug{\'e} and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Mathieu Jan and S{\'e}bastien Monnet and Pierre Sens},
   booktitle = {{Future Generation Grids}},
   editor = {Getov, Vladimir and Laforenza, Domenico and Reinefeld, Alexander},
   keywords = {JuxMem,DIET},
   publisher = {Springer Verlag},
   series = {Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany},
   title = {{GDS}: An Architecture Proposal for a Grid Data-Sharing Service},
   volume = {XVIII, CoreGrid Series},
   year = {2006} 
   }
   




2. E. Caron, F. Desprez, J.-Y. L'Excellent, C. Hamerling, M. Pantel, and C. Puglisi-Amestoy. 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.
   Keywords: DIET.
   

   @InCollection{ InCollectionCaron.CDLHPP_06,
   author = {E. Caron and F. Desprez and J.-Y. L'Excellent and C. Hamerling and M. Pantel and C. Puglisi-Amestoy},
   booktitle = {{Future Generation Grids}},
   editor = {Getov, Vladimir and Laforenza, Domenico and Reinefeld, Alexander},
   keywords = {DIET},
   publisher = {Springer Verlag},
   series = {Proceedings of the Workshop on Future Generation Grids November 1-5, 2004, Dagstuhl, Germany},
   title = {Use of A Network Enabled Server System for a Sparse Linear Algebra Application},
   volume = {XVIII, CoreGrid Series},
   year = {2006} 
   }
   




3. Patrick R. Amestoy, Abdou Guermouche, Jean-Yves L'Excellent, and Stephane Pralet. Hybrid scheduling for the parallel solution of linear systems. Parallel Computing, 32(2):136--156, 2006.
   

   @Article{ ArticleAmestoy.AGLP_PC06,
   author = {Patrick R. Amestoy and Abdou Guermouche and Jean-Yves L'Excellent and Stephane Pralet},
   title = {Hybrid scheduling for the parallel solution of linear systems},
   journal = {Parallel Computing},
   volume = {32},
   number = {2},
   pages = {136--156},
   year = 2006 
   }
   




4. Olivier Beaumont, Loris Marchal, and Yves Robert. Complexity results for collective communications on heterogeneous platforms. Int. Journal of High Performance Computing Applications, 20(1):5-17, 2006.
   

   @Article{ ArticleBeaumont.BMR_IJHPCA06,
   author = {Olivier Beaumont and Loris Marchal and Yves Robert},
   journal = {Int. Journal of High Performance Computing Applications},
   title = {Complexity results for collective communications on heterogeneous platforms},
   volume = {20},
   number = {1},
   pages = {5-17},
   year = {2006} 
   }
   




5. Anne Benoit, Brigitte Plateau, and William J. Stewart. Memory Efficient Kronecker algorithms with applications to the modelling of parallel systems. Future Generation Computer Systems, special issue on System Performance Analysis and Evaluation, 22(7):838--847, August 2006.
   

   @Article{ ArticleBenoit.BPS_FGCSSISPAE06,
   author = {Benoit, Anne and Plateau, Brigitte and Stewart, William J.},
   title = {{Memory Efficient Kronecker algorithms with applications to the modelling of parallel systems}},
   journal = {Future Generation Computer Systems, special issue on System Performance Analysis and Evaluation},
   volume = 22,
   number = 7,
   pages = {838--847},
   month = aug,
   year = 2006 
   }
   




6. 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.
   Keywords: Grid'5000, DIET.
   

   @Article{ ArticleBolze.BCCDDJJLLMMNPQRTI_IJHPCA06,
   author = {Bolze, Rapha{\"e}l and Cappello, Franck and Caron, Eddy and Dayd{\'e}, Michel and Desprez, Frederic and Jeannot, Emmanuel and J{\'e}gou, Yvon and Lanteri, St{\'e}phane and Leduc, Julien and Melab, Noredine and Mornet,Guillaume and Namyst, Raymond and Primet, Pascale and Quetier, Benjamin and Richard, Olivier and Talbi, El-Ghazali and Touch{\'e} Irena},
   journal = {International Journal of High Performance Computing Applications},
   keywords = {Grid'5000, DIET},
   month = nov,
   number = {4},
   pages = {481-494},
   title = {Grid'5000: a large scale and highly reconfigurable experimental Grid testbed.},
   volume = {20},
   year = {2006} 
   }
   




7. Yves Caniou and Emmanuel Jeannot. Multi-Criteria Scheduling Heuristics for GridRPC Systems. Special edition of The International Journal of High Performance Computing Applications (IJHPCA), 20(1):61-76, 2006.
   

   @Article{ ArticleCaniou.CJ_SEIJHPCAI06,
   author = {Yves Caniou and Emmanuel Jeannot},
   title = {Multi-Criteria Scheduling Heuristics for {G}rid{RPC} Systems},
   journal = {Special edition of The International Journal of High Performance Computing Applications (IJHPCA)},
   year = {2006},
   pages = {61-76},
   volume = {20},
   number = {1} 
   }
   




8. 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.
   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.

   
   

   @Article{ ArticleCaron.CD_IJHPCA06,
   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.},
   author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric},
   journal = {International Journal of High Performance Computing Applications},
   keywords = {Grid Computing, Network Enabled Servers, Client-servers computing,DIET},
   number = {3},
   pages = {335-352},
   title = {{DIET}: A Scalable Toolbox to Build Network Enabled Servers on the Grid},
   volume = {20},
   year = {2006} 
   }
   




9. 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.
   Keywords: Deployment, DIET.
   

   @Article{ ArticleChouhan.CDCV_IJHPCA06,
   author = {Chouhan, Pushpinder Kaur and Dail, Holly and Caron, Eddy and Vivien, Fr{\'e}d{\'e}ric},
   journal = {International Journal of High Performance Computing Applications},
   keywords = {Deployment, DIET},
   month = nov,
   number = {4},
   pages = {517-530},
   title = {Automatic Middleware Deployment Planning on Clusters},
   volume = {20},
   year = {2006} 
   }
   




10. Holly Dail and Frédéric Desprez. Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments. International Journal of High Performance Computing Applications, 20(1):143-157, February 2006.
    

    @Article{ ArticleDail.DD_I06,
    author = {Holly Dail and Fr\'ed\'eric Desprez},
    title = {Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments},
    journal = {{International Journal of High Performance Computing Applications}},
    volume = 20,
    number = 1,
    pages = {143-157},
    month = feb,
    year = {2006} 
    }
    




11. Frédéric Desprez and Antoine Vernois. Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid. Journal of Grid Computing, 4(1):19-31, March 2006.
    

    @Article{ ArticleDesprez.DV_JGC06,
    author = {Fr\'ed\'eric Desprez and Antoine Vernois},
    journal = {Journal of Grid Computing},
    title = {Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid},
    year = {2006},
    volume = {4},
    number = {1},
    month = mar,
    pages = {19-31} 
    }
    




12. N. Garnier, A. Friedrich, R. Bolze, E. Bettler, L. Moulinier, C. Geourjon, J. D. Thompson, G. Deleage, and O. Poch. MAGOS: multiple alignment and modelling server. Bioinformatics, 22(17):2164-2165, 2006.

    Abstract:

    Summary: MAGOS is a web server allowing automated protein modelling coupled to the creation of a hierarchical and annotated multiple alignment of complete sequences. MAGOS is designed for an interactive approach of structural information within the framework of the evolutionary relevance of mined and predicted sequence information. Availability: The web server is freely available at http://pig-pbil.ibcp.fr/magos Supplementary information: The website supplies detailed explanations and illustrations of processes and results at http://pig-pbil.ibcp.fr/html/magos/help.html Contact: e.bettler@ibcp.fr

    
    

    @Article{ ArticleGarnier.GFBBMGTDP_B06,
    author = {Garnier, N. and Friedrich, A. and Bolze, R. and Bettler, E. and Moulinier, L. and Geourjon, C. and Thompson, J. D. and Deleage, G. and Poch, O.},
    title = {{MAGOS: multiple alignment and modelling server}},
    journal = {Bioinformatics},
    volume = {22},
    number = {17},
    pages = {2164-2165},
    year = {2006},
    abstract = {Summary: MAGOS is a web server allowing automated protein modelling coupled to the creation of a hierarchical and annotated multiple alignment of complete sequences. MAGOS is designed for an interactive approach of structural information within the framework of the evolutionary relevance of mined and predicted sequence information. Availability: The web server is freely available at http://pig-pbil.ibcp.fr/magos Supplementary information: The website supplies detailed explanations and illustrations of processes and results at http://pig-pbil.ibcp.fr/html/magos/help.html Contact: e.bettler@ibcp.fr },
    url = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/22/17/2164} 
    }
    




13. Arnaud Giersch, Yves Robert, and Frédéric Vivien. Scheduling tasks sharing files on heterogeneous master-slave platforms. Journal of Systems Architecture, 52(2):88-104, 2006.
    

    @Article{ ArticleGiersch.GRV_JSA06,
    author = {Arnaud Giersch and Yves Robert and Fr\'ed\'eric Vivien},
    journal = {Journal of Systems Architecture},
    title = {Scheduling tasks sharing files on heterogeneous master-slave platforms},
    volume = {52},
    number = {2},
    pages = {88-104},
    year = {2006} 
    }
    




14. Abdou Guermouche and Jean-Yves L'Excellent. Constructing Memory-minimizing Schedules for Multifrontal Methods. ACM Transactions on Mathematical Software, 32(1):17-32, 2006.
    

    @Article{ ArticleGuermouche.GL_ATMS06,
    title = {Constructing Memory-minimizing Schedules for Multifrontal Methods},
    author = {Abdou Guermouche and Jean-Yves L'Excellent},
    journal = {{ACM} Transactions on Mathematical Software},
    volume = 32,
    number = 1,
    pages = {17-32},
    year = {2006} 
    }
    




15. Loris Marchal, Yang Yang, Henri Casanova, and Yves Robert. Steady-state scheduling of multiple divisible load applications on wide-area distributed computing platforms. Int. Journal of High Performance Computing Applications, 20(3):365-381, 2006.
    

    @Article{ ArticleMarchal.MYCR_IJHPCA06,
    author = {Loris Marchal and Yang Yang and Henri Casanova and Yves Robert},
    journal = {Int. Journal of High Performance Computing Applications},
    title = {Steady-state scheduling of multiple divisible load applications on wide-area distributed computing platforms},
    volume = {20},
    number = {3},
    pages = {365-381},
    year = {2006} 
    }
    




16. Hélène Renard, Yves Robert, and Frédéric Vivien. Data redistribution algorithms for heterogeneous processor rings. Int. Journal of High Performance Computing Applications, 20(1):31-43, 2006.
    

    @Article{ ArticleRenard.RRV_IJHPCA06,
    author = {H\'el\`ene Renard and Yves Robert and Fr\'ed\'eric Vivien},
    journal = {Int. Journal of High Performance Computing Applications},
    title = {Data redistribution algorithms for heterogeneous processor rings},
    volume = {20},
    number = {1},
    pages = {31-43},
    year = {2006} 
    }
    




17. Bora Uçar, Cevdet Aykanat, Kamer Kaya, and Murat Ikinci. Task assignment in heterogeneous computing systems. Journal of Parallel and Distributed Computing, 66:32--46, 2006.
    

    @Article{ ArticleUcar.UAKI_JPDC06,
    author = {Bora U\c{c}ar and Cevdet Aykanat and Kamer Kaya and Murat Ikinci},
    title = {Task assignment in heterogeneous computing systems},
    journal = {Journal of Parallel and Distributed Computing},
    year = 2006,
    volume = 66,
    pages = {32--46} 
    }
    

1. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. A Preliminary Out-of-core Extension of a Parallel Multifrontal Solver. In EuroPar'06 Parallel Processing, volume 4128 of Lecture Notes in Computer Science, pages 1053--1063, 2006.
   

   @InProceedings{ InProceedingsAgullo.AGL_06*1,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {{A} Preliminary Out-of-core Extension of a Parallel Multifrontal Solver},
   booktitle = {EuroPar'06 Parallel Processing},
   pages = {1053--1063},
   volume = 4128,
   series = {Lecture Notes in Computer Science},
   year = {2006} 
   }
   




2. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. Étude mémoire d'une méthode multifrontale parallèle hors-mémoire. In 17e Rencontres Francophones en Parallélisme (RenPar'17), Perpignan, France, pages 220--227, 2006.
   

   @InProceedings{ InProceedingsAgullo.AGL_06,
   title = {{\'E}tude m\'emoire d'une m\'ethode multifrontale parall\`ele hors-m\'emoire},
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   booktitle = {17e Rencontres Francophones en Parall\'elisme (RenPar'17)},
   address = {Perpignan, France},
   year = {2006},
   pages = {220--227} 
   }
   




3. 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.
   Keywords: DIET, LEGO.
   

   @InProceedings{ InProceedingsAmar.ABBCCCCDDDGL-MS_06,
   address = {Dresden, Germany},
   author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien and Chouhan, Pushpinder Kaur and Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Le Mahec, Ga{\"e}l and Su, Alan},
   booktitle = {CoreGRID Workshop on Grid Middleware (in conjunction with EuroPar2006)},
   editor = {Lehner et al. (Eds.)},
   keywords = {DIET,LEGO},
   month = {August 28-29},
   number = {4375},
   pages = {150-170},
   publisher = {Springer},
   series = {LNCS},
   title = {DIET: New Developments and Recent Results},
   year = {2006} 
   }
   




4. Gabriel Antoniu, Hinde Lilia Bouziane, Landry Breuil, Mathieu Jan, and Christian Pérez. Enabling Transparent Data Sharing in Component Models. In 6th IEEE International Symposium on Cluster Computing and the Grid (CCGRID), Singapore, pages 430-433, May 2006.
   Keywords: Component, Data sharing, Grid computing, JUXMEM, LEGO.
   

   @InProceedings{ InProceedingsAntoniu.ABBJP_06,
   author = {Antoniu, Gabriel and Bouziane, Hinde Lilia and Breuil, Landry and Jan, Mathieu and P{\'e}rez, Christian},
   title = {Enabling Transparent Data Sharing in Component Models},
   year = {2006},
   month = may,
   booktitle = {6th IEEE International Symposium on Cluster Computing and the Grid (CCGRID)},
   pages = {430-433},
   address = {Singapore},
   keywords = {Component, Data sharing, Grid computing, JUXMEM, LEGO} 
   }
   




5. Gabriel Antoniu, Hinde Lilia Bouziane, Mathieu Jan, Christian Pérez, and Thierry Priol. Combining Data Sharing with the Master-Worker Paradigm in the Common Component Architecture. In Proc. Joint Workshop on HPC Grid programming Environments and COmponents and Component and Framework Technology in High-Performance and Scientific Computing (HPC-GECO/CompFrame 2006), Paris, France, pages 10-18, June 2006.
   Note: Held in conjunction with HPDC-15.
   Keywords: Component, Data sharing, JUXMEM, LEGO.
   

   @InProceedings{ InProceedingsAntoniu.ABJPP_06,
   author = {Antoniu, Gabriel and Bouziane, Hinde Lilia and Jan, Mathieu and P{\'e}rez, Christian and Priol, Thierry},
   title = {Combining Data Sharing with the Master-Worker Paradigm in the Common Component Architecture},
   year = {2006},
   month = jun,
   booktitle = {Proc. Joint Workshop on HPC Grid programming Environments and COmponents and Component and Framework Technology in High-Performance and Scientific Computing (HPC-GECO/CompFrame 2006)},
   pages = {10-18},
   address = {Paris, France},
   note = {Held in conjunction with HPDC-15},
   keywords = {Component, Data sharing, JUXMEM, LEGO} 
   }
   




6. Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, and Yves Robert. Centralized versus distributed schedulers for multiple bag-of-task applications. In International Parallel and Distributed Processing Symposium IPDPS'2006, 2006. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BCFLMR_06,
   author = {Olivier Beaumont and Larry Carter and Jeanne Ferrante and Arnaud Legrand and Loris Marchal and Yves Robert},
   booktitle = {International Parallel and Distributed Processing Symposium {IPDPS'2006}},
   publisher = {IEEE Computer Society Press},
   title = {Centralized versus distributed schedulers for multiple bag-of-task applications},
   year = {2006} 
   }
   




7. Olivier Beaumont, Anne-Marie Kermarrec, Loris Marchal, and Étienne Rivière. Voronet, un réseau objet-à-objet sur le modèle petit-monde. In CFSE'5: Conférence Française sur les Systèmes d'Exploitation, 2006.
   

   @InProceedings{ InProceedingsBeaumont.BKMR_06,
   author = {Olivier Beaumont and Anne-Marie Kermarrec and Loris Marchal and \'Etienne Rivi\`ere},
   title = {Voronet, un r\'eseau objet-\`a-objet sur le mod\`ele petit-monde},
   booktitle = {{CFSE'5}: Conf\'erence Fran\c{c}aise sur les Syst\`emes d'Exploitation},
   year = {2006} 
   }
   




8. Olivier Beaumont, Loris Marchal, Veronika Rehn-Sonigo, and Yves Robert. FIFO scheduling of divisible loads with return messages under the one-port model. In HCW'2006, the 15th Heterogeneous Computing Workshop, 2006. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BMRR_06,
   author = {Olivier Beaumont and Loris Marchal and Veronika Rehn-Sonigo and Yves Robert},
   booktitle = {{HCW'2006}, the 15th Heterogeneous Computing Workshop},
   publisher = {IEEE Computer Society Press},
   title = {{FIFO} scheduling of divisible loads with return messages under the one-port model},
   year = {2006} 
   }
   




9. Michele Benzi and Bora Uçar. Product preconditioning for Markov chain problems. In A. N. Langville and W. J. Stewart, editors, Proceedings of the 2006 Markov Anniversary Meeting, Charleston, SC, pages 239--256, 2006. Boson Books, Raleigh, NC.
   Note: Best paper award.
   

   @InProceedings{ InProceedingsBenzi.BU_06,
   author = {Michele Benzi and Bora U\c{c}ar},
   title = {Product preconditioning for {M}arkov chain problems},
   booktitle = {Proceedings of the 2006 Markov Anniversary Meeting},
   pages = {239--256},
   year = 2006,
   editor = {A. N. Langville and W. J. Stewart},
   address = {Charleston, SC},
   publisher = {Boson Books, Raleigh, NC},
   note = {Best paper award} 
   }
   




10. 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.
    Keywords: Monitoring, Visualization, DIET.
    

    @InProceedings{ InProceedingsBolze.BCDHP_06,
    address = {Glasgow, UK.},
    author = {Bolze, Rapha{\"e}l and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Hoesch, Georg and Pontvieux, Cyril},
    booktitle = {Computational Science and Its Applications - ICCSA 2006},
    editor = {M. Gavrilova},
    isbn = {3-540-34079-3},
    keywords = {Monitoring, Visualization, DIET},
    month = {May 8-11},
    pages = {202--213},
    publisher = {Springer},
    series = {LNCS},
    title = {A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform},
    volume = {3984},
    year = {2006} 
    }
    




11. Hinde Lilia Bouziane, Christian Pérez, and Thierry Priol. Modeling and executing Master-Worker applications in component models. In 11th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS), Rhodes Island, Greece, April 2006.
    Keywords: Component, Grid computing, LEGO.
    

    @InProceedings{ InProceedingsBouziane.BPP_06,
    author = {Bouziane, Hinde Lilia and P{\'e}rez, Christian and Priol, Thierry},
    title = {Modeling and executing Master-Worker applications in component models},
    year = {2006},
    month = apr,
    booktitle = {11th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS)},
    address = {Rhodes Island, Greece},
    keywords = {Component, Grid computing, LEGO} 
    }
    




12. 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.
    Keywords: DIET, Scheduling.
    

    @InProceedings{ InProceedingsCaron.CCDS_06,
    address = {Melbourne, Australia},
    author = {Caron, Eddy and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Su, Alan},
    booktitle = {4th International Workshop on Middleware for Grid Computing - MGC 2006},
    editor = {ACM/IFIP/USENIX},
    keywords = {DIET, Scheduling},
    month = nov,
    note = {In conjunction with ACM/IFIP/USENIX 7th International Middleware Conference 2006},
    title = {Plug-in Scheduler Design for a Distributed Grid Environment},
    year = {2006} 
    }
    




13. 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.
    Keywords: Deployment, GoDIET, DIET.
    

    @InProceedings{ InProceedingsCaron.CCD_06,
    address = {Paris, France},
    author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Holly Dail},
    booktitle = {EXPGRID workshop. Experimental Grid Testbeds for the Assessment of Large-Scale Distributed Applications and Tools. In conjunction with HPDC-15.},
    keywords = {Deployment,GoDIET,DIET},
    month = jun,
    pages = {1-8},
    publisher = {IEEE},
    title = {GoDIET: A Deployment Tool for Distributed Middleware on Grid'5000},
    year = {2006} 
    }
    




14. 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.
    Keywords: P2P, Fault Tolerance, TPLD.
    

    @InProceedings{ InProceedingsCaron.CDFPT_06,
    address = {Bangalore. India},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
    booktitle = {{HiPC'2006}. 13th International Conference on High Performance Computing.},
    editor = {Yves Robert and Manish Parashar and Ramamurthy Badrinath and Viktor K. Prasanna},
    keywords = {P2P, Fault Tolerance, TPLD},
    month = {December 18-21},
    pages = {171-182},
    publisher = {Springer-Verlag Berlin Heidelberg},
    series = {LNCS},
    title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
    volume = {4297},
    year = {2006} 
    }
    




15. 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.
    Keywords: TPLD.
    

    @InProceedings{ InProceedingsCaron.CDT_06,
    address = {Cambridge, UK.},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
    booktitle = {The Sixth IEEE International Conference on Peer-to-Peer Computing, P2P2006},
    editor = {A. Montresor and A. Wierzbicki and N. Shahmehri},
    keywords = {TPLD},
    month = sep,
    pages = {106-113},
    publisher = {IEEE},
    title = {A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids},
    year = {2006} 
    }
    




16. 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.
    

    @InProceedings{ InProceedingsCaron.CFPT_06,
    address = {Canet en Roussillon},
    author = {Caron, Eddy and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
    booktitle = {Perpi'2006 - Conf{\'e}rences conjointes RenPar'17 / SympA'2006 / CFSE'5 / JC'2006},
    month = {October 4-6},
    pages = {252-259},
    title = {M{\'e}canisme de r{\'e}parations pour un syst{\`e}me P2P de d{\'e}couverte de services},
    year = {2006} 
    }
    




17. 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.
    Keywords: Deployment, DIET.
    

    @InProceedings{ InProceedingsChouhan.CDCV_06,
    address = {Paris, France},
    author = {Chouhan, Pushpinder Kaur and Dail, Holly and Caron, Eddy and Vivien, Fr{\'e}d{\'e}ric},
    booktitle = {HPDC-15. 15th IEEE International Symposium on High Performance Distributed Computing},
    keywords = {Deployment, DIET},
    month = jun,
    pages = {339-340 (Poster)},
    publisher = {IEEE},
    title = {How should you structure your hierarchical scheduler?},
    year = {2006} 
    }
    




18. Sylvain Dahan, Jean-Marc Nicod, and Laurent Philippe. Utilisation du Distributed Spanning Tree en tant qu'Overlay. In O. Beaumont and V. Boudet, editors, RenPar'17, Perpignan, France, pages 60--67, October 2006. Université de Perpignan.
    

    @InProceedings{ InProceedingsDahan.DNP_06,
    author = {Dahan, Sylvain and Nicod, Jean-Marc and Philippe, Laurent},
    title = {{Utilisation du Distributed Spanning Tree en tant qu'Overlay}},
    booktitle = {RenPar'17},
    pages = {60--67},
    year = 2006,
    editor = {O. Beaumont and V. Boudet},
    address = {Perpignan, France},
    month = oct,
    organization = {Universit\'e de Perpignan} 
    }
    




19. Bruno Del-Fabbro, David Laiymani, Jean-Marc Nicod, and Laurent Philippe. Design and experimentations of an efficient data management service for NES architectures. In J.M. Pierson, editor, 2nd VLDB Workshop on Data Management in Grids (VLDB DMG 06), Seoul, Korea, pages 62-75, September 2006.
    Keywords: DIET.
    

    @InProceedings{ InProceedingsDel-Fabbro.DLNP_06,
    author = {Del-Fabbro, Bruno and Laiymani, David and Nicod, Jean-Marc and Philippe, Laurent},
    title = {{Design and experimentations of an efficient data management service for NES architectures}},
    booktitle = {2nd VLDB Workshop on Data Management in Grids (VLDB DMG 06)},
    pages = {62-75},
    year = 2006,
    editor = {J.M. Pierson},
    address = {Seoul, Korea},
    month = sep,
    keywords = {DIET} 
    }
    




20. Jean-Sébastien Gay and Yves Caniou. Simbatch : une API pour la simulation et la prédiction de performances de systèmes batch. In 17e Rencontres Francophones du Parallélisme, des Architectures et des Systèmes, Perpignan, pages 180--187, October 2006.
    Keywords: DIET, LEGO.

    Abstract:

    Les \'etudes d'algorithmes d'ordonnancement de t\^aches parall\`eles dans le contexte des grilles de calcul ignorent souvent les syst\`emes de r\'eservation locaux qui g\`erent les ressources parall\`eles, ou supposent qu'ils instancient {\it First Come First Served}. Nous d\'ecrivons donc dans cet article une API int\'egr\'ee au simulateur de grille Simgrid. Elle offre les structures et fonctionnalit\'es pour simuler de fa\c{c}on tr\`es r\'ealiste les grappes de PCs et les syst\`emes de r\'eservation batch pour les g\'erer. Les exp\'eriences montrent des erreurs de simulation inf\'erieures \`a 1\ 0x9a3a5c0ar rapport aux r\'esultats {\it r\'eels} obtenus avec le syst\`eme de r\'eservation OAR.

    
    

    @InProceedings{ InProceedingsGay.GC_06,
    author = {Jean-S{\'e}bastien Gay and Yves Caniou},
    title = {Simbatch : une {API} pour la simulation et la pr{\'e}diction de performances de syst{\`e}mes batch},
    booktitle = {17e Rencontres Francophones du Parall\'elisme, des Architectures et des Syst\`emes},
    pages = {180--187},
    year = {2006},
    address = {Perpignan},
    month = oct,
    abstract = {Les \'etudes d'algorithmes d'ordonnancement de t\^aches parall\`eles dans le contexte des grilles de calcul ignorent souvent les syst\`emes de r\'eservation locaux qui g\`erent les ressources parall\`eles, ou supposent qu'ils instancient {\it First Come First Served}. Nous d\'ecrivons donc dans cet article une API int\'egr\'ee au simulateur de grille Simgrid. Elle offre les structures et fonctionnalit\'es pour simuler de fa\c{c}on tr\`es r\'ealiste les grappes de PCs et les syst\`emes de r\'eservation batch pour les g\'erer. Les exp\'eriences montrent des erreurs de simulation inf\'erieures \`a 1\ 0x9a3a5c0ar rapport aux r\'esultats {\it r\'eels} obtenus avec le syst\`eme de r\'eservation OAR.},
    keywords = {DIET, LEGO} 
    }
    




21. Arnaud Legrand, Alan Su, and Frédéric Vivien. Minimizing the stretch when scheduling flows of biological requests. In SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, Cambridge, Massachusetts, USA, pages 103--112, 2006. ACM Press.
    

    @InProceedings{ InProceedingsLegrand.LSV_06,
    author = {Arnaud Legrand and Alan Su and Fr\'ed\'eric Vivien},
    title = {Minimizing the stretch when scheduling flows of biological requests},
    booktitle = {SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures},
    year = {2006},
    isbn = {1-59593-452-9},
    pages = {103--112},
    address = {Cambridge, Massachusetts, USA},
    publisher = {ACM Press} 
    }
    




22. Loris Marchal, Pascale Primet, Yves Robert, and Jingdi Zeng. Optimal bandwidth sharing in grid environment. In HPDC'2006, the 15th International Symposium on High Performance Distributed Computing, 2006. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsMarchal.MPRZ_06,
    author = {Loris Marchal and Pascale Primet and Yves Robert and Jingdi Zeng},
    booktitle = {{HPDC'2006}, the 15th International Symposium on High Performance Distributed Computing},
    publisher = {IEEE Computer Society Press},
    title = {Optimal bandwidth sharing in grid environment},
    year = {2006} 
    }
    




23. Nicolas Marilleau, Chistophe Lang, Pascal Chatonnay, and Laurent Philippe. An Agent-Based Framework for Urban Mobility Simulation. In Procs of the 14th IEEE Euromicro Conference on Parallel, Distributed and Network based Processing (PDP 2006), Montbéliard, France, pages 355--361, February 2006.
    

    @InProceedings{ InProceedingsMarilleau.MLCP_06,
    author = {Marilleau, Nicolas and Lang, Chistophe and Chatonnay, Pascal and Philippe, Laurent},
    title = {An Agent-Based Framework for Urban Mobility Simulation},
    booktitle = {Procs of the 14th IEEE Euromicro Conference on Parallel, Distributed and Network based Processing (PDP~2006)},
    pages = {355--361},
    address = {Montb\'eliard, France},
    month = feb,
    year = 2006 
    }
    




24. Stéphane Operto, Jean Virieux, Patrick Amestoy, Luc Giraud, and Jean-Yves L'Excellent. 3D frequency-domain finite-difference modeling of accoustic wave propagation using a masively parallel direct solver: a feasable study. In The Society of Exploration Geophysicists (SEG 2006), New Orleans (USA), 01/10/06-06/10/06, pages 2265--2269, 2006.
    

    @InProceedings{ InProceedingsOperto.OVAGL_06,
    author = {Operto, St\'ephane and Virieux, Jean and Amestoy, Patrick and Giraud, Luc and L'Excellent, Jean-Yves},
    title = "{{3D} frequency-domain finite-difference modeling of accoustic wave propagation using a masively parallel direct solver: a feasable study}",
    booktitle = "{The Society of Exploration Geophysicists (SEG 2006), New Orleans (USA), 01/10/06-06/10/06}",
    pages = "2265--2269",
    year = {2006} 
    }
    




25. Laurent Philippe, Sylvain Dahan, Ismael Djama, Sylvie Damy, and Bénédicte Herrmann. Evaluation of a large scale lookup algorithm for ASP based grids. In Procs of the 5th Int. Symposium on Parallel and Distributed Computing, Timisoara, Romania, pages 220--229, July 2006. IEEE computer society.
    Keywords: DIET.
    

    @InProceedings{ InProceedingsPhilippe.PDDDH_06,
    author = {Philippe, Laurent and Dahan, Sylvain and Djama, Ismael and Damy, Sylvie and Herrmann, B\'en\'edicte},
    title = {Evaluation of a large scale lookup algorithm for {ASP} based grids},
    booktitle = {Procs of the 5th Int. Symposium on Parallel and Distributed Computing},
    pages = {220--229},
    address = {Timisoara, Romania},
    publisher = {IEEE computer society},
    month = jul,
    year = 2006,
    keywords = {DIET} 
    }
    




26. Jean-François Pineau, Yves Robert, and Frédéric Vivien. Off-line and on-line scheduling on heterogeneous master-slave platforms. In PDP'2006, 14th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2006. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsPineau.PRV_06,
    author = {Jean-Fran\c{c}ois Pineau and Yves Robert and Fr\'ed\'eric Vivien},
    booktitle = {{PDP'2006}, 14th Euromicro Workshop on Parallel, Distributed and Network-based Processing},
    publisher = {IEEE Computer Society Press},
    title = {Off-line and on-line scheduling on heterogeneous master-slave platforms},
    year = {2006} 
    }
    




27. Jean-François Pineau, Yves Robert, and Frédéric Vivien. The impact of heterogeneity on master-slave on-line scheduling. In HCW'2006, the 15th Heterogeneous Computing Workshop, 2006. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsPineau.PRV_06*1,
    author = {Jean-Fran\c{c}ois Pineau and Yves Robert and Fr\'ed\'eric Vivien},
    booktitle = {{HCW'2006}, the 15th Heterogeneous Computing Workshop},
    publisher = {IEEE Computer Society Press},
    title = {The impact of heterogeneity on master-slave on-line scheduling},
    year = {2006} 
    }
    




28. Cédric Tedeschi. Découverte de services pour les grilles de calcul dynamiques large échelle. In Perpi'2006 - Conférences conjointes RenPar'17 / SympA'2006 / CFSE'5 / JC'2006, Canet en Roussillon, France, pages 52-59, October 4-6 2006.
    

    @InProceedings{ InProceedingsTedeschi.T_06,
    address = {Canet en Roussillon, France},
    author = {Tedeschi, C{\'e}dric},
    booktitle = {Perpi'2006 - Conf{\'e}rences conjointes RenPar'17 / SympA'2006 / CFSE'5 / JC'2006},
    month = {October 4-6},
    pages = {52-59},
    title = {D{\'e}couverte de services pour les grilles de calcul dynamiques large {\'e}chelle},
    year = {2006} 
    }
    

1. 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.
   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.

   
   

   @TechReport{ TechReportRR-INRIA-6027,
   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.},
   author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien and Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Chouhan, Pushpinder Kaur and Le Mahec, Ga{\"e}l and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Su, Alan},
   institution = {INRIA},
   keywords = {Grid Computing, Network Enabled Servers, Client-servers computing, DIET},
   month = nov,
   note = {Also available as LIP Research Report 2006-31},
   number = {6027},
   pages = {24 p.},
   title = {DIET: New Developments and Recent Results},
   type = {Research Report},
   url = {https://hal.inria.fr/inria-00115569},
   year = {2006} 
   }
   




2. 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.
   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.

   
   

   @TechReport{ TechReportRR-Laboratoire-RR2006-31,
   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.},
   author = {Amar, Abelkader and Bolze, Rapha{\"e}l and Bouteiller, Aur{\'e}lien and Chis, Andr{\'e}ea and Caniou, Yves and Caron, Eddy and Chouhan, Pushpinder Kaur and Le Mahec, Ga{\"e}l and Dail, Holly and Depardon, Benjamin and Desprez, Fr{\'e}d{\'e}ric and Gay, Jean-S{\'e}bastien and Su, Alan},
   institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
   keywords = {Grid Computing, Network Enabled Servers, Client-servers computing, DIET},
   month = oct,
   note = {Also available as INRIA Research Report 6027},
   number = {RR2006-31},
   title = {DIET: New Developments and Recent Results},
   url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-31.pdf},
   year = 2006 
   }
   




3. 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.
   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.

   
   

   @TechReport{ TechReportRR-INRIA-RR-6009,
   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. },
   author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Jan, Mathieu},
   institution = {INRIA},
   keywords = {GridRPC, Data Sharing, Persistency, JUXMEM, DIET},
   month = nov,
   note = {Also available as IRISA Research Report PI1823},
   number = {RR-6009},
   title = {Towards a Transparent Data Access Model for the {GridRPC} Paradigm},
   url = {https://hal.inria.fr/inria-00110902},
   year = 2006 
   }
   




4. 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.
   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.

   
   

   @TechReport{ TechReportRR-IRISA-PI1823,
   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. },
   author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Jan, Mathieu},
   institution = {IRISA},
   keywords = {GridRPC, Data Sharing, Persistency, JUXMEM, DIET},
   month = nov,
   note = {Also available as INRIA Research Report 6009},
   number = {PI1823},
   title = {Towards a Transparent Data Access Model for the {GridRPC} Paradigm},
   url = {http://www.irisa.fr/centredoc/publis/PI/2006/irisapublication.2006-11-02.8327047788},
   year = 2006 
   }
   




5. 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.
   

   @TechReport{ TechReportRR-Institut-RR-5815,
   author = {Ballier, Alexis and Caron, Eddy and Epema, Dick and Mohamed, Hashim},
   institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
   month = jan,
   note = {Also available as LIP Research Report 2006-01 and CoreGRID Technical Report TR-0061},
   number = {RR-5815},
   title = {Simulating Grid Schedulers with Deadlines and Co-Allocation},
   url = {http://www.inria.fr/rrrt/rr-5815.html},
   year = 2006 
   }
   




6. 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.

   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.

   
   

   @TechReport{ TechReportRR-CoreGRID-TR-0061,
   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. },
   author = {Ballier, Alexis and Caron, Eddy and Epema, Dick and Mohamed, Hashim},
   institution = {CoreGRID},
   month = oct,
   note = {Also available as LIP Research Report 2006-01 and INRIA Research Report RR-5815},
   number = {TR-0061},
   pdf = {http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0061.pdf},
   title = {Simulating Grid Schedulers with Deadlines and Co-Allocation},
   year = 2006 
   }
   




7. 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.
   

   @TechReport{ TechReportRR-Laboratoire-2006-01,
   author = {Ballier, Alexis and Caron, Eddy and Epema, Dick and Mohamed, Hashim},
   institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
   month = jan,
   note = {Also available as INRIA Research Report RR-5815 and CoreGRID Technical Report TR-0061},
   number = {2006-01},
   pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-01.pdf},
   title = {Simulating Grid Schedulers with Deadlines and Co-Allocation},
   year = {2006} 
   }
   




8. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Impact of QoS on Replica Placement in Tree Networks. Research Report 6065, INRIA, December 2006.
   Note: Also available as LIP research report 2006-48.
   

   @TechReport{ TechReportRR-INRIA-6065,
   author = {Benoit, Anne and Rehn-Sonigo, Veronika and Robert, Yves},
   title = {Impact of QoS on Replica Placement in Tree Networks},
   year = {2006},
   month = dec,
   institution = {INRIA},
   number = {6065},
   type = {Research Report},
   url = {https://hal.inria.fr/inria-00120456},
   note = {Also available as LIP research report 2006-48.} 
   }
   




9. 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.
   Keywords: Monitoring, Visualization, DIET.
   

   @TechReport{ TechReportRR-Institut-RR-5879,
   author = {Bolze, Rapha{\"e}l and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Hoesch, Georg and Pontvieux, Cyril},
   institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
   keywords = {Monitoring, Visualization, DIET},
   month = apr,
   note = {Also available as LIP Research Report 2006-14},
   number = {RR-5879},
   pdf = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5879.pdf},
   postscript = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5879.ps.gz},
   title = {A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform},
   year = 2006 
   }
   




10. 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.
    Keywords: Monitoring, Visualization, DIET.
    

    @TechReport{ TechReportRR-Laboratoire-RR-2006-14,
    author = {Bolze, Rapha{\"e}l and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Hoesch, Georg and Pontvieux, Cyril},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Monitoring, Visualization, DIET},
    month = apr,
    note = {Also available as INRIA Research Report 5879},
    number = {RR-2006-14},
    pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-14.pdf},
    title = {A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform},
    year = 2006 
    }
    




11. 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.
    Keywords: Grid Computing, Scheduling, Performance Prediction, DIET.

    Abstract:

    This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC 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.

    
    

    @TechReport{ TechReportRR-INRIA-RR-6030,
    abstract = {This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC 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.},
    author = {Caron, Eddy and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Su, Alan},
    institution = {INRIA},
    keywords = {Grid Computing, Scheduling, Performance Prediction, DIET},
    month = nov,
    note = {Also available as LIP Research Report 2006-41},
    number = {RR-6030},
    title = {Plug-in Scheduler Design for a Distributed Grid Environment.},
    url = {https://hal.inria.fr/inria-00115949},
    year = 2006 
    }
    




12. 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.
    Keywords: Grid Computing, Scheduling, Performance Prediction, DIET.

    Abstract:

    This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC 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.

    
    

    @TechReport{ TechReportRR-Laboratoire-RR2006-41,
    abstract = {This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC 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.},
    author = {Caron, Eddy and Chis, Andr{\'e}ea and Desprez, Fr{\'e}d{\'e}ric and Su, Alan},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Grid Computing, Scheduling, Performance Prediction, DIET},
    month = nov,
    note = {Also available as INRIA Research Report 6030},
    number = {RR2006-41},
    pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-41.pdf},
    title = {Plug-in Scheduler Design for a Distributed Grid Environment.},
    year = 2006 
    }
    




13. 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.
    Keywords: Deployment, ASP, Grid computing, DIET.
    

    @TechReport{ TechReportRR-Laboratoire-RR-5886,
    author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Dail, Holly},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Deployment, ASP, Grid computing,DIET},
    month = apr,
    note = {Also available as INRIA Research Report 5886},
    number = {RR-5886},
    title = {GoDIET: A Deployment Tool for Distributed Middleware on Grid 5000},
    url = {http://www.inria.fr/rrrt/rr-5886.html},
    year = 2006 
    }
    




14. 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.
    Keywords: Deployment, ASP, Grid computing, DIET.
    

    @TechReport{ TechReportRR-Institut-RR-5886,
    author = {Caron, Eddy and Chouhan, Pushpinder Kaur and Dail, Holly},
    institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
    keywords = {Deployment, ASP, Grid computing,DIET},
    month = apr,
    note = {Also available as LIP Research Report 2006-17},
    number = {RR-5886},
    title = {GoDIET: A Deployment Tool for Distributed Middleware on Grid 5000},
    url = {http://www.inria.fr/rrrt/rr-5886.html},
    year = 2006 
    }
    




15. 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.
    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.

    
    

    @TechReport{ TechReportRR-Institut-RR6029,
    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.},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
    institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
    keywords = {Fault tolerance, peer-to-peer, prefix trees},
    month = oct,
    note = {Also available as LIP Research Report 2001-34},
    number = {RR6029},
    title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
    url = {https://hal.inria.fr/inria-00115997},
    year = 2006 
    }
    




16. 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.
    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.

    
    

    @TechReport{ TechReportRR-Laboratoire-RR2006-34,
    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.},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Fourdrignier, Charles and Petit, Franck and Tedeschi, C{\'e}dric},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Fault tolerance, peer-to-peer, prefix trees},
    month = oct,
    note = {Also available as INRIA Research Report 6029},
    number = {RR2006-34},
    pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-34.pdf},
    title = {A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems},
    year = 2006 
    }
    




17. 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.
    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.

    
    

    @TechReport{ TechReportRR-Institut-RR-6028,
    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. },
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
    institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
    keywords = {Service discovery, Computational grids, Peer-to-peer, Prefix trees},
    month = oct,
    note = {Also available as LIP Research Report 2001-33},
    number = {RR-6028},
    title = {A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids},
    url = {https://hal.inria.fr/inria-00116111},
    year = 2006 
    }
    




18. 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: 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.

    
    

    @TechReport{ TechReportRR-Laboratoire-RR2006-33,
    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. },
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Service discovery, Computational grids, Peer-to-peer, Prefix trees},
    month = oct,
    note = {Also available as INRIA Research Report 6028},
    number = {RR2006-33},
    pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-33.pdf},
    title = {A Dynamic Prefix Tree for the Service Discovery Within Large Scale Grids},
    year = 2006 
    }
    




19. Jack Dongarra, Jean-François Pineau, Yves Robert, Zhiao Shi, and Frédéric Vivien. Revisiting Matrix Product on Master-Worker Platforms. Research report RR-6053, INRIA, 2006.
    Note: Rlhttp://hal.inria.fr/inria-00117050. Also available as LIP research report RR2006-39.
    

    @TechReport{ TechReportRR-INRIA-RR-6053,
    author = {Jack Dongarra and Jean-Fran\c{c}ois Pineau and Yves Robert and Zhiao Shi and Fr\'ed\'eric Vivien},
    title = {Revisiting Matrix Product on Master-Worker Platforms},
    institution = {INRIA},
    year = 2006,
    type = {Research report},
    number = {RR-6053},
    note = {\url{http://hal.inria.fr/inria-00117050}. Also available as LIP research report RR2006-39.} 
    }
    




20. Aurélia Fèvre, Jean-Yves L'Excellent, and Stéphane Pralet. Scilab and MATLAB Interfaces to MUMPS. Technical report RR2006-06, LIP, 2006.
    Note: Also appeared as ENSEEIHT-IRIT report TR/TLSE/06/01 and INRIA report RR-5816.
    

    @TechReport{ TechReportRR-LIP-RR2006-06,
    author = {Aur\'elia F\`evre and Jean-Yves L'Excellent and St\'ephane Pralet},
    title = {{S}cilab and {MATLAB} Interfaces to {MUMPS}},
    year = 2006,
    number = {RR2006-06},
    institution = {LIP},
    note = {Also appeared as ENSEEIHT-IRIT report TR/TLSE/06/01 and INRIA report RR-5816} 
    }
    




21. Aurélia Fèvre, Jean-Yves L'Excellent, and Stéphane Pralet. Scilab and MATLAB Interfaces to MUMPS. Technical report RR-5816, INRIA, January 2006.
    Note: Also appeared as ENSEEIHT-IRIT report TR/TLSE/06/01 and LIP report RR2006-06.
    

    @TechReport{ TechReportRR-INRIA-RR-5816,
    author = {Aur\'elia F\`evre and Jean-Yves L'Excellent and St\'ephane Pralet},
    title = {{S}cilab and {MATLAB} Interfaces to {MUMPS}},
    year = 2006,
    month = jan,
    number = {RR-5816},
    institution = {INRIA},
    note = {Also appeared as ENSEEIHT-IRIT report TR/TLSE/06/01 and LIP report RR2006-06} 
    }
    




22. Matthieu Gallet, Yves Robert, and Frédéric Vivien. Scheduling communication requests traversing a switch: complexity and algorithms.. Research report RR2006-25, LIP, ENS Lyon, 2006.
    Note: Also available as LIP research report.
    

    @TechReport{ TechReportRR-LIP-RR2006-25,
    author = {Matthieu Gallet and Yves Robert and Fr\'ed\'eric Vivien},
    title = {Scheduling communication requests traversing a switch: complexity and algorithms.},
    institution = {LIP, ENS Lyon},
    year = 2006,
    type = {Research report},
    number = {RR2006-25},
    note = {Also available as LIP research report } 
    }
    




23. Jean-Sébastien Gay and Yves Caniou. Simbatch: an API for simulating and predicting the performance of parallel resources and batch systems. Research Report 6040, INRIA, November 2006.
    Note: Also appeared as LIP research report RR2006-32.
    Keywords: DIET, LEGO.
    

    @TechReport{ TechReportRR-INRIA-6040,
    author = {Gay, Jean-S{\'e}bastien and Caniou, Yves},
    title = {Simbatch: an {API} for simulating and predicting the performance of parallel resources and batch systems},
    year = {2006},
    month = nov,
    institution = {INRIA},
    number = {6040},
    type = {Research Report},
    pages = {15 p.},
    note = {Also appeared as LIP research report RR2006-32},
    url = {https://hal.inria.fr/inria-00115880},
    keywords = {DIET, LEGO} 
    }
    




24. Jean-Sébastien Gay and Yves Caniou. Simbatch: an API for simulating and predicting the performance of parallel resources and batch systems. Technical report RR2006-32, LIP, October 2006.
    Note: Also available as INRIA Research Report 6040.

    Abstract:

    The study of scheduling algorithms for parallel tasks in a grid computing context either neglects local reservation systems which manage parallel resources, either suppose that they use a \textit{First Come First Served} strategy, or the experimental model does not handle parallel tasks. In this report, we describe an API built in the grid simulation tool Simgrid. It offers core functionalities to simulate in a realistic way parallel resources and batch reservation systems. Simbatch simulation experiments show an error rate inferior to 1\Àompared to \textit{real life} experiments conducted with the OAR batch manager.

    
    

    @TechReport{ TechReportRR-LIP-RR2006-32,
    author = {Jean-S\'ebastien Gay and Yves Caniou},
    title = {Simbatch: an {API} for simulating and predicting the performance of parallel resources and batch systems},
    institution = {LIP},
    year = {2006},
    number = {RR2006-32},
    note = {Also available as INRIA Research Report 6040},
    month = oct,
    abstract = {The study of scheduling algorithms for parallel tasks in a grid computing context either neglects local reservation systems which manage parallel resources, either suppose that they use a \textit{First Come First Served} strategy, or the experimental model does not handle parallel tasks. In this report, we describe an API built in the grid simulation tool Simgrid. It offers core functionalities to simulate in a realistic way parallel resources and batch reservation systems. Simbatch simulation experiments show an error rate inferior to 1\Àompared to \textit{real life} experiments conducted with the OAR batch manager.} 
    }
    




25. Arnaud Legrand, Alan Su, and Frédéric Vivien. Minimizing the stretch when scheduling flows of divisible requests. Research report RR-6002, INRIA, 2006.
    Note: Rlhttp://hal.inria.fr/inria-00108524. Also available as LIP research report RR2006-19.
    

    @TechReport{ Tec-Legrand.LSV_06,
    author = {Arnaud Legrand and Alan Su and Fr\'ed\'eric Vivien},
    title = {Minimizing the stretch when scheduling flows of divisible requests},
    institution = {INRIA},
    year = 2006,
    type = {Research report RR-6002},
    note = {\url{http://hal.inria.fr/inria-00108524}. Also available as LIP research report RR2006-19.} 
    }
    




26. Loris Marchal, Veronika Rehn-Sonigo, Yves Robert, and Frédéric Vivien. Scheduling and data redistribution strategies on star platforms. Research report RR-6005, INRIA, 2006.
    Note: Rlhttp://hal.inria.fr/inria-00108518. Also available as LIP research report RR2006-23.
    

    @TechReport{ TechReportRR-INRIA-RR-6005,
    author = {Loris Marchal and Veronika Rehn-Sonigo and Yves Robert and Fr\'ed\'eric Vivien},
    title = {Scheduling and data redistribution strategies on star platforms},
    institution = {INRIA},
    year = 2006,
    type = {Research report},
    number = {RR-6005},
    note = {\url{http://hal.inria.fr/inria-00108518}. Also available as LIP research report RR2006-23.} 
    }
    




27. Yves Robert, Anne Benoit, and Veronika Rehn-Sonigo. Strategies for Replica Placement in Tree Networks. Research Report 6024, INRIA, November 2006.
    Note: Also available as LIP research report 2006-30.
    

    @TechReport{ TechReportRR-INRIA-6024,
    author = {Robert, Yves and Benoit, Anne and Rehn-Sonigo, Veronika},
    title = {Strategies for Replica Placement in Tree Networks},
    year = {2006},
    month = nov,
    institution = {INRIA},
    number = {6024},
    type = {Research Report},
    pages = {39 p.},
    url = {https://hal.inria.fr/inria-00111963},
    note = {Also available as LIP research report 2006-30.} 
    }
    




28. Cédric Tedeschi. Découverte de services pour les grilles de calcul dynamiques large échelle. Technical report RR2006-44, Laboratoire de l'Informatique du Parallélisme (LIP), November 2006.
    Note: Also available as INRIA Research Report xxxx.
    Keywords: Découverte de services, grilles de calcul, pair-à-pair, arbres de prefixes.

    Abstract:

    Dans les grilles des serveurs offrent des services aux clients afin de r\'ealiser des calculs. Avant de pouvoir les utiliser, les clients doivent \^etre \`a m\^eme de les retrouver. Bien que les diff\'erentes solutions propos\'ees depuis l'\'emergence des grilles soient efficaces sur des plates-formes relativement statiques et de petite \'echelle, elles ne sont plus en ad\'equation avec la nature dynamique et \`a large \'echelle des grilles futures. Pour de tels environnements de nouveaux outils doivent \^etre propos\'es, notamment des m\'ecanismes pour la d\'ecouverte de services, qui devront \^etre \emphflexibles et passer \`a l'\'echelle dans des environnements dynamiques. Nous \'etudions dans ce papier la d\'ecouverte de services pour des grilles de calcul pair-\`a-pair. Nous proposons une nouvelle architecture bas\'ee sur un arbre de plus long pr\'efixes.

    
    

    @TechReport{ TechReportRR-Laboratoire-RR2006-44,
    abstract = {Dans les grilles des serveurs offrent des services aux clients afin de r\'ealiser des calculs. Avant de pouvoir les utiliser, les clients doivent \^etre \`a m\^eme de les retrouver. Bien que les diff\'erentes solutions propos\'ees depuis l'\'emergence des grilles soient efficaces sur des plates-formes relativement statiques et de petite \'echelle, elles ne sont plus en ad\'equation avec la nature dynamique et \`a large \'echelle des grilles futures. Pour de tels environnements de nouveaux outils doivent \^etre propos\'es, notamment des m\'ecanismes pour la d\'ecouverte de services, qui devront \^etre \emphflexibles et passer \`a l'\'echelle dans des environnements dynamiques. Nous \'etudions dans ce papier la d\'ecouverte de services pour des grilles de calcul pair-\`a-pair. Nous proposons une nouvelle architecture bas\'ee sur un arbre de plus long pr\'efixes.},
    author = {Tedeschi, C{\'e}dric},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {D\'ecouverte de services, grilles de calcul, pair-\`a-pair, arbres de prefixes},
    month = nov,
    note = {Also available as INRIA Research Report xxxx},
    number = {RR2006-44},
    title = {D\'ecouverte de services pour les grilles de calcul dynamiques large \'echelle},
    url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2006/RR2006-44.pdf},
    year = 2006 
    }
    

1. Jo Ebergen, Ivan Sutherland, and Bernard Tourancheau. Arbiters with Preferential Enables for Asynchronous Circuits. US Patent 7064583, 2006.
   

   @Misc{ Mis-Ebergen.EST_06,
   author = {Ebergen, Jo and Sutherland, Ivan and Tourancheau, Bernard},
   howpublished = {US Patent 7064583},
   institution = {SUN Microsystems},
   number = {7064583},
   title = {Arbiters with Preferential Enables for Asynchronous Circuits},
   year = {2006} 
   }
   




2. Francois Vigouroux, Bernard Tourancheau, and Cedric Koch-Hofer. Network chip design for grid communication. US Patent Application 0224796, 2006.
   

   @Misc{ Mis-Vigouroux.VTK_06,
   author = {Vigouroux, Francois and Tourancheau, Bernard and Koch-Hofer, Cedric},
   howpublished = {US Patent Application 0224796},
   institution = {SUN Microsystems},
   number = {0224796},
   title = {Network chip design for grid communication},
   year = {2006} 
   }
   




3. Francois Vigouroux, Bernard Tourancheau, and Cedric Koch-Hofer. Optimal communication path routing in a system employing interconnected integrated circuit technology. US Patent Application 0018261, 2006.
   

   @Misc{ Mis-Vigouroux.VTK_06*1,
   author = {Vigouroux, Francois and Tourancheau, Bernard and Koch-Hofer, Cedric},
   howpublished = {US Patent Application 0018261},
   institution = {SUN Microsystems},
   number = {0018261},
   title = {Optimal communication path routing in a system employing interconnected integrated circuit technology},
   year = {2006} 
   }
   

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.

This document was translated from BibT_EX by bibtex2html