Dynamically allocating processor resources between nearby and distant ILP

Conference Proceedings - Annual International Symposium on Computer Architecture, ISCA

Volumn , Issue , 2001, Pages 26-37

  Balasubramonian, R ^a   Dwarkadas, S ^a   Albonesi, D H ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTER HARDWARE; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

DYNAMICALLY ALLOCATING PROCESSOR RESOURCES; INSTRUCTION LEVEL PARALLELISM; MICROARCHITECTURE; MULTITHREADING; SUPERSCALAR PROCESSORS;

REDUCED INSTRUCTION SET COMPUTING;

EID: 0034856729     PISSN: 08847495     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/379240.379249     Document Type: Conference Paper

References (36)

1. A dynamic multithreading processor
2. Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures
3. Dynamically allocating processor resources between nearby and distant ILP
4. The simplescalar toolset, version 2.0
5. Simultaneous subordinate microthreading (SSMT)
6. Effective hardware based data prefetching for high performance processors
7. Multiple-banked register file architectures
8. The NAS parallel benchmarks
9. Assisted execution
10. Improving data cache performance by pre-executing instructions under a cache miss
11. Dataflow analysis of branch misprediction and its application to early resolution of branch outcomes
12. Register file considerations in dynamically scheduled processors
13. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
14. The Alpha 21264 microprocessor
15. Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processors
16. Compiler-based prefetching for recursive data structures
17. Delaying physical register allocation through virtual-physical registers
18. Register renaming and dynamic speculation: An alternative approach
19. Design and evaluation of a compiler algorithm for prefetching
20. Code transformations to improve memory parallelism
21. Complexity-effective superscalar processors
22. Transient fault detection via simultaneous multithreading
23. Supporting dynamic data structures on distributed memory machines
24. AR-SMT: A microarchitectural approach to fault tolerance in microprocessors
25. Trace processors
26. Dependence based prefetching for linked data structures
27. Improving virtual function call target prediction via dependence-based pre-computation
28. Speculative data-driven multithreading
29. Dynamic instruction reuse
30. Multiscalar processors
31. The potential for using thread level data-speculation to facilitate automatic parallelization
32. Slip-stream processors: Improving both performance and fault tolerance
33. Simultaneous multithreading: Maximizing on-chip parallelism
34. A scalable register file architecture for dynamically scheduled processors
35. The MIPS R 10000 superscalar microprocessor
36. Understanding the backward slices of performance degrading instructions