Please use this identifier to cite or link to this item: https://doi.org/10.1016/S1383-7621(00)00021-7
Title: Analytical modeling of multithreaded architectures
Authors: Vlassov, V.
Ayani, R. 
Issue Date: 2000
Source: Vlassov, V., Ayani, R. (2000). Analytical modeling of multithreaded architectures. Journal of Systems Architecture 46 (13) : 1205-1230. ScholarBank@NUS Repository. https://doi.org/10.1016/S1383-7621(00)00021-7
Abstract: Multithreading is used for hiding long memory latency in uniprocessors and multiprocessor computer systems and aims at increasing system efficiency. In such an architecture, a number of threads are allocated to each processing element (PE) and whenever a running thread becomes suspended the PE switches to another ready thread. In this paper, we discuss analytical modeling of coarsely multithreaded architectures and present two analytical models: (i) a deterministic model, where the timing parameters (e.g., context switching time, threads's run length, and memory latency) are assumed to be constant, and (ii) a stochastic model where the timing parameters are random variables. Both models provide a framework to study the dependence of the MTA efficiency on design parameters of the target architecture and its workload. The deterministic model, as well as asymptotic bounding analysis of the stochastic model, allows to determine upper bounds and some break points of the MTA efficiency such as stability (saturation) points, whereas the stochastic model provides more accurate prediction of the efficiency.
Source Title: Journal of Systems Architecture
URI: http://scholarbank.nus.edu.sg/handle/10635/39082
ISSN: 13837621
DOI: 10.1016/S1383-7621(00)00021-7
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

1
checked on Dec 11, 2017

Page view(s)

43
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.