Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Execution Time Prediction"”.

  1. Refining a task-execution time prediction model for use in MSHN

    … within an RMS uses a model to predict the execution time of the applications. A model from a previous thesis was analyzed and refined to estimate the time that the last task will be completed when scheduling several tasks among several machines. The goal of this thesis was to refine the …

    nps Repository record for Refining a task-execution time prediction model for use in MSHN (opens in a new tab)

  2. Compute Overlap Stall (COS): Predicting Performance of Power Management for Shared Memory Codes When Throttling Processors, Memory, and Thread Concurrency

    … the cost of possible performance loss. Accurate execution time prediction mechanisms are useful for choosing system configurations that yield workload efficiency. The Compute Overlap Stall model predicts execution time of parallel applications across these operating modes. The key insight of the …

    vt Repository record for Compute Overlap Stall (COS): Predicting Performance of Power Management for Shared Memory Codes When Throttling Processors, Memory, and Thread Concurrency (opens in a new tab)

  3. Partially-observed graph abstractions for authorship identification and process interference prediction

    … path on a weighted graph as a feature used for prediction. We apply this abstraction to predicting collaboration between authors in an on-line publication database. The unweighted graph contains an edge if two authors collaborated and the weighted graph encodes the number of collaborations. …

    ubc Repository record for Partially-observed graph abstractions for authorship identification and process interference prediction (opens in a new tab) Download PDF for Partially-observed graph abstractions for authorship identification and process interference prediction (opens in a new tab)

  4. Performance Modeling for Spark Applications

    … The first problem focuses on predicting the execution time of a Spark application. Predicting the execution time of an application before submitting it to the cluster will allow a user to quickly estimate the right amount of resources required to achieve a desired execution time target. Most …

    calgary Repository record for Performance Modeling for Spark Applications (opens in a new tab)

  5. Predictive Parallelization: A Framework for Reducing Tail Latencies of Web Search Queries

    … technique for reducing the query response time. Our workload characterization of commercial search engine servers shows that using parallelization to reduce the tail latency is challenging: (1) The search workload consists of mainly short-running queries that do not benefit from …

    rice Repository record for Predictive Parallelization: A Framework for Reducing Tail Latencies of Web Search Queries (opens in a new tab)

  6. Locality Transformations and Prediction Techniques for Optimizing Multicore Memory Performance

    … distance profile computation tool to build an execution time prediction model that can rank order the different combinations of parallelization strategies and partitioning sizes. We report the amount of gain that we can capture using the PIN prediction relative to what detailed simulation …

    maryland Repository record for Locality Transformations and Prediction Techniques for Optimizing Multicore Memory Performance (opens in a new tab)