Bottleneck Identification for Multithreaded Processors

Miao Ju, Hun Jung, and Hao Che


Design Space Exploration, multithreaded processor


This paper studies the general properties for a class of queuing network models that at the thread level, characterize a class of single-core multithreaded processors with various thread scheduling disciplines and parallel resources. In particular, we find the general conditions under which the bottleneck resources are bound to appear. Our simulation testing demonstrates that these general conditions accurately predict when a bottleneck resource appears. The test of these conditions only involves estimation of some workload related parameters, making it possible to quickly identify bottleneck resources without actually running the program in the processor. We also demonstrate how these general conditions, combined with any given caching model, can lead to useful algorithms for thread and cache resource provisioning that maximizes the throughput performance.

Important Links:

Go Back