Transient-Execution Attacks: A Computer Architect Perspective

L Fiolhais, L Sousa - ACM Computing Surveys, 2023 - dl.acm.org
Computer architects employ a series of performance optimizations at the micro-architecture
level. These optimizations are meant to be invisible to the programmer but they are implicitly …

Mechanisms for store-wait-free multiprocessors

TF Wenisch, A Ailamaki, B Falsafi… - Proceedings of the 34th …, 2007 - dl.acm.org
Store misses cause significant delays in shared-memory multiprocessors because of limited
store buffering and ordering constraints required for proper synchronization. Today …

Nosq: Store-load communication without a store queue

T Sha, MMK Martin, A Roth - 2006 39th Annual IEEE/ACM …, 2006 - ieeexplore.ieee.org
This paper presents NoSQ (short for No Store Queue), a microarchitecture that performs
store-load communication without a store queue and without executing stores in the outof …

Scalable store-load forwarding via store queue index prediction

T Sha, MMK Martin, A Roth - 38th Annual IEEE/ACM …, 2005 - ieeexplore.ieee.org
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 …

Fire-and-forget: Load/store scheduling with no store queue at all

S Subramaniam, GH Loh - 2006 39th Annual IEEE/ACM …, 2006 - ieeexplore.ieee.org
Modern processors use CAM-based load and store queues (LQ/SQ) to support out-of-order
memory scheduling and store-to-load forwarding. However, the LQ and SQ scale poorly for …

Address-indexed memory disambiguation and store-to-load forwarding

SS Stone, KM Woley, MI Frank - 38th Annual IEEE/ACM …, 2005 - ieeexplore.ieee.org
This paper describes a scalable, low-complexity alternative to the conventional load/store
queue (LSQ) for superscalar processors that execute load and store instructions …

A performance-correctness explicitly-decoupled architecture

A Garg, MC Huang - 2008 41st IEEE/ACM International …, 2008 - ieeexplore.ieee.org
Optimizing the common case has been an adage in decades of processor design practices.
However, as the system complexity and optimization techniquespsila sophistication have …

Late-binding: Enabling unordered load-store queues

S Sethumadhavan, F Roesner, JS Emer… - ACM SIGARCH …, 2007 - dl.acm.org
Conventional load/store queues (LSQs) are an impediment to both power-efficient execution
in superscalar processors and scaling tolarge-window designs. In this paper, we propose …

Decomposing the load-store queue by function for power reduction and scalability

L Baugh, C Zilles - IBM Journal of Research and Development, 2006 - ieeexplore.ieee.org
Because they are based on large, content-addressable memories, load-store queues
(LSQs) present implementation challenges in superscalar processors. In this paper, we …

Teaching computational thinking to non-computing majors using spreadsheet functions

KC Yeh, Y Xie, F Ke - 2011 Frontiers in Education Conference …, 2011 - ieeexplore.ieee.org
Recently, higher education has seen an increasing emphasis on the prominent role of
computational thinking in all disciplines. Computational thinking is advocated as not only a …