Inter-warp Instruction Temporal Locality in Deep-Multithreaded GPUs

2013 ◽  
pp. 134-146 ◽  
Author(s):  
Ahmad Lashgar ◽  
Amirali Baniasadi ◽  
Ahmad Khonsari
Keyword(s):  
Temporal Locality

scholarly journals Exploit Temporal Locality of Shared Data in SRC Enabled CMP

2007 ◽  
pp. 384-393 ◽  
Author(s):  
Haixia Wang ◽  
Dongsheng Wang ◽  
Peng Li ◽  
Jinglei Wang ◽  
XianPing Fu
Keyword(s):  
Shared Data ◽  
Temporal Locality

HISTORICAL SEARCHING

1993 ◽  
Vol 04 (01) ◽  
pp. 85-98 ◽  
Author(s):  
ALISTAIR MOFFAT ◽  
OLA PETERSSON
Keyword(s):  
Data Structure ◽  
Search Tree ◽  
Insertions And Deletions ◽  
Spatial Locality ◽  
Temporal Locality

When searching for an item x in a dictionary, let t be the number of distinct items referenced since the previous reference to x. The move-to-front-list is a widely known dictionary data structure that supports searches on x in O(t) time. We present a new selforganizing data structure, called the Historical Search Tree, which supports the search in O( log t) time, and thus exploits the temporal locality more efficiently. The Historical Search Tree also handles unsuccessful searches, insertions, and deletions efficiently. We further show how the data structure can be modified to take advantage of spatial locality.

Sign in / Sign up

Export Citation Format

Share Document