Mostrar el registro sencillo del ítem

Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems

hal.structure.identifierSchool of Global Information and Telecommunication Studies [Waseda] [GITS]
dc.contributor.authorGHATPANDE, Abhay
hal.structure.identifierSchool of Global Information and Telecommunication Studies [Waseda] [GITS]
dc.contributor.authorNAKAZATO, Hidenori
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorBEAUMONT, Olivier
hal.structure.identifierSchool of Global Information and Telecommunication Studies [Waseda] [GITS]
dc.contributor.authorWATANABE, Hiroshi
dc.date.accessioned2024-04-15T09:53:57Z
dc.date.available2024-04-15T09:53:57Z
dc.date.issued2008
dc.identifier.issn0916-8516
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198640
dc.description.abstractEnDivisible Load Theory (DLT) is an established framework to study Divisible Load Scheduling (DLS). Traditional DLT ignores the result collection phase, and specifies no solution to the general case where both the network speed and computing capacity of the nodes are heterogeneous. In this paper, the DLS with Result Collection on HETerogeneous Systems (DLSRCHETS) problem is formulated as a linear program and analyzed. The papers to date that have dealt with result collection, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions. The main contributions of this paper are: (a) A proof of the Allocation Precedence Condition, which is inconsequential in LIFO or FIFO, but is important in a general schedule. (b) A proof of the Idle Time Theorem, which states that irrespective of whether load is allocated to all available processors, in the optimal solution to the DLSRCHETS problem, at the most one processor that is allocated load has idle time, and that the idle time exists only when the result collection begins immediately after the completion of load distribution.
dc.description.sponsorshipALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
dc.language.isoen
dc.publisherInstitute of Electronics, Information and Communication Engineers
dc.title.enAnalysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.journalIEICE Transactions on Communications
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierinria-00336236
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00336236v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEICE%20Transactions%20on%20Communications&rft.date=2008&rft.eissn=0916-8516&rft.issn=0916-8516&rft.au=GHATPANDE,%20Abhay&NAKAZATO,%20Hidenori&BEAUMONT,%20Olivier&WATANABE,%20Hiroshi&rft.genre=article


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem