1. Jack Dongarra and Bernard Tourancheau, editors. Clusters and Computational Grids for Scientific Computing, March 2007. Parallel Processing Letters 17(1).
   

   @Proceedings{ ProceedingsDongarra.DT_07,
   publisher = {Parallel Processing Letters 17(1)},
   editor = {Dongarra, Jack and Tourancheau, Bernard},
   month = mar,
   badpublisher = {World Scientific Publishing},
   title = {Clusters and Computational Grids for Scientific Computing},
   year = 2007 
   }
   

1. Michel Cosnard and Yves Robert. Algorithmique parallèle. In Encyclopédie de l'Informatique et des Systèmes d'Information, pages 955-965. Vuibert, 2007.
   

   @InCollection{ InCollectionCosnard.CR_07,
   author = {Michel Cosnard and Yves Robert},
   booktitle = {Encyclop\'edie de l'Informatique et des Syst\`emes d'Information},
   publisher = {Vuibert},
   title = {Algorithmique parall\`ele},
   pages = {955-965},
   year = 2007 
   }
   




2. 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. Cluster Computing, 10(3):265 -- 276, 2007.
   Keywords: Component, Data sharing, Master-worker, Grid computing, LEGO.
   

   @Article{ ArticleAntoniu.ABJPP_CC07,
   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 = {2007},
   journal = {Cluster Computing},
   volume = {10},
   number = {3},
   pages = {265 -- 276 },
   publisher = {Kluwer Academic Publishers Hingham, MA, USA},
   keywords = {Component, Data sharing, Master-worker, Grid computing, LEGO} 
   }
   




3. Michele Benzi and Bora Uçar. Block triangular preconditioners for M-matrices and Markov chains. Electronic Transactions on Numerical Analysis, 26:209--227, 2007.
   

   @Article{ ArticleBenzi.BU_ETNA07,
   author = {Michele Benzi and Bora U\c{c}ar},
   journal = {Electronic Transactions on Numerical Analysis},
   pages = {209--227},
   title = {Block triangular preconditioners for {M}-matrices and {M}arkov chains},
   volume = {26},
   year = 2007 
   }
   




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

   
   

   @Article{ ArticleCaron.CDT_JGC07,
   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.},
   author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
   editor = {Springer Netherlands},
   journal = {Journal of Grid Computing},
   keywords = {DLPT, LEGO, P2P},
   month = sep,
   number = {3},
   pages = {337-360},
   title = {Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery},
   url = {http://www.springerlink.com/content/946324035g533050/fulltext.pdf},
   volume = {5},
   year = {2007} 
   }
   




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

   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.

   
   

   @Article{ ArticleCaron.CGT_FGCS07,
   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. },
   author = {Caron, Eddy and Garonne, Vincent and Tsaregorodtsev, Andre{\"\i}},
   journal = {Future Generation Computer Systems},
   month = {November},
   note = {ISSN:0167-739X},
   number = {Issue 8},
   pages = {968-976},
   title = {Definition, modelling and simulation of a grid computing scheduling system for high throughput computing},
   volume = {23},
   year = {2007} 
   }
   




6. Bruno Del-Fabbro, David Laiymani, Jean-Marc Nicod, and Laurent Philippe. DTM: a service for managing data persistency and data replication in network-enabled server environments. Concurrency and Computation: Practice and Experience, 19(16):2125-2140, November 2007.
   Keywords: DIET.
   

   @Article{ ArticleDel-Fabbro.DLNP_CCPE07,
   author = {Del-Fabbro, Bruno and Laiymani, David and Nicod, Jean-Marc and Philippe, Laurent},
   title = {DTM: a service for managing data persistency and data replication in network-enabled server environments},
   journal = {Concurrency and Computation: Practice and Experience},
   pages = {2125-2140},
   year = 2007,
   month = nov,
   publisher = {John Wiley \& Sons, Ltd. Chichester, UK},
   volume = 19,
   number = 16,
   keywords = {DIET} 
   }
   




7. Kamer Kaya, Bora Uçar, and Cevdet Aykanat. Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. Journal of Parallel and Distributed Computing, 67:271--285, 2007.
   

   @Article{ ArticleKaya.KUA_JPDC07,
   author = {Kamer Kaya and Bora U\c{c}ar and Cevdet Aykanat},
   title = {Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories},
   journal = {Journal of Parallel and Distributed Computing},
   year = 2007,
   volume = 67,
   pages = {271--285} 
   }
   




8. Loris Marchal, Veronika Rehn-Sonigo, Yves Robert, and Frédéric Vivien. Scheduling algorithms for data redistribution and load-balancing on master-slave platforms. Parallel Processing Letters, 17(1):61-77, 2007.
   

   @Article{ ArticleMarchal.MRRV_PPL07,
   author = {Loris Marchal and Veronika Rehn-Sonigo and Yves Robert and Fr\'ed\'eric Vivien},
   journal = {Parallel Processing Letters},
   title = {Scheduling algorithms for data redistribution and load-balancing on master-slave platforms},
   volume = {17},
   number = {1},
   pages = {61-77},
   year = {2007} 
   }
   




9. Stéphane Operto, Jean Virieux, Patrick Amestoy, Jean-Yves L'Excellent, Luc Giraud, and Hafedh Ben Hadj Ali. 3D finite-difference frequency-domain modeling of visco-acoustic wave propagation using a massively parallel direct solver: A feasibility study. Geophysics, 72(5):SM195-SM211, 2007.
   Keywords: acoustic wave propagation, finite difference methods, geophysical techniques, seismic waves, seismology, wave equations.
   

   @Article{ ArticleOperto.OVALGB_G07,
   author = {St\'ephane Operto and Jean Virieux and Patrick Amestoy and Jean-Yves L'Excellent and Luc Giraud and Hafedh {Ben Hadj Ali}},
   title = {3D finite-difference frequency-domain modeling of visco-acoustic wave propagation using a massively parallel direct solver: A feasibility study},
   publisher = {SEG},
   year = {2007},
   journal = {Geophysics},
   volume = {72},
   number = {5},
   pages = {SM195-SM211},
   keywords = {acoustic wave propagation; finite difference methods; geophysical techniques; seismic waves; seismology; wave equations},
   url = {http://link.aip.org/link/?GPY/72/SM195/1} 
   }
   




10. Clément Rezvoy, Delphine Charif, Laurent Guéguen, and Gabriel A.B. Marais. MareyMap: an R-based tool with graphical interface for estimating recombination rates. Bioinformatics, 23(16):2188-2189, 2007.
    

    @Article{ ArticleRezvoy.RCGM_B07,
    title = {{MareyMap: an R-based tool with graphical interface for estimating recombination rates}},
    author = {Rezvoy, Cl\'ement and Charif, Delphine and Gu\'eguen, Laurent and Marais, Gabriel A.B.},
    journal = {Bioinformatics},
    volume = {23},
    number = {16},
    pages = {2188-2189},
    year = {2007},
    publisher = {Oxford Univ Press} 
    }
    




11. William Thies, Frédéric Vivien, and Saman Amarasinghe. A step towards unifying schedule and storage optimization. ACM Transactions on Programming Languages and Systems (TOPLAS), 29(6):45 p., 2007.
    

    @Article{ ArticleThies.TVA_ATPLST07,
    author = {William Thies and Fr\'ed\'eric Vivien and Saman Amarasinghe},
    title = {A step towards unifying schedule and storage optimization},
    journal = {ACM Transactions on Programming Languages and Systems (TOPLAS)},
    year = 2007,
    volume = 29,
    number = 6,
    pages = {45 p.} 
    }
    




12. Bora Uçar and Cevdet Aykanat. Revisiting Hypergraph Models for Sparse Matrix Partitioning. SIAM Review, 49(4):595--603, 2007.
    

    @Article{ ArticleUcar.UA_SR07,
    author = {Bora U\c{c}ar and Cevdet Aykanat},
    journal = {SIAM Review},
    number = {4},
    pages = {595--603},
    title = {Revisiting Hypergraph Models for Sparse Matrix Partitioning},
    volume = {49},
    year = {2007} 
    }
    




13. Bora Uçar and Cevdet Aykanat. Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods. SIAM Journal on Scientific Computing, 29(4):1683--1709, 2007.
    

    @Article{ ArticleUcar.UA_SJSC07,
    author = {Bora U\c{c}ar and Cevdet Aykanat},
    journal = {SIAM Journal on Scientific Computing},
    number = {4},
    pages = {1683--1709},
    title = {Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods},
    volume = {29},
    year = {2007} 
    }
    




14. Bora Uçar, Cevdet Aykanat, Mustafa \cCelebi Pinar, and Tahir Malas. Parallel image restoration using surrogate constraint methods. Journal of Parallel and Distributed Computing, 67:186--204, 2007.
    

    @Article{ ArticleUcar.UAPM_JPDC07,
    author = {Bora U\c{c}ar and Cevdet Aykanat and Mustafa \c{C}elebi P{\i}nar and Tahir Malas},
    title = {Parallel image restoration using surrogate constraint methods},
    journal = {Journal of Parallel and Distributed Computing},
    year = 2007,
    volume = 67,
    pages = {186--204} 
    }
    

1. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. On Reducing the I/O Volume in a Sparse Out-of-core Solver. In HiPC'07 14th International Conference On High Performance Computing, number 4873 of Lecture Notes in Computer Science, Goa, India, pages 47-58, December 17-20, 2007.
   

   @InProceedings{ InProceedingsAgullo.AGL_07,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {On Reducing the {I/O} Volume in a Sparse Out-of-core Solver},
   booktitle = {{HiPC'07} 14th International Conference On High Performance Computing},
   address = {Goa, India},
   series = {Lecture Notes in Computer Science},
   month = {December 17-20,},
   year = {2007},
   number = {4873},
   pages = {47-58} 
   }
   




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

   @InProceedings{ InProceedingsAntoniu.ACDFJ_07,
   address = {Goa. India},
   author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and F{\`e}vre, Aur{\'e}lia and Jan, Mathieu},
   booktitle = {{HiPC'2007}. 14th International Conference on High Performance Computing.},
   editor = {S. Aluru et al. (Eds)},
   keywords = {DIET, JuxMem, LEGO},
   month = dec,
   number = {4873},
   pages = {269-284},
   publisher = {Springer Verlag Berlin Heidelberg},
   series = {LNCS},
   title = {Towards a Transparent Data Access Model for the {GridRPC} Paradigm},
   year = {2007} 
   }
   




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

   @InProceedings{ InProceedingsAstsatryan.ADHPC_07,
   address = {Yerevan (Arm{\'e}nie)},
   author = {Astsatryan, Hrachya and Dayd{\'e}, Michel and Hurault, Aur{\'e}lie and Pantel, Marc and Caron, Eddy},
   booktitle = {International Conference on Computer Science and Information Technologies (CSIT'07)},
   keywords = {LEGO},
   month = sep,
   title = {On defining a Web Interface for Linear Algebra Tasks over Computational Grids},
   year = {2007} 
   }
   




4. Olivier Beaumont, Anne-Marie Kermarrec, Loris Marchal, and Etienne Riviére. VoroNet: A scalable object network based on Voronoi tessellations. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2007), pages 1-10, 2007. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BKMR_07,
   author = {Olivier Beaumont and Anne-Marie Kermarrec and Loris Marchal and Etienne Rivi\'ere},
   title = {VoroNet: A scalable object network based on Voronoi tessellations},
   booktitle = {Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2007)},
   publisher = {IEEE Computer Society Press},
   year = {2007},
   pages = {1-10} 
   }
   




5. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Impact of QoS on replica placement in tree networks. In ICCS'2007, the 7th 2007 International Conference on Computational Science, LNCS 4487, pages 366-373, 2007. Springer Verlag.
   

   @InProceedings{ InProceedingsBenoit.BRR_07*1,
   author = {Anne Benoit and Veronika Rehn-Sonigo and Yves Robert},
   booktitle = {{ICCS'2007}, the 7th 2007 International Conference on Computational Science},
   publisher = {Springer Verlag},
   series = {LNCS 4487},
   pages = {366-373},
   title = {Impact of {QoS} on replica placement in tree networks},
   year = {2007} 
   }
   




6. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Strategies for replica placement in tree networks. In HCW'2007, the 16th Heterogeneous Computing Workshop, 2007. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBenoit.BRR_07,
   author = {Anne Benoit and Veronika Rehn-Sonigo and Yves Robert},
   booktitle = {{HCW'2007}, the 16th Heterogeneous Computing Workshop},
   publisher = {IEEE Computer Society Press},
   title = {Strategies for replica placement in tree networks},
   year = {2007} 
   }
   




7. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Multi-criteria scheduling of pipeline workflows. In HeteroPar'2007: International Conference on Heterogeneous Computing, jointly published with Cluster'2007, 2007. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBenoit.BRR_07*2,
   author = {Anne Benoit and Veronika Rehn-Sonigo and Yves Robert},
   booktitle = {{HeteroPar'2007}: International Conference on Heterogeneous Computing, jointly published with {Cluster'2007}},
   publisher = {IEEE Computer Society Press},
   title = {Multi-criteria scheduling of pipeline workflows},
   year = {2007} 
   }
   




8. Anne Benoit and Yves Robert. Complexity results for throughput and latency optimization of replicated and data-parallel workflows. In HeteroPar'2007: International Conference on Heterogeneous Computing, jointly published with Cluster'2007, 2007. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBenoit.BR_07*1,
   author = {Anne Benoit and Yves Robert},
   booktitle = {{HeteroPar'2007}: International Conference on Heterogeneous Computing, jointly published with {Cluster'2007}},
   publisher = {IEEE Computer Society Press},
   title = {Complexity results for throughput and latency optimization of replicated and data-parallel workflows},
   year = {2007} 
   }
   




9. Anne Benoit and Yves Robert. Mapping pipeline skeletons onto heterogeneous platforms. In ICCS'2007, the 7th International Conference on Computational Science, LNCS 4487, pages 591-598, 2007. Springer Verlag.
   

   @InProceedings{ InProceedingsBenoit.BR_07,
   author = {Anne Benoit and Yves Robert},
   booktitle = {{ICCS'2007}, the 7th International Conference on Computational Science},
   publisher = {Springer Verlag},
   series = {LNCS 4487},
   pages = {591-598},
   title = {Mapping pipeline skeletons onto heterogeneous platforms},
   year = {2007} 
   }
   




10. Julien Bigot and Christian Pérez. Enabling Collective Communications between Components. In CompFrame'07: Proceedings of the 2007 symposium on Component and framework technology in high-performance and scientific computing, New York, NY, USA, pages 121--130, 21-22 October 2007. ACM Press.
    Keywords: COLLECTIVE OPERATIONS, COMPONENT, DEPLOYMENT, GRID, GRID COMPUTING, Grid'5000, HIERARCHICAL ARCHITECTURE, MPI, programming.
    

    @InProceedings{ InProceedingsBigot.BP_07,
    author = {Bigot, Julien and P{\'e}rez, Christian},
    title = {Enabling Collective Communications between Components},
    year = {2007},
    month = {21-22 October},
    booktitle = {CompFrame'07: Proceedings of the 2007 symposium on Component and framework technology in high-performance and scientific computing},
    pages = {121--130},
    address = {New York, NY, USA},
    publisher = {ACM Press},
    keywords = {COLLECTIVE OPERATIONS, COMPONENT, DEPLOYMENT, GRID, GRID COMPUTING, Grid'5000, HIERARCHICAL ARCHITECTURE, MPI, programming} 
    }
    




11. 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 (HPGC'07), Long Beach, California, USA, March 2007. IEEE.
    Keywords: DIET, LEGO.
    

    @InProceedings{ InProceedingsCaniou.CCCDT_07,
    address = {Long Beach, California, USA},
    author = {Caniou, Yves and Caron, Eddy and Courtois, H{\'e}l{\`e}ne and Depardon, Benjamin and Teyssier, Romain},
    booktitle = {Fourth High-Performance Grid Computing Workshop (HPGC'07)},
    keywords = {DIET, LEGO},
    month = mar,
    publisher = {IEEE},
    title = {Cosmological Simulations using Grid Middleware},
    year = {2007} 
    }
    




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

    @InProceedings{ InProceedingsCaron.CDPT_07,
    address = {Paris, France},
    author = {Caron, Eddy and Desprez, Fr\'ed\'eric and Petit, Franck and Tedeschi, C\'edric},
    booktitle = {9th International Symposium on Stabilization, Safety, and Security of Distributed Systems},
    month = nov,
    pages = {82-96},
    publisher = {Springer Verlag Berlin Heidelberg},
    series = {Lecture Notes in Computer Science},
    title = {{Snap-stabilizing Prefix Tree for Peer-to-peer Systems}},
    volume = {4838},
    year = {2007} 
    }
    




13. Frédéric Desprez and Antoine Vernois. Semi-Static Algorithms for Data Replication and Scheduling Over the Grid. In IEEE 3rd International Conference on Intelligent Computer Communication and Processing, workshop on Grid Computing, Cluj-Napoca, Romania, September 2007.
    

    @InProceedings{ InProceedingsDesprez.DV_07,
    author = {Desprez, Fr\'ed\'eric and Vernois, Antoine},
    title = "{Semi-Static Algorithms for Data Replication and Scheduling Over the Grid}",
    booktitle = {IEEE 3rd International Conference on Intelligent Computer Communication and Processing, workshop on Grid Computing},
    year = 2007,
    address = {Cluj-Napoca, Romania},
    month = sep 
    }
    




14. Jack DiGiovanna, Loris Marchal, Prapaporn Rattanatamrong, Ming Zhao, Shalom Darmanjian, Babak Mahmoudi, Justin Sanchez, José Prìncipe, Linda Hermer-Vazquez, Renato Figueiredo, and José Fortes. Towards Real-Time Distributed Signal Modeling for Brain Machine Interfaces. In Proceedings of Dynamic Data Driven Application Systems (workshop of ICCS), volume 4487 of LNCS, pages 964-971, 2007. Springer Verlag.
    

    @InProceedings{ InProceedingsDiGiovanna.DMRZDMSPHFF_07,
    author = {Jack DiGiovanna and Loris Marchal and Prapaporn Rattanatamrong and Ming Zhao and Shalom Darmanjian and Babak Mahmoudi and Justin Sanchez and Jos\'e Pr\'incipe and Linda Hermer-Vazquez and Renato Figueiredo and Jos\'e Fortes},
    title = {Towards Real-Time Distributed Signal Modeling for Brain Machine Interfaces},
    booktitle = {Proceedings of Dynamic Data Driven Application Systems (workshop of ICCS)},
    publisher = {Springer Verlag},
    series = {LNCS},
    year = {2007},
    volume = {4487},
    pages = {964-971} 
    }
    




15. Jack Dongarra, Jean-François Pineau, Yves Robert, Zhiao Shi, and Frédéric Vivien. Revisiting matrix product on master-worker platforms. In 9th Workshop on Advances in Parallel and Distributed Computational Models APDCM 2007, 2007. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsDongarra.DPRSV_07,
    author = "Jack Dongarra and Jean-Fran\c{c}ois Pineau and Yves Robert and Zhiao Shi and Fr\'ed\'eric Vivien",
    booktitle = {9th Workshop on Advances in Parallel and Distributed Computational Models {APDCM 2007}},
    publisher = {IEEE Computer Society Press},
    title = {Revisiting matrix product on master-worker platforms},
    year = {2007} 
    }
    




16. Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quinson, and Frédéric Vivien. A First Step Towards Automatically Building Network Representations. In Proceedings of Euro-Par 2007, volume 4641 of LNCS, pages 160-169, 2007.
    

    @InProceedings{ InProceedingsEyraud-Dubois.ELQV_07,
    author = {Lionel Eyraud-Dubois and Arnaud Legrand and Martin Quinson and Fr\'ed\'eric Vivien},
    title = {A First Step Towards Automatically Building Network Representations},
    booktitle = {Proceedings of Euro-Par 2007},
    pages = {160-169},
    year = 2007,
    volume = 4641,
    series = {LNCS} 
    }
    




17. Matthieu Gallet, Yves Robert, and Frédéric Vivien. Scheduling multiple divisible loads on a linear processor network. In ICPADS'2007, the 13th International Conference on Parallel and Distributed Systems, 2007.
    

    @InProceedings{ InProceedingsGallet.GRV_07*1,
    author = {Matthieu Gallet and Yves Robert and Fr\'ed\'eric Vivien},
    title = {Scheduling multiple divisible loads on a linear processor network},
    booktitle = {{ICPADS'2007}, the 13th International Conference on Parallel and Distributed Systems},
    year = {2007} 
    }
    




18. Matthieu Gallet, Yves Robert, and Frédéric Vivien. Scheduling communication requests traversing a switch: complexity and algorithms. In PDP'2007, 15th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages 39-46, 2007. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsGallet.GRV_07,
    author = {Matthieu Gallet and Yves Robert and Fr\'ed\'eric Vivien},
    booktitle = {{PDP'2007}, 15th Euromicro Workshop on Parallel, Distributed and Network-based Processing},
    publisher = {IEEE Computer Society Press},
    title = {Scheduling communication requests traversing a switch: complexity and algorithms},
    pages = "39-46",
    year = {2007} 
    }
    




19. Loris Marchal, Veronika Rehn-Sonigo, Yves Robert, and Frédéric Vivien. Scheduling and data redistribution strategies on star platforms. In PDP'2007, 15th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages 288-295, 2007. IEEE Computer Society Press.
    

    @InProceedings{ InProceedingsMarchal.MRRV_07,
    author = {Loris Marchal and Veronika Rehn-Sonigo and Yves Robert and Fr\'ed\'eric Vivien},
    booktitle = {{PDP'2007}, 15th Euromicro Workshop on Parallel, Distributed and Network-based Processing},
    publisher = {IEEE Computer Society Press},
    title = {Scheduling and data redistribution strategies on star platforms},
    pages = "288-295",
    year = {2007} 
    }
    




20. Veronika Rehn-Sonigo. Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks. In CoreGRID'2007, Core GRID Symposium 2007, 2007. Springer Verlag.
    

    @InProceedings{ InProceedingsRehn-Sonigo.R_07,
    author = {Veronika Rehn-Sonigo},
    booktitle = {{CoreGRID'2007}, Core GRID Symposium 2007},
    publisher = {Springer Verlag},
    title = {{Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks}},
    year = {2007} 
    }
    

1. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. Towards a Parallel Out-of-core Multifrontal Solver: Preliminary Study. Research report RR2007-06, LIP, February 2007.
   Note: Also available as INRIA report 6120.
   

   @TechReport{ TechReportRR-LIP-RR2007-06,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {Towards a Parallel Out-of-core Multifrontal Solver: Preliminary Study},
   type = {Research report},
   institution = {LIP},
   number = {RR2007-06},
   month = feb,
   note = {Also available as INRIA report 6120},
   year = {2007} 
   }
   




2. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. Reducing the I/O Volume in an Out-of-core Sparse Multifrontal Solver. Research Report RR-6207, INRIA, May 2007.
   Note: Also appeared as LIP report RR2007-22.
   

   @TechReport{ TechReportRR-INRIA-RR-6207,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {Reducing the {I/O} Volume in an Out-of-core Sparse Multifrontal Solver},
   year = {2007},
   month = may,
   institution = {INRIA},
   number = {RR-6207},
   type = {Research Report},
   pages = {32 p.},
   url = {https://hal.inria.fr/inria-00150588},
   note = {Also appeared as LIP report RR2007-22} 
   }
   




3. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. Towards a Parallel Out-of-core Multifrontal Solver: Preliminary Study. Research report RR-6120, INRIA, February 2007.
   Note: Also available as LIP report RR2007-06.
   

   @TechReport{ TechReportRR-INRIA-RR-6120,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {Towards a Parallel Out-of-core Multifrontal Solver: Preliminary Study},
   type = {Research report},
   institution = {INRIA},
   number = {RR-6120},
   month = feb,
   note = {Also available as LIP report RR2007-06},
   year = {2007} 
   }
   




4. Emmanuel Agullo, Abdou Guermouche, and Jean-Yves L'Excellent. Reducing the I/O Volume in an Out-of-core Sparse Multifrontal Solver. Research Report RR2007-22, LIP, May 2007.
   Note: Also appeared as INRIA report 6207.
   

   @TechReport{ TechReportRR-LIP-RR2007-22,
   author = {Agullo, Emmanuel and Guermouche, Abdou and L'Excellent, Jean-Yves},
   title = {Reducing the I/O Volume in an Out-of-core Sparse Multifrontal Solver},
   year = {2007},
   month = may,
   institution = {LIP},
   number = {RR2007-22},
   type = {Research Report},
   pages = {23 p.},
   url = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2007/RR2007-22.ps.gz},
   note = {Also appeared as INRIA report 6207} 
   }
   




5. Anne Benoit, Loris Marchal, Jean-François Pineau, Yves Robert, and Frédéric Vivien. Offline and Online Scheduling of Concurrent Bags-of-Tasks on Heterogeneous Platforms. Research Report RR-6401, INRIA, 2007.
   

   @TechReport{ TechReportRR-INRIA--RR-6401-,
   author = { Benoit, Anne and Marchal, Loris and Pineau, Jean-Fran\c{c}ois and Robert, Yves and Vivien, Fr\'ed\'eric },
   title = { Offline and Online Scheduling of Concurrent Bags-of-Tasks on Heterogeneous Platforms },
   year = { 2007 },
   number = { RR-6401 },
   institution = {INRIA},
   type = {Research Report},
   url = {http://hal.inria.fr/inria-00200261/} 
   }
   




6. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Multi-criteria scheduling of pipeline workflows. Research Report RR-6232, INRIA, 2007.
   Note: Also available as LIP research report 2007-32.
   

   @TechReport{ TechReportRR-INRIA-RR-6232,
   author = {Benoit, Anne and Rehn-Sonigo, Veronika and Robert, Yves},
   title = {Multi-criteria scheduling of pipeline workflows},
   year = {2007},
   institution = {INRIA},
   number = {RR-6232},
   type = {Research Report},
   url = {https://hal.inria.fr/inria-00156732},
   note = {Also available as LIP research report 2007-32} 
   }
   




7. Anne Benoit, Veronika Rehn-Sonigo, and Yves Robert. Optimizing Latency and Reliability of Pipeline Workflow Applications. Research Report 6345, INRIA, November 2007.
   Note: Also available as LIP research report 2007-43.
   

   @TechReport{ TechReportRR-INRIA-6345,
   author = {Benoit, Anne and Rehn-Sonigo, Veronika and Robert, Yves},
   title = {Optimizing Latency and Reliability of Pipeline Workflow Applications},
   year = {2007},
   month = nov,
   institution = {INRIA},
   number = {6345},
   type = {Research Report},
   url = {https://hal.inria.fr/inria-00186152},
   note = {Also available as LIP research report 2007-43} 
   }
   




8. Anne Benoit and Yves Robert. Complexity results for throughput and latency optimization of replicated and data-parallel workflows. Research Report RR-6308, INRIA, 2007.
   

   @TechReport{ TechReportRR-INRIA--RR-6308-,
   author = { Benoit, Anne and Robert, Yves },
   title = { Complexity results for throughput and latency optimization of replicated and data-parallel workflows },
   year = { 2007 },
   number = { RR-6308 },
   institution = {INRIA},
   type = {Research Report},
   url = {http://hal.inria.fr/inria-00175066} 
   }
   




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

   
   

   @TechReport{ TechReportRR-Laboratoire-RR2007-11,
   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 = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
   institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
   keywords = {Grid computing, cosmological simulations, DIET, LEGO},
   month = mar,
   note = {Also available as INRIA Research Report 6139},
   number = {RR2007-11},
   pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2007/RR2007-11.pdf},
   title = {Cosmological Simulations using Grid Middleware},
   year = 2007 
   }
   




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

    
    

    @TechReport{ TechReportRR-Institut-6139,
    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 = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
    institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
    keywords = {Grid computing, cosmological simulations, DIET, LEGO},
    month = mar,
    note = {Also available as LIP Research Report 2007-11},
    number = {6139},
    title = {Cosmological Simulations using Grid Middleware},
    url = {http://hal.inria.fr/inria-00135189},
    year = 2007 
    }
    




11. 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: Also available as LIP Research Report 2007-xx.
    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.

    
    

    @TechReport{ TechReportRR-Institut-RR-6297,
    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.},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Petit, Franck and Tedeschi, C{\'e}dric},
    institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
    keywords = {TPLD, Peer-to-peer systems, Fault-tolerance, Self-stabilization, Snap-stabilization, Grid computing},
    month = sep,
    note = {Also available as LIP Research Report 2007-xx},
    number = {RR-6297},
    title = {Snap-stabilizing Prefix Tree for Peer-to-peer Systems},
    url = {http://hal.inria.fr/inria-00173050/fr/},
    year = 2007 
    }
    




12. Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quinson, and Frédéric Vivien. A First Step Towards Automatically Building Network Representations. Research Report RR-6133, INRIA, February 2007.
    Note: Also available as LIP research report 2007-08.
    

    @TechReport{ TechReportRR-INRIA-RR-6133,
    author = {Lionel Eyraud-Dubois and Arnaud Legrand and Martin Quinson and Fr\'ed\'eric Vivien},
    title = {A First Step Towards Automatically Building Network Representations},
    year = {2007},
    month = feb,
    institution = {INRIA},
    number = {RR-6133},
    type = {Research Report},
    url = {https://hal.inria.fr/inria-00130734},
    note = {Also available as LIP research report 2007-08} 
    }
    




13. Matthieu Gallet, Yves Robert, and Frédéric Vivien. Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''. Research Report RR-6123, INRIA, February 2007.
    Note: Also available as LIP research report 2007-07.
    

    @TechReport{ TechReportRR-INRIA-RR-6123,
    author = {Gallet, Matthieu and Robert, Yves and Vivien, Fr\'ed\'eric},
    title = {Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''},
    year = {2007},
    month = feb,
    institution = {INRIA},
    number = {RR-6123},
    type = {Research Report},
    url = {https://hal.inria.fr/inria-00130294},
    note = {Also available as LIP research report 2007-07} 
    }
    




14. Matthieu Gallet, Yves Robert, and Frédéric Vivien. Scheduling multiple divisible loads on a linear processor network. Research Report RR-6235, INRIA, 2007.
    

    @TechReport{ TechReportRR-INRIA--RR-6235-,
    author = { Gallet, Matthieu and Robert, Yves and Vivien, Fr\'ed\'eric },
    title = { Scheduling multiple divisible loads on a linear processor network },
    year = { 2007 },
    number = { RR-6235 },
    institution = {INRIA},
    type = {Research Report},
    url = {http://hal.inria.fr/inria-00158027} 
    }
    




15. Veronika Rehn-Sonigo. Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy. Research Report 6233, INRIA, 2007.
    Note: Also available as LIP research report 2007-10.
    

    @TechReport{ TechReportRR-INRIA-6233,
    author = {Rehn-Sonigo, Veronika},
    title = {Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy},
    year = {2007},
    institution = {INRIA},
    number = {6233},
    type = {Research Report},
    url = {https://hal.inria.fr/inria-00156747},
    note = {Also available as LIP research report 2007-10} 
    }
    

1. 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.
   Keywords: DIET.
   

   @Manual{ Man-Tanimura.TSCANTD_07,
   author = {Tanimura, Yusuke and Seymour, Keith and Caron, Eddy and Amar, Abelkader and Nakada, Hidemoto and Tanaka, Yoshio and Desprez, Fr\'ed\'eric},
   editor = {GridRPC-WG},
   keywords = {DIET},
   month = may,
   note = {OGF Reference: GFD.102},
   organization = {Open Grid Forum},
   title = {Interoperability Testing for The {GridRPC} API Specification},
   url = {http://www.ogf.org/documents/GFD.102.pdf},
   year = {2007} 
   }
   

1. Bernard Tourancheau, Francois Vigouroux, and Cedric Koch-Hofer. System and method for determining a carrier layout using cornered chip-to-chip input/output. US Patent 7191422, 2007.
   

   @Misc{ Mis-Tourancheau.TVK_07,
   author = {Tourancheau, Bernard and Vigouroux, Francois and Koch-Hofer, Cedric},
   howpublished = {US Patent 7191422},
   institution = {SUN Microsystems},
   number = {7191422},
   title = {System and method for determining a carrier layout using cornered chip-to-chip input/output},
   year = {2007} 
   }
   

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