.png){kind=icon}
Return
Adaptive dynamic thread scheduling for simultaneous multithreaded architectures with a detector thread
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2006.06.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Simultaneous multithreading (SMT) is an architectural technique that improves resource utilization by allowing instructions from multiple threads to coexist in a processor and share resources. However, earlier studies have shown that the performance of an SMT architecture begins to saturate as the number of coexisting threads increases beyond four. We show that no single fetch policy can be the best solution during the entire execution time and that a significant performance improvement can be attained by dynamically switching the fetch policies. We propose an implementation method which includes an extremely lightweight thread to control fetch policies (a detector thread) and a processor architecture to run the detector thread without impact on the user application threads. We evaluate various heuristics for the detector thread to determine the best fetch policies. We show that, with eight threads running on our simulated SMT, the proposed approach can outperform fixed scheduling mechanisms by up to 30%. (C) 2006 Elsevier Inc. All rights reserved.
Keywords:
simultaneous multithreading
fetch policy
detector thread
adaptive dynamic thread scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
Chronology and palaeoenvironmental implications of the ice‐wedge pseudomorphs and composite‐wedge casts on the Magdalen Islands (eastern Canada).png)
Boreas
BoreasIF0
PREAI
ShareSavePTCH1 Gene Mutations in Keratocystic Odontogenic Tumors: A Study of 43 Chinese Patients and a Systematic ReviewPLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSave no more
no more