Show simple item record

dc.contributor.authorGajinov, Vladimir
dc.contributor.authorEric, Igor
dc.contributor.authorStojanovic, Saa
dc.contributor.authorMilutinovic, Veljko
dc.contributor.authorUnsal, Osman Sabri
dc.contributor.authorAyguadé Parra, Eduard
dc.contributor.authorCristal Kestelman, Adrián
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor.otherBarcelona Supercomputing Center
dc.date.accessioned2015-02-04T12:21:04Z
dc.date.created2014
dc.date.issued2014
dc.identifier.citationGajinov, V. [et al.]. A case study of hybrid dataflow and shared-memory programming models: Dependency-based parallel game engine. A: International Symposium on Computer Architecture and High Performance Computing. "IEEE 26th International Symposium on Computer Architecture and High Performance Computing: 22–24 October 2014: Paris, France: proceedings". París: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 1-8.
dc.identifier.isbn978-1-4799-6904-3
dc.identifier.urihttp://hdl.handle.net/2117/26204
dc.description.abstractRecently proposed hybrid dataflow and shared memory programming models combine these two underlying models in order to support a wider range of problems naturally. The effectiveness of such hybrid models for parallel implementations of dense and sparse algebra problems is well known. In this paper, we show another real world example for which hybrid dataflow models provide better support than traditional shared memory models. Specifically, we compare these models using the game engine parallelization as a case study. We show that hybrid dataflow models decrease the complexity of the parallel game engine implementation by eliminating or restructuring the explicit synchronization that is necessary in shared memory implementations. The corresponding implementations also exhibit good scala-bility and better speedup than the shared memory parallel implementations, especially in the case of a highly congested game world that contains a large number of game objects. Ultimately, on an eight core machine we were able to obtain 4.72x speedup compared to the sequential baseline, and to improve 49% over the lock-based parallel implementation based on work-sharing.
dc.format.extent8 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures paral·leles
dc.subject.lcshParallel processing (Electronic computers)
dc.subject.otherdataflow
dc.subject.othergame engine
dc.subject.othershared memory
dc.titleA case study of hybrid dataflow and shared-memory programming models: Dependency-based parallel game engine
dc.typeConference report
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1109/SBAC-PAD.2014.21
dc.description.peerreviewedPeer Reviewed
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac15404234
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorGajinov, V.; Eric, I.; Stojanovic, S.; Milutinovic, V.; Unsal, O.; Ayguade, E.; Cristal, A.
local.citation.contributorInternational Symposium on Computer Architecture and High Performance Computing
local.citation.pubplaceParís
local.citation.publicationNameIEEE 26th International Symposium on Computer Architecture and High Performance Computing: 22–24 October 2014: Paris, France: proceedings
local.citation.startingPage1
local.citation.endingPage8


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record