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

Doug Balog

dblp:54/731 · also Douglas A. Balog · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Storage systems · 72% High-performance computing · 23% Distributed systems · 4%

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

TopicWeightPapersLastEvidence papers
Storage systems
distributed storage
0.112006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
Storage systems › file systems › distributed file system
wide-area file system
0.112006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
High-performance computing
data-intensive computing
0.012006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
High-performance computing
scientific data management
0.012006
Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor · SC 2006
High-performance computing
scientific computing systems
0.011991
A simple approach for the distribution of computationally intense tasks in an heterogeneous environment: distribution of the MDPP image-processing package · Comput. Appl. Biosci. 1991

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

wide-area networking · 0.1lustre · 0.1message passing · 0.0
YearPublicationVenuePosition
2006 Bandwidth challenge - All in a day's work: advancing data-intensive research with the data capacitor
abstract
Indiana University provides powerful compute, storage, and network resources to a diverse local and national research community every day. IU's facilities have been used to support data-intensive applications ranging from digital humanities to computational biology.For this year's bandwidth challenge, several IU researchers will conduct experiments from the exhibit floor utilizing the resources that University Information Technology Services currently provides.Using IU's newly constructed 535 TB Data Capacitor and an additional component installed on the exhibit floor, we will use Lustre across the wide area network to simultaneously facilitate dynamic weather modeling, protein analysis, instrument data capture, and the production, storage, and analysis of simulation data.
Stephen C. Simms, Matt Davy, Bret Hammond, Matthew R. Link, Craig A. Stewart, Randall Bramley, Beth Plale, Dennis Gannon, Mu-Hyun Baik, Scott Teige, John C. Huffman, Rick McMullen, Doug Balog, Gregory G. Pike
SC13
1991 A simple approach for the distribution of computationally intense tasks in an heterogeneous environment: distribution of the MDPP image-processing package
abstract
A method has been developed to link the display ability of a high-resolution graphics workstation with the computational power of a local mainframe or a remote supercomputer via an electronic data network. The method allows this link to be established in a manner largely transparent to the user. The application of the method is illustrated by our successful distribution of the computationally intensive portions of an imaging program (MDPP) from a small VAX workstation to a VAX mainframe and Cray Y-MP8/832 using a simple message-passing technique. This technique can be applied to almost any configuration of networked machines.
P. R. Smith, Alexander Ropelewski, Doug Balog, S. Gottesman, David W. Deerfield II
Comput. Appl. Biosci.3