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

John T. Daly

dblp:99/2326 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

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

Systems, architecture and hardware · 6 · 3 first-authorSecurity and privacy · 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
2 papers
Hardware reliability and fault tolerance · 54% Distributed systems · 24% High-performance computing · 22%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › reliability analysis
error characterization
0.212014
Correctness Field Testing of Production and Decommissioned High Performance Computing Platforms at Los Alamos National Laboratory · SC 2014
Hardware reliability and fault tolerance › soft errors
silent data corruption
0.212014
Correctness Field Testing of Production and Decommissioned High Performance Computing Platforms at Los Alamos National Laboratory · SC 2014
High-performance computing › system resilience
application resilience
0.112010
Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters · HPDC 2010
Distributed systems › fault tolerance
checkpointing
0.112010
Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters · HPDC 2010
Hardware reliability and fault tolerance › error recovery
checkpoint interval optimization
0.112010
Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters · HPDC 2010
Distributed systems
fault tolerance
0.112010
Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters · HPDC 2010
High-performance computing
cluster computing
0.012010
Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters · HPDC 2010

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

correctness field testing · 0.2checkpointing · 0.1
YearPublicationVenuePosition
2014 Correctness Field Testing of Production and Decommissioned High Performance Computing Platforms at Los Alamos National Laboratory
abstract
Silent Data Corruption (SDC) can threaten the integrity of scientific calculations performed on high performance computing (HPC) platforms and other systems. To characterize this issue, correctness field testing of HPC platforms at Los Alamos National Laboratory was performed. This work presents results for 12 platforms, including over 1,000 node-years of computation performed on over 8,750 compute nodes and over 260 petabytes of data transfers involving nearly 6,000 compute nodes, and relevant lessons learned. Incorrect results characteristic of transient errors and of intermittent errors were observed. These results are a key underpinning to resilience efforts as they provide signatures of incorrect results observed under field conditions. Five incorrect results consistent with a transient error mechanism were observed, suggesting that the effects of transient errors could be mitigated. However, the observed numbers of incorrect results consistent with an intermittent error mechanism suggest that intermittent errors could substantially effect computational correctness.
Sarah Ellen Michalak, William N. Rust, John T. Daly, Rew J. Dubois, David H. Dubois
SC3
2010 1st workshop on fault-tolerance for HPC at extreme scale FTXS 2010
abstract
With the emergence of many-core processors, accelerators, and alternative/heterogeneous architectures, the HPC community faces a new challenge: a scaling in number of processing elements that supersedes the historical trend of scaling in processor frequencies. The attendant increase in system complexity has first-order implications for fault tolerance. Mounting evidence invalidates traditional assumptions of HPC fault tolerance: faults are increasingly multiple-point instead of single-point and interdependent instead of independent; silent failures and silent data corruption are no longer rare enough to discount; stabilization time consumes a larger fraction of useful system lifetime, with failure rates projected to exceed one per hour on the largest systems; and application interrupt rates are apparently diverging from system failure rates.
John T. Daly, Nathan DeBardeleben
DSN1
2010 Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters
abstract
As computational clusters rapidly grow in both size and complexity, system reliability and, in particular, application resilience have become increasingly important factors to consider in maintaining efficiency and providing improved computational performance over predecessor systems. One commonly used mechanism for providing application fault tolerance in parallel systems is the use of checkpointing.
William M. Jones, John T. Daly, Nathan DeBardeleben
HPDC2
2008 Application MTTFE vs. Platform MTBF: A Fresh Perspective on System Reliability and Application Throughput for Computations at Scale
abstract
When running on HPC systems characterized by component failure rates high enough to impact productivity, it becomes important to consider the impact of those failures on individual applications. Typically, this is done by assuming that the mean time between failures (MTBF) for hardware and software components on the system is equivalent to the mean time to fatal error (MTTFE) for an application running on that system. In addition, one commonly applies the rule of thumb estimate that application MTTFE scales as the inverse of the number of nodes used to run the application, so that running on half as many nodes increases MTTFE by a factor of two. However, this estimate does not take into account the fact that a non-trivial fraction of failures affect multiple compute nodes, so a single component failure has the potential to cause multiple application fatal errors. In the work that follows, a new model for application MTTFE is derived based on the impact of multi-component failures and their potential to terminate multiple applications.
John T. Daly, Lori A. Pritchett-Sheats, Sarah Ellen Michalak
CCGRID1
2008 Application Resilience: Making Progress in Spite of Failure
abstract
While measures such as raw compute performance and system capacity continue to be important factors for evaluating cluster performance, such issues as system reliability and application resilience have become increasingly important as cluster sizes rapidly grow. Although efforts to directly improve fault-tolerance are important, it is also essential to accept that application failures will inevitably occur and to ensure that progress is made despite these failures. Application monitoring frameworks are central to providing application resilience. As such, the central theme of this paper is to address the impact that application monitoring detection latency has on the overall system performance. We find that immediate fault detection is not necessary in order to obtain substantial improvement in performance. This conclusion is significant because it implies that less complex, highly portable, and predominately less expensive failure detection schemes would provide adequate application resilience.
William M. Jones, John T. Daly, Nathan DeBardeleben
CCGRID2
2006 A higher order estimate of the optimum checkpoint interval for restart dumps
John T. Daly
Future Gener. Comput. Syst.1