- Anasayfa
- Bölüm Hakkında
- Akademik Programlar
- Dersler
- Etkinlikler
- İletişim
- Araştırma Alanları
- Bilgisayar Mühendisliği
- Burslular
- Kitaplar
- Laboratuvarlar
- Ofis Saatleri
- Projeler
- Yayınlar
- gömülü sistemler laboratuvarı
- kablosuz ağlar laboratuvarı
- kasırga laboratuvarı
- mikroişlemciler laboratuvarı
- multimedya laboratuvarı
- veri tabanı sistemleri ve internet programlama laboratuvarı
- yüksek başarımlı hesaplama laboratuvarı
- İdari Kadro
- İş Duyuruları
| Başlık | Early register deallocation mechanisms using checkpointed register files |
| Publication Type | Journal Article |
| Year of Publication | 2006 |
| Authors | Ergin O, Balkan D, Ponomarev D, Ghose K |
| Journal | IEEE TRANSACTIONS ON COMPUTERS |
| Volume | 55 |
| Issue | 9 |
| Pagination | 1153-1166 |
| Date Published | SEP |
| ISSN | 0018-9340 |
| Abstract | Modern superscalar microprocessors need sizable register files to support a large number of in-flight instructions for exploiting instruction level parallelism (ILP). An alternative to building large register files is to use a smaller number of registers, but manage them more effectively. More efficient management of registers can also result in higher performance if the reduction of the register file size is not the goal. Traditional register file management mechanisms deallocate a physical register only when the next instruction writing to the same destination architectural register commits. In this paper, we propose several techniques for deallocating physical registers much earlier. Our designs rely on the use of a checkpointed register file (CRF), where a local shadow copy of each bitcell is used to temporarily save the values of the early deallocated registers should they be needed to recover from branch mispredictions or to reconstruct the precise state after exceptions or interrupts. The proposed techniques try to release registers as soon as possible and are more aggressive than the previously proposed schemes for early deallocation of registers. |