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

Becky Springmeyer

dblp:162/4913 · also Rebecca Springmeyer · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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
1 paper
Cloud and datacenter computing · 38% Parallel and multicore computing · 38% Storage systems · 23%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel scheduling › resource-aware scheduling
i/o-aware scheduling
0.212016
Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters · HPDC 2016
Cloud and datacenter computing
job scheduling
0.212016
Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters · HPDC 2016
Storage systems › storage performance
i/o interference
0.112016
Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters · HPDC 2016
Storage systems › file systems › distributed file system
parallel file system
0.112016
Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters · HPDC 2016
Rendering
bidirectional reflectance distribution function
0.011987
Bidirectional reflection functions from surface bump maps · SIGGRAPH 1987
Rendering › appearance modeling › reflectance and appearance modeling
reflectance and shading models
0.011987
Bidirectional reflection functions from surface bump maps · SIGGRAPH 1987
Rendering › texture mapping
bump mapping
0.011987
Bidirectional reflection functions from surface bump maps · SIGGRAPH 1987
Rendering › appearance modeling
surface detail
0.011987
Bidirectional reflection functions from surface bump maps · SIGGRAPH 1987

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

bandwidth modeling · 0.2EASY backfilling · 0.2table-based geometric attenuation · 0.0spherical harmonics · 0.0
YearPublicationVenuePosition
2020 Flux: Overcoming scheduling challenges for exascale workflows
Dong H. Ahn, Ned Bass, Albert Chu, Jim Garlick, Mark Grondona, Stephen Herbein, Helgi I. Ingólfsson, Joe Koning, Tapasya Patki, Thomas Scogland, Becky Springmeyer, Michela Taufer
Future Gener. Comput. Syst.11
2016 Scalable I/O-Aware Job Scheduling for Burst Buffer Enabled HPC Clusters
abstract
The economics of flash vs. disk storage is driving HPC centers to incorporate faster solid-state burst buffers into the storage hierarchy in exchange for smaller parallel file system (PFS) bandwidth. In systems with an underprovisioned PFS, avoiding I/O contention at the PFS level will become crucial to achieving high computational efficiency. In this paper, we propose novel batch job scheduling techniques that reduce such contention by integrating I/O awareness into scheduling policies such as EASY backfilling. We model the available bandwidth of links between each level of the storage hierarchy (i.e., burst buffers, I/O network, and PFS), and our I/O-aware schedulers use this model to avoid contention at any level in the hierarchy. We integrate our approach into Flux, a next-generation resource and job management framework, and evaluate the effectiveness and computational costs of our I/O-aware scheduling. Our results show that by reducing I/O contention for underprovisioned PFSes, our solution reduces job performance variability by up to 33% and decreases I/O-related utilization losses by up to 21%, which ultimately increases the amount of science performed by scientific workloads.
Stephen Herbein, Dong H. Ahn, Don Lipari, Thomas Scogland, Marc Stearman, Mark Grondona, Jim Garlick, Becky Springmeyer, Michela Taufer
HPDC8
1987 Bidirectional reflection functions from surface bump maps
abstract
The Torrance-Sparrow model for calculating bidirectional reflection functions contains a geometrical attenuation factor to account for shadowing and occlusions in a hypothetical distribution of grooves on a rough surface. Using an efficient table-based method for determining the shadows and occlusions, we calculate the geometric attenuation factor for surfaces defined by a specific table of bump heights.Diffuse and glossy specular reflection of the environment can be handled in a unified manner by using an integral of the bidirectional reflection function times the environmental illumination, over the hemisphere of solid angle above a surface. We present a method of estimating the integral, by expanding the bidirectional reflection coefficient in spherical harmonics, and show how the coefficients in this expansion can be determined efficiently by reorganizing our geometric attenuation calculation.
Brian Cabral, Nelson L. Max, Becky Springmeyer
SIGGRAPH3