257 citations · 1.4k across the 39 of their papers we have counts for
42 papers
Tascade: Hardware Support for Atomic-free, Asynchronous and Efficient Reduction Trees
Marcelo Orenes-Vera, Esin Tureci, David Wentzlaff +1
Graph search and sparse data-structure traversal workloads contain challenging irregular memory patterns on global data structures that need to be modified atomically. Distributed…
DCRA: A Distributed Chiplet-based Reconfigurable Architecture for Irregular Applications
Marcelo Orenes-Vera, Esin Tureci, Margaret Martonosi +1
In recent years, the growing demand to process large graphs and sparse datasets has led to increased research efforts to develop hardware- and software-based architectural solution…
Using LLMs to Facilitate Formal Verification of RTL
Marcelo Orenes-Vera, Margaret Martonosi, David Wentzlaff
Formal property verification (FPV) has existed for decades and has been shown to be effective at finding intricate RTL bugs. However, formal properties, such as those written as Sy…
Microarchitectures for Heterogeneous Superconducting Quantum Computers
Samuel Stein, Sara Sussman, Teague Tomesh +12
Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Quantum Computation (FTQC) offering signifi…
Massive Data-Centric Parallelism in the Chiplet Era
Marcelo Orenes-Vera, Esin Tureci, David Wentzlaff +1
Recent works have introduced task-based parallelization schemes to accelerate graph search and sparse data-structure traversal, where some solutions scale up to thousands of proces…
Architectures for Multinode Superconducting Quantum Computers
James Ang, Gabriella Carini, Yanzhu Chen +30
Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode…
ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors
Wei Tang, Margaret Martonosi
Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore…
Dalorex: A Data-Local Program Execution and Architecture for Memory-bound Applications
Marcelo Orenes-Vera, Esin Tureci, David Wentzlaff +1
Applications with low data reuse and frequent irregular memory accesses, such as graph or sparse linear algebra workloads, fail to scale well due to memory bottlenecks and poor cor…
Cutting Quantum Circuits to Run on Quantum and Classical Platforms
Wei Tang, Margaret Martonosi
Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of th…
Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems
Teague Tomesh, Kaiwen Gui, Pranav Gokhale +4
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across…
SupermarQ: A Scalable Quantum Benchmark Suite
Teague Tomesh, Pranav Gokhale, Victory Omole +7
The emergence of quantum computers as a new computational paradigm has been accompanied by speculation concerning the scope and timeline of their anticipated revolutionary changes.…
Specifying and Testing GPU Workgroup Progress Models
Tyler Sorensen, Lucas F. Salvador, Harmit Raval +4
As GPU availability has increased and programming support has matured, a wider variety of applications are being ported to these platforms. Many parallel applications contain fine-…
Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
Teague Tomesh, Zain H. Saleem, Michael A. Perlin +3
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield…
Designing calibration and expressivity-efficient instruction sets for quantum computing
Prakash Murali, Lingling Lao, Margaret Martonosi +1
Near-term quantum computing (QC) systems have limited qubit counts, high gate (instruction) error rates, and typically support a minimal instruction set having one type of two-qubi…
AutoSVA: Democratizing Formal Verification of RTL Module Interactions
Marcelo Orenes-Vera, Aninda Manocha, David Wentzlaff +1
Modern SoC design relies on the ability to separately verify IP blocks relative to their own specifications. Formal verification (FV) using SystemVerilog Assertions (SVA) is an eff…
Logical Abstractions for Noisy Variational Quantum Algorithm Simulation
Yipeng Huang, Steven Holtzen, Todd Millstein +2
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantu…
Optimizing IoT and Web Traffic Using Selective Edge Compression
Themis Melissaris, Kelly Shaw, Margaret Martonosi
Internet of Things (IoT) devices and applications are generating and communicating vast quantities of data, and the rate of data collection is increasing rapidly. These high commun…
CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
Wei Tang, Teague Tomesh, Martin Suchara +2
Quantum computing (QC) is a new paradigm offering the potential of exponential speedups over classical computing for certain computational problems. Each additional qubit doubles t…
Resource-Efficient Quantum Computing by Breaking Abstractions
Yunong Shi, Pranav Gokhale, Prakash Murali +11
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an acce…
TransForm: Formally Specifying Transistency Models and Synthesizing Enhanced Litmus Tests
Naorin Hossain, Caroline Trippel, Margaret Martonosi
Memory consistency models (MCMs) specify the legal ordering and visibility of shared memory accesses in a parallel program. Traditionally, instruction set architecture (ISA) MCMs a…
The MosaicSim Simulator (Full Technical Report)
Opeoluwa Matthews, Aninda Manocha, Davide Giri +7
As Moore's Law has slowed and Dennard Scaling has ended, architects are increasingly turning to heterogeneous parallelism and domain-specific hardware-software co-designs. These tr…
Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers
Prakash Murali, Dripto M. Debroy, Kenneth R. Brown +1
Trapped ions (TI) are a leading candidate for building Noisy Intermediate-Scale Quantum (NISQ) hardware. TI qubits have fundamental advantages over other technologies such as super…
SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
Yongshan Ding, Xin-Chuan Wu, Adam Holmes +4
Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) i…
RealityCheck: Bringing Modularity, Hierarchy, and Abstraction to Automated Microarchitectural Memory Consistency Verification
Yatin A. Manerkar, Daniel Lustig, Margaret Martonosi
Modern SoCs are heterogeneous parallel systems comprised of components developed by distinct teams and possibly even different vendors. The memory consistency model (MCM) of proces…