A feasibility study of hierarchical multithreading
Abstract
Many studies have shown that significant amounts of parallelism exist at different granularities. Execution models such as superscalar and VLIW exploit parallelism from a single thread. Multithreaded processors make a step towards exploiting parallelism from different threads, but are not geared to exploit parallelism at different granularities (fine and medium grain). We present a feasibility study of a new execution model for exploiting both adjacent and distant parallelism in the dynamic instruction stream. Our model, called hierarchical multithreading, uses a two-level hierarchical arrangement of processing elements. The lower level of the hierarchy exploits instruction-level parallelism and fine-grain thread-level parallelism, whereas the upper level exploits more distant parallelism. Detailed simulation studies with a cycle accurate simulator are presented, showing the feasibility of hierarchical multithreading. Conclusions are drawn about the best ways to obtain the most front the hierarchical multithreading scheme.
Related Papers
- → Relating data-parallelism and (and-) parallelism in logic programs(1996)11 cited
- Parallelism viewpoint: An architecture viewpoint to model parallelism behaviour of parallelism-intensive software systems(2010)
- → A MODEL OF SPECULATIVE PARALLELISM(1992)4 cited
- → On the Concepts of Parallelism in Biomolecular Computing(2018)
- Relating data—parallelism and (and—) parallelismin logic programs(1996)