1 resultado para Blocking
em Digital Commons - Michigan Tech
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (8)
- Aston University Research Archive (3)
- B-Digital - Universidade Fernando Pessoa - Portugal (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (29)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (12)
- Boston University Digital Common (4)
- Brock University, Canada (5)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (9)
- Cambridge University Engineering Department Publications Database (30)
- CentAUR: Central Archive University of Reading - UK (112)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (69)
- Cochin University of Science & Technology (CUSAT), India (5)
- CORA - Cork Open Research Archive - University College Cork - Ireland (7)
- Dalarna University College Electronic Archive (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (3)
- Digital Commons - Michigan Tech (1)
- Digital Peer Publishing (4)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (3)
- Diposit Digital de la UB - Universidade de Barcelona (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- Duke University (11)
- Earth Simulator Research Results Repository (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Greenwich Academic Literature Archive - UK (2)
- Harvard University (3)
- Helda - Digital Repository of University of Helsinki (20)
- Indian Institute of Science - Bangalore - Índia (65)
- Instituto Politécnico do Porto, Portugal (7)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (6)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (8)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (81)
- Queensland University of Technology - ePrints Archive (92)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (154)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (8)
- Universidade de Lisboa - Repositório Aberto (4)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (12)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (15)
- Université de Montréal, Canada (43)
- University of Michigan (29)
- University of Queensland eSpace - Australia (8)
- WestminsterResearch - UK (4)
Resumo:
Mower is a micro-architecture technique which targets branch misprediction penalties in superscalar processors. It speeds-up the misprediction recovery process by dynamically evicting stale instructions and fixing the RAT (Register Alias Table) using explicit branch dependency tracking. Tracking branch dependencies is accomplished by using simple bit matrices. This low-overhead technique allows overlapping of the recovery process with instruction fetching, renaming and scheduling from the correct path. Our evaluation of the mechanism indicates that it yields performance very close to ideal recovery and provides up to 5% speed-up and 2% reduction in power consumption compared to a traditional recovery mechanism using a reorder buffer and a walker. The simplicity of the mechanism should permit easy implementation of Mower in an actual processor.