Performance Tradeoffs In Multithreaded Processors

Performance Tradeoffs In Multithreaded Processors (1991)

Cached

Download Links

[www.lcs.mit.edu]

Other Repositories/Bibliography

DBLP

by Anant Agarwal

Venue:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Citations:	111 - 5 self

Versions

Version History

Metadata Version 5

User correction supplied by mph

Datum	Value	Source
TITLE	Performance Tradeoffs In Multithreaded Processors	user correction - Legacy Corrections
AUTHOR NAME	Anant Agarwal	user correction
AUTHOR AFFIL	Laboratory for Computer Science; Massachusetts Institute of Technology	user correction
AUTHOR ADDR	Cambridge, MA 02139	user correction
ABSTRACT	... utilization. By maintaining multiple process contexts in hardware and switching among them in a few cycles, multithreaded processors can overlap computation with memory accesses and reduce processor idle time. This paper presents an analytical performance model for multithreaded processors that includes cache interference, network contention, context-switching overhead, and data-sharing effects. The model is validated through our own simulations and by comparison with previously published simulation results. Our results indicate that processors can substantially benefit from multithreading, even in systems with small caches. Large caches yield close to full processor utilization with as few as two to four contexts, while small caches may require up to four times as many contexts. Increased network contention due to multithreading has a major effect on performance. The available network bandwidth and the context-switching overhead limits the best possible utilization.	user correction
YEAR	1991	user correction - Legacy Corrections
VENUE	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	525--539	INFERENCE
VOLUME	3	INFERENCE
CITATIONS	34 found	ParsCit 1.0