Russell, Gordon and Shaw, Paul (1993) A stack-based register set. Technical Report. University of Strathclyde.
Full text not available from this repository. (Request a copy)Abstract/Description
Register windowing has become a common sight in high speed processors, reducing the memory traffic required to preserve register contents over sub-routine invocations. However, approaches to register windowing have changed little since their introduction. In this article, the current windowing schemes (namely fixed-sized and variable-sized) are presented, along with methods of implementation. A number of disadvantages with these systems are identified, and the requirements for an improved register windowing mechanism defined. A new register windowing paradigm is presented, known as Shifting Register Windows , which is design to meet these requirements. This windowing system is first given in overview, followed by a more detailed description of the underlying model. Finally, a performance analysis of the model is presented, and conclusions drawn on speed and efficiency.
| Item Type: | Monograph (Technical Report) |
|---|---|
| Additional Information: | RR-93-85 (formally ARCH-09-93) |
| Uncontrolled Keywords: | Register windowing; high speed processors; Shifting Register Windows; |
| University Divisions/Research Centres: | Faculty of Engineering, Computing and Creative Industries > School of Computing |
| Dewey Decimal Subjects: | 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data |
| Library of Congress Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Item ID: | 3189 |
| Depositing User: | Computing Research |
| Date Deposited: | 27 Aug 2010 11:59 |
| Last Modified: | 18 Aug 2011 12:56 |
| URI: | http://researchrepository.napier.ac.uk/id/eprint/3189 |
Actions (login required)
| View Item |

Tools
Tools