Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2009-04-13T19:27:33Z
dc.date.available 2009-04-13T03:00:00Z
dc.date.issued 2008-10
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/9636
dc.description.abstract One of the main challenges of modern processor designs is the implementation of scalable and efficient mechanisms to detect memory access order violations as a result of out-of-order execution. Conventional structures performing this task are complex, inefficient and power-hungry. This fact has generated a large body of work on optimizing address-based memory disambiguation logic, namely the load-store queue. In this paper we review the most significant proposals in this research field, focusing on our own contributions. en
dc.format.extent 132-138 es
dc.language en es
dc.subject Filtering es
dc.subject LSQ en
dc.subject memory disambiguation en
dc.subject energy-efficiency en
dc.title Memory disambiguation hardware: a review en
dc.type Articulo es
sedici.identifier.uri http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Oct08-1.pdf es
sedici.identifier.issn 1666-6038 es
sedici.creator.person Castro, Fernando es
sedici.creator.person Chaver, Daniel es
sedici.creator.person Piñuel, Luis es
sedici.creator.person Prieto, Manuel es
sedici.creator.person Tirado Fernández, Francisco es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc/3.0/
sedici.description.peerReview peer-review es
sedici2003.identifier ARG-UNLP-ART-0000000845 es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 8, no. 3 es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)