BOTTLENECK IDENTIFICATION FOR MULTITHREADED PROCESSORS

摘要

This paper studies the general properties for a class ofrnqueuing network models that at the thread level,rncharacterize a class of single-core multithreadedrnprocessors with various thread scheduling disciplines andrnparallel resources. In particular, we find the generalrnconditions under which the bottleneck resources arernbound to appear. Our simulation testing demonstrates thatrnthese general conditions accurately predict when arnbottleneck resource appears. The test of these conditionsrnonly involves estimation of some workload relatedrnparameters, making it possible to quickly identifyrnbottleneck resources without actually running the programrnin the processor. We also demonstrate how these generalrnconditions, combined with any given caching model, canrnlead to useful algorithms for thread and cache resourcernprovisioning that maximizes the throughput performance.