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

Gregory Davies

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

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

Systems, architecture and hardware · 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 · 61% Electronic design automation · 30% Embedded and real-time systems · 9%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models
message passing
0.011995
Network-Specific Performance Enhancements for PVM · HPDC 1995
Parallel and multicore computing
parallel programming models
0.011995
Network-Specific Performance Enhancements for PVM · HPDC 1995
Electronic design automation › yield analysis
process variation modeling
0.011995
Network-Specific Performance Enhancements for PVM · HPDC 1995
Embedded and real-time systems › real-time communication
ethernet
0.011995
Network-Specific Performance Enhancements for PVM · HPDC 1995

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

programmed backoff · 0.0broadcast optimization · 0.0
YearPublicationVenuePosition
1995 Network-Specific Performance Enhancements for PVM
abstract
PVM, a message-passing software system for parallel processing, is used on a wide variety of processor platforms, but this portability restricts execution speed. The work here will address this problem mainly in the context of Ethernet-based systems, proposing two PVM enhancements for such systems. The first enhancement exploits the fact that an Ethernet has broadcast capability. Since unenhanced PVM must, to keep portability, avoid using broadcast, execution speed is sacrificed. In addition, the larger the system, the larger the sacrifice in speed. A solution to this problem is presented. The second enhancement is intended for use in applications in which many concurrent tasks finish at the same time, and thus simultaneously try to transmit to a master process. On an Ethernet, this produces excessively long random backoffs, reducing program speed. An enhancement, termed "programmed backoff," is proposed.
Gregory Davies, Norman S. Matloff
HPDC1