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

Paul Stelling

dblp:38/5129 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 72% Electronic design automation · 28%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault detection
0.011998
A Fault Detection Service for Wide Area Distributed Computations · HPDC 1998
Distributed systems
fault tolerance
0.011998
A Fault Detection Service for Wide Area Distributed Computations · HPDC 1998
Distributed systems › fault tolerance › failure detection
unreliable failure detector
0.011998
A Fault Detection Service for Wide Area Distributed Computations · HPDC 1998
Distributed systems
grid computing
0.011998
A Fault Detection Service for Wide Area Distributed Computations · HPDC 1998
Distributed systems › grid computing
wide-area distributed computing
0.011998
A Fault Detection Service for Wide Area Distributed Computations · HPDC 1998
YearPublicationVenuePosition
1998 A Fault Detection Service for Wide Area Distributed Computations
abstract
The potential for faults in distributed computing systems is a significant complicating factor for application developers. While a variety of techniques exist for detecting and correcting faults, the implementation of these techniques in a particular context can be difficult. Hence, we propose a fault detection service designed to be incorporated, in a modular fashion, into distributed computing systems, tools, or applications. This service uses well-known techniques based on unreliable fault detectors to detect and report component failure, while allowing the user to tradeoff timeliness of reporting against false positive rates. We describe the architecture of this service, report on experimental results that quantify its cost and accuracy, and describe its use in two applications, monitoring the status of system components of the GUSTO computational grid testbed and as part of the NetSolve network-enabled numerical solver.
Paul Stelling, Ian T. Foster, Carl Kesselman, Craig A. Lee, Gregor von Laszewski
HPDC1
1998 Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem
Dan Gusfield, Richard M. Karp, Lusheng Wang 0001, Paul Stelling
Discret. Appl. Math.4
1996 Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem
Dan Gusfield, Richard M. Karp, Lusheng Wang 0001, Paul Stelling
CPM4