Full metadata record
DC FieldValueLanguage
dc.contributor.authorLange, Patrick
dc.contributor.authorWeller, Rene
dc.contributor.authorZachmann, Gabriel
dc.contributor.editorSkala, Václav
dc.date.accessioned2017-11-08T13:26:55Z
dc.date.available2017-11-08T13:26:55Z
dc.date.issued2014
dc.identifier.citationWSCG 2014: communication papers proceedings: 22nd International Conference in Central Europeon Computer Graphics, Visualization and Computer Visionin co-operation with EUROGRAPHICS Association, p. 383-390.en
dc.identifier.isbn978-80-86943-71-8
dc.identifier.uriwscg.zcu.cz/WSCG2014/!!_2014-WSCG-Communication.pdf
dc.identifier.urihttp://hdl.handle.net/11025/26438
dc.format8 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesWSCG 2014: communication papers proceedingsen
dc.rights@ Václav Skala - UNION Agencycs
dc.subjectsouběžné datové strukturycs
dc.subjectparalelní programovánícs
dc.subjectspráva pamětics
dc.subjectzáruka pokrokucs
dc.subjectmapacs
dc.subjectslovníkcs
dc.titleA framework for wait-free data exchange in massively threaded VR systemsen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedA central part of virtual reality systems and game engines is the generation, management and distribution of all relevant world states. In modern interactive graphic software systems usually many independent software components need to communicate and exchange data. Standard approaches suffer the n2 problem because the number of interfaces grows quadratically with the number of component functionalities. Such many-to-many architectures quickly become unmaintainable, not to mention latencies of standard concurrency control mechanisms. We present a novel method to manage concurrent multithreaded access to shared data in virtual environments. Our highly efficient low-latency and lightweight architecture is based on a new wait-free hash map using key-value pairs. This allows us to reduce the traditional many-to-many problem to a simple many-to-one approach. Our results show that our framework outperforms by more than two orders of magnitude standard lock-based but also modern lock-free methods significantly.en
dc.subject.translatedconcurrent data structuresen
dc.subject.translatedparallel programmingen
dc.subject.translatedmemory managementen
dc.subject.translatedprogress guaranteeen
dc.subject.translatedmapen
dc.subject.translateddictionaryen
dc.type.statusPeer-revieweden
Appears in Collections:WSCG 2014: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Lange.pdfPlný text5,15 MBAdobe PDFView/Open
Show simple item record


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/26438

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

search
navigation
  1. DSpace at University of West Bohemia
  2. Publikace ZČU / UWB Publications
  3. Sborníky ZČU / UWB Proceedings
  4. WSCG: Communication Papers
  5. WSCG 2014: Communication Papers Proceedings