(Enter summary)
Abstract: We present a technique for deriving predictions for the run
times of parallel applications from the run times of "similar" applications
that have executed in the past. The novel aspect of our work is
the use of search techniques to determine those application characteristics
that yield the best definition of similarity for the purpose of making
predictions. We use four workloads recorded from parallel computers
at Argonne National Laboratory, the Cornell Theory Center, and the
San Diego... (Update)
Cited by: More
Using Runtime Measurements and Historical Traces for - Acquiring Knowledge In (2004)
(Correct)
An Instance-based Learning Approach for - Predicting Execution Times (2004)
(Correct)
Costs and Benefits of Load Sharing in the - Computational Grid Darin
(Correct)
Similar documents (at the sentence level):
18.9%: Using Run-Time Predictions to Estimate Queue Wait Times.. - Smith, Taylor, Foster (1999)
(Correct)
Active bibliography (related documents): More All
0.5: Predicting Application Run Times Using Historical Information - Smith (1997)
(Correct)
0.2: A Historical Application Profiler for Use by Parallel Schedulers - Gibbons (1997)
(Correct)
0.1: Scheduling with Advanced Reservations - Smith, Foster, Taylor (2000)
(Correct)
Similar documents based on text: More All
0.3: Predicting Queue Times on Space-Sharing Parallel Computers - Downey (1997)
(Correct)
0.3: Using Queue Time Predictions for Processor Allocation - Downey (1997)
(Correct)
0.2: A Decomposition Method for Efficient Use of.. - Taylor, Chen.. (1996)
(Correct)
Related documents from co-citation: More All
14: Predicting Queue Times on SpaceSharing Parallel Computers
- Downey - 1997
12: A Historical Application Profiler for Use by Parallel Scheculers
- Gibbons - 1997
11: Theory and Practice in Parallel Job Scheduling
- Feitelson, Rudolph et al. - 1997
BibTeX entry: (Update)
W. Smith, I. Foster, and V. Taylor. Predicting application run times using historical information. Technical report, 1997. Submitted. http://citeseer.ist.psu.edu/smith97predicting.html More
@article{ smith98predicting,
author = "Warren Smith and Ian Foster and Valerie Taylor",
title = "Predicting Application Run Times Using Historical Information",
journal = "Lecture Notes in Computer Science",
volume = "1459",
pages = "122--??",
year = "1998",
url = "citeseer.ist.psu.edu/smith97predicting.html" }
Citations (may not include all citations):
2138
Genetic Algorithms in Search (context) - Goldberg - 1989
659
Globus: A Metacomputing Infrastructure Toolkit
- Foster, Kesselman - 1997
166
Applied Regression Analysis (context) - Draper, Smith - 1981
106
Job Characteristics of a Production Parallel Scientific Work..
- Feitelson, Nitzberg - 1995
80
Communications of the ACM (context) - Catlett, Smarr - 1992
57
A Historical Application Profiler for Use by Parallel Schecu..
- Gibbons - 1997
30
Predicting Queue Times on Space-Sharing Parallel Computers
- Downey - 1997
29
Predictability of Process Resource Usage: A Measurement-Base.. (context) - Devarakonda, Iyer - 1989
9
Introductory Statistics (context) - Weiss, Hassett - 1982
6
A Resource Management Architecture for Metasystems (context) - Czajkowski, Foster et al. - 1998
5
A Historical Profiler for Use by Parallel Schedulers (context) - Gibbons - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.huji.ac.il/~feit/parsched/parsched98.html): More
Improving First-Come-First-Serve Job Scheduling by Gang.. - Schwiegelshohn, Yahyapour (1998)
(Correct)
Lachesis: a job scheduler for the Cray T3E - Allen Downey Colby (1998)
(Correct)
A Resource Management Architecture for Metacomputing Systems - Czajkowski, Foster, al (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC