Sciweavers

17 search results - page 1 / 4
» Address compression for scalable load store queue implementa...
Sort
View
MICRO
2005
IEEE
110views Hardware» more  MICRO 2005»
13 years 10 months ago
Scalable Store-Load Forwarding via Store Queue Index Prediction
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
Tingting Sha, Milo M. K. Martin, Amir Roth
ISCAS
2008
IEEE
123views Hardware» more  ISCAS 2008»
13 years 11 months ago
Address compression for scalable load/store queue implementation
Yi-Ying Tsai, Chia-Jung Hsu, Chung-Ho Chen
IBMRD
2006
63views more  IBMRD 2006»
13 years 4 months ago
Decomposing the load-store queue by function for power reduction and scalability
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
Lee Baugh, Craig B. Zilles
ISCA
2008
IEEE
113views Hardware» more  ISCA 2008»
13 years 11 months ago
A Two-Level Load/Store Queue Based on Execution Locality
Multicore processors have emerged as a powerful platform on which to efficiently exploit thread-level parallelism (TLP). However, due to Amdahl’s Law, such designs will be incr...
Miquel Pericàs, Adrián Cristal, Fran...
ISLPED
2006
ACM
73views Hardware» more  ISLPED 2006»
13 years 10 months ago
Substituting associative load queue with simple hash tables in out-of-order microprocessors
Buffering more in-flight instructions in an out-of-order microprocessor is a straightforward and effective method to help tolerate the long latencies generally associated with ...
Alok Garg, Fernando Castro, Michael C. Huang, Dani...