How frequently are computer jobs submitted to an industrial-scale datacenter? We investigate the trace that contains job requests and execution collected in one of large-scale industrial datacenters, which spans near half of a Terabyte. In this paper, we discover and explain two surprising patterns with respect to the inter-arrival time (IAT) of job requests: (a) multiple periodicities and (b) multi-level bundling effects. Specifically, we propose a novel generative process, Hierarchical Bundling Model (HiBM), for modeling the data. HiBM is able to mimic multiple components in the distribution of IAT, and to simulate job requests with the same statistical properties as in the real data. We also provide a systematic approach to estimate the parameters of HiBM. © 2014 Springer International Publishing.
CITATION STYLE
Juan, D. C., Li, L., Peng, H. K., Marculescu, D., & Faloutsos, C. (2014). Beyond poisson: Modeling inter-arrival time of requests in a datacenter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8444 LNAI, pp. 198–209). Springer Verlag. https://doi.org/10.1007/978-3-319-06605-9_17
Mendeley helps you to discover research relevant for your work.