|Title:||FAME: FAirly MEasuring multithreaded architectures||Authors:||Vera, Javier
Cazorla, Francisco J.
Santana, Oliverio J.
|UNESCO Clasification:||120326 Simulación||Issue Date:||2007||Publisher:||Institute of Electrical and Electronics Engineers (IEEE)||Journal:||Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT||Conference:||16th International Conference on Parallel Architecture and Compilation Techniques, PACT 2007||Abstract:||Nowadays, multithreaded architectures are becoming more and more popular. In order to evaluate their behavior, several methodologies and metrics have been proposed. A methodology defines when the measurements of a given workload execution are taken. A metric combines those measurements to obtain a final evaluation result. However, since current evaluation methodologies do not provide representative measurements for these metrics, the analysis and evaluation of novel ideas could be either unfair or misleading. Given the potential impact of multithreaded architectures on current andfuture processor designs, it is crucial to develop an accurate evaluation methodology for them. This paper presents FAME, a new evaluation methodology aimed to fairly measure the performance of rnultithreaded processors. FAME reexecutes all traces in a rnultithreaded workload until all of them are fairly represented in the final measurements taken from the workload. We compare FAME with previously used methodologies for both architectural research simulators and real processors. Our results show that FAME provides more accurate measurements than other methodologies, becoming an ideal evaluation methodology to analyze proposals for multithreaded architectures. © 2007 IEEE.||URI:||http://hdl.handle.net/10553/50496||ISBN:||0-7695-2944-5||ISSN:||1089-795X||DOI:||10.1109/PACT.2007.4336221||Source:||Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT [ISSN 1089-795X], n. 4336221, p. 305-316|
|Appears in Collections:||Actas de congresos|
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.