An abstraction methodology for the evaluation of multi-core multi-threaded architectures
Document typeConference report
PublisherIEEE Computer Society Publications
Rights accessRestricted access - publisher's policy
European Commisision's projectHIPEAC - High Performance and Embedded Architecture and Compilation (EC-FP7-217068)
As the evolution of multi-core multi-threaded processors continues, the complexity demanded to perform an extensive trade-off analysis, increases proportionally. Cycle-accurate or trace-driven simulators are too slow to execute the large amount of experiments required to obtain indicative results. To achieve a thorough analysis of the system, software benchmarks or traces are required. In many cases when an analysis is needed most, during the earlier stages of the processor design, benchmarks or traces are not available. Analytical models overcome these limitations but do not provide the fine grain details needed for a deep analysis of these architectures. In this work we present a new methodology to abstract processor architectures, at a level between cycle-accurate and analytical simulators. To apply our methodology we use queueing modeling techniques. Thus, we introduce Q-MAS, a queueing based tool targeting a real chip (the Ultra SPARC T2 processor) and aimed at facilitating the quantification of trade-offs during the design phase of multi-core multi-threaded processor architectures. The results demonstrate that Q-MAS, the tool that we developed, provides accurate results very close to the actual hardware, with a minimal cost of running what-if scenarios.
CitationZilan, Ruken [et al.]. An abstraction methodology for the evaluation of multi-core multi-threaded architectures. A: IEEE/ACM International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems. "Proceedings of 19th Annual Meeting of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)". IEEE Computer Society Publications, 2011, p. 478-481.