1 resultado para Orbital blocking
em Digital Commons - Michigan Tech
Filtro por publicador
- Aberdeen University (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (8)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (14)
- Aston University Research Archive (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (16)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (9)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (46)
- Boston University Digital Common (1)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (27)
- Cambridge University Engineering Department Publications Database (39)
- CentAUR: Central Archive University of Reading - UK (44)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (116)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (1)
- Digital Peer Publishing (4)
- DigitalCommons - The University of Maine Research (2)
- DigitalCommons@The Texas Medical Center (5)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- Earth Simulator Research Results Repository (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Harvard University (3)
- Helda - Digital Repository of University of Helsinki (28)
- Indian Institute of Science - Bangalore - Índia (226)
- Infoteca EMBRAPA (3)
- Livre Saber - Repositório Digital de Materiais Didáticos - SEaD-UFSCar (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (5)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (10)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (8)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (23)
- Queensland University of Technology - ePrints Archive (128)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (64)
- Universidad de Alicante (6)
- Universidad Politécnica de Madrid (9)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (1)
- Université de Lausanne, Switzerland (5)
- Université de Montréal, Canada (1)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (38)
- University of Queensland eSpace - Australia (18)
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.