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

Bryan Jacobs

dblp:45/5555 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Software engineering, systems software and programming languages · 1

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
1 paper
Compilers and program optimization · 50% Concurrent programming · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 81% Processor architecture and microarchitecture · 19%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
dependence analysis
0.112011
Safe parallel programming using dynamic dependence hints · OOPSLA 2011
Concurrent programming › concurrency correctness
safe parallelism
0.112011
Safe parallel programming using dynamic dependence hints · OOPSLA 2011
Parallel and multicore computing
speculative parallelization
0.112011
Safe parallel programming using dynamic dependence hints · OOPSLA 2011
Parallel and multicore computing
parallel programming models
0.012011
Safe parallel programming using dynamic dependence hints · OOPSLA 2011
Processor architecture and microarchitecture
speculative execution
0.012011
Safe parallel programming using dynamic dependence hints · OOPSLA 2011

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

dynamic dependence analysis · 0.2
YearPublicationVenuePosition
2011 Safe parallel programming using dynamic dependence hints
abstract
Speculative parallelization divides a sequential program into possibly parallel tasks and permits these tasks to run in parallel if and only if they show no dependences with each other. The parallelization is safe in that a speculative execution always produces the same output as the sequential execution.
Chuanle Ke, Lei Liu 0030, Tongxin Bai, Bryan Jacobs, Chen Ding 0001
OOPSLA5