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

Michael Bentley

dblp:194/7691 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 59% Parallel and multicore computing · 41%
Software engineering, system software, and programming languages
2 papers
Concurrent programming · 54% Software testing · 46%

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

TopicWeightPapersLastEvidence papers
Human-AI interaction
prompt engineering
0.912025
Intent Tagging: Exploring Micro-Prompting Interactions for Supporting Granular Human-GenAI Co-Creation Workflows · CHI 2025
Concurrent programming › concurrency bug detection
data race detection
0.412020
ArcherGear: data race equivalencing for expeditious HPC debugging · PPoPP 2020
Parallel and multicore computing › parallel computing
parallel program debugging
0.412020
ArcherGear: data race equivalencing for expeditious HPC debugging · PPoPP 2020
Software testing › test infrastructure
test framework
0.412019
Multi-Level Analysis of Compiler-Induced Variability and Performance Tradeoffs · HPDC 2019
High-performance computing
performance optimization
0.412019
Multi-Level Analysis of Compiler-Induced Variability and Performance Tradeoffs · HPDC 2019
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP
0.112020
ArcherGear: data race equivalencing for expeditious HPC debugging · PPoPP 2020
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.112020
ArcherGear: data race equivalencing for expeditious HPC debugging · PPoPP 2020
High-performance computing › finite element method
finite element simulation
0.112019
Multi-Level Analysis of Compiler-Induced Variability and Performance Tradeoffs · HPDC 2019
High-performance computing
scientific computing
0.112019
Multi-Level Analysis of Compiler-Induced Variability and Performance Tradeoffs · HPDC 2019

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

user study · 0.9data race equivalencing · 0.9fault injection · 0.8bisection algorithms · 0.4bisection algorithm · 0.4
YearPublicationVenuePosition
2025 Intent Tagging: Exploring Micro-Prompting Interactions for Supporting Granular Human-GenAI Co-Creation Workflows
abstract
Despite Generative AI (GenAI) systems' potential for enhancing content creation, users often struggle to effectively integrate GenAI into their creative workflows. Core challenges include misalignment of AI-generated content with user intentions (intent elicitation and alignment), user uncertainty around how to best communicate their intents to the AI system (prompt formulation), and insufficient flexibility of AI systems to support diverse creative workflows (workflow flexibility). Motivated by these challenges, we created IntentTagger: a system for slide creation based on the notion of Intent Tags - small, atomic conceptual units that encapsulate user intent - for exploring granular and non-linear micro-prompting interactions for Human-GenAI co-creation workflows. Our user study with 12 participants provides insights into the value of flexibly expressing intent across varying levels of ambiguity, meta-intent elicitation, and the benefits and challenges of intent tag-driven workflows. We conclude by discussing the broader implications of our findings and design considerations for GenAI-supported content creation workflows.
Frederic Gmeiner, Nicolai Marquardt, Michael Bentley, Hugo Romat, Michel Pahud, Asta Roseway, Nikolas Martelaro, Kenneth Holstein, Ken Hinckley, Nathalie Henry Riche
CHI3
2020 ArcherGear: data race equivalencing for expeditious HPC debugging
abstract
There is growing uptake of shared memory parallelism in high performance computing, and this has increased the need for data race checking during the creation of new parallel codes or parallelizing existing sequential codes. While race checking concepts and implementations have been around for many concurrency models, including tasking models such as Cilk and PThreads (e.g., the Thread Sanitizer tool), practically usable race checkers for other APIs such as OpenMP have been lagging. For example, the OpenMP parallelization of an important library (namely Hypre) was initially unsuccessful due to inexplicable nondeterminism introduced when the code was optimized, and later root-caused to a race by the then recently developed OpenMP race checker Archer [2]. The open-source Archer now enjoys significant traction within several organizations.
Samuel Thayer, Ganesh Gopalakrishnan, Ian Briggs, Michael Bentley, Dong H. Ahn, Ignacio Laguna, Gregory L. Lee
PPoPP4
2019 Multi-Level Analysis of Compiler-Induced Variability and Performance Tradeoffs
abstract
Successful HPC software applications are long-lived. When ported across machines and their compilers, these applications often produce different numerical results, many of which are unacceptable. Such variability is also a concern while optimizing the code more aggressively to gain performance. Efficient tools that help locate the program units (files and functions) within which most of the variability occurs are badly needed, both to plan for code ports and to root-cause errors due to variability when they happen in the field. In this work, we offer an enhanced version of the open-source testing framework FLiT to serve these roles. Key new features of FLiT include a suite of bisection algorithms that help locate the root causes of variability. Another added feature allows an analysis of the tradeoffs between performance and the degree of variability. Our new contributions also include a collection of case studies. Results on the MFEM finite-element library include variability/performance tradeoffs, and the identification of a (hitherto unknown) abnormal level of result-variability even under mild compiler optimizations. Results from studying the Laghos proxy application include identifying a significantly divergent floating-point result-variability and successful root-causing down to the problematic function over as little as 14 program executions. Finally, in an evaluation of 4,376 controlled injections of floating-point perturbations on the LULESH proxy application, we showed that the FLiT framework has 100% precision and recall in discovering the file and function locations of the injections all within an average of only 15 program executions.
Michael Bentley, Ian Briggs, Ganesh Gopalakrishnan, Dong H. Ahn, Ignacio Laguna, Gregory L. Lee, Holger E. Jones
HPDC1
2016 Giving voice to office customers: Best practices in how office handles verbatim text feedback
abstract
Microsoft Office users submit hundreds of thousands of pieces of verbatim feedback per month. How can an engineer or manager in Office find the signal in this data to make business decisions? This paper presents an overview of the Office Customer Voice (OCV) system. OCV combines classification, on-demand clustering and other machine learning techniques with a rich web UI to solve this problem. In this paper, we describe the different types of feedback received. Next, we outline the architecture used to build OCV. We then detail the text processing, classification and clustering done to reason on the data. Finally, we present challenges, future plans, and best practices that may be relevant to other teams analyzing customer feedback. We argue that this multi-pronged approach to handling customer feedback presents a pattern that other organizations can use to mature their handling of customer feedback.
Michael Bentley, Soumya Batra
IEEE BigData1