Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Norimasa Otsuki

dblp:70/9032 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
0000-0002-1140-0013ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Concurrent programming · 79% Program analysis · 21%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
cache coherence
0.222012
Pacman: Tolerating asymmetric data races with unintrusive hardware · HPCA 2012
AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection · MICRO 2010
Concurrent programming › concurrency bugs
data race tolerance
0.112012
Pacman: Tolerating asymmetric data races with unintrusive hardware · HPCA 2012
Concurrent programming › concurrency bugs
atomicity violation
0.112010
AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection · MICRO 2010
Concurrent programming
concurrency bugs
0.112010
AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection · MICRO 2010
Program analysis
dynamic analysis
0.112010
AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection · MICRO 2010
Concurrent programming › synchronization
critical sections
0.012012
Pacman: Tolerating asymmetric data races with unintrusive hardware · HPCA 2012

Methods — techniques the papers use, named apart from their topics

cache coherence hardware · 0.3cache coherence state transitions · 0.2atomic region inference · 0.2
YearPublicationVenuePosition
2012 Pacman: Tolerating asymmetric data races with unintrusive hardware
abstract
Data races are a major contributor to parallel software unreliability. A type of race that is both common and typically harmful is the Asymmetric data race. It occurs when at least one of the racing threads is inside a critical section. Current proposals that target them are software-based. They slow down execution and require significant compiler, operating system (OS), or application changes. This paper proposes the first scheme to tolerate asymmetric data races in production runs with negligible execution overhead. The scheme, called Pacman, exploits cache coherence hardware to temporarily protect the variables that a thread accesses in a critical section from other threads' requests. Unlike previous schemes, Pacman induces negligible slowdown, needs no support from the compiler or (in the baseline design) from the OS, and requires no application source code changes. In addition, its hardware is relatively unintrusive. We test Pacman with the SPLASH-2, PARSEC, Sphinx 3, and Apache codes, and discover two unreported asymmetric data races.
Shanxiang Qi, Norimasa Otsuki, Lois Orosa 0001, Abdullah Muzahid, Josep Torrellas
HPCA2
2010 AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection
abstract
A particularly insidious type of concurrency bug is atomicity violations. While there has been substantial work on automatic detection of atomicity violations, each existing technique has focused on a certain type of atomic region. To address this limitation, this paper presents Atom Tracker, a comprehensive approach to atomic region inference and violation detection. Atom Tracker is the first scheme to (1) automatically infer generic atomic regions (not limited by issues such as the number of variables accessed, the number of instructions included, or the type of code construct the region is embedded in) and (2) automatically detect violations of them at runtime with negligible execution overhead. Atom Tracker provides novel algorithms to infer generic atomic regions and to detect atomicity violations of them. Moreover, we present a hardware implementation of the violation detection algorithm that leverages cache coherence state transitions in a multiprocessor. In our evaluation, we take eight atomicity violation bugs from real-world codes like Apache, MySql, and Mozilla, and show that Atom Tracker detects them all. In addition, Atom Tracker automatically infers all of the atomic regions in a set of micro benchmarks accurately. Finally, we also show that the hardware implementation induces a negligible execution time overhead of 0.2-4.0% and, therefore, enables Atom Tracker to find atomicity violations on-the-fly in production runs.
Abdullah Muzahid, Norimasa Otsuki, Josep Torrellas
MICRO2