1. Frédéric Suter. Parallélisme mixte et prédiction de performances sur réseaux hétérogènes de machines parallèles. PhD thesis, Ecole Normale Supéieure de Lyon, November 2002.
   

   @PhDThesis{ PhDThesisPhD-Suter_02,
   author = {Suter, Fr\'ed\'eric},
   title = {Parall\'elisme mixte et pr\'ediction de performances sur r\'eseaux h\'et\'erog\`enes de machines parall\`eles},
   school = {Ecole Normale Sup\'eieure de Lyon},
   year = 2002,
   month = nov,
   postscript = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD2002/PhD2002-02.ps.gz" 
   }
   

1. Olivier Beaumont, Vincent Boudet, Arnaud Legrand, Fabrice Rastello, and Yves Robert. Static Data Allocation and Load Balancing Techniques for Heterogeneous Systems. In C.K. Yuen, editor,Annual Review of Scalable Computing, volume 4, chapter 1, pages 1-37. World Scientific, 2002.
   

   @InCollection{ InCollectionBeaumont.BBLRR_02,
   author = {Olivier Beaumont and Vincent Boudet and Arnaud Legrand and Fabrice Rastello and Yves Robert},
   booktitle = {Annual Review of Scalable Computing},
   chapter = {1},
   editor = {C.K. Yuen},
   publisher = {World Scientific},
   pages = {1-37},
   title = {Static Data Allocation and Load Balancing Techniques for Heterogeneous Systems},
   volume = {4},
   year = {2002} 
   }
   




2. E. Caron, F. Desprez, E. Fleury, F. Lombard, J.-M. Nicod, M. Quinson, and F. Suter. Une approche hiérarchique des serveurs de calculs. In Françoise Baude, editor,Calcul réparti à grande échelle, pages 129-151. Hermès Science Paris, 2002.
   Note: ISBN 2-7462-0472-X.
   Keywords: DIET.
   

   @InCollection{ InCollectionCaron.CDFLNQS_02,
   author = {Caron, E. and Desprez, F. and Fleury, E. and Lombard, F. and Nicod, J.-M. and Quinson, M. and Suter, F.},
   booktitle = {Calcul r{\'e}parti {\`a} grande {\'e}chelle},
   editor = {Fran{\c c}oise Baude},
   keywords = {DIET},
   note = {ISBN 2-7462-0472-X},
   pages = {129-151},
   publisher = {Herm{\`e}s Science Paris},
   title = {Une approche hi{\'e}rarchique des serveurs de calculs},
   year = {2002} 
   }
   




3. Patrick R. Amestoy, Iain S. Duff, Jacko Koster, and Jean-Yves L'Excellent. MUMPS: A Multifrontal Massively Parallel Solver. ERCIM News, 50:14--15, July 2002.
   Note: European Research Consortium for Informatics and Mathematics (ERCIM), rlhttp://www.ercim.org.
   

   @Article{ ArticleAmestoy.ADKL_EN02,
   title = "{{MUMPS}: A Multifrontal Massively Parallel Solver}",
   author = {Patrick R. Amestoy and Iain S. Duff and Jacko Koster and Jean-Yves L'Excellent},
   journal = {ERCIM News},
   year = {2002},
   volume = {50},
   pages = {14--15},
   month = jul,
   note = {European Research Consortium for Informatics and Mathematics (ERCIM), \url{http://www.ercim.org}} 
   }
   




4. Olivier Beaumont, Vincent Boudet, Fabrice Rastello, and Yves Robert. Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica, 34:217-239, 2002.
   

   @Article{ ArticleBeaumont.BBRR_A02,
   author = {Olivier Beaumont and Vincent Boudet and Fabrice Rastello and Yves Robert},
   journal = {Algorithmica},
   title = {Partitioning a square into rectangles: {NP}-completeness and approximation algorithms},
   year = {2002},
   pages = {217-239},
   volume = {34} 
   }
   




5. Olivier Beaumont, Arnaud Legrand, Fabrice Rastello, and Yves Robert. Dense linear algebra kernels on heterogeneous platforms: redistribution issues. Parallel Computing, 28:155-185, 2002.
   

   @Article{ ArticleBeaumont.BLRR_PC02,
   author = {Olivier Beaumont and Arnaud Legrand and Fabrice Rastello and Yves Robert},
   journal = {Parallel Computing},
   title = {Dense linear algebra kernels on heterogeneous platforms: redistribution issues},
   year = {2002},
   pages = {155-185},
   volume = {28} 
   }
   




6. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Static scheduling strategies for heterogeneous systems. Computing and Informatics, 21:413-430, 2002.
   

   @Article{ ArticleBeaumont.BLR_CI02,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   journal = {Computing and Informatics},
   title = {Static scheduling strategies for heterogeneous systems},
   year = {2002},
   pages = {413-430},
   volume = {21} 
   }
   




7. Sylvain Contassot-Vivier, Frédéric Lombard, Jean-Marc Nicod, and Laurent Philippe. Evaluation of the DIET hierarchical metacomputing architecture. Parallel and Distributed Computing Practices. Special Issue on Parallel Numeric Algorithms on Faster Computers, 5(4):64--76, December 2002.
   Keywords: DIET.
   

   @Article{ ArticleContassot-Vivier.CLNP_PDCPSIPNAFC02,
   author = {Contassot-Vivier, Sylvain and Lombard, Fr\'ed\'eric and Nicod, Jean-Marc and Philippe, Laurent},
   title = {Evaluation of the {DIET} hierarchical metacomputing architecture},
   journal = {Parallel and Distributed Computing Practices. Special Issue on Parallel Numeric Algorithms on Faster Computers},
   pages = {64--76},
   volume = 5,
   number = 4,
   month = dec,
   year = 2002,
   keywords = {DIET} 
   }
   




8. Alain Darte, Rob Schreiber, B. Ramakrishna Rau, and Frédéric Vivien. Constructing and Exploiting Linear Schedules with Prescribed Parallelism. ACM Transactions on Design Automation of Electronic Systems, 7(1):159-172, January 2002.
   

   @Article{ ArticleDarte.DSRV_ATDAES02,
   author = {Alain Darte and Rob Schreiber and B. Ramakrishna Rau and Fr\'ed\'eric Vivien},
   title = {Constructing and Exploiting Linear Schedules with Prescribed Parallelism},
   journal = {ACM Transactions on Design Automation of Electronic Systems},
   year = 2002,
   volume = 7,
   number = 1,
   pages = {159-172},
   month = jan 
   }
   




9. P. Geoffray, C. Pham, and B. Tourancheau. A Software Suite for High-Performance Communications on Clusters of SMPs. Journal of Cluster Computing, 5(4):353-363, 2002.
   

   @Article{ ArticleGeoffray.GPT_JCC02,
   author = {P. Geoffray and C. Pham and B. Tourancheau},
   journal = {Journal of Cluster Computing},
   number = {4},
   optmonth = oct,
   pages = {353-363},
   title = {A Software Suite for High-Performance Communications on Clusters of SMPs},
   volume = {5},
   year = {2002} 
   }
   




10. Arnaud Legrand. Équilibrage de charge statique pour noyaux d'algèbre linéaire sur plate-forme hétérogène. Technique et Science Informatique, Numéro spécial RenPar'13, pp 711--734, 2002.

    Abstract:

    Dans cet article, nous nous int\'eressons \`a la distribution de donn\'ees pour des noyaux d'alg\`ebre lin\'eaire (tels que le produit de matrices ou la factorisation LU) adapt\'es aux plates-formes h\'et\'erog\`enes. Les distributions cycliques par blocs utilis\'ees dans ScaLAPACK ne sont plus adapt\'ees \`a de telles plates-formes et ne permettent pas d'obtenir un bon \'equilibrage de charge. Le r\'esultat principal de cet article porte sur une technique de distribution des donn\'ees qui permet d'obtenir un \'equilibrage de charge asymptotiquement optimal pour les factorisations LU, et qui peut donc servir \`a la mise en oeuvre d'une version de ScaLAPACK h\'et\'erog\`ene.

    
    

    @Article{ ArticleLegrand.L_TSI02,
    author = {Arnaud Legrand},
    title = {\'Equilibrage de charge statique pour noyaux d'alg\`ebre lin\'eaire sur plate-forme h\'et\'erog\`ene},
    journal = {Technique et Science Informatique{, Num\'ero sp\'ecial RenPar'13}},
    year = {2002},
    pages = {711--734},
    abstract = {Dans cet article, nous nous int\'eressons \`a la distribution de donn\'ees pour des noyaux d'alg\`ebre lin\'eaire (tels que le produit de matrices ou la factorisation LU) adapt\'es aux plates-formes h\'et\'erog\`enes. Les distributions cycliques par blocs utilis\'ees dans ScaLAPACK ne sont plus adapt\'ees \`a de telles plates-formes et ne permettent pas d'obtenir un bon \'equilibrage de charge. Le r\'esultat principal de cet article porte sur une technique de distribution des donn\'ees qui permet d'obtenir un \'equilibrage de charge asymptotiquement optimal pour les factorisations LU, et qui peut donc servir \`a la mise en oeuvre d'une version de ScaLAPACK h\'et\'erog\`ene.},
    postscript = {articles/TSI02.ps.gz} 
    }
    




11. G. Montenegro, B. Gaidioz, P. Primet, and B. Tourancheau. Equivalent differentiated services for AODVng. SIGMOBILE Mobile Computing and Communications Review, 6(3), July 2002.
    

    @Article{ ArticleMontenegro.MGPT_SMCCR02,
    author = {Montenegro, G. and Gaidioz, B. and Primet, P. and Tourancheau, B.},
    journal = {SIGMOBILE Mobile Computing and Communications Review},
    month = jul,
    number = {3},
    title = {Equivalent differentiated services for AODVng},
    volume = {6},
    year = {2002} 
    }
    




12. Martin Quinson. Un outil de prédiction dynamique de performances dans un environnement de metacomputing. Technique et Science Informatique, (5), 2002.
    Note: Numéro spécial RenPar'13.
    

    @Article{ ArticleQuinson.Q_TSI02,
    author = {Martin Quinson},
    title = {Un outil de pr\'ediction dynamique de performances dans un environnement de metacomputing},
    journal = {Technique et Science Informatique},
    note = {Num\'ero sp\'ecial RenPar'13},
    number = {5},
    year = {2002} 
    }
    




13. Fabrice Rastello and Yves Robert. Automatic partitioning of parallel loops with parallelepiped-shaped tiles. IEEE Trans. Parallel Distributed Systems, 13(5):460-470, 2002.
    

    @Article{ ArticleRastello.RR_ITPDS02,
    author = {Fabrice Rastello and Yves Robert},
    journal = {IEEE Trans. Parallel Distributed Systems},
    title = {Automatic partitioning of parallel loops with parallelepiped-shaped tiles},
    year = {2002},
    number = {5},
    pages = {460-470},
    volume = {13} 
    }
    

1. Cyril Banino, Olivier Beaumont, Arnaud Legrand, and Yves Robert. Scheduling strategies for master-slave tasking on heterogeneous processor grids. In PARA'02: International Conference on Applied Parallel Computing, LNCS 2367, pages 423-432, 2002. Springer Verlag.
   

   @InProceedings{ InProceedingsBanino.BBLR_02,
   author = {Cyril Banino and Olivier Beaumont and Arnaud Legrand and Yves Robert},
   booktitle = {{PARA'02}: International Conference on Applied Parallel Computing},
   publisher = {Springer Verlag},
   series = {LNCS 2367},
   title = {Scheduling strategies for master-slave tasking on heterogeneous processor grids},
   pages = {423-432},
   year = {2002} 
   }
   




2. Olivier Beaumont, Vincent Boudet, and Yves Robert. The iso-level scheduling heuristic for heterogeneous processors. In PDP'2002, 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BBR_02,
   author = {Olivier Beaumont and Vincent Boudet and Yves Robert},
   booktitle = {{PDP'2002}, 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing},
   publisher = {IEEE Computer Society Press},
   title = {The iso-level scheduling heuristic for heterogeneous processors},
   year = {2002} 
   }
   




3. Olivier Beaumont, Vincent Boudet, and Yves Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In HCW'2002, the 11th Heterogeneous Computing Workshop, 2002. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BBR_02*1,
   author = {Olivier Beaumont and Vincent Boudet and Yves Robert},
   booktitle = {{HCW'2002}, the 11th Heterogeneous Computing Workshop},
   publisher = {IEEE Computer Society Press},
   title = {A realistic model and an efficient heuristic for scheduling with heterogeneous processors},
   year = {2002} 
   }
   




4. Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, and Yves Robert. Bandwidth-centric allocation of independent tasks on heterogeneous platforms. In International Parallel and Distributed Processing Symposium IPDPS'2002, 2002. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsBeaumont.BCFLR_02,
   author = {Olivier Beaumont and Larry Carter and Jeanne Ferrante and Arnaud Legrand and Yves Robert},
   booktitle = {International Parallel and Distributed Processing Symposium {IPDPS'2002}},
   publisher = {IEEE Computer Society Press},
   title = {Bandwidth-centric allocation of independent tasks on heterogeneous platforms},
   year = {2002} 
   }
   




5. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Ordonnancement en régime permanent pour plateformes hétérogènes. In GRID'2002, Actes de l'école thématique sur la globalisation des ressources informatiques et des données, pages 325-334, 2002. INRIA Lorraine.
   

   @InProceedings{ InProceedingsBeaumont.BLR_02*4,
   author = "Olivier Beaumont and Arnaud Legrand and Yves Robert",
   booktitle = "{GRID'2002}, Actes de l'\'ecole th\'ematique sur la globalisation des ressources informatiques et des donn\'ees",
   publisher = "INRIA Lorraine",
   title = "Ordonnancement en r\'egime permanent pour plateformes h\'et\'erogènes",
   pages = "325-334",
   year = "2002" 
   }
   




6. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Static scheduling strategies for dense linear algebra kernels on heterogeneous clusters. In Parallel Matrix Algorithms and Applications, 2002. Université de Neuchâtel.
   

   @InProceedings{ InProceedingsBeaumont.BLR_02*3,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   booktitle = {{Parallel Matrix Algorithms and Applications}},
   publisher = {Universit\'e de Neuchâtel},
   title = {Static scheduling strategies for dense linear algebra kernels on heterogeneous clusters},
   year = {2002} 
   }
   




7. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Static scheduling strategies for heterogeneous systems. In ISCIS XVII, Seventeenth International Symposium On Computer and Information Sciences, pages 18-22, 2002. CRC Press.
   

   @InProceedings{ InProceedingsBeaumont.BLR_02,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   booktitle = {{ISCIS XVII}, Seventeenth International Symposium On Computer and Information Sciences},
   publisher = {CRC Press},
   title = {Static scheduling strategies for heterogeneous systems},
   pages = {18-22},
   year = {2002} 
   }
   




8. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Mixed task and data parallelism. In Parallel Matrix Algorithms and Applications, 2002. Université de Neuchâtel.
   

   @InProceedings{ InProceedingsBeaumont.BLR_02*2,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   booktitle = {{Parallel Matrix Algorithms and Applications}},
   publisher = {Universit\'e de Neuchâtel},
   title = {Mixed task and data parallelism},
   year = {2002} 
   }
   




9. Olivier Beaumont, Arnaud Legrand, and Yves Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. In ISCIS XVII, Seventeenth International Symposium On Computer and Information Sciences, pages 115-119, 2002. CRC Press.
   

   @InProceedings{ InProceedingsBeaumont.BLR_02*1,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   booktitle = {{ISCIS XVII}, Seventeenth International Symposium On Computer and Information Sciences},
   publisher = {CRC Press},
   title = {A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs},
   pages = {115-119},
   year = {2002} 
   }
   




10. Oleg Blagosklonov, Branco Dancuo, Sébastien Klingelschmitt, Laurent Comas, Jean-Marc Nicod, Josette Verdenet, Rémy Sabbah, and Jean-Claude Cardot. Méthode automatique de d/'etection et de correction des artefacts en tomographie myocardique. In 40ème Colloque de Médecine Nucléaire de la Langue Française, volume 26 of M/'edecine nucl/'eaire, pages 552, 2002.
    

    @InProceedings{ InProceedingsBlagosklonov.BDKCNVSC_02,
    author = {Blagosklonov, Oleg and Dancuo, Branco and Klingelschmitt, S\'ebastien and Comas, Laurent and Nicod, Jean-Marc and Verdenet, Josette and Sabbah, R\'emy and Cardot, Jean-Claude},
    title = {M\'ethode automatique de d/'etection et de correction des artefacts en tomographie myocardique},
    booktitle = {40\`eme Colloque de M\'edecine Nucl\'eaire de la Langue Fran\ccaise},
    pages = 552,
    year = 2002,
    volume = 26,
    number = 10,
    series = {M/'edecine nucl/'eaire} 
    }
    




11. Yves Caniou and Emmanuel Jeannot. Ordonnancement pour la grille : une extension de MCT. In D. Lytaize M. Jemni, Z. Mahjoub, D. Trystram and D. Hagimot, editors, Rencontres Francophones du Parallélisme - RENPAR'02, Hammamet, Tunisia, pages 58--65, April 2002.
    

    @InProceedings{ InProceedingsCaniou.CJ_02,
    author = {Yves Caniou and Emmanuel Jeannot},
    title = {Ordonnancement pour la grille : une extension de {MCT}},
    booktitle = {Rencontres Francophones du Parall{\'e}lisme - RENPAR'02},
    editors = {M. Jemni, Z. Mahjoub, D. Trystram,D. Lytaize, and D. Hagimot},
    pages = {58--65},
    year = {2002},
    month = apr,
    address = {Hammamet, Tunisia} 
    }
    




12. Yves Caniou. Ordonnancement pour le modèle temps partagé. In Proceedings of WINTER SCHOOL Grid 2002, Aussois, France, December 2002.
    

    @InProceedings{ InProceedingsCaniou.C_02,
    author = {Yves Caniou},
    title = {Ordonnancement pour le mod{\`e}le temps partag{\'e}},
    booktitle = {Proceedings of WINTER SCHOOL Grid 2002},
    year = {2002},
    month = dec,
    address = {Aussois, France} 
    }
    




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

    @InProceedings{ InProceedingsCaron.CDLNQS_02,
    address = {Paderborn, Germany},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Lombard, Fr{\'e}d{\'e}ric and Nicod, Jean-Marc and Quinson, Martin and Suter, Fr{\'e}d{\'e}ric},
    booktitle = {Proceedings of the 8th International EuroPar Conference},
    editor = {B. Monien and R. Feldmann},
    keywords = {Grid computing, DIET},
    month = aug,
    pages = {907-910},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {A Scalable Approach to Network Enabled Servers},
    volume = 2400,
    year = 2002 
    }
    




14. Eddy Caron and Frédéric Desprez. GridRPC: Approche RPC pour la simulation sur la grille: Approche RPC pour la simulation sur la grille. In Actes de l'Ecole thématique sur la globalisation des ressources informatiques et des données, Aussois, France, pages 87-98, December 2002.
    Keywords: Grid Computing GridRPC, DIET.
    

    @Conference{ Con-Caron.CD_02,
    address = {Aussois, France},
    author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric},
    booktitle = {Actes de l'Ecole th{\'e}matique sur la globalisation des ressources informatiques et des donn{\'e}es},
    keyword = {Grid Computing GridRPC,DIET},
    month = dec,
    pages = {87-98},
    title = {{GridRPC}: Approche RPC pour la simulation sur la grille: Approche RPC pour la simulation sur la grille},
    year = 2002 
    }
    




15. Eddy Caron and Frédéric Suter. Extension parallèle d'un outil de prédiction dynamique de performances. In 14e Rencontres Francophones du Parallélisme, Hammamet, Tunisie, pages 69-74, 10-13 # apr 2002.
    Keywords: Performance Forecasting, FAST, Metacomputing, Ordonnancement.
    

    @InProceedings{ InProceedingsCaron.CS_02*1,
    address = {Hammamet, Tunisie},
    author = {Caron, Eddy and Suter, Fr{\'e}d{\'e}ric},
    booktitle = {14e Rencontres Francophones du Parall{\'e}lisme},
    keywords = {Performance Forecasting, FAST,Metacomputing,Ordonnancement},
    month = {10-13} # apr,
    pages = {69-74},
    title = {Extension parall{\`e}le d'un outil de pr{\'e}diction dynamique de performances},
    year = 2002 
    }
    




16. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. In Proceedings of the International Symposium on Parallel and Distributed Computing, Iasi, Romania, pages 80-93, July 2002.
    Keywords: Performance Forecasting, FAST.
    

    @InProceedings{ InProceedingsCaron.CS_02,
    address = {Iasi, Romania},
    author = {Caron, Eddy and Suter, Fr{\'e}d{\'e}ric},
    booktitle = {Proceedings of the International Symposium on Parallel and Distributed Computing},
    keywords = {Performance Forecasting, FAST},
    month = jul,
    pages = {80-93},
    title = {Parallel Extension of a Dynamic Performance Forecasting Tool},
    year = 2002 
    }
    




17. Eddy Caron and Gil Utard. Parallel Out-of-Core Matrix Inversion. In IPDPS'02. The 16th International Parallel and Distributed Processing Symposium, Fort Lauderdale, 15-18 # apr 2002.
    Keywords: Out-of-core.
    

    @InProceedings{ InProceedingsCaron.CU_02,
    address = {Fort Lauderdale},
    author = {Caron, Eddy and Gil Utard},
    booktitle = {IPDPS'02. The 16th International Parallel and Distributed Processing Symposium},
    keywords = {Out-of-core},
    month = {15-18} # apr,
    title = {Parallel Out-of-Core Matrix Inversion},
    year = 2002 
    }
    




18. Philippe Combes, Frédéric Lombard, Martin Quinson, and Frédéric Suter. A Scalable Approach to Network Enabled Servers. In A. Jean-Marie, editor, Advances in Computing Science - ASIAN 2002. Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster Computing. Seventh Asian Computing Science Conference, volume 2550 of Lecture Notes in Computer Science, Hano\Å¡i, Vietnam, pages 110--124, December 2002. Springer-Verlag.
    

    @InProceedings{ InProceedingsCombes.CLQS_02,
    author = {Combes, Philippe and Lombard, Fr\'ed\'eric and Quinson, Martin and Suter, Fr\'ed\'eric},
    title = {{A Scalable Approach to Network Enabled Servers}},
    booktitle = {Advances in Computing Science - ASIAN 2002. Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster Computing. Seventh Asian Computing Science Conference},
    year = 2002,
    month = dec,
    editor = {A. Jean-Marie},
    pages = {110--124},
    address = {Hano\Å¡i, Vietnam},
    series = {Lecture Notes in Computer Science},
    volume = 2550,
    publisher = {Springer-Verlag} 
    }
    




19. Olivier Cozette, Cyril Randriamaro, and Gil Utard. Improving Cluster IO Performance with Remote Efficient Access to Distant Device. In IEEE Workshop on High Speed Local Network (HSLN'02), Tampas, Florida, US, November 2002.
    

    @InProceedings{ InProceedingsCozette.CRU_02,
    author = {Olivier Cozette and Cyril Randriamaro and Gil Utard},
    title = {{Improving Cluster IO Performance with Remote Efficient Access to Distant Device}},
    booktitle = {IEEE Workshop on High Speed Local Network (HSLN'02)},
    year = 2002,
    address = {Tampas, Florida, US},
    month = nov 
    }
    




20. Holly Dail, Henri Casanova, and Fran Berman. A Decoupled Scheduling Approach for the GrADS Environment. In Proceedings of the IEEE/ACM SC2002 Conference (SC'02), Baltimore, Maryland, November 2002. IEEE.
    

    @InProceedings{ InProceedingsDail.DCB_02,
    author = {Holly Dail and Henri Casanova and Fran Berman},
    title = {A Decoupled Scheduling Approach for the GrADS Environment},
    booktitle = {Proceedings of the IEEE/ACM SC2002 Conference ({SC'02})},
    publisher = {IEEE},
    address = {Baltimore, Maryland},
    month = nov,
    year = {2002} 
    }
    




21. Abdou Guermouche, Jean-Yves L'Excellent, and Gil Utard. Impact of Sparse Matrix Reordering Techniques on the Memory Usage of a Parallel Multifrontal Solver. In 2nd International workshop on Parallel Matrix Algorithms and Applications (PMAA'02), November 2002.
    

    @InProceedings{ InProceedingsGuermouche.GLU_02,
    title = "{Impact of Sparse Matrix Reordering Techniques on the Memory Usage of a Parallel Multifrontal Solver}",
    author = {Abdou Guermouche and Jean-Yves L'Excellent and Gil Utard},
    booktitle = {2nd International workshop on Parallel Matrix Algorithms and Applications (PMAA'02)},
    month = nov,
    year = {2002} 
    }
    




22. Marc Herbert, Pascale Primet, Bernard Tourancheau, and Laurent Lefevre. A scalable and fully distributed architecture for Ethernet switching. In Proceedings of the 2002 Workshop on High Performance Switching and Routing (HPSR 2002), Kobe, Hyogo pref., Japan, pages 234--238, May 2002. IEICE Communication Society, IEEE.
    

    @InProceedings{ InProceedingsHerbert.HPTL_02,
    address = {Kobe, Hyogo pref., Japan},
    author = {Marc Herbert and Pascale Primet and Bernard Tourancheau and Laurent Lefevre},
    booktitle = {Proceedings of the 2002 Workshop on High Performance Switching and Routing (HPSR 2002)},
    month = may,
    organization = {IEICE Communication Society},
    pages = {234--238},
    publisher = {IEEE},
    title = {A scalable and fully distributed architecture for Ethernet switching},
    url = {http://www.ieice.or.jp/hpsr2002/},
    year = {2002} 
    }
    




23. Ken Kennedy, Mark Mazina, John Mellor-Crummey, Keith Cooper, Linda Torczon, Fran Berman, Andrew Chien, Holly Dail, Otto Sievert, Dave Angulo, Ian Foster, Dennis Gannon, Lennart Johnsson, Carl Kesselman, Ruth Aydt, Daniel Reed, Jack Dongarra, Sathish Vadhiyar, and Rich Wolski. Toward a Framework for Preparing and Executing Adaptive Grid Programs. In Proceedings of NSF Next Generation Systems Program Workshop, Fort Lauderdale, Florida, April 2002.
    Note: In conjunction with IPDPS'2002.
    

    @InProceedings{ InProceedingsKennedy.KMMCTBCDSAFGJKARD_02,
    author = {Ken Kennedy and Mark Mazina and John Mellor-Crummey and Keith Cooper and Linda Torczon and Fran Berman and Andrew Chien and Holly Dail and Otto Sievert and Dave Angulo and Ian Foster and Dennis Gannon and Lennart Johnsson and Carl Kesselman and Ruth Aydt and Daniel Reed and Jack Dongarra and Sathish Vadhiyar and Rich Wolski},
    title = {Toward a Framework for Preparing and Executing Adaptive Grid Programs},
    booktitle = {Proceedings of NSF Next Generation Systems Program Workshop},
    note = {in conjunction with IPDPS'2002},
    address = {Fort Lauderdale, Florida},
    month = apr,
    year = {2002} 
    }
    




24. Arnaud Legrand. Simulation pour l'ordonnancement distribué. In GRID'2002, Actes de l'école thématique sur la globalisation des ressources informatiques et des données, pages 155-164, 2002. INRIA Lorraine.
    

    @InProceedings{ InProceedingsLegrand.L_02,
    author = "Arnaud Legrand",
    booktitle = "{GRID'2002}, Actes de l'\'ecole th\'ematique sur la globalisation des ressources informatiques et des donn\'ees",
    publisher = "INRIA Lorraine",
    title = "Simulation pour l'ordonnancement distribu\'e",
    pages = "155-164",
    year = "2002" 
    }
    




25. Martin Quinson. Dynamic Performance Forecasting for Network-Enabled Servers in a Metacomputing Environment. In International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'02), apr # 15-19 2002.
    

    @InProceedings{ InProceedingsQuinson.Q_02,
    author = {Martin Quinson},
    title = {Dynamic Performance Forecasting for Network-Enabled Servers in a Metacomputing Environment},
    booktitle = {International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'02)},
    month = apr # "{15-19}",
    year = {2002} 
    }
    




26. A. Su, H. Casanova, and F. Berman. Utilizing DAG Scheduling Algorithms for Entity-Level Simulations. In Proceedings of the High Performance Computing Symposium (HPC 2002), 2002.
    

    @InProceedings{ InProceedingsSu.SCB_02,
    author = {A. Su and H. Casanova and F. Berman},
    title = {{Utilizing DAG Scheduling Algorithms for Entity-Level Simulations}},
    booktitle = {{Proceedings of the High Performance Computing Symposium (HPC 2002)}},
    year = 2002 
    }
    




27. Frédéric Vivien. On the Optimality of Feautrier's Scheduling Algorithm. In Proceedings of Euro-Par 2002, volume 2400 of LNCS, pages 299-308, 2002. Springer-Verlag.
    

    @InProceedings{ InProceedingsVivien.V_02,
    author = {Fr\'ed\'eric Vivien},
    title = {On the Optimality of {F}eautrier's Scheduling Algorithm},
    booktitle = {Proceedings of Euro-Par 2002},
    pages = {299-308},
    year = 2002,
    volume = 2400,
    series = {LNCS},
    publisher = {Springer-Verlag} 
    }
    

1. Patrick R. Amestoy, Iain S. Duff, Jacko Koster, and Jean-Yves L'Excellent. MUltifrontal Massively Parallel Solver (MUMPS Version 4.2 beta) Users' guide. Research report TR2002-02, LIP, Lyon, France, December 2002.
   Note: Also ENSEEIHT-IRIT Technical Report RT/APO/02/2.
   

   @TechReport{ TechReportRR-LIP-TR2002-02,
   title = "{{MU}ltifrontal {M}assively {P}arallel {S}olver ({MUMPS} Version 4.2 beta) Users' guide}",
   author = {Patrick R. Amestoy and Iain S. Duff and Jacko Koster and Jean-Yves L'Excellent},
   institution = {LIP},
   number = {TR2002-02},
   address = {Lyon, France},
   year = 2002,
   month = dec,
   type = {Research report},
   note = {Also ENSEEIHT-IRIT Technical Report RT/APO/02/2} 
   }
   




2. Cyril Banino, Olivier Beaumont, Arnaud Legrand, and Yves Robert. Scheduling strategies for master-slave tasking on heterogeneous processor grids. Technical report 2002-12, LIP, March 2002.

   Abstract:

   In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous grid computing platform. We use a non-oriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters. Because spanning trees are easier to deal with in practice (there is a single path from the master to each node), a natural question arises: how to extract the best spanning tree, i.e. the one with optimal steady-state throughput, out of a general interconnection graph? We show that this problem is NP-hard. Even worse, we show that there exist heterogeneous networks for which the optimal spanning tree has a throughput which is arbitrarily bad in front of the throughput that can be achieved by the optimal (multiple-path) solution. Still, we introduce and compare several low-complexity heuristics to determine a sub-optimal spanning tree. Fortunately, we observe that the best heuristics do achieve an excellent performance in most experiments.

   
   

   @TechReport{ TechReportRR-LIP-2002-12,
   author = {Cyril Banino and Olivier Beaumont and Arnaud Legrand and Yves Robert},
   title = {Scheduling strategies for master-slave tasking on heterogeneous processor grids},
   institution = {LIP},
   year = {2002},
   number = {2002-12},
   month = mar,
   postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-12.ps.gz},
   abstract = {In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous grid computing platform. We use a non-oriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters. Because spanning trees are easier to deal with in practice (there is a single path from the master to each node), a natural question arises: how to extract the best spanning tree, i.e. the one with optimal steady-state throughput, out of a general interconnection graph? We show that this problem is NP-hard. Even worse, we show that there exist heterogeneous networks for which the optimal spanning tree has a throughput which is arbitrarily bad in front of the throughput that can be achieved by the optimal (multiple-path) solution. Still, we introduce and compare several low-complexity heuristics to determine a sub-optimal spanning tree. Fortunately, we observe that the best heuristics do achieve an excellent performance in most experiments.} 
   }
   




3. Olivier Beaumont, Arnaud Legrand, and Yves Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. Technical report 2002-7, LIP, February 2002.

   Abstract:

   In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication capabilities. We assume communication-computation overlap for each slave (and for the master), but the communication medium is exclusive: the master can only communicate with a single slave at each time-step. We give a polynomial-time algorithm to solve the following scheduling problem: given a time-bound T, what is the maximal number of tasks that can be processed by the master and the p slaves within T time-units?.

   
   

   @TechReport{ TechReportRR-LIP-2002-7,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   title = {A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs},
   institution = {LIP},
   year = {2002},
   number = {2002-7},
   month = feb,
   postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-07.ps.gz},
   abstract = {In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication capabilities. We assume communication-computation overlap for each slave (and for the master), but the communication medium is exclusive: the master can only communicate with a single slave at each time-step. We give a polynomial-time algorithm to solve the following scheduling problem: given a time-bound T, what is the maximal number of tasks that can be processed by the master and the p slaves within T time-units?.} 
   }
   




4. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Static scheduling strategies for heterogeneous systems. Technical report 2002-29, LIP, July 2002.

   Abstract:

   In this paper, we consider static scheduling techniques for heterogeneous systems, such as clusters and grids. We successively deal with minimum makespan scheduling, divisible load scheduling and steady-state scheduling. Finally, we discuss the limitations of static scheduling approaches.

   
   

   @TechReport{ TechReportRR-LIP-2002-29,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   title = {Static scheduling strategies for heterogeneous systems},
   institution = {LIP},
   year = {2002},
   number = {2002-29},
   month = jul,
   postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-29.ps.gz},
   abstract = {In this paper, we consider static scheduling techniques for heterogeneous systems, such as clusters and grids. We successively deal with minimum makespan scheduling, divisible load scheduling and steady-state scheduling. Finally, we discuss the limitations of static scheduling approaches.} 
   }
   




5. Olivier Beaumont, Arnaud Legrand, and Yves Robert. Scheduling strategies for mixed data and task parallelism on heterogeneous processor grids. Technical report 2002-20, LIP, May 2002.

   Abstract:

   In this paper, we consider the execution of a complex application on a heterogeneous grid computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples. We use a non-oriented graph to model the grid platform, where resources have different speeds of computation and communication. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph.

   
   

   @TechReport{ TechReportRR-LIP-2002-20,
   author = {Olivier Beaumont and Arnaud Legrand and Yves Robert},
   title = {Scheduling strategies for mixed data and task parallelism on heterogeneous processor grids},
   institution = {LIP},
   year = {2002},
   number = {2002-20},
   month = may,
   postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-20.ps.gz},
   abstract = {In this paper, we consider the execution of a complex application on a heterogeneous grid computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples. We use a non-oriented graph to model the grid platform, where resources have different speeds of computation and communication. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph.} 
   }
   




6. Yves Caniou and Emmanuel Jeannot. Dynamic Mapping of a Metatask on the Grid: Historical Trace, Minimum Perturbation and Minimum Length Heuristics. Research report 4620, LORIA, nancy, October 2002.
   

   @TechReport{ TechReportRR-LORIA-4620,
   author = {Yves Caniou and Emmanuel Jeannot},
   address = {nancy},
   institution = {LORIA},
   number = {4620},
   title = {Dynamic Mapping of a Metatask on the Grid: Historical Trace, Minimum Perturbation and Minimum Length Heuristics},
   month = oct,
   type = {Research report},
   year = {2002} 
   }
   




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

   @TechReport{ TechReportRR-Laboratoire-2002-21,
   author = {Caron, Eddy and Combes, Philippe and Contassot-Vivier, Sylvain and Desprez, Fr{\'e}d{\'e}ric and Lombard, Fr{\'e}d{\'e}ric and Nicod, Jean-Marc and Quinson, Martin and Suter, Fr{\'e}d{\'e}ric},
   institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
   keywords = {Grid Computing, DIET},
   month = may,
   note = {Also available as INRIA Research Report RR-4501},
   number = {2002-21},
   postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-21.ps.gz},
   title = {A Scalable Approach to Network Enabled Servers},
   type = {Research report},
   year = 2002 
   }
   




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

   @TechReport{ TechReportRR-Institut-RR-4501,
   author = {Caron, Eddy and Combes, Philippe and Contassot-Vivier, Sylvain and Desprez, Fr{\'e}d{\'e}ric and Lombard, Fr{\'e}d{\'e}ric and Nicod, Jean-Marc and Quinson, Martin and Suter, Fr{\'e}d{\'e}ric},
   institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
   keywords = {Grid Computing, DIET},
   month = jun,
   note = {Also available as LIP Research Report 2002-21},
   number = {RR-4501},
   postscript = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4501.ps.gz},
   title = {A Scalable Approach to Network Enabled Servers},
   type = {Research report},
   year = 2002 
   }
   




9. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. Research report RR-4470, Institut National de Recherche en Informatique et en Automatique (INRIA), June 2002.
   Note: Also available as LIP Research Report 2002-19.
   Keywords: Performance Forecasting, FAST.
   

   @TechReport{ TechReportRR-Institut-RR-4470,
   author = {Caron, Eddy and Suter, Fr{\'e}d{\'e}ric},
   institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
   keyword = {Performance Forecasting, FAST},
   month = jun,
   note = {Also available as LIP Research Report 2002-19},
   number = {RR-4470},
   postscript = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-4470.ps.gz},
   title = {Parallel Extension of a Dynamic Performance Forecasting Tool},
   type = {Research report},
   year = 2002 
   }
   




10. Eddy Caron and Frédéric Suter. Parallel Extension of a Dynamic Performance Forecasting Tool. Research report 2002-19, Laboratoire de l'Informatique du Parallélisme (LIP), May 2002.
    Keywords: Performance Forecasting, FAST, Metacomputing, Modeling, Parallel routines.
    

    @TechReport{ TechReportRR-Laboratoire-2002-19,
    author = {Caron, Eddy and Suter, Fr{\'e}d{\'e}ric},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Performance Forecasting, FAST, Metacomputing, Modeling, Parallel routines},
    month = may,
    number = {2002-19},
    postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-19.ps.gz},
    title = {Parallel Extension of a Dynamic Performance Forecasting Tool},
    type = {Research report},
    year = {2002} 
    }
    




11. Eddy Caron and Gil Utard. Parallel Out-of-Core Matrix Inversion.. Research report 2002-04, Laboratoire de l'Informatique du Parallélisme (LIP), January 2002.
    Keywords: Out-of-core.
    

    @TechReport{ TechReportRR-Laboratoire-2002-04,
    author = {Caron, Eddy and Utard, Gil},
    institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
    keywords = {Out-of-core},
    month = jan,
    number = {2002-04},
    postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-04.ps.Z},
    title = {Parallel Out-of-Core Matrix Inversion.},
    type = {Research report},
    year = {2002} 
    }
    




12. H. Casanova and L. Marchal. A Network Model for Simulation of Grid Application. Research Report RR-2002-40, LIP, ENS Lyon, France, October 2002.
    Note: Also available as INRIA Research Report RR-4596.
    

    @TechReport{ TechReportRR-LIP-RR-2002-40,
    author = {H. Casanova and L. Marchal},
    address = {ENS Lyon, France},
    institution = {LIP},
    title = {A Network Model for Simulation of Grid Application},
    number = {RR-2002-40},
    month = oct,
    year = {2002},
    type = {Research Report},
    note = {Also available as INRIA Research Report RR-4596},
    postscript = {pubs/RR2002-40.ps.gz} 
    }
    




13. Abdou Guermouche, Jean-Yves L'Excellent, and Gil Utard. On the memory Usage of a Parallel Multifrontal Solver. Research report RR-4617, INRIA, 2002.
    Note: Also LIP report RR2002-42.
    

    @TechReport{ TechReportRR-INRIA-RR-4617,
    title = {On the memory Usage of a Parallel Multifrontal Solver},
    author = {Abdou Guermouche and Jean-Yves L'Excellent and Gil Utard},
    institution = {INRIA},
    number = {RR-4617},
    year = {2002},
    type = {Research report},
    note = "Also LIP report RR2002-42" 
    }
    




14. Abdou Guermouche, Jean-Yves L'Excellent, and Gil Utard. On the memory Usage of a Parallel Multifrontal Solver. Research report RR-2002-42, LIP, 2002.
    Note: Also INRIA report RR-4617.
    

    @TechReport{ TechReportRR-LIP-RR-2002-42,
    title = {On the memory Usage of a Parallel Multifrontal Solver},
    author = {Abdou Guermouche and Jean-Yves L'Excellent and Gil Utard},
    institution = {LIP},
    number = {RR-2002-42},
    year = {2002},
    type = {Research report},
    note = "Also INRIA report RR-4617" 
    }
    




15. Arnaud Legrand and Julien Lerouge. MetaSimGrid : Towards realistic scheduling simulation of distributed applications. Technical report 2002-28, LIP, July 2002.

    Abstract:

    Most scheduling problems are already hard on homogeneous platforms, they become quite intractable in an heterogeneous framework such as a metacomputing grid. In the best cases, a guaranteed heuristic can be found, but most of the time, it is not possible. Real experiments or simulations are often involved to test or to compare heuristics. However, on a distributed heterogeneous platform, such experiments are technically difficult to drive, because of the genuine instability of the platform. It is almost impossible to guarantee that a platform which is not dedicated to the experiment, will remain exactly the same between two tests, thereby forbidding any meaningful comparison. Simulations are then used to replace real experiments, so as to ensure the reproducibility of measured data. A key issue is the possibility to run the simulations against a realistic environment. The main idea of trace-based simulation is to record the platform parameters today, and to simulate the algorithms tomorrow, against the recorded data: even though it is not the current load of the platform, it is realistic, because it represents a fair summary of what happened previously. A good example of a trace-based simulation tool is SimGrid, a toolkit providing a set of core abstractions and functionalities that can be used to easily build simulators for specific application domains and/or computing environment topologies. Nevertheless, SimGrid lacks a number of convenient features to craft simulations of a distributed application where scheduling decisions are not taken by a single process. Furthermore, modeling a complex platform by hand is fastidious for a few hosts and is almost impossible for a real grid. This report is a survey on simulation for scheduling evaluation purposes and present MetaSimGrid, a simulator built on top of SimGrid.

    
    

    @TechReport{ TechReportRR-LIP-2002-28,
    author = {Arnaud Legrand and Julien Lerouge},
    title = {MetaSimGrid : Towards realistic scheduling simulation of distributed applications},
    institution = {LIP},
    year = {2002},
    number = {2002-28},
    month = jul,
    postscript = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-28.ps.gz},
    abstract = {Most scheduling problems are already hard on homogeneous platforms, they become quite intractable in an heterogeneous framework such as a metacomputing grid. In the best cases, a guaranteed heuristic can be found, but most of the time, it is not possible. Real experiments or simulations are often involved to test or to compare heuristics. However, on a distributed heterogeneous platform, such experiments are technically difficult to drive, because of the genuine instability of the platform. It is almost impossible to guarantee that a platform which is not dedicated to the experiment, will remain exactly the same between two tests, thereby forbidding any meaningful comparison. Simulations are then used to replace real experiments, so as to ensure the reproducibility of measured data. A key issue is the possibility to run the simulations against a realistic environment. The main idea of trace-based simulation is to record the platform parameters today, and to simulate the algorithms tomorrow, against the recorded data: even though it is not the current load of the platform, it is realistic, because it represents a fair summary of what happened previously. A good example of a trace-based simulation tool is SimGrid, a toolkit providing a set of core abstractions and functionalities that can be used to easily build simulators for specific application domains and/or computing environment topologies. Nevertheless, SimGrid lacks a number of convenient features to craft simulations of a distributed application where scheduling decisions are not taken by a single process. Furthermore, modeling a complex platform by hand is fastidious for a few hosts and is almost impossible for a real grid. This report is a survey on simulation for scheduling evaluation purposes and present MetaSimGrid, a simulator built on top of SimGrid.} 
    }
    




16. Frédéric Vivien and Nicolas Wicker. Minimal Enclosing Parallelepiped in 3D. Research report RR-2002-49, Laboratoire de l'Informatique du Parallélisme (LIP), December 2002.
    Note: Also INRIA Research Report RR-4685.
    

    @TechReport{ TechReportRR-Laboratoire-RR-2002-49,
    author = {Fr\'ed\'eric Vivien and Nicolas Wicker},
    title = {Minimal {E}nclosing {P}arallelepiped in 3{D}},
    institution = {Laboratoire de l'Informatique du Parall\'elisme (LIP)},
    year = 2002,
    number = {RR-2002-49},
    month = dec,
    type = {Research report},
    note = {Also INRIA Research Report RR-4685} 
    }
    

1. Holly Dail. A Modular Framework for Adaptive Scheduling in Grid Application Development Environments. Master's thesis, University of California, San Diego, March 2002.
   

   @MastersThesis{ MastersThesisMSc-Dail_02,
   author = {Holly Dail},
   title = {A Modular Framework for Adaptive Scheduling in Grid Application Development Environments},
   school = {University of California, San Diego},
   month = mar,
   year = {2002} 
   }
   

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