This thesis introduces the Named-State Register File, a fine-grain, fully-associative register file. The NSF allows fast context switching between concurrent threads as well as efficient sequential program performance. The NSF holds more live data than conventional register files, and requires less spill and reload traffic to switch between contexts. This thesis demonstrates an implementation of the Named-State Register File and estimates the access time and chip area required for different organizations. Architectural simulations of large sequential and parallel applications show that the NSF can reduce execution time by 9% to 17% compared to alternative register files.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6780 |
| Date | 01 August 1993 |
| Creators | Nuth, Peter R. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 134 p., 1003600 bytes, 2027035 bytes, application/octet-stream, application/pdf |
| Relation | AITR-1459 |
Page generated in 0.0021 seconds