Show simple item record

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithms and high performance computing for grand challenge applications [SCALAPPLIX]
dc.contributor.authorBEAUMONT, Olivier
hal.structure.identifierDepartment of Computer Science and Engineering [Univ California San Diego] [CSE - UC San Diego]
dc.contributor.authorCARTER, Larry
hal.structure.identifierDepartment of Computer Science and Engineering [Univ California San Diego] [CSE - UC San Diego]
dc.contributor.authorFERRANTE, Jeanne
hal.structure.identifierMiddleware efficiently scalable [MESCAL]
dc.contributor.authorLEGRAND, Arnaud
hal.structure.identifierLaboratoire de l'Informatique du Parallélisme [LIP]
hal.structure.identifierAlgorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL]
dc.contributor.authorMARCHAL, Loris
hal.structure.identifierAlgorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL]
hal.structure.identifierLaboratoire de l'Informatique du Parallélisme [LIP]
dc.contributor.authorROBERT, Yves
dc.date.accessioned2024-04-15T09:43:55Z
dc.date.available2024-04-15T09:43:55Z
dc.date.issued2006
dc.date.conference2006
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/197802
dc.description.abstractEnMultiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and efficient execution on master-worker platforms where the communication is restricted to a tree embedded in the network. The goal of the scheduling is to obtain the best throughput while enforcing some fairness between applications. We show how to derive an asymptotically optimal periodic schedule by solving a linear program expressing all problem constraints. For single-level trees, the optimal solution can be analytically computed. For large-scale platforms, gathering the global knowledge needed by the linear programming approach might be unrealistic. One solution is to adapt the multi-commodity flow algorithm of Awerbuch and Leighton, but it still requires some global knowledge. Thus, we also investigates heuristic solutions using only local information, and test them via simulations. The best of our heuristics achieves the optimal performance on about two-thirds of our test cases, but is far worse in a few cases.
dc.description.sponsorshipALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
dc.language.isoen
dc.publisherIEEE Computer Society Press
dc.subject.enParallel computing
dc.subject.enresource sharing
dc.subject.enscheduling
dc.subject.endivisible load
dc.subject.enmultiple applications
dc.subject.enresource sharing.
dc.title.enCentralized Versus Distributed Schedulers Multiple Bag-of-Task Applications
dc.typeCommunication dans un congrès
dc.identifier.doi10.1109/TPDS.2007.70747
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleInternational Parallel and Distributed Processing Symposium IPDPS'2006
bordeaux.countryGR
bordeaux.conference.cityRhodes Island
bordeaux.peerReviewedoui
hal.identifierhal-00789440
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00789440v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2006&rft.au=BEAUMONT,%20Olivier&CARTER,%20Larry&FERRANTE,%20Jeanne&LEGRAND,%20Arnaud&MARCHAL,%20Loris&rft.genre=unknown


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record