Mahita Nagabhiru

Works (3)

Updated: April 20th, 2024 05:01

2024 article

Achieving Forward Progress Guarantee in Small Hardware Transactions

Nagabhiru, M., & Byrd, G. T. (2024, January 1). IEEE Computer Architecture Letters, Vol. 23, pp. 53–56.

By: M. Nagabhiru n & G. Byrd n 

author keywords: Hardware; Programming; Data structures; Coherence; Protocols; Instruction sets; Software; Atomics; compare-and-swap; concurrency; forward progress; hardware transactional memory; multi-word-compare-and-swap; multithreading; non-blocking; lock-free
topics (OpenAlex): Distributed systems and fault tolerance; Parallel Computing and Optimization Techniques; Distributed and Parallel Computing Systems
TL;DR: It is argued that limiting the scope of applications helps HTM attain guaranteed forward progress, and it is shown that NACK-with-backoff performs better than the others without compromising scalability for both read- and write-intensive applications. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: March 1, 2024

2023 article

lfbench: a lock-free microbenchmark suite

Nagabhiru, M., & Byrd, G. (2023, April 1). 2023 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE, ISPASS, pp. 322–324.

By: M. Nagabhiru n & G. Byrd n 

topics (OpenAlex): Distributed systems and fault tolerance; Parallel Computing and Optimization Techniques; Security and Verification in Computing
TL;DR: This work attempts for the first time to bring all the popular lock- free data structures under one roof, primarily to enable development of new WW semantics needed for easy lock-free programming and help evaluate the same. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: July 31, 2023

2019 article

Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation

Regan, M., Eastwood, B., Nagabhiru, M., & Mueller, F. (2019, January 1). Lecture Notes in Computer Science.

By: M. Regan n, B. Eastwood n, M. Nagabhiru n & F. Mueller n

author keywords: Quantum computation; Quantum annealing; Quantum gate circuits; Adiabatic computation
topics (OpenAlex): Quantum Computing Algorithms and Architecture; Quantum Information and Cryptography; Quantum and electron transport phenomena
TL;DR: Adiabatic computing with two degrees of freedom of 2-local Hamiltonians has been theoretically shown to be equivalent to the gate model of universal quantum computing, but today's quantum annealers, namely D-Wave’s 2000Q platform, only provide a 2- local Ising Hamiltonian abstraction with a single degree of freedom. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: Web Of Science
Added: November 25, 2019

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2026) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.