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

Allan Espinosa

dblp:78/2810 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · unresolved

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

Systems, architecture and hardware · 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
Storage systems · 44% High-performance computing · 28% Distributed systems · 28%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed scheduling
data-aware scheduling
0.112012
Design and analysis of data management in scalable parallel scripting · SC 2012
Storage systems
data management
0.112012
Design and analysis of data management in scalable parallel scripting · SC 2012
High-performance computing › high-throughput computing
many-task computing
0.112012
Design and analysis of data management in scalable parallel scripting · SC 2012
Storage systems
i/o optimization
0.012012
Design and analysis of data management in scalable parallel scripting · SC 2012
Storage systems › file systems › distributed file system
parallel file system
0.012012
Design and analysis of data management in scalable parallel scripting · SC 2012

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

dataflow analysis · 0.1
YearPublicationVenuePosition
2012 Design and analysis of data management in scalable parallel scripting
abstract
We seek to enable efficient large-scale parallel execution of applications in which a shared filesystem abstraction is used to couple many tasks. Such parallel scripting (many-task computing, MTC) applications suffer poor performance and utilization on large parallel computers because of the volume of filesystem I/O and a lack of appropriate optimizations in the shared filesystem. Thus, we design and implement a scalable MTC data management system that uses aggregated compute node local storage for more efficient data movement strategies. We co-design the data management system with the data-aware scheduler to enable dataflow pattern identification and automatic optimization. The framework reduces the time to solution of parallel stages of an astronomy data analysis application, Montage, by 83.2% on 512 cores; decreases the time to solution of a seismology application, CyberShake, by 7.9% on 2,048 cores; and delivers BLAST performance better than mpiBLAST at various scales up to 32,768 cores, while preserving the flexibility of the original BLAST application.
Zhao Zhang 0007, Daniel S. Katz, Justin M. Wozniak, Allan Espinosa, Ian T. Foster
SC4