Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/15113
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Faria, Nuno Filipe Monteiro | - |
dc.contributor.author | Silva, Rui C. | - |
dc.contributor.author | Sobral, João Luís Ferreira | - |
dc.date.accessioned | 2011-12-13T12:24:42Z | - |
dc.date.available | 2011-12-13T12:24:42Z | - |
dc.date.issued | 2011-09 | - |
dc.identifier.uri | https://hdl.handle.net/1822/15113 | - |
dc.description.abstract | Improving locality of memory accesses in current and future multi-core platforms is a key to efficiently exploit those platforms. Irregular applications, which operate on pointer-based data structures, are hard to optimize in modern computer architectures due to their intrinsic unpredictable patterns of memory accesses. In this paper we explore a memory locality-driven set of data-structures in order to attenuate the memory bandwidth limitations from typical irregular algorithms. We identify the inefficiencies in the standard Java implementation of a priority-queue as one of the main memory limitations in Prim’s Minimal Spanning Tree algorithm. We also present a priority-queue using the data layout inspired in Van Emde Boas for ordering heaps. We also implement optimizations in the graph data-structure and explore ways to efficiently combine it with the memory-efficient priority-queue. In order to improve efficiency in both case studies we had to transform the data-structures in the form of array of pointer into arrays of structures or structure of arrays. | eng |
dc.language.iso | eng | por |
dc.rights | openAccess | por |
dc.subject | Locality | por |
dc.subject | Irregular data structures | por |
dc.title | Enhancing locality in Java based irregular applications | por |
dc.type | conferencePaper | - |
dc.peerreviewed | yes | por |
sdum.publicationstatus | published | por |
oaire.citationConferenceDate | 08-09 Set. 2011 | - |
sdum.event.location | Coimbra, Portugal | - |
sdum.event.title | INForum 2011 - Simpósio de Informática | - |
Aparece nas coleções: | DI/CCTC - Artigos (papers) |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Inforum.pdf | 534,53 kB | Adobe PDF | Ver/Abrir |