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

Der-Chung Cheng

dblp:78/5626 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › synchronization
barrier synchronization
0.011992
The time-constrained barrier synchronizer and its applications in parallel systems · ISCA 1992
Parallel and multicore computing
synchronization
0.011992
The time-constrained barrier synchronizer and its applications in parallel systems · ISCA 1992
Parallel and multicore computing
concurrent data structures
0.011992
The time-constrained barrier synchronizer and its applications in parallel systems · ISCA 1992
Parallel and multicore computing › concurrent data structures
concurrent queue
0.011992
The time-constrained barrier synchronizer and its applications in parallel systems · ISCA 1992

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

time-constrained barrier synchronization · 0.0software combining · 0.0
YearPublicationVenuePosition
1992 The time-constrained barrier synchronizer and its applications in parallel systems
abstract
A barrier synchronizer, allowing processors to participate dynamically by letting them register their intent to participate within a timeout period, is presented. The synchronizer allows some applications - like software combining and highly concurrent queue operations - to be implemented in a rather unconventional but highly efficient manner. The barrier synchronizer generates successive time windows, allowing requests within the same window to be combined, thus ensuring a more-or-less fixed latency for the Fetch-and Op primitive.
Der-Chung Cheng, Kanad Ghose
ISCA1
1991 Efficient Synchronization Schemes for Large-Scale Shared-Memory Multiprocessors
Kanad Ghose, Der-Chung Cheng
ICPP (1)2