Task Selection for a Multiscalar Processor
T. N. Vijaykumar, Gurindar S. Sohi · 1998
The Multiscalar architecture advocates a distributed processor organization and task-level speculation to exploit high degrees of instruction level parallelism (ILP) in sequential programs without impeding improvements in clock speeds. The main goal of this paper is to understand the key implications of the architectural features of distributed processor organization and task-level speculation for compiler task selection from the point of view of performance. We identify the fundamental performance issues to be: control flow speculation, data communication, data dependence speculation, load imbalance, and task overhead. We show that these issues are intimately related to a few key characteristics of tasks: task size, inter-task control flow, and inter-task data dependence. We describe compiler heuristics to select tasks with favorable characteristics. We report experimental results to show that the heuristics are successful in boosting overall performance by establishing larger ILP win...
Cited by 131 works.
Authors
References
- Compilers: Principles, Techniques, and Tools
- Trace Scheduling: A Technique for Global Microcode Compaction
- Multiscalar processors
- Conversion of control dependence to data dependence
- Baring it all to software: Raw machines
- The case for a single-chip multiprocessor
- Highly concurrent scalar processing
- Efficient context-sensitive pointer analysis for C programs
- Efficient context-sensitive pointer analysis for C programs
- ARB: a hardware mechanism for dynamic reordering of memory references