Dynamic grid load sharing with adaptive dissemination protocols

dc.authoridErdil, D. Cenk/0000-0003-1380-3497
dc.authorwosidErdil, D. Cenk/ABE-8301-2020
dc.contributor.authorErdil, D. Cenk
dc.contributor.authorLewis, Michael J.
dc.date.accessioned2024-07-18T20:42:17Z
dc.date.available2024-07-18T20:42:17Z
dc.date.issued2012
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description.abstractScheduling in large scale dynamic grids comprising eclectic collections of resources is increasingly difficult. Autonomous resource neighborhoods may wish to determine the level of grid offered load that they can or will accept; different sites may wish to attract different amounts of load, to satisfy some desired property within a grid economy. This changes the traditional notion of load sharing, which generally assumes that the desired equilibrium should be an equal distribution of load across all participating machines, because they are under the jurisdiction of a single site, and therefore more likely to implement one common policy. In large-scale grids, nodes and neighborhoods should instead get a portion of the load that best matches their local policies for supporting and admitting grid jobs. This article describes information dissemination protocols that can distribute load in this way, without using load rebalancing through job migration, which is more difficult and costly in large-scale heterogeneous grids. Essentially, nodes adjust their advertising rates and aggressiveness to influence where jobs get scheduled. We report experimental results with example resource configurations in which each resource neighborhood determines its ideal grid load and disseminates accordingly. In turn, each neighborhood attracts the requisite amount of resource requests from the grid. Moreover, performance does not degrade: overall query satisfaction rates are within 9% of both adaptive dissemination protocols that use static adaptation policies, and static dissemination protocols that may be custom-tailored to specific resource and load distributions.en_US
dc.description.sponsorshipNSF [ACI-0133838, CNS-0454298]en_US
dc.description.sponsorshipThis research is supported by NSF Career Award ACI-0133838 and NSF Award CNS-0454298.en_US
dc.identifier.doi10.1007/s11227-010-0507-y
dc.identifier.endpage1166en_US
dc.identifier.issn0920-8542
dc.identifier.issn1573-0484
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-84897582154en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage1139en_US
dc.identifier.urihttps://doi.org/10.1007/s11227-010-0507-y
dc.identifier.urihttps://hdl.handle.net/11411/7223
dc.identifier.volume59en_US
dc.identifier.wosWOS:000299509500003en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofJournal of Supercomputingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGrid Resource Schedulingen_US
dc.subjectGrid Load Balancingen_US
dc.subjectInformation Disseminationen_US
dc.subjectHybrid Gridsen_US
dc.subjectHybrid Cloudsen_US
dc.titleDynamic grid load sharing with adaptive dissemination protocols
dc.typeArticle

Dosyalar