Scott Levy

Scott Levy

Auto-generated profile, based on publicly available information

Scott Levy

Sandia National Laboratories, Albuquerque, New Mexico, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 February 2019 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
KFKurt Ferreira
Kurt Ferreira
RGRyan E. Grant
Ryan E. Grant
MLMichael J. Levenhagen
Michael J. Levenhagen
SLScott Levy
Scott Levy
TGTaylor Groves
Taylor Groves

7 August 2023
Verified
Conference Paper
Open access
WMWilliam Pepper Marts
William Pepper Marts
MDMatthew G. F. Dosanjh
Matthew G. F. Dosanjh
WSWhit Schonbein
Whit Schonbein
SLScott Levy
Scott Levy
PBPatrick G. Bridges
Patrick G. Bridges

1 May 2019 in Parallel Computing
Verified
Journal Article
Closed access
SLScott Levy
Scott Levy
KFKurt B. Ferreira
Kurt B. Ferreira
WSWhit Schonbein
Whit Schonbein
RGRyan Grant
Ryan Grant
MDMatthew G.F. Dosanjh
Matthew G.F. Dosanjh

7 August 2023
Verified
Conference Paper
Open access
WSWhit Schonbein
Whit Schonbein
SLScott Levy
Scott Levy
MDMatthew G. F. Dosanjh
Matthew G. F. Dosanjh
WMW. Pepper Marts
W. Pepper Marts
ERElizabeth Reid
Elizabeth Reid
RGRyan Grant
Ryan Grant
Traditional point-to-point communication sends data only after the entirety of the data is available. This includes situations where multiple actors (e.g., threads) contribute to the send buffer. As a result, cases where the completion times of these actors are widely distributed may be lost opportunities for optimization because data ready to be sent is waiting to be transmitted. Fine-grained communication exposes these opportunities by allowing buffers to be divided into element s that can then be sent independently (see e.g., Partitioned Communication in Message Passing Interface v4.0). While some research has been directed at exploring the utility of such ‘early-bird’ transmission, the overall search space for finding the best performing actor completion timings and element counts is large. In this work, we present an abstract model of fine-grained communication based on the LogGP model and a complementary benchmark. We use the model to explore actor completion timing scenarios and identify trends in communication behavior based on factors such as overall message size and delay between actor completions. We evaluate the benchmarks on three systems utilizing distinct network technologies and show that: (i) smaller numbers of element s are able to exploit most of the benefit of early-bird communication, (ii) performance benefit will depend non-trivially on application behavior, and (iii) benefits are highly network-dependent.

18 December 2015
Verified
Book Chapter
Open access
PDF file
PWPatrick M. Widener
Patrick M. Widener
KFKurt B. Ferreira
Kurt B. Ferreira
SLScott Levy
Scott Levy
NFNathan Fabian
Nathan Fabian
Memory failures in future extreme scale applications are a significant concern in the high-performance computing community and have attracted much research attention. We contend in this paper that using application checkpoint data to detect memory failures has potential benefits and is preferable to examining application memory. To support this contention, we describe the application of machine learning techniques to evaluate the veracity of checkpoint data. Our preliminary results indicate that supervised decision tree machine learning approaches can effectively detect corruption in restart files, suggesting that future extreme-scale applications and systems may benefit from incorporating such approaches in order to cope with memory failures.

9 September 2018 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
SLScott Levy
Scott Levy
KFKurt B. Ferreira
Kurt B. Ferreira
PWPatrick Widener
Patrick Widener