Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis 2011
DOI: 10.1145/2063384.2063441
|View full text |Cite
|
Sign up to set email alerts
|

A similarity measure for time, frequency, and dependencies in large-scale workloads

Abstract: Performance evaluations of large-scale systems require the use of representative workloads with certifiable similar or dissimilar characteristics. To quantify the similarity of the characteristics, we describe a novel measure comprising two efficient methods that are suitable for large-scale workloads. One method uses the discrete wavelet transform to assess the periodic time and frequency characteristics in the workload. The second method evaluates dependencies in descriptive attributes via association rule l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…For example, the traces from PWA are used as an input to simulation in [20][21][22]. The workloads from GWA are used for testing the dependency searching methodology proposed in [23], and for developing workload models based on user activity in [24]. The data from GO serves as the basis for developing a job re-submission model in [25].…”
Section: Workload Analysis In Grid Computingmentioning
confidence: 99%
“…For example, the traces from PWA are used as an input to simulation in [20][21][22]. The workloads from GWA are used for testing the dependency searching methodology proposed in [23], and for developing workload models based on user activity in [24]. The data from GO serves as the basis for developing a job re-submission model in [25].…”
Section: Workload Analysis In Grid Computingmentioning
confidence: 99%
“…The key idea behind FAST is to explore and exploit the correlation property within and among datasets via improved correlation-aware hashing [11] and flat-structured addressing [12] to significantly reduce the processing latency of parallel queries, while incurring acceptably small loss of accuracy. The approximate scheme for real-time performance has been widely recognized in system design [13]- [16] and high-end computing [17]- [19]. In essence, FAST goes beyond the simple combination of existing techniques to offer efficient data analytics via significantly increased processing speed.…”
Section: Introductionmentioning
confidence: 99%