1 / 1

Urgent Computing: SPRUCE

B = I B + Q B + E B + O B. Q ≥ I Q * Q Q * E Q * O Q. Probabilistic Upper Bounds for Urgent Applications Nick Trebon and Pete Beckman University of Chicago and Argonne National Lab, USA. Urgent Computing: SPRUCE. Motivation. Probabilistic Upper Bounds. Methodology.

farrah
Download Presentation

Urgent Computing: SPRUCE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. B = IB + QB + EB + OB Q ≥ IQ * QQ * EQ * OQ Probabilistic Upper Bounds for Urgent ApplicationsNick Trebon and Pete BeckmanUniversity of Chicago and Argonne National Lab, USA Urgent Computing: SPRUCE Motivation Probabilistic Upper Bounds Methodology Urgent applications operate under strict deadlines after which point the results may have very little use (e.g., severe weather modeling). The Special PRiority and Urgent Computing Environment (SPRUCE) provides elevated priority access to urgent computations. The urgent computing user is still faced with the challenging problem of resource selection. In particular, they want to know which configuration of their application will offer them the greatest probability of meeting their deadline. In this context, a configuration is simply a specification of the computational resource and runtime parameters (e.g., urgency, input/output repositories, requested CPUs, etc) that affect the total turnaround time. GOAL: Predict an upper bound on the total turnaround time for a configuration of the urgent computation. A probabilistic upper bound is more meaningful to a user than a point-value prediction because it indicates the likelihood that the bound will be exceeded. Individual Phase Quantile Predictor Methodologies Urgent Computing: We Need Cycles Now! Phases of Total Turnaround Time In the simplest case where each phase is independent, there is a straight-forward approach to calculating a conservative upper bound on the total turnaround time. Which Configuration Provides the Greatest Probability of Meeting the Deadline? Composite Bound and Quantile if Individual Phases are Independent Resources decide locally how to respond to SPRUCE requests based on the user-specified urgency (i.e., low, medium, or high). An upper quantile for each phase is predicted. The value associated with the quantile serves as the probabilistic upper bound. For example, if the 0.95 quantile on the total turnaround time is 10,000 seconds, one can say that there is a 95% that the delay on the total turnaround time will be less than 10,000 seconds. It is important to note that this bound is conservative in that the composite quantile reflects the probability that each phase bound is satisfied individually. This ignores the case where at least one individual bound fails, but the composite bound still succeeds.

More Related