Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

A comparative study of real workload traces and synthetic workload models for parallel job scheduling

Virginia LoContact Information, Jens MacheContact Information and Kurt WindischContact Information

(1)  Department of Computer and Information Science, University of Oregon, 97403 Eugene, OR
Abstract
Two basic approaches are taken when modeling workloads in simulation-based performance evaluation of parallel job scheduling algorithms: (1) a carefully reconstructed trace from a real supercomputer can provide a very realistic job stream, or (2) a flexible synthetic model that attempts to capture the behavior of observed workloads can be devised. Both approaches require that accurate statistical observations be made and that the researcher be aware of the applicability of a given trace for his or her experimental goals.
In this paper, we compare a number of real workload traces and synthetic workload models currently used to evaluate job scheduling and allocation strategies. Our results indicate that the choice of workload model alone — real workload trace versus synthetic workload models — did not significantly affect the relative performance of the algorithms in this study (two scheduling algorithms and three static processor allocation algorithms). Almost all traces and models gave the same ranking of algorithms from best to worst. However, two specific workload characteristics were found to significantly affect algorithm performance: (a) proportion of power-of-two job sizes and (b) degree of correlation between job size and job runtime. When used in the experimental evaluation of resource management algorithms, workloads differing in these two characteristics may lead to discrepant conclusions.
This research was sponsored by NSF grant MIP-9108528.

Contact Information Virginia Lo
Email: lo@cs.uoregon.edu

Contact Information Jens Mache
Email: jens@cs.uoregon.edu

Contact Information Kurt Windisch
Email: kurtw@cs.uoregon.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
7 newer articles

  1. Kurowski, Krzysztof (2008) Multicriteria approach to two-level hierarchy scheduling in grids. Journal of Scheduling
    [CrossRef]
  2. Feitelson, D.G. (2005) Experimental analysis of the root causes of performance evaluation results: a backfilling case study. IEEE Transactions on Parallel and Distributed Systems 16(2)
    [CrossRef]
  3. Oleszkiewicz, J. (2006) Effectively utilizing global cluster memory for large data-intensive parallel programs. IEEE Transactions on Parallel and Distributed Systems 17(1)
    [CrossRef]
  4. Cirne, W. (2003) When the herd is smart: aggregate behavior in the selection of job request. IEEE Transactions on Parallel and Distributed Systems 14(2)
    [CrossRef]
  5. Feitelson, D.G. (2003) Metric and workload effects on computer systems evaluation. Computer 36(9)
    [CrossRef]
  6. Mu'alem, A.W. (2001) Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6)
    [CrossRef]
  7. Sodan, A. C. (2005) Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey. Concurrency and Computation Practice and Experience 17(15)
    [CrossRef]
Remote Address: 38.107.191.109 • Server: mpweb22
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)