Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/26182
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNEMETH, Balazs-
dc.contributor.authorHABER, Tom-
dc.contributor.authorLIESENBORGS, Jori-
dc.contributor.authorLAMOTTE, Wim-
dc.date.accessioned2018-06-26T11:05:02Z-
dc.date.available2018-06-26T11:05:02Z-
dc.date.issued2018-
dc.identifier.citationShi, Yong; Fu, Haohuan; Tian, Yingjie; Krzhizhanovskaya, Valeria V.; Lees, Michael Harold; Dongarra, Jack; Sloot, Peter M. A. (Ed.). Computational Science – ICCS 2018, Springer,p. 799-805-
dc.identifier.isbn9783319937007-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/1942/26182-
dc.description.abstractRoulette Wheel Sampling, sometimes referred to as Fitness Proportionate Selection, is a method to sample from a set of objects each with an associated weight. This paper introduces a distributed version of the method designed for message passing environments. Theoretical bounds are derived to show that the presented method has better scalability than naive approaches. This is verified empirically on a test cluster, where improved speedup is measured. In all tested configurations, the presented method performs better than naive approaches. Through a renumbering step, communication volume is minimized. This step also ensures reproducibility regardless of the underlying architecture.-
dc.description.sponsorshipThe work has been partially supported by the Ministerio de Economia y Competitividad under projects ENE2017-89029-P and MTM2014-58159-P, the Generalitat Valenciana under PROMETEO II/2014/008 and the Universitat Politècnica de València under FPI-2013.-
dc.language.isoen-
dc.publisherSpringer-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.rights(C) Springer International Publishing AG, part of Springer Nature 2018-
dc.subject.othergenetic algorithms; roulette wheel selection; sequential; Monte Carlo; HPC; message passing-
dc.titleReproducible Roulette Wheel Sampling for Message Passing Environments-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsShi, Yong-
local.bibliographicCitation.authorsFu, Haohuan-
local.bibliographicCitation.authorsTian, Yingjie-
local.bibliographicCitation.authorsKrzhizhanovskaya, Valeria V.-
local.bibliographicCitation.authorsLees, Michael Harold-
local.bibliographicCitation.authorsDongarra, Jack-
local.bibliographicCitation.authorsSloot, Peter M. A.-
local.bibliographicCitation.conferencedate11-13/06/2018-
local.bibliographicCitation.conferencenameICCS 2018: Computational Science – ICCS 2018-
local.bibliographicCitation.conferenceplaceWuxi, China-
dc.identifier.epage805-
dc.identifier.spage799-
local.bibliographicCitation.jcatC1-
local.publisher.placeCham, Switzerland-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr10861-
dc.identifier.doi10.1007/978-3-319-93701-4_63-
local.bibliographicCitation.btitleComputational Science – ICCS 2018-
item.contributorNEMETH, Balazs-
item.contributorHABER, Tom-
item.contributorLIESENBORGS, Jori-
item.contributorLAMOTTE, Wim-
item.validationvabb 2020-
item.fullcitationNEMETH, Balazs; HABER, Tom; LIESENBORGS, Jori & LAMOTTE, Wim (2018) Reproducible Roulette Wheel Sampling for Message Passing Environments. In: Shi, Yong; Fu, Haohuan; Tian, Yingjie; Krzhizhanovskaya, Valeria V.; Lees, Michael Harold; Dongarra, Jack; Sloot, Peter M. A. (Ed.). Computational Science – ICCS 2018, Springer,p. 799-805.-
item.accessRightsOpen Access-
item.fulltextWith Fulltext-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
iccs2018_balazs_nemeth.pdf
  Restricted Access
Published version191.31 kBAdobe PDFView/Open    Request a copy
_469698_1_En_63_Chapter_Author.pdfPeer-reviewed author version392.41 kBAdobe PDFView/Open
Show simple item record

Page view(s)

76
checked on Sep 7, 2022

Download(s)

178
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.