Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-fv566 Total loading time: 0 Render date: 2024-07-21T15:29:41.675Z Has data issue: false hasContentIssue false

8 - Hierarchical Generative Models

Published online by Cambridge University Press:  05 March 2015

Dror G. Feitelson
Affiliation:
Hebrew University of Jerusalem
Get access

Summary

The discovery of self-similarity and the quest to model it required a radical departure from previous practices. Before this discovery, workload items were considered to be independent of each other. Modeling could then be done by sampling workload items from the relevant distributions, subject to desired correlations between workload attributes. But self-similar workloads have an internal structure. Workload items are no longer distributed uniformly along time – they come in bursts, in many different time scales.

The next step is to consider whether it is only the arrivals that are bursty. Self-similarity says that workload items come in bursts, but says nothing about the nature of the items in a burst. Do the attributes of the burst items have any special characteristics? For example, do job sizes also come in “bursts,” or are they just randomly selected from a distribution? And what about runtimes, memory usage, and so on?

The answer to these questions is that all workload attributes tend to come in bursts. It is common to see a burst of jobs with similar attributes, and then a burst of jobs with other attributes, and so on [239, 109]. Each burst is characterized by rather modal distributions, often concentrated around a single value. The wider distributions describing the entire workload are actually a combination of the modal distributions of the different bursts of activity. Thus the collective distribution does not capture the workload dynamics unless we postulate locality of sampling: instead of sampling from the whole distribution, sample first from one part, then from another, and so on.

A good way to produce locality of sampling is by using a hierarchical model: first select the part of the distribution on which to focus, and then sample from this selected region. This chapter suggests that such a model can and should be generative. This means that it should mimic and model the processes that create the real workload. Such models are therefore called hierarchical generative models (HGM).

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Hierarchical Generative Models
  • Dror G. Feitelson, Hebrew University of Jerusalem
  • Book: Workload Modeling for Computer Systems Performance Evaluation
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139939690.009
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Hierarchical Generative Models
  • Dror G. Feitelson, Hebrew University of Jerusalem
  • Book: Workload Modeling for Computer Systems Performance Evaluation
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139939690.009
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Hierarchical Generative Models
  • Dror G. Feitelson, Hebrew University of Jerusalem
  • Book: Workload Modeling for Computer Systems Performance Evaluation
  • Online publication: 05 March 2015
  • Chapter DOI: https://doi.org/10.1017/CBO9781139939690.009
Available formats
×