Show simple item record

dc.contributorAyguadé Parra, Eduard
dc.contributorBader, David A.
dc.contributor.authorMunguía Conejero, Lluís-Miquel
dc.date.accessioned2012-06-26T14:38:04Z
dc.date.issued2011-12-23
dc.identifier.urihttp://hdl.handle.net/2099.1/15451
dc.description.abstractBreadth-first search (BFS) is an essential graph traversal strategy widely used in computing applications. We introduce a parallelization strategy that allows the load balancing of computation resources as well as the execution of graph traversals in hybrid environments composed of CPUs and GPUs.
dc.language.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.publisherGeorgia Institute of Technology
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshParallel processing (Electronic computers)
dc.subject.lcshGraphics Processing Units
dc.subject.lcshComputer algorithms
dc.subject.otherBFS
dc.subject.otherGPU
dc.subject.otherCPU
dc.subject.otherhigh perfomance computing
dc.subject.otherOmpSs
dc.subject.othergraphs
dc.subject.otherhybrid architectures
dc.titleTask-based parallel breadth-first search in heterogeneous environments
dc.typeMaster thesis (pre-Bologna period)
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.subject.lemacAlgorismes computacionals
dc.identifier.slug85601
dc.rights.accessRestricted access - confidentiality agreement
dc.date.lift10000-01-01
dc.date.updated2012-06-22T13:36:14Z
dc.audience.educationlevelEstudis de primer/segon cicle
dc.audience.mediatorFacultat d'Informàtica de Barcelona


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder