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.

Todd Kordenbrock

dblp:20/6793 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 5 · 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
High-performance computing · 64% Storage systems · 36%

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

TopicWeightPapersLastEvidence papers
Storage systems › file systems › distributed file system
parallel file system
0.222010
Managing Variability in the IO Performance of Petascale Storage Systems · SC 2010
Poster reception - Parallel I/O advancements in air quality modeling systems · SC 2006
High-performance computing › parallel i/o
i/o interference management
0.112010
Managing Variability in the IO Performance of Petascale Storage Systems · SC 2010
High-performance computing › parallel i/o
i/o variability
0.112010
Managing Variability in the IO Performance of Petascale Storage Systems · SC 2010
High-performance computing
parallel i/o
0.112006
Poster reception - Parallel I/O advancements in air quality modeling systems · SC 2006
High-performance computing
scientific computing
0.012006
Poster reception - Parallel I/O advancements in air quality modeling systems · SC 2006

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

adaptive workload management · 0.1collective i/o · 0.1MPI-IO · 0.1
YearPublicationVenuePosition
2013 Experiences Applying Data Staging Technology in Unconventional Ways
abstract
Several efforts have shown the potential of using additional compute-area resources to enhance the IO path to storage. Efforts like data staging, IO forwarding, and similar techniques can accelerate IO performance and reduce the impact of IO time to a compute application. Hybrid staging enhanced this path by adding processing functionality to locations along the data path to storage. While these efforts have been effective, they have taken a somewhat limited view of the potential benefits using some additional compute resources can offer both to enhance a compute application as well as to offering a way to exploit HPC-style resources for non-traditional tasks. Over the last few years, we have been experimenting with the potential for other sorts of activities using a staging style approach to add or enable new functionality. The efforts in this area have yielded a collection of small projects that yield some insights into both the potential and limitations of this approach for both achieving exascale computing and for enabling alternative uses for HPC resources.
Jay F. Lofstead, Ron A. Oldfield, Todd Kordenbrock
CCGRID3
2010 Managing Variability in the IO Performance of Petascale Storage Systems
abstract
Significant challenges exist for achieving peak or even consistent levels of performance when using IO systems at scale. They stem from sharing IO system resources across the processes of single largescale applications and/or multiple simultaneous programs causing internal and external interference, which in turn, causes substantial reductions in IO performance. This paper presents interference effects measurements for two different file systems at multiple supercomputing sites. These measurements motivate developing a 'managed' IO approach using adaptive algorithms varying the IO system workload based on current levels and use areas. An implementation of these methods deployed for the shared, general scratch storage system on Oak Ridge National Laboratory machines achieves higher overall performance and less variability in both a typical usage environment and with artificially introduced levels of 'noise'. The latter serving to clearly delineate and illustrate potential problems arising from shared system usage and the advantages derived from actively managing it.
Jay F. Lofstead, Fang Zheng 0003, Qing Liu 0002, Scott Klasky, Ron A. Oldfield, Todd Kordenbrock, Karsten Schwan, Matthew Wolf
SC6
2006 Efficient Data-Movement for Lightweight I/O
abstract
Efficient data movement is an important part of any high-performance I/O system, but it is especially critical for the current and next-generation of massively parallel processing (MPP) systems. In this paper, we discuss how the scale, architecture, and organization of current and proposed MPP systems impact the design of the data-movement scheme for the I/O system. We also describe and analyze the approach used by the lightweight file systems (LWFS) project, and we compare that approach to more conventional data-movement protocols used by small and mid-range clusters. Our results indicate that the data-movement strategy used by LWFS clearly outperforms conventional data-movement protocols, particularly as data sizes increase
Ron A. Oldfield, Patrick M. Widener, Arthur B. Maccabe, Lee Ward, Todd Kordenbrock
CLUSTER5
2006 Lightweight I/O for Scientific Applications
abstract
Today's high-end massively parallel processing (MPP) machines have thousands to tens of thousands of processors, with next-generation systems planned to have in excess of one hundred thousand processors. For systems of such scale, efficient I/O is a significant challenge that cannot be solved using traditional approaches. In particular, general purpose parallel file systems that limit applications to standard interfaces and access policies do not scale and will likely be a performance bottleneck for many scientific applications. In this paper, we investigate the use of a "lightweight" approach to I/O that requires the application or I/O-library developer to extend a core set of critical I/O functionality with the minimum set of features and services required by its target applications. We argue that this approach allows the development of I/O libraries that are both scalable and secure. We support our claims with preliminary results for a lightweight checkpoint operation on a development cluster at Sandia
Ron A. Oldfield, Lee Ward, Rolf Riesen, Arthur B. Maccabe, Patrick M. Widener, Todd Kordenbrock
CLUSTER6
2006 Poster reception - Parallel I/O advancements in air quality modeling systems
abstract
This poster presents an overview of and the performance results of recent I/O advancements in the parallel CMAQ framework. These optimizations were developed as part of a collaboration between the EPA and Sandia National Laboratories. netCDF provides a portable file format and an easily understood API, but it does not support concurrent writes by multiple processes. In a cluster environment, this leaves two basic options: create a file per process or funnel all the data through a single node. Neither of these options are optimal. Using a slightly modified API, parallel-netCDF (pnetCDF) enables high performance parallel I/O using the MPI-IO collective I/O optimizations while maintaining the netCDF file format. We have created a thin wrapper around pnetCDF that makes it simple for users to enable the new parallel I/O features at compile time. Using parallel I/O has improved the write performance of the CMAQ air-quality modeling code by up to 48%.
Todd Kordenbrock, Ron A. Oldfield, Jeffrey Young 0001
SC1