Book contents
- Frontmatter
- Dedication
- Contents
- PREFACE
- 1 Introduction
- 2 Workload Data
- 3 Statistical Distributions
- 4 Fitting Distributions to Data
- 5 Heavy Tails
- 6 Correlations in Workloads
- 7 Self-Similarity and Long-Range Dependence
- 8 Hierarchical Generative Models
- 9 Case Studies
- 10 Summary and Outlook
- Appendix Data Sources
- Bibliography
- Index
- References
Bibliography
Published online by Cambridge University Press: 05 March 2015
Book contents
- Frontmatter
- Dedication
- Contents
- PREFACE
- 1 Introduction
- 2 Workload Data
- 3 Statistical Distributions
- 4 Fitting Distributions to Data
- 5 Heavy Tails
- 6 Correlations in Workloads
- 7 Self-Similarity and Long-Range Dependence
- 8 Hierarchical Generative Models
- 9 Case Studies
- 10 Summary and Outlook
- Appendix Data Sources
- Bibliography
- Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Workload Modeling for Computer Systems Performance Evaluation , pp. 501 - 540Publisher: Cambridge University PressPrint publication year: 2015
References
[1] , , and , “Parameter estimation for the truncated Pareto distribution.”J. Am. Stat. Assoc. 101(473), pp. 270–277, Mar 2006, DOI:10.1198/016214505000000411.Google Scholar
[2] and , “Web content adaptation to improve server overload behavior.”Comput. Networks 31(11–16), pp. 1563–1577, May 1999, DOI:10.1016/S1389-1286(99)00031-6.Google Scholar
[3] , , , , and , “Multiscale nature of network traffic.”IEEE Signal Processing Mag. 19(3), pp. 28–46, May 2002, DOI:10.1109/79.998080.Google Scholar
[4] , , , , and , “Revisiting an old friend: On the observability of the relation between long range dependence and heavy tail.”Telecomm. Syst. 43(3–4), pp. 147–165, Apr 2010, DOI:10.1007/s11235-009-9205-6.Google Scholar
[5] , , , and , “Self-similarity and long-range dependence through the wavelet lens.” In Theory and Applications of Long-Range Dependence, , , and (eds.), pp. 527–556, Birkhäauser, 2003.Google Scholar
[6] and , “Wavelet analysis of long-range-dependent traffic.”IEEE Trans. Information Theory 44(1), pp. 2–15, Jan 1998, DOI:10.1109/18.650984.Google Scholar
[7] , , and , “Long-range dependence: Revisiting aggregation with wavelets.”J. Time Series Analysis 19(3), pp. 253–266, May 1998, DOI:10.1111/1467-9892.00090.Google Scholar
[8] , “Zipf, power-laws, and Pareto–a ranking tutorial.” http://www.hpl.hp.com/research/idl/papers/ranking/, 2000.
[9] and , “The web's hidden order.”Comm. ACM 44(9), pp. 55–59, Sep 2001, DOI:10.1145/383694.383707.Google Scholar
[11] , “Workload models for DBMS performance evaluation.” In 13th ACM Comput. Sci. Conf., pp. 185–195, Mar 1985, DOI:10.1145/320599.320676.Google Scholar
[12] , “User 4XXXXX9: Anonymizing query logs.” In WWW'07 Workshop on Query Log Analysis, May 2007.Google Scholar
[13] and , “Tracking information epidemics in blogspace.” In Intl. Conf. Web Intelligence, pp. 207–214, Sep 2005, DOI:10.1109/WI.2005.151.Google Scholar
[15] , , , and , “Why we search: Visualizing and predicting user behavior.” In 16th Intl. World Wide Web Conf., pp. 161–170, May 2007, DOI:10.1145/1242572.1242595.Google Scholar
[16] , , and (eds.), A Practical Guide to Heavy Tails: Statistical Techniques and Applications. Birkhäuser, 1998.
[17] and , “Performance analysis of mesh interconnection networks with deterministic routing.”IEEE Trans. Parallel & Distributed Syst. 5(3), pp. 225–246, Mar 1994, DOI:10.1109/71.277793.Google Scholar
[18] , , , and , “A five-year study of file-system metadata.”ACM Trans. Storage 3(3), art. no. 9, Oct 2007, DOI:10.1145/1288783.1288788.Google Scholar
[19] , , and , “An approach to the workload characterization problem.”Computer 9(6), pp. 18–32, Jun 1976, DOI:10.1109/CM.1976.218610.Google Scholar
[20] , “A new look at the statistical model identification.”IEEE Trans. Automatic Control AC-19(6), pp. 716–723, Dec 1974, DOI:10.1109/TAC.1974.1100705.Google Scholar
[21] , Probability, Statistics, and Queueing Theory with Computer Science Applications. Academic Press, 1978.Google Scholar
[22] , , and , “Calculating stack distances efficiently.” In Workshop Memory Syst. Perf., pp. 37–43, Jun 2002, DOI:10.1145/773146.773043.Google Scholar
[23] , , , and , “Characterizing reference locality in the WWW.” In Parallel & Distributed Inf. Syst., pp. 92–103, Dec 1996, DOI:10.1109/PDIS.1996.568672.Google Scholar
[24] , The Long Tail: Why the Future of Business is Selling Less of More. Hyperion, 2006.Google Scholar
[25] , “You don't know Jack about disks.”Queue 1(4), pp. 20–30, Jun 2003, DOI:10.1145/864056.864058.Google Scholar
[26] , , , , and , “SETI@home: An experiment in public-resource computing.”Comm. ACM 45(11), pp. 56–61, Nov 2002, DOI:10.1145/581571.581573.Google Scholar
[27] , “Capture, conversion, and analysis of an intense NFS workload.” In 7th USENIX Conf. File & Storage Technologies, pp. 139–152, Feb 2009.Google Scholar
[28] and , “Global optimizations for parallelism and locality on scalable parallel machines.” In Proc. SIGPLAN Conf. Prog. Lang. Design & Implementation, pp. 112–125, Jun 1993, DOI:10.1145/155090.155101.Google Scholar
[29] and , “A test of goodness of fit.”J. Am. Statist. Assoc. 49(268), pp. 765–769, Dec 1954, DOI:10.1080/01621459.1954.10501232.Google Scholar
[30] , , , and , “OurGrid: An approach to easily assemble grids with equitable resource sharing.” In Job Scheduling Strategies for Parallel Processing, pp. 61–86, Springer-Verlag, 2003, DOI:10.1007/10968987 4. Lect. Notes Comput. Sci.2862.Google Scholar
[31] , “Graphs in statistical analysis.”Am. Statistician 27(1), pp. 17–21, Feb 1973, DOI:10.1080/00031305.1973.10478966.Google Scholar
[32] , , , , and , “Characterization & analysis of a server consolidation benchmark.” In 4th Intl. Conf. Virtual Execution Environments, pp. 21–29, Mar 2008, DOI:10.1145/1346256.1346260.Google Scholar
[33] , , , , and , “Managing flash crowds on the Internet.” In 11th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 246–249, Oct 2003, DOI:10.1109/MASCOT.2003.1240667.Google Scholar
[34] , “Characterizing web user sessions.”Performance Evaluation Rev. 28(2), pp. 50–56, Sep 2000, DOI:10.1145/362883.362920.Google Scholar
[35] and , “A workload characterization study of the 1998 world cup web site.”IEEE Network 14(3), pp. 30–37, May/Jun 2000, DOI:10.1109/65.844498.Google Scholar
[36] and , “A synthetic workload model for Internet Mosaic traffic.” In Summer Computer Simulation Conf., pp. 852–857, Jul 1995.Google Scholar
[37] and , “Web server workload characterization: The search for invariants.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 126–137, May 1996, DOI:10.1145/233008.233034.Google Scholar
[38] and , “Internet web servers: Workload characterization and performance implications.”IEEE/ACM Trans. Networking 5(5), pp. 631–645, Oct 1997, DOI:10.1109/90.649565.Google Scholar
[39] , , and , “Analyzing the network traffic requirements of multiplayer online games.” In 2nd Intl. Conf. Advanced Eng. Comput. & Apps. in Sci., pp. 229–234, Sep 2008, DOI:10.1109/ADVCOMP.2008.15.Google Scholar
[41] , , and , “Fitting phase-type distributions via the EM algorithm.”Scand. J. Stat. 23(4), pp. 419–441, Dec 1996.Google Scholar
[42] , , , , and , “Workload analysis of a large-scale key-value store.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 53–64, Jun 2012, DOI:10.1145/2254756.2254766.Google Scholar
[43] , , and , “Desktop workload characterization for CMP/SMT and implications for operating system design.” In Workshop on Interaction between Operating Syst. & Comput. Arch., pp. 2–9, Jun 2007.Google Scholar
[44] , , , and , “NAS parallel benchmark results.”IEEE Trans. Parallel & Distributed Syst. 1(1), pp. 43–51, Feb 1993, DOI:10.1109/88.219861.Google Scholar
[45] , “‘Infant mortality’ and generational garbage collection.”SIGPLAN Notices 28(4), pp. 55–57, Apr 1993, DOI:10.1145/152739.152747.Google Scholar
[46] , , , , and , “Measurements of a distributed file system.” In 13th Symp. Operating Systems Principles, pp. 198–212, Oct 1991, DOI:10.1145/121132.121164. Correction in Operating Systems Rev. 27(1), pp. 7–10, Jan 1993.Google Scholar
[47] and , “Analysis of SRPT scheduling: Investigating unfairness.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 279–290, Jun 2001, DOI:10.1145/384268.378792.Google Scholar
[48] , “The origin of bursts and heavy tails in human dynamics.”Nature 435(7039), pp. 207–211, May 2005, DOI:10.1038/nature03459.Google Scholar
[49] and , “Emergence of scaling in random networks.”Science 286(5439), pp. 509–512, 15 Oct 1999, DOI:10.1126/science.286.5439.509.Google Scholar
[50] , , and , “Mean-field theory for scale-free random networks.”Physica A 272(1–2), pp. 173–187, Oct 1999, DOI:10.1016/S0378-4371(99)00291-5.Google Scholar
[51] and , “MOS: A multiprocessor distributed operating system.”Software – Pract. & Exp. 15(8), pp. 725–737, Aug 1985, DOI:10.1002/spe.4380150802.Google Scholar
[52] and , “A distributed load-balancing policy for a multicomputer.”Software – Pract. & Exp. 15(9), pp. 901–913, Sep 1985, DOI:10.1002/spe.4380150905.Google Scholar
[53] and , Jr., “A face is exposed for AOL searcher no. 4417749.”New York Times, Aug 9, 2006. (Technology Section).Google Scholar
[54] , “User community modeling language (UCMLTM) v1.1 for performance test workloads.” www.perftestplus.com/resources/ucml_1.1.pdf, Mar 2004.
[55] , “Creating effective load models for performance testing with incomplete empirical data.” In 6th IEEE Intl. Workshop Web Site Evolution, pp. 51–59, Sep 2004, DOI:10.1109/WSE.2004.10002.Google Scholar
[56] , , , , , and , “Semiparametric estimation of the long-range dependence parameter: A survey.” In Theory and Applications of Long-Range Dependence, , , and (eds.), pp. 557–578, Birkhäuser, 2003.Google Scholar
[57] and , “Generating representative web workloads for network and server performance evaluation.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 151–160, Jun 1998, DOI:10.1145/277851.277897.Google Scholar
[58] , , , and , “Toward a model of source addresses of Internet background radiation.” In 7th Passive&Active Measurement Conf., Mar 2006.Google Scholar
[59] , “Distributions in text.” In Corpus Linguistics: An International Handbook, and (eds.), chap. 39, pp. 803–821, Mouton de Gruyter, 2009.Google Scholar
[60] , , and , “Memory system characterization of commercial workloads.” In 25th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 3–14, Jun 1998, DOI:10.1145/279358.279363.Google Scholar
[61] and , “Measurement of major locality phases in symbolic reference streams.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 75–84, 1976, DOI:10.1145/800200.806184.Google Scholar
[62] , “Estimation of the tail probability of the truncated Pareto distribution.”J. Inf. & Optimization Sci. 2(2), pp. 192–198, 1981.Google Scholar
[63] , , , , and , “Hourly analysis of a very large topically categorized web query log.” In 27th ACM SIGIR Conf., pp. 321–328, Jul 2004, DOI:10.1145/1008992.1009048.Google Scholar
[64] , Jr. and , “Improved automatic testcase synthesis for performance model validation.” In 19th Intl. Conf. Supercomputing, pp. 111–120, Jun 2005, DOI:10.1145/1088149.1088164.Google Scholar
[65] , , , and , “Characterization of a large web site population with implications for content delivery.” In 13th Intl. World Wide Web Conf., pp. 522–533, May 2004, DOI:10.1145/988672.988743.Google Scholar
[66] , , , and , “A locally adaptive data compression scheme.”Comm. ACM 29(4), pp. 320–330, Apr 1986, DOI:10.1145/5684.5688.Google Scholar
[68] , “Music – chaos, fractals, and information.”Chance 17(4), pp. 7–16, Fall 2004, DOI:10.1080/09332480.2004.10554920.Google Scholar
[69] , , , and , “Long-range dependence in variable-bit-rate video traffic.”IEEE Trans. Commun. 43(2/3/4), pp. 1566–1579, Feb/Mar/Apr 1995, DOI:10.1109/26.380206.Google Scholar
[70] , “A guided tour of the fast Fourier transform.”IEEE Spectrum 6(7), pp. 41–52, Jul 1969, DOI:10.1109/MSPEC.1969.5213896.Google Scholar
[72] and , “Models of mail server workloads.”Performance Evaluation 46(2–3), pp. 65–76, Oct 2001, DOI:10.1016/S0166-5316(01)00047-5.Google Scholar
[73] , , , and , “CMMD I/O: A parallel Unix I/O.” In 7th Intl. Parallel Processing Symp., pp. 489–495, Apr 1993, DOI:10.1109/IPPS.1993.262828.Google Scholar
[74] , , , , and , “Web user session characterization via clustering techniques.” In IEEE Globecom, pp. 1102–1107, Nov 2005, DOI:10.1109/GLOCOM.2005.1577807.Google Scholar
[75] , , , and , “The PARSEC benchmark suite: Characterization and architectural implications.” In 17th Intl. Conf. Parallel Arch. & Compilation Tech., pp. 72–81, Oct 2008, DOI:10.1145/1454115.1454128.Google Scholar
[76] , , , , and , “Characterizing, modeling, and generating workload spikes for stateful services.” In 1st Symp. Cloud Comput., pp. 241–252, Jun 2010, DOI:10.1145/1807128.1807166.Google Scholar
[77] , “On the mapping problem.”IEEE Trans. Comput. C-30(3), pp. 207–214, Mar 1981, DOI:10.1109/TC.1981.1675756.Google Scholar
[78] , , , and , “The degree sequence of a scale-free random graph process.”Random Structures & Algorithms 18(3), pp. 279–290, May 2001, DOI:10.1002/rsa.1009.Google Scholar
[79] , , , and , “Detailed analysis of Skype traffic.”IEEE Trans. Multimedia 11(1), pp. 117–127, Jan 2009, DOI:10.1109/TMM.2008.2008927.Google Scholar
[80] and , “Performance on a bandwidth constrained network: How much bandwidth do we need?” In Supercomputing '93, pp. 906–915, Nov 1993, DOI:10.1109/SUPERC.1993.1263549.Google Scholar
[81] , “Source models of network game traffic.”Comput. Commun. 23(4), pp. 403–410, Feb 2000, DOI:10.1016/S0140-3664(99)00197-8.Google Scholar
[82] , , , , and , “Seven years and one day: Sketching the evolution of Internet traffic.” In IEEE INFOCOM, pp. 711–719, Apr 2009, DOI:10.1109/INFCOM.2009.5061979.Google Scholar
[83] , , and , Time Series Analysis: Forecasting and Control. Prentice Hall, 3rd ed., 1994.Google Scholar
[84] and , “Experience with network simulation.” In SIG-METRICS Conf. Measurement & Modeling of Comput. Syst., pp. 80–90, May 1996, DOI:10.1145/233008.233027.Google Scholar
[85] , , , , and , “Web caching and Zipf-like distributions: Evidence and implications.” In 18th IEEE INFOCOM, vol. 1, pp. 126–134, Mar 1999, DOI:10.1109/INFCOM.1999.749260.Google Scholar
[86] and , “Selecting representative benchmark inputs for exploring microprocessor design spaces.”ACM Trans. Arch. & Code Optimization 10(4), art. no. 37, Dec 2013, DOI:10.1145/2541228.2555294.Google Scholar
[87] , , and , “Predicting bounds on queuing delay for batch-scheduled parallel machines.” In 11th Symp. Principles & Practice of Parallel Programming, pp. 110–118, Mar 2006, DOI:10.1145/1122971.1122989.Google Scholar
[88] , “Lessons from giant-scale services.”IEEE Internet Comput. 5(4), pp. 46–55, Jul/Aug 2001, DOI:10.1109/4236.939450.Google Scholar
[89] and , “Network statistics.” In Network Analysis: Methodological Foundations, and (eds.), pp. 293–317, Springer-Verlag, 2005, DOI:10.1007/978-3-540-31955-9 11. Lect. Notes Comput. Sci. 3418.Google Scholar
[90] , , and , “Metcalfe's law is wrong.”IEEE Spectrum 43(7), pp. 26–31, Jul 2006, DOI:10.1109/MSPEC.2006.1653003.Google Scholar
[91] , “A taxonomy of web search.”SIGIR Forum 36(2), Fall 2002, DOI:10.1145/792550.792552.Google Scholar
[92] , , , and , “Their share: Diversity and disparity in IP traffic.” In 5th Intl. Workshop Passive & Active Network Measurement, pp. 113–125, Springer-Verlag, Apr 2004, DOI:10.1007/978-3-540-24668-8 12. Lect. Notes Comput. Sci. 3015.Google Scholar
[93] , “A synthetic job for measuring system performance.”IBM Syst. J. 8(4), pp. 309–318, 1969, DOI:10.1147/sj.84.0309.Google Scholar
[94] and , “An API for runtime code patching.”Intl. J. High Performance Comput. Appl. 14(4), pp. 317–329, Winter 2000, DOI:10.1177/109434200001400404.Google Scholar
[95] , , and , “A measure of program locality and its application.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 28–40, Aug 1984, DOI:10.1145/800264.809311.Google Scholar
[96] , , , and , “Measuring system normality.”ACM Trans. Comput. Syst. 20(2), pp. 125–160, May 2002, DOI:10.1145/507052.507054.Google Scholar
[97] and , “The phase concept: Approximation of measured data and perfrmance analysis.” In Computer Performance, and (eds.), pp. 23–38, North Holland, 1977.Google Scholar
[98] and , “Limits of the web log analysis artifacts.” In Workshop on Logging Traces of Web Activity: The Mechanics of Data Collection, May 2006.Google Scholar
[99] and , “A sensitivity study of the clustering approach to workload modeling.”Performance Evaluation 6(1), pp. 25–33, Mar 1986, DOI:10.1016/0166-5316(86)90006-4.Google Scholar
[100] , , , , and , “A hierarchical approach to workload characterization for parallel systems.” In High-Performance Computing and Networking, pp. 102–109, Springer-Verlag, May 1995, DOI:10.1007/BFb0046616. Lect. Notes Comput. Sci. 919.Google Scholar
[101] , , and , “Workload characterization issues and methodologies.” In Performance Evaluation: Origins and Directions, , , and (eds.), pp. 459–482, Springer-Verlag, 2000, DOI:10.1007/3-540-46506-5 20. Lect. Notes Comput. Sci. 1769.Google Scholar
[102] and , “A characterization of the variation in time of workload arrival patterns.”IEEE Trans. Comput. C-34(2), pp. 156–162, Feb 1985, DOI:10.1109/TC.1985.1676552.Google Scholar
[103] and , “Workload characterization: A survey.”Proc. IEEE 81(8), pp. 1136–1150, Aug 1993, DOI:10.1109/5.236191.Google Scholar
[104] and , “Construction and use of multiclass workload models.”Performance Evaluation 19(4), pp. 341–352, 1994, DOI:10.1016/0166-5316(94)90046-9.Google Scholar
[105] , , , and , “On the nonstationarity of Internet traffic.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 102–112, Jun 2001, DOI:10.1145/378420.378440.Google Scholar
[106] , , , , and , “Long-range dependence and heavy-tail modeling for teletraffic data.”IEEE Signal Processing Mag. 19(3), pp. 14–27, May 2002, DOI:10.1109/79.998079.Google Scholar
[107] , “Internet census 2012: Port scanning /0 using insecure embedded devices.” http://internetcensus2012.bitbucket.org/paper.html, 2013.
[108] and , “A user-based model of grid computing workloads.” In 13th Intl. Conf. Grid Computing, pp. 40–48, Sep 2012, DOI:10.1109/Grid.2012.13.Google Scholar
[109] , , , and , “Dealing with burstiness in multitier applications: Models and their parameterization.”IEEE Trans. Softw. Eng. 38(5), pp. 1040–1053, Sep/Oct 2012, DOI:10.1109/TSE.2011.87.Google Scholar
[110] , , and , “Model-driven system capacity planning under workload burstiness.”IEEE Trans. Comput. 59(1), pp. 66–80, Jan 2010, DOI:10.1109/TC.2009.135.Google Scholar
[111] , , and , “Redefining server performance characterization for virtualization benchmarking.”Intel Tech. J. 10(3), pp. 243–251, Aug 2006.Google Scholar
[112] , , and , “Tracing and characterization of Windows NT-based system workloads.”Digital Tech. J. 10(1), pp. 6–21, Dec 1998.Google Scholar
[113] and , “Characterizing browsing strategies in the world-wide web.”Comput. Netw. & ISDN Syst. 27(6), pp. 1065–1073, Apr 1995, DOI:10.1016/0169-7552(95)00043-7.Google Scholar
[114] , , , , and , “I tube, you tube, everybody tubes: Analyzing the world's largest user generated content video system.” In 7th Internet Measurement Conf., pp. 1–13, Oct 2007, DOI:10.1145/1298306.1298309.Google Scholar
[115] and , “Understanding heavy tails in a bounded world or, is a truncated heavy tail heavy or not?”Stochastic Models 28(1), pp. 109–143, 2012, DOI:10.1080/15326349.2012.646551.Google Scholar
[116] , , , and , “Measurement-based characterization of a collection of on-line games.” In 5th Internet Measurement Conf., pp. 1–14, Oct 2005.Google Scholar
[117] , , and , “Anomaly detection: A survey.”ACM Comput. Surv. 41(3), art. no. 15, Jul 2009, DOI:10.1145/1541880.1541882.Google Scholar
[118] , , , , , , , and , “Benchmarks and standards for the evaluation of parallel job schedulers.” In Job Scheduling Strategies for Parallel Processing, pp. 67–90, Springer-Verlag, 1999, DOI:10.1007/3-540-47954-6 4. Lect. Notes Comput. Sci.1659.Google Scholar
[119] , “Quality control and validation of point-sourced environmental resource data.” In Spatial Accuracy Assessment: Land Information Uncertainty in Natural Resources, and (eds.), pp. 409–418, CRC Press, 1999.Google Scholar
[120] , “Confessions of a pragmatic statistician.”The Statistician 51(1), pp. 1–20, Mar 2002, DOI:10.1111/1467-9884.00294.Google Scholar
[121] , The Analysis of Time Series: An Introduction. Chapman & Hall/CRC, 6th ed., 2003.Google Scholar
[122] , , , , , , and , “The measured performance of personal computer operating systems.”ACM Trans. Comput. Syst. 14(1), pp. 3–40, Feb 1996, DOI:10.1145/225535.225536.Google Scholar
[123] and , “Flash crowd mitigation via adaptive admission control based on application-level observations.”ACM Trans. Internet Technology 5(3), pp. 532–569, Aug 2005, DOI:10.1145/1084772.1084776.Google Scholar
[124] , , and , “Interactive analytical processing in big data systems: A cross-industry study of MapReduce workloads.”Proc. VLDB Endowment 5(12), pp. 1802–1813, Aug 2012.Google Scholar
[125] , , , and , “The case for evaluating MapReduce performance using workload suites.” In 19th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 390–399, Jul 2011, DOI:10.1109/MASCOTS.2011.12.Google Scholar
[126] , , , , , , and , “Evaluating iterative optimization across 1000 data sets.” In Proc. SIGPLAN Conf. Prog. Lang. Design & Implementation, pp. 448–459, Jun 2010, DOI:10.1145/1809028.1806647.Google Scholar
[127] , “Trace-driven system modeling.”IBM Syst. J. 8(4), pp. 280–289, 1969, DOI:10.1147/sj.84.0280.Google Scholar
[128] , , , , and , “Anomaly? application change? or workload change?” In Intl. Conf. Dependable Syst. & Networks, pp. 452–461, Jun 2008, DOI:10.1109/DSN.2008.4630116.Google Scholar
[129] , , , , and , “Automated anomaly detection and performance modeling of enterprise applications.”ACM Trans. Comput. Syst. 27(3), art. no. 6, Nov 2009, DOI:10.1145/1629087.1629089.Google Scholar
[130] and , “Dynamic vs. static quantum-based parallel processor allocation.” In Job Scheduling Strategies for Parallel Processing, pp. 200–223, Springer-Verlag, 1996, DOI:10.1007/BFb0022295. Lect. Notes Comput. Sci. 1162.Google Scholar
[131] and , “Characteristics of a large shared memory production workload.” In Job Scheduling Strategies for Parallel Processing, pp. 159–187, Springer-Verlag, 2001, DOI:10.1007/3-540-45540-X 10. Lect. Notes Comput. Sci.2221.Google Scholar
[132] and , “Impact of search engines on page popularity.” In 13th Intl. World Wide Web Conf., pp. 20–29, May 2004, DOI:10.1145/988672.988676.Google Scholar
[133] , , , and , “SCALLOP: A scalable and load-balanced peer-to-peer lookup protocol.”IEEE Trans. Parallel & Distributed Syst. 17(5), pp. 419–433, May 2006, DOI:10.1109/TPDS.2006.66.Google Scholar
[134] , “Fast algorithms for the calculation of Kendall's τ.”Computational Statistics 20(1), pp. 51–62, Mar 2005, DOI:10.1007/BF02736122.Google Scholar
[135] and , “Beyond eyeballing: Fitting models to experimental data.”Critical Rev. Biochemistry & Molecular Biology 35(5), pp. 359–391, 2000, DOI:10.1080/10409230091169212.Google Scholar
[136] and , “A model for moldable supercomputer jobs.” In 15th Intl. Parallel & Distributed Processing Symp., Apr 2001, DOI:10.1109/IPDPS.2001.925004.Google Scholar
[137] and , “A comprehensive model of the supercomputer workload.” In 4th Workshop on Workload Characterization, pp. 140–148, Dec 2001, DOI:10.1109/WWC.2001.990753.Google Scholar
[138] , “MisSPECulation: Partial and misleading use of SPEC CPU2000 in computer architecture conferences.” In 30th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 52–61, Jun 2003, DOI:10.1145/871656.859625.Google Scholar
[139] , , and , “Accelerating multi-media processing by implementing memoing in multiplication and division units.” In Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 252–261, Oct 1998, DOI:10.1145/291069.291056.Google Scholar
[140] and , “Creating a wider bus using caching techniques.” In 1st Intl. Symp. High Performance Comput. Arch., pp. 90–99, Jan 1995, DOI:10.1109/HPCA.1995.386552.Google Scholar
[141] , , and , “Power-law distributions in empirical data.”SIAM Rev. 51(4), pp. 661–703, Nov 2009, DOI:10.1137/070710111.Google Scholar
[142] , , and , “Scale invariance in the severity of terrorism.”J. Conflict Resolution 51, Feb 2007.Google Scholar
[143] , “A practical guide to measuring the Hurst parameter.”Intl. J. Simulation: Syst., Sci. & Tech. 7(2), pp. 3–14, Mar 2006. http://ijssst.info/Vol-07/No-2/one.pdf.Google Scholar
[144] , Jr., , and , “Approximation algorithms for bin-packing – an updated survey.” In Algorithm Design for Computer Systems Design, , , and (eds.), pp. 49–106, Springer-Verlag, 1984.Google Scholar
[145] , Jr., , and , “Bin packing with divisible item sizes.”J. Complex. 3(4), pp. 406–428, Dec 1987, DOI:10.1016/0885-064X(87)90009-4.Google Scholar
[146] , Jr. and , “Interarrival statistics for time sharing systems.”Comm. ACM 9(7), pp. 500–503, Jul 1966, DOI:10.1145/365719.365961.Google Scholar
[147] , “A survey of query log privacy-enhancing techniques from a policy perspective.”ACM Trans. Web 2(4), art. no. 19, Oct 2008, DOI:10.1145/1409220.1409222.Google Scholar
[148] and , “A general model of web graphs.”Random Structures & Algorithms 22(3), pp. 311–335, May 2003, DOI:10.1002/rsa.10084.Google Scholar
[149] , , , , , , , , , , , , , and , “Parallel file systems for the IBM SP computers.”IBM Syst. J. 34(2), pp. 222–248, 1995, DOI:10.1147/sj.342.0222.Google Scholar
[150] , , , and , Introduction to Algorithms. MIT Press and McGraw-Hill, 2nd ed., 2001.Google Scholar
[151] , , , and , “GENIUS: A generator of interactive user media sessions.” In 7th Workshop on Workload Characterization, pp. 29–36, Oct 2004, DOI:10.1109/WWC.2004.1437393.Google Scholar
[152] and , “A decomposable model of program paging behavior.”Acta Informatica 6(3), pp. 251–275, Sep 1976, DOI:10.1007/BF00288657.Google Scholar
[153] and , “End-to-end performance of web services.” In Performance Evaluation of Complex Systems: Techniques and Tools, (eds.), pp. 158–178, Springer-Verlag, 2002, DOI:10.1007/3-540-45798-4 8. Lect. Notes Comput. Sci. 2459.Google Scholar
[154] , “Performance evaluation with heavy tailed distributions.” In Job Scheduling Strategies for Parallel Processing, pp. 1–10, Springer-Verlag, 2001, DOI:10.1007/3-540-45540-X 1. Lect. Notes Comput. Sci.2221.Google Scholar
[155] and , “Self-similarity in world wide web traffic: Evidence and possible causes.”IEEE/ACM Trans. Networking 5(6), pp. 835–846, Dec 1997, DOI:10.1109/90.650143.Google Scholar
[156] and , “Long-lasting transient conditions in simulations with heavy-tailed workloads.” In Winter Simulation conf., Dec 1997.Google Scholar
[157] and , “Simulations with heavy-tailed workloads.” In Self-Similar Network Traffic and Performance Evaluation, and (eds.), pp. 89–100, John Wiley & Sons, 2000, DOI:10.1002/047120644X.ch3.Google Scholar
[158] and , “Estimating the heavy tail index from scaling properties.”Methodology & Comput. in Applied Probability 1(1), pp. 55–79, Jul 1999, DOI:10.1023/A:1010012224103.Google Scholar
[159] , , and , “Big data: A research agenda.” In 17th Intl. Databases Eng. & Apps. Symp., pp. 198–203, Oct 2013, DOI:10.1145/2513591.2527071.Google Scholar
[160] , , , and , “A quantitative study of parallel scientific applications with explicit communication.”J. Supercomput. 10(1), pp. 5–24, 1996, DOI:10.1007/BF00128097.Google Scholar
[161] and , “Improving parallel job scheduling using runtime measurements.” In Job Scheduling Strategies for Parallel Processing, pp. 18–38, Springer-Verlag, 2000, DOI:10.1007/3-540-39997-6 2. Lect. Notes Comput. Sci. 1911.Google Scholar
[162] and (eds.), Goodness-of-Fit Techniques. Marcel Dekker, Inc., 1986.
[163] , “Reducing hot-spot contention in shared-memory multiprocessor systems.”IEEE Concurrency 7(1), pp. 48–59, Jan-Mar 1999, DOI:10.1109/4434.749135.Google Scholar
[164] , , , , and , “An empirical workload model for driving wide-area TCP/IP network simulations.”Internetworking: Research and Experience 3, pp. 1–26, 1992.Google Scholar
[165] and , “Tests for Hurst effect.”Biometrika 74(1), pp. 95–101, Mar 1987, DOI:10.1093/biomet/74.1.95.Google Scholar
[166] , “An analysis of some failure data.”J. Am. Stat. Assoc. 47(258), pp. 113–150, Jun 1952, DOI:10.1080/01621459.1952.10501160.Google Scholar
[167] and , “MapReduce: Simplified data processing on large clusters.” In 6th Symp. Operating Systems Design & Implementation, pp. 137–150, Dec 2004.
[168] and , “MapReduce: A flexible data processing tool.”Comm. ACM 53(1), pp. 72–77, Jan 2010, DOI:10.1145/1629175.1629198.Google Scholar
[170] , , and , “Maximum likelihood from incomplete data via the EM algorithm.”J. Royal Statist. Soc. Series B (Methodological) 39(1), pp. 1–38, 1977, DOI:10.2307/2984875.Google Scholar
[171] , “The working set model for program behavior.”Comm. ACM 11(5), pp. 323–333, May 1968, DOI:10.1145/363095.363141.Google Scholar
[172] , “Working sets past and present.”IEEE Trans. Softw. Eng. SE-6(1), pp. 64–84, Jan 1980, DOI:10.1109/TSE.1980.230464.Google Scholar
[173] , “The locality principle.”Comm. ACM 48(7), pp. 19–24, Jul 2005, DOI:10.1145/1070838.1070856.Google Scholar
[174] and , “Properties of the working-set model.”Comm. ACM 15(3), pp. 191–198, Mar 1972, DOI:10.1145/361268.361281.Google Scholar
[175] and , “Predictability of process resource usage: A measurement-based study on UNIX.”IEEE Trans. Softw. Eng. 15(12), pp. 1579–1586, Dec 1989, DOI:10.1109/32.58769.Google Scholar
[176] , , , , and , “Extracting hidden anomalies using sketch and non Gaussian multiresolution statistical detection procedures.” In Workshop Large Scale Attack Defense, pp. 145–152, Aug 2007, DOI:10.1145/1352664.1352675.Google Scholar
[177] , , and , “Characterization and comparison of cloud versus grid workloads.” In Intl. Conf. Cluster Comput., pp. 230–238, Sep 2012, DOI:10.1109/CLUSTER.2012.35.Google Scholar
[178] and , “Computer-intensive methods in statistics.”Sci. Am. 248(5), pp. 116–130, May 1983.Google Scholar
[179] and , “How multimedia workloads will change processor design.”Computer 30(9), pp. 43–45, Sep 1997, DOI:10.1109/2.612247.Google Scholar
[180] , , and , “An investigation of web crawler behavior: Characterization and metrics.”Comput. Commun. 28(8), pp. 880–897, May 2005, DOI:10.1016/j.comcom.2005.01.003.Google Scholar
[181] , , , , , , and , “The user in experimental computer systems research.” In Workshop Experimental Comput. Sci., art. no. 10, Jun 2007, DOI:10.1145/1281700.1281710.Google Scholar
[182] and , “Predicting whole-program locality through reuse distance analysis.” In Proc. SIGPLAN Conf. Prog. Lang. Design & Implementation, pp. 247–257, Jun 2003, DOI:10.1145/781131.781159.Google Scholar
[183] and , “Whiteboards that compute: A workload analysis.” In IEEE Intl. Symp. Workload Characterization, pp. 69–78, Sep 2008, DOI:10.1109/IISWC.2008.4636092.Google Scholar
[184] and , The economic value of rapid response time. Tech. Rep. GE20-1752-0, IBM, Nov 1982.Google Scholar
[185] , , , and , “Do you want to take notes? Identifying research missions in Yahoo! search pad.” In 19th Intl. World Wide Web Conf., pp. 321–330, Apr 2010, DOI:10.1145/1772690.1772724.Google Scholar
[186] , “Predicting queue times on space-sharing parallel computers.” In 11th Intl. Parallel Processing Symp., pp. 209–218, Apr 1997, DOI:10.1109/IPPS.1997.580894.Google Scholar
[187] , “A parallel workload model and its implications for processor allocation.”Cluster Comput. 1(1), pp. 133–145, 1998, DOI:10.1023/A:1019077214124.Google Scholar
[188] , “The structural cause of file size distributions.” In 9th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 361–370, Aug 2001, DOI:10.1109/MASCOT.2001.948888.Google Scholar
[189] , “Lognormal and Pareto distributions in the Internet.”Comput. Commun. 28(7), pp. 790–801, May 2005, DOI:10.1016/j.comcom.2004.11.001.Google Scholar
[190] and , “The elusive goal of workload characterization.”Performance Evaluation Rev. 26(4), pp. 14–29, Mar 1999, DOI:10.1145/309746.309750.Google Scholar
[191] , , and , “Models of searching and browsing: Languages, studies, and applications.” In 20th Intl. Joint Conf. Artificial Intelligence, pp. 1465–1472, Jan 2007.Google Scholar
[192] , , , , and , “Traffic characteristics and communication patterns in blogosphere.” In 1st Intl. Conf. Weblogs & Social Media, Mar 2007.Google Scholar
[193] , “Universal benchmark suites.” In 7th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 197–205, Oct 1999, DOI:10.1109/MASCOT.1999.805056.Google Scholar
[194] and , “Distinguishing humans from robots in web search logs: Preliminary results using query rates and intervals.” In 2nd Workshop on Web Search Click Data, pp. 15–19, Feb 2009, DOI:10.1145/1507509.1507512.Google Scholar
[195] and , “SynRGen: An extensible file reference generator.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 108–117, May 1994, DOI:10.1145/183018.183030.Google Scholar
[196] , “Gibrat's law for (all) cities.”Am. Economic Rev. 94(5), pp. 1429–1451, Dec 2004, DOI:10.1257/0002828043052303.Google Scholar
[197] , , , , and , “Control flow modeling in statistical simulation for accurate and efficient processor design studies.” In 31st Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 350–361, Jun 2004, DOI:10.1109/ISCA.2004.1310787.Google Scholar
[198] and , “Hybrid analytical-statistical modeling for efficiently exploring architecture and workload design spaces.” In 10th Intl. Conf. Parallel Arch. & Compilation Tech., pp. 25–34, Sep 2001, DOI:10.1109/PACT.2001.953285.Google Scholar
[199] and , “Quantifying behavioral differences between multimedia and general-purpose workloads.”J. Syst. Arch. 48(6-7), pp. 199–220, Jan 2003, DOI:10.1016/S1383-7621(03)00003-1.Google Scholar
[200] , , and , “Performance analysis through synthetic trace generation.” In IEEE Intl. Symp. Performance Analysis Syst. & Software, pp. 1–6, Apr 2000, DOI:10.1109/ISPASS.2000.842273.Google Scholar
[201] , , , and , “Statistical simulation: Adding efficiency to the computer designer's toolbox.”IEEE Micro 23(5), pp. 26–38, Sep-Oct 2003, DOI:10.1109/MM.2003.1240210.Google Scholar
[202] , , and , “Workload design: Selecting representative program-input pairs.” In 11th Intl. Conf. Parallel Arch. & Compilation Tech., pp. 83–94, Sep 2002, DOI:10.1109/PACT.2002.1106006.Google Scholar
[203] , , and , “Designing computer architecture research workloads.”Computer 36(2), pp. 65–71, Feb 2003, DOI:10.1109/MC.2003.1178050.Google Scholar
[204] , , and , “Quantifying the impact of input data sets on program behavior and its applications.”J. Instruction Level Parallelism 5, pp. 1–33, Apr 2003.Google Scholar
[205] , “Computers and the theory of statistics: Thinking the unthinkable.”SIAM Rev. 21(4), pp. 460–480, Oct 1979, DOI:10.1137/1021092.Google Scholar
[206] and , “A leisurely look at the bootstrap, the jackknife, and cross-validation.”The American Statistician 37(1), pp. 36–48, Feb 1983, DOI:10.2307/2685844.Google Scholar
[207] , “The power of power laws and an interpretation of Lotkaian informetric systems as self-similar fractals.”J. Am. Soc. Inf. Sci. & Tech. 56(7), pp. 669–675, May 2005, DOI:10.1002/asi.20158.Google Scholar
[208] , , and , “Fitting world-wide web request traces with the EM-algorithm.”Performance Evaluation 52, pp. 175–191, 2003, DOI:10.1016/S0166-5316(02)00179-7.Google Scholar
[209] , , , and , “Is it DSS or OLTP: Automatically identifying DBMS workloads.”J. Intelligent Inf. Syst. 30(3), pp. 249–271, Jun 2008, DOI:10.1007/s10844-006-0036-6.Google Scholar
[210] and , “Handling flash crowds from your garage.” In USENIX Ann. Tech. Conf., pp. 171–184, Jun 2008.Google Scholar
[211] and , “Behavioral aspects of text editors.”ACM Comput. Surv. 13(1), pp. 33–70, Mar 1981, DOI:10.1145/356835.356838.Google Scholar
[212] and , “Modern robust statistical methods: An easy way to maximize the accuracy and power of your research.”Am. Psych. 63(7), pp. 591–601, Oct 2008, DOI:10.1037/0003-066X.63.7.591.Google Scholar
[213] , , and , “Scaling of workload traces.” In Job Scheduling Strategies for Parallel Processing, pp. 166–182, Springer-Verlag, 2003, DOI:10.1007/10968987_9. Lect. Notes Comput. Sci. 2862.Google Scholar
[214] , , and , “Experimental queueing analysis with longrange dependent packet traffic.”IEEE/ACM Trans. Networking 4(2), pp. 209–223, Apr 1996, DOI:10.1109/90.491008.Google Scholar
[215] and , “New directions in traffic measurements and accounting: Focusing on the elephants, ignoring the mice.”ACM Trans. Comput. Syst. 21(3), pp. 270–313, Aug 2003, DOI:10.1145/859716.859719.Google Scholar
[216] and , “Probabilistic prediction of temporal locality.”IEEE Comput. Arch. Let. 6(1), pp. 17–20, Jan-Jun 2007, DOI:10.1109/L-CA.2007.5.Google Scholar
[217] and , “L1 cache filtering through random selection of memory references.” In 16th Intl. Conf. Parallel Arch. & Compilation Tech., pp. 235–244, Sep 2007, DOI:10.1109/PACT.2007.44.Google Scholar
[218] and , “Exploiting core working sets to filter the L1 cache with random sampling.”IEEE Trans. Comput. 61(11), pp. 1535–1550, Nov 2012, DOI:10.1109/TC.2011.197.Google Scholar
[219] , , , and , “Fine grained kernel logging with KLogger: Experience and insights.” In 2nd EuroSys, pp. 259–272, Mar 2007, DOI:10.1145/1272996.1273023.Google Scholar
[220] , “Moving up the information food chain: Deploying softbots on the world wide web.”AI Magazine 18(2), pp. 11–18, Summer 1997.Google Scholar
[221] , , and , Statistical Distributions. John Wiley & Sons, 3rd ed., 2000.
[223] , , , and , “An analysis of correlation and predictability: What makes two-level branch predictors work.” In 25th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 52–61, Jun 1998, DOI:10.1145/279358.279368.Google Scholar
[224] and , “Probabilistic job symbiosis modeling for SMT processor scheduling.” In 15th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 91–102, Mar 2010, DOI:10.1145/1736020.1736033.Google Scholar
[225] , , and , “Revisiting web server workload invariants in the context of scientific web sites.” In ACM/IEEE Conf. Supercomputing, art. no. 110, 2006, DOI:10.1145/1188455.1188570.Google Scholar
[226] , , and , “On power-law relationships of the Internet topology.” In ACM SIGCOMM Conf., pp. 251–262, Aug 1999, DOI:10.1145/316188.316229.Google Scholar
[227] , , , and , “Prefix-preserving IP address anonymization: Measurement-based security evaluation and a new cryptography-based scheme.”Comput. Networks 46(2), pp. 253–272, Oct 2004, DOI:10.1016/j.comnet.2004.03.033.Google Scholar
[228] , , and , “Managing contention for shared resources on multicore processors.”Comm. ACM 53(2), pp. 49–57, Feb 2010, DOI:10.1145/1646353.1646371.Google Scholar
[229] , A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994.Google Scholar
[230] , “Packing schemes for gang scheduling.” In Job Scheduling Strategies for Parallel Processing, pp. 89–110, Springer-Verlag, 1996, DOI:10.1007/BFb0022289. Lect. Notes Comput. Sci. 1162.Google Scholar
[231] , “Memory usage in the LANL CM-5 workload.” In Job Scheduling Strategies for Parallel Processing, pp. 78–94, Springer-Verlag, 1997, DOI:10.1007/3-540-63574-2 17. Lect. Notes Comput. Sci. 1291.Google Scholar
[232] , “A critique of ESP.” In Job Scheduling Strategies for Parallel Processing, pp. 68–73, Springer-Verlag, 2000, DOI:10.1007/3-540-39997-6_5. Lect. Notes Comput. Sci. 1911.Google Scholar
[233] , “The forgotten factor: Facts; on performance evaluation and its dependence on workloads.” In Euro-Par 2002 Parallel Processing, and (eds.), pp. 49–60, Springer-Verlag, Aug 2002, DOI:10.1007/3-540-45706-2_4. Lect. Notes Comput. Sci. 2400.Google Scholar
[234] , “Workload modeling for performance evaluation.” In Performance Evaluation of Complex Systems: Techniques and Tools, and (eds.), pp. 114–141, Springer-Verlag, Sep 2002, DOI:10.1007/3-540-45798-4_6. Lect. Notes Comput. Sci. 2459.Google Scholar
[235] , “Metric and workload effects on computer systems evaluation.”Computer 36(9), pp. 18–25, Sep 2003, DOI:10.1109/MC.2003.1231190.Google Scholar
[236] , “A distributional measure of correlation.”InterStat Dec 2004. http://interstat.statjournals.net/YEAR/2004/abstracts/0412001.php.
[237] , “Experimental analysis of the root causes of performance evaluation results: A backfilling case study.”IEEE Trans. Parallel & Distributed Syst. 16(2), pp. 175–182, Feb 2005, DOI:10.1109/TPDS.2005.18.Google Scholar
[238] , “Metrics for mass-count disparity.” In 14th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 61–68, Sep 2006, DOI:10.1109/MASCOTS.2006.30.Google Scholar
[239] , “Locality of sampling and diversity in parallel system workloads.” In 21st Intl. Conf. Supercomputing, pp. 53–63, Jun 2007, DOI:10.1145/1274971.1274982.Google Scholar
[240] and , “Improved utilization and responsiveness with gang scheduling.” In Job Scheduling Strategies for Parallel Processing, pp. 238–261, Springer-Verlag, 1997, DOI:10.1007/3-540-63574-2_24. Lect. Notes Comput. Sci. 1291.Google Scholar
[241] and , “On the definition of ‘on-line’ in job scheduling problems.”SIGACT News 36(1), pp. 122–131, Mar 2005, DOI:10.1145/ 1052796.1052797.Google Scholar
[242] and , “Utilization and predictability in scheduling the IBM SP2 with backfilling.” In 12th Intl. Parallel Processing Symp., pp. 542–546, Apr 1998, DOI:10.1109/IPPS.1998.669970.Google Scholar
[243] and , “Self-tuning systems.”IEEE Softw. 16(2), pp. 52–60, Mar/Apr 1999, DOI:10.1109/52.754053.Google Scholar
[244] and , “Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860.” In Job Scheduling Strategies for Parallel Processing, pp. 337–360, Springer-Verlag, 1995, DOI:10.1007/3-540-60153-8_38. Lect. Notes Comput. Sci. 949.Google Scholar
[245] and , “Evaluation of design choices for gang scheduling using distributed hierarchical control.”J. Parallel & Distributed Comput. 35(1), pp. 18–34, May 1996, DOI:10.1006/jpdc.1996.0064.Google Scholar
[246] and , “Toward convergence in job schedulers for parallel supercomputers.” In Job Scheduling Strategies for Parallel Processing, pp. 1–26, Springer-Verlag, 1996, DOI:10.1007/BFb0022284. Lect. Notes Comput. Sci. 1162.Google Scholar
[247] and , “Metrics and benchmarking for parallel job scheduling.” In Job Scheduling Strategies for Parallel Processing, pp. 1–24, Springer-Verlag, 1998, DOI:10.1007/BFb0053978. Lect. Notes Comput. Sci. 1459.Google Scholar
[248] and , “A case for conservative workload modeling: Parallel job scheduling with daily cycles of activity.” In 17th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., Sep 2009, DOI:10.1109/MASCOT.2009.5366139.Google Scholar
[249] and , “Workload sanitation for performance evaluation.” In IEEE Intl. Symp. Performance Analysis Syst. & Software, pp. 221–230, Mar 2006, DOI:10.1109/ISPASS.2006.1620806.
[250] , , and , “Experience with using the Parallel Workloads Archive.”J. Parallel & Distributed Comput. 74(10), pp. 2967–2982, Oct 2014, DOI:10.1016/j.jpdc.2014.06.013.Google Scholar
[251] , , and , “Data networks as cascades: Investigating the multifractal nature of Internet WAN traffic.” In ACM SIGCOMM Conf., pp. 42–55, Sep 1998, DOI:10.1145/285243.285256.Google Scholar
[252] , , , and , “The changing nature of network traffic: Scaling phenomena.”Comput. Commun. Rev. 28(2), pp. 5–29, Apr 1998, DOI:10.1145/279345.279346.Google Scholar
[253] and , “Fitting mixtures of exponentials to long-tail distributions to analyze network performance models.”Performance Evaluation 31(3–4), pp. 245–279, Jan 1998, DOI:10.1016/S0166-5316(97)00003-5.Google Scholar
[254] , An Introduction to Probability Theory and Its Applications, vol. II. John Wiley & Sons, 2nd ed., 1971.Google Scholar
[255] , , and , “A stochastic model for the evolution of the web allowing link deletion.”ACM Trans. Internet Technology 6(2), pp. 117–130, May 2006, DOI:10.1145/1149121.1149122.Google Scholar
[256] , “Workload characterization and selection in computer performance measurement.”Computer 5(4), pp. 18–24, Jul/Aug 1972, DOI:10.1109/C-M.1972.216939.Google Scholar
[257] , “A generative model of working set dynamics.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 52–57, Sep 1981, DOI:10.1145/1010629.805474.Google Scholar
[258] , “On the foundations of artificial workload design.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 8–14, Aug 1984, DOI:10.1145/1031382.809309.Google Scholar
[259] , , , , and , “A community databank for performance tracefiles.” In Recent Advances in Parallel Virtual Machine and Message Passing Interface, and (eds.), pp. 233–240, Springer-Verlag, Sep 2001, DOI:10.1007/3-540-45417-9_33. Lect. Notes Comput. Sci. 2131.Google Scholar
[260] , , , , , and , “On TCP and self-similar traffic.”Performance Evaluation 61(2–3), pp. 129–141, Jul 2005, DOI:10.1016/j.peva.2004.11.004.Google Scholar
[261] , , , , and , “Experiences of Internet traffic monitoring with Tstat.”IEEE Network 25(3), pp. 8–14, May-Jun 2011, DOI:10.1109/MNET.2011.5772055.Google Scholar
[262] and , “The Markov-modulated Poisson process (MMPP) cookbook.”Performance Evaluation 18(2), pp. 149–171, Sep 1993, DOI:10.1016/0166-5316(93)90035-S.Google Scholar
[264] and , “Difficulties in simulating the Internet.”IEEE/ACM Trans. Networking 9(4), pp. 392–403, Aug 2001, DOI:10.1109/90.944338.Google Scholar
[265] , , and , “Locality in a web of streams.”Comm. ACM 48(1), pp. 82–88, Jan 2005, DOI:10.1145/1039539.1039543.Google Scholar
[266] , , , and , “On the intrinsic locality properties of web reference streams.” In 22nd IEEE INFOCOM, vol. 1, pp. 448–458, Mar 2003, DOI:10.1109/INFCOM.2003.1208696.Google Scholar
[267] and , “Large-sample properties of parameter estimates for strongly dependent stationary Gaussian time series.”Ann. Statist. 14(2), pp. 517–532, Jun 1986, DOI:10.1214/aos/1176349936.Google Scholar
[268] , , , and , “Adaptive parallel job scheduling with flexible coscheduling.”IEEE Trans. Parallel & Distributed Syst. 16(11), pp. 1066–1077, Nov 2005, DOI:10.1109/TPDS.2005.130.Google Scholar
[269] and , “Extreme deviations and applications.”J. Phys. I France 7(9), pp. 1155–1171, Sep 1997, DOI:10.1051/jp1:1997114.Google Scholar
[270] and , “The effect of client caching on file server workloads.” In 29th Hawaii Intl. Conf. System Sciences, vol. 1, pp. 150–159, Jan 1996, DOI:10.1109/HICSS.1996.495458.Google Scholar
[271] and , “Estimates of distributions of random variables for certain computer communications traffic models.”Comm. ACM 13(12), pp. 752–757, Dec 1970, DOI:10.1145/362814.362830.Google Scholar
[272] , “Zipf's law for cities: An explanation.”Quart. J. Economics 114(3), pp. 739–767, Aug 1999, DOI:10.1162/003355399556133.Google Scholar
[273] , “Clustering.” In Network Analysis: Methodological Foundations, and (eds.), chap. 8, pp. 178–215, Springer-Verlag, 2005, DOI:10.1007/978-3-540-31955-9_8. Lect. Notes Comput. Sci. 3418.Google Scholar
[274] , , , , and , “Statistics-driven workload modeling for the cloud.” In 5th Intl. Workshop Self-Managing Database Syst., pp. 87–92, Mar 2010, DOI:10.1109/ICDEW.2010.5452742. (At 26th IEEE Intl. Conf. Data Engineering).Google Scholar
[275] , , , and , “SOFTScale: Stealing opportunistically for transient scaling.” In 13th Intl. Middleware Conf., pp. 142–163, Springer-Verlag, Dec 2012, DOI:10.1007/978-3-642-35170-9_8. Lect. Notes Comput. Sci. 7662.Google Scholar
[276] and , “Using system-level models to evaluate I/O subsystem designs.”IEEE Trans. Comput. 47(6), pp. 667–678, Jun 1998, DOI:10.1109/12.689646.Google Scholar
[277] and , “TPC-W e-commerce benchmark evaluation.”Computer 36(2), pp. 42–48, Feb 2003, DOI:10.1109/MC.2003.1178045.Google Scholar
[278] , , , , and , “Characterization of ISP traffic: Trends, user habits, and access technology impact.”IEEE Trans. Network & Service Management 9(2), pp. 142–155, Jun 2012, DOI:10.1109/TNSM.2012.022412.110184.Google Scholar
[279] , , , , and , “Big Data textoriented banchmark creation for Hadoop.”IBMJ. Res. Dev. 57(3/4), art. no. 10, May/Jul 2013, DOI:10.1147/JRD.2013.2240732.Google Scholar
[280] , , and , “Evaluation of web robot discovery techniques: A benchmarking study.” In 6th Industrial Conf. Data Mining, pp. 121–130, Springer-Verlag, Jul 2006, DOI:10.1007/11790853_10. Lect. Notes Comput. Sci. 4065.Google Scholar
[281] and , “Using edit sessions to measure participation in Wikipedia.” In Conf. Comput. Supported CooperativeWork, pp. 861–870, Feb 2013, DOI:10.1145/2441776.2441873.Google Scholar
[282] and , “The estimation and application of long memory time series models.”J. Time Series Analysis 4(4), pp. 221–238, Jul 1983, DOI:10.1111/j.1467-9892.1983.tb00371.x.Google Scholar
[283] and , “SPEC as a performance evaluation measure.”Computer 28(8), pp. 33–42, Aug 1995, DOI:10.1109/2.402073.Google Scholar
[284] , , , and , “YouTube traffic characterization: A view from the edge.” In 7th Internet Measurement Conf., pp. 15–28, Oct 2007, DOI:10.1145/1298306.1298310.Google Scholar
[285] , , , and , “Trace factory: Generating workloads for trace-driven simulation of shared-bus multiprocessors.”IEEE Concurrency 5(4), pp. 54–68, Oct-Dec 1997, DOI:10.1109/4434.641627.Google Scholar
[286] and , “Adaptive page replacement based on memory reference behavior.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 115–126, Jun 1997, DOI:10.1145/258623.258681.Google Scholar
[287] , , , , , and , “A survey on facilities for experimental internet of things research.”IEEE Commun. Mag. 49(11), pp. 58–67, Nov 2011, DOI:10.1109/MCOM.2011.6069710.Google Scholar
[288] , , and , “Program-counter-based pattern classification in buffer caching.” In 6th Symp. Operating Systems Design & Implementation, pp. 395–408, Dec 2004.Google Scholar
[289] and , “Subexponential distributions.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 436–459, Birkhäuser, 1998.Google Scholar
[290] , , and , “Problems with fitting to the power-law distribution.”European Phys. J. B 41(2), pp. 255–258, Sep 2004, DOI:10.1140/epjb/e2004-00316-5.Google Scholar
[291] , , , and , “Heavy-tailed phenomena in satisfiability and constraint satisfaction problems.”J. Automated Reasoning 24, pp. 67–100, Feb 2000, DOI:10.1023/A:1006314320276.Google Scholar
[292] and , “Analysis of self-similarity in I/O workload using structural modeling.” In 7th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 234–242, Oct 1999, DOI:10.1109/MASCOT.1999.805060.Google Scholar
[293] and , “A new approach in the analysis and modeling of disk access patterns.” In IEEE Intl. Symp. Performance Analysis Syst. & Software, pp. 172–177, Apr 2000, DOI:10.1109/ISPASS.2000.842297.Google Scholar
[294] , , , and , “Self-similarity and long range dependence on the Internet: A second look at the evidence, origins and implications.”Comput. Networks 48(3), pp. 377–399, Jun 2005, DOI:10.1016/j.comnet.2004.11.026.Google Scholar
[295] and , “Empirical quantification of opportunities for content adaptation in web servers.” In 3rd Haifa Experimental Syst. Conf., art. no. 5, May 2010, DOI:10.1145/1815695.1815702.Google Scholar
[296] and , “Trading off quality for throughput using content adaptation in web servers.” In 4th Intl. Conf. Systems & Storage, art. no. 6, May 2011, DOI:10.1145/1987816.1987824.Google Scholar
[297] , , , and , “Empirical characterization of session-based workload and reliability for web servers.”Empirical Softw. Eng. 11(1), pp. 71–117, Mar 2006, DOI:10.1007/s10664-006-5966-7.Google Scholar
[298] and , “An introduction to long-memory time series models and fractional differencing.”J. Time Series Analysis 1(1), pp. 15–29, Jan 1980, DOI:10.1111/j.1467-9892.1980.tb00297.x.Google Scholar
[299] , “On the asymptotic eigenvalue distribution of Toeplitz matrices.”IEEE Trans. Information Theory IT–18(6), pp. 725–730, Nov 1972, DOI:10.1109/TIT.1972.1054924.Google Scholar
[300] , “Practical algorithms for self scaling histograms or better than average data collection.”Performance Evaluation 27&28, pp. 19–40, Oct 1996, DOI:10.1016/S0166-5316(96)90018-8.Google Scholar
[301] , , and , “The importance of power-tail distributions for modeling queueing systems.”Operations Research 47(2), pp. 313–326, Mar/Apr 1999, DOI:10.1287/opre.47.2.313.Google Scholar
[302] and , “System design issues for internet middleware services: Deductions from a large client trace.” In Symp. Internet Technologies & Syst., pp. 207–218, Dec 1997.Google Scholar
[303] , , , , , and , “Self-similarity in file systems.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 141–150, Jun 1998, DOI:10.1145/277851.277894.Google Scholar
[304] and , Probability and Random Processes. Oxford University Press, 2nd ed., 1992.
[305] , , , and , “Locality as a visualization tool.”IEEE Trans. Comput. 45(11), pp. 1319–1326, Nov 1996, DOI:10.1109/12.544490.Google Scholar
[306] , , , and , “Difficulties in simulating queues with Pareto service.” In Winter Simul. Conf., vol. 1, pp. 407–415, Dec 2002, DOI:10.1109/WSC.2002.1172911.Google Scholar
[307] , “Theorems and fallacies in the theory of long-range-dependent processes.”IEEE Trans. Information Theory 51(3), pp. 1234–1239, Mar 2005, DOI:10.1109/TIT.2004.842768.Google Scholar
[308] , , , , , and , “Measurement, modeling, and analysis of a peer-to-peer file-sharing workload.” In 19th Symp. Operating Systems Principles, pp. 314–329, Oct 2003, DOI:10.1145/945445.945475.Google Scholar
[309] , , , and , “Analysis of multimedia workloads with implications for Internet streaming.” In 14th Intl. World Wide Web Conf., pp. 519–528, May 2005, DOI:10.1145/1060745.1060821.Google Scholar
[310] , , and , “How does TCP generate pseudo-self-similarity?” In 9th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 215–223, Aug 2001, DOI:10.1109/MASCOT.2001.948871.Google Scholar
[311] , , , and , “Fast and low-cost search schemes by exploiting localities in P2P networks.”J. Parallel & Distributed Comput. 65(6), pp. 729–742, Jun 2005, DOI:10.1016/j.jpdc.2005.01.007.Google Scholar
[312] , , and , “Measuring and understanding user comfort with resource borrowing.” In 13th Intl. Symp. High Performance Distributed Comput., pp. 214–224, Jun 2004, DOI:10.1109/HPDC.2004.1323536.Google Scholar
[313] , , and , “Analysis of scheduling policies under correlated job sizes.”Performance Evaluation 67(11), pp. 996–1013, Nov 2010, DOI:10.1016/j.peva.2010.08.010.Google Scholar
[314] , “Characterizing the variability of arrival processes with indices of dispersion.”IEEE J. Select Areas in Commun. 9(2), pp. 203–211, Feb 1991, DOI:10.1109/49.68448.Google Scholar
[315] , , , , , and , “MiBench: A free, commercially representative embedded benchmark suit.” In 4th Workshop on Workload Characterization, pp. 3–14, Dec 2001, DOI:10.1109/WWC.2001.990739.Google Scholar
[316] , “Task assignment with unknown duration.”J. ACM 49(2), pp. 260–288, Mar 2002, DOI:10.1145/506147.506154.Google Scholar
[317] , , , and , “SRPT scheduling for web servers.” In Job Scheduling Strategies for Parallel Processing, pp. 11–20, Springer-Verlag, 2001, DOI:10.1007/3-540-45540-X_2. Lect. Notes Comput. Sci. 2221.Google Scholar
[318] , , and , “On choosing a task assignment policy for a distributed server system.”J. Parallel & Distributed Comput. 59(2), pp. 204–228, Nov 1999, DOI:10.1006/jpdc.1999.1577.Google Scholar
[319] and , “Exploiting process lifetime distributions for dynamic load balancing.”ACM Trans. Comput. Syst. 15(3), pp. 253–285, Aug 1997, DOI:10.1145/263326.263344.Google Scholar
[320] and , “Simulation of user-driven computer behavior.” In 15th Systems Administration Conf. (LISA), pp. 101–107, Dec 2001.Google Scholar
[321] , , and , “Branch transition rate: A new metric for improved branch classification analysis.” In 6th Intl. Symp. High Performance Comput. Arch., pp. 241–250, Jan 2000, DOI:10.1109/HPCA.2000.824354.Google Scholar
[322] , “The Britney Spears problem.”American Scientist 96(4), pp. 274–279, Jul-Aug 2008, DOI:10.1511/2008.73.3822.Google Scholar
[323] and , “Detecting session boundaries from web user logs.” In 22nd BCS-IRSG Ann. Colloq.|Information Retrieval Research, pp. 57–66, 2000.Google Scholar
[324] and , “Extreme values in the dock.”Significance 1(1), pp. 13–17, Mar 2004, DOI:10.1111/j.1740-9713.2004.00003.x.Google Scholar
[325] and , “An extreme value analysis for the investigation into the sinking of the M. V. Derbyshire.”J. Royal Stat. Soc. C: App. Stat. 52(3), pp. 337–354, Jul 2003, DOI:10.1111/1467-9876.00408.Google Scholar
[326] and , “Modelling user behavior in networked games.” In 9th ACM Intl. Conf. Multimedia, pp. 212–220, Sep 2001, DOI:10.1145/500141.500175.Google Scholar
[327] , , and , “The changing nature of a mature campus-wide wireless network.” In 10th Mobile Comput. & Networking, pp. 187–201, Sep 2004, DOI:10.1145/1023720.1023739.Google Scholar
[328] , “SPEC CPU2000: Measuring CPU performance in the new millennium.”Computer 33(7), pp. 28–35, Jul 2000, DOI:10.1109/2.869367.Google Scholar
[329] , , and , “Tracking the evolution of web traffic: 1995–2003.” In 11th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 16–25, Oct 2003, DOI:10.1109/MASCOT.2003.1240638.Google Scholar
[330] , , and , “Modeling and generating TCP application workloads.” In 4th Broadband Comm., Netw. & Syst., pp. 280–289, Sep 2007, DOI:10.1109/BROADNETS.2007.4550436.Google Scholar
[331] , , , and , “Variable heavy tailed distributions in Internet traffic, part I: Understanding heavy tails.” In 10th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 43–52, Oct 2002, DOI:10.1109/MASCOT.2002.1167059.Google Scholar
[332] and , “Profiling, what-if analysis, and cost-based optimization of MapReduce programs.”Proc. VLDB Endowment 4(11), pp. 1111–1122, Aug 2011.Google Scholar
[333] , “A simple general approach to inference about the tail of a distribution.”Ann. Statist. 3(5), pp. 1163–1174, Sep 1975.Google Scholar
[334] and , “Cache considerations for multiprocessor programmers.”Comm. ACM 33(8), pp. 97–102, Aug 1990, DOI:10.1145/79173.79180.Google Scholar
[335] and , “Modeling user behavior: A layered approach.” In 7th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 218–225, Oct 1999, DOI:10.1109/MASCOT.1999.805058.Google Scholar
[336] , , , , , , , , , and , “Understanding system design for Big Data workloads.”IBM J. Res. Dev. 57(3/4), art. no. 3, May/Jul 2013, DOI:10.1147/JRD.2013.2242674.Google Scholar
[337] , , and , “Does fractal scaling at the IP level depend on TCP flow arrival processes?” In 2nd Internet Measurement Workshop, pp. 63–68, Nov 2002, DOI:10.1145/637201.637208.Google Scholar
[338] , , and , “Dynamic program instrumentation for scalable performance tools.” In Scalable High-Performance Comput. Conf., pp. 841–850, May 1994, DOI:10.1109/SHPCC.1994.296728.Google Scholar
[339] , , , and , “An empirical comparison of generators for self similar simulated traffic.”Performance Evaluation 64(2), pp. 162–190, Feb 2007, DOI:10.1016/j.peva.2006.06.005.Google Scholar
[340] and , “Markovian modeling of real data traffic: Heuristic phase type and MAP fitting of heavy tailed and fractal like samples.” In Performance Evaluation of Complex Systems: Techniques and Tools, and (eds.), pp. 405–434, Springer-Verlag, 2002, DOI:10.1007/3-540-45798-4_17. Lect. Notes Comput. Sci. 2459.Google Scholar
[341] and , “PhFit: A general phase-type fitting tool.” In Computer Performance Evaluation: Modelling Techniques and Tools, et al. (eds.), pp. 82–91, Springer-Verlag, 2002, DOI:10.1007/3-540-46029-2_5. Lect. Notes Comput. Sci. 2324.Google Scholar
[342] , “Fractional differencing.”Biometrika 68(1), pp. 165–176, Apr 1981, DOI:10.1093/biomet/68.1.165.Google Scholar
[343] , “Modeling persistence in hydrological time series using fractional differencing.”Water Resources Res. 20(12), pp. 1989–1908, Dec 1984, DOI:10.1029/WR020i012p01898.Google Scholar
[344] and , “Microarchitecture-independent workload characterization.”IEEE Micro 27(3), pp. 63–72, May/Jun 2007, DOI:10.1109/MM.2007.56.Google Scholar
[345] , “Workload evolution on the Cornell Theory Center IBM SP2.” In Job Scheduling Strategies for Parallel Processing, pp. 27–40, Springer-Verlag, 1996, DOI:10.1007/BFb0022285. Lect. Notes Comput. Sci. 1162.Google Scholar
[346] and , “Characteristics of I/O traffic in personal computer and server workloads.”IBM Syst. J. 42(2), pp. 347–372, 2003, DOI:10.1147/sj.422.0347.Google Scholar
[347] , , and , “I/O reference behavior of production database workloads and the TPC benchmarks – an analysis at the logical level.”ACM Trans. Database Syst. 26(1), pp. 96–143, Mar 2001, DOI:10.1145/383734.383737.Google Scholar
[348] , , and , “Characteristics of production database workloads and the TCP benchmarks.”IBM Syst. J. 40(3), pp. 781–802, 2001, DOI:10.1147/sj.403.0781.Google Scholar
[349] , , and , “The automatic improvement of locality in storage systems.”ACM Trans. Comput. Syst. 23(4), pp. 424–473, Nov 2005, DOI:10.1145/1113574.1113577.Google Scholar
[350] , , , , and , “The HiBench benchmark suite: Characterization of the MapReduce-based data analysis.” In 2nd Intl. Workshop Inf. & Softw. as Services, pp. 41–51, Mar 2010, DOI:10.1109/ICDEW.2010.5452747.Google Scholar
[351] and , Evolutionary Dynamics of the World-Wide Web. Tech. rep., Xerox Palo Alto Research Center, Jan 1999. http://arxiv.org/abs/condmat/9901071v2.
[352] and , “Growth dynamics of the world-wide web.”Nature 401, p. 131, Sep 1999, DOI:10.1038/43604.Google Scholar
[353] , “Long-term storage capacity of reservoirs.”Trans. Am. Soc. Civil Engineers 116, pp. 770–808, 1951.Google Scholar
[354] , , and , “The effect of detail on Ethernet simulation.” In 18th Parallel & Distrib. Sim., pp. 97–104, May 2004, DOI:10.1109/PADS.2004.1301290.Google Scholar
[355] and , “Empirical observations on the session timeout threshold.”Inf. Process. & Management 45(5), pp. 513–528, Sep 2009, DOI:10.1016/j.ipm.2009.04.007.Google Scholar
[356] and , “Grid computing workloads.”IEEE Internet Comput. 15(2), pp. 19–26, Mar/Apr 2011, DOI:10.1109/MIC.2010.130.Google Scholar
[357] , , , , , , and , “On grid performance evaluation using synthetic workloads.” In Job Scheduling Strategies for Parallel Processing, and (eds.), pp. 232–255, Springer-Verlag, 2006, DOI:10.1007/978-3-540-71035-6_12. Lect. Notes Comput. Sci. 4376.Google Scholar
[358] , , , and , “The characteristics and performance of groups of jobs in grids.” In EuroPar, pp. 382–393, Aug 2007, DOI:10.1007/978-3-540-74466-5_42.Google Scholar
[359] , , , , , , and , “The grid workloads archive.”Future Generation Comput. Syst. 24(7), pp. 672–686, May 2008, DOI:10.1016/j.future.2008.02.003.Google Scholar
[360] , “Unix file size survey – 1993.” www.gordoni.com/ufs93.html.
[361] , , , and , “A general methodology for characterizing access patterns and analyzing web server performance.” In 6th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 167–174, Jul 1998, DOI:10.1109/MASCOT.1998.693691.Google Scholar
[362] , , and , “Representative traces for processor models with infinite caches.” In 2nd High Performance Comput. Arch., pp. 62–72, Feb 1996, DOI:10.1109/HPCA.1996.501174.Google Scholar
[363] , “Congestion avoidance and control.” In ACM SIGCOMM Conf., pp. 314–329, Aug 1988, DOI:10.1145/52325.52356.Google Scholar
[364] , , and , “Data clustering: A review.”ACM Comput. Surv. 31(3), pp. 264–323, Sep 1999, DOI:10.1145/331499.331504.Google Scholar
[365] , “Characteristics of destination address locality in computer networks: A comparison of caching schemes.”Computer Networks and ISDN Systems 18(4), pp. 243–254, May 1990, DOI:10.1016/0169-7552(90)90106-3.Google Scholar
[367] and , “The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations.”Comm. ACM 28(10), pp. 1076–1085, Oct 1985, DOI:10.1145/4372.4378.Google Scholar
[368] and , “Packet trains – measurements and a new model for computer network traffic.”IEEE J. Select Areas in Commun. SEC-4(6), pp. 986–995, Sep 1986, DOI:10.1109/JSAC.1986.1146410.Google Scholar
[369] , , , , , and , “Modeling of workload in MPPs.” In Job Scheduling Strategies for Parallel Processing, pp. 95–116, Springer-Verlag, 1997, DOI:10.1007/3-540-63574-2_18. Lect. Notes Comput. Sci. 1291.Google Scholar
[370] , , and , “Determining the informational, navigational, and transactional intent of web queries.”Inf. Process. & Management 44(3), pp. 1251– 1266, May 2008, DOI:10.1016/j.ipm.2007.07.015.Google Scholar
[371] , , , and , “Automated gathering of web information: An in-depth examination of agents interacting with search engines.”ACM Trans. Internet Technology 6(4), pp. 442–464, Nov 2006, DOI:10.1145/1183463.1183468.Google Scholar
[372] and , “An analysis of web searching by European All the Web.com users.”Inf. Process. & Management 41(2), pp. 361–381, Mar 2005, DOI:10.1016/S0306-4573(03)00067-0.Google Scholar
[373] , , , and , “Defining a session on web search engines.”J. Am. Soc. Inf. Sci. & Tech. 58(6), pp. 862–871, Apr 2007, DOI:10.1002/asi.20564.Google Scholar
[374] , , and , “A temporal comparison of AltaVista web searching.”J. Am. Soc. Inf. Sci. & Tech. 56(6), pp. 559–570, 2005, DOI:10.1002/asi.20145.Google Scholar
[375] , , and , “Real life, real users, and real needs: A study and analysis of user queries on the web.”Inf. Process. & Management 36, pp. 207–227, 2000, DOI:10.1016/S0306-4573(99)00056-4.Google Scholar
[376] , , , , and , “Workload characterization and performance implications of large-scale blog servers.”ACM Trans. Web 6(4), art. no. 16, Nov 2012, DOI:10.1145/2382616.2382619.Google Scholar
[377] , , , and , “Suggestions of efficient self-similar generators.”Simulation Modeling Practice & Theory 15(3), pp. 328–353, Mar 2007, DOI:10.1016/j.simpat.2006.10.002.Google Scholar
[378] , , , and , “Comparison of various estimators in simulated FGN.”Simulation Modeling Practice & Theory 15(9), pp. 1173–1191, Oct 2007, DOI:10.1016/j.simpat.2007.08.004.Google Scholar
[379] , , , , , , , and , “PCantorSim: Accelerating parallel architecture simulation through fractal-based sampling.”ACM Trans. Arch. & Code Optimization 10(4), art. no. 49, Dec 2013, DOI:10.1145/2541228.2555305.Google Scholar
[380] and , “Sources and characteristics of web temporal locality.” In 8th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 28–35, Aug 2000, DOI:10.1109/MASCOT.2000.876426.Google Scholar
[381] , , , and , “Workload characterization for news-on-demand streaming services.” In 26th IEEE Intl. Performance, Comput. & Commun. Conf., pp. 314–323, Apr 2007, DOI:10.1109/PCCC.2007.358909.Google Scholar
[382] , “Systems of frequency curves generated by methods of translation.”Biometrika 36(1/2), pp. 149–176, Jun 1949.Google Scholar
[383] and , “The memory fragmentation problem: Solved?” In 1st Intl. Symp. Memory Management, pp. 26–36, Oct 1998, DOI:10.1145/301589.286864.CrossRef
[384] and , “Beyond the session timeout: Automatic hierarchical segmentation of search topics in query logs.” In 17th ACM Conf. Inf. & Knowledge Management, pp. 699–708, Oct 2008, DOI:10.1145/1458082.1458176.CrossRef
[385] , , , and , “‘I know what you did last summer’ – query logs and user privacy.” In 16th Conf. Inf. & Knowledge Mgmt., pp. 909–914, Nov 2007, DOI:10.1145/1321440.1321573.Google Scholar
[386] , , Jr., and , “Distilling the essence of proprietary workloads into miniature benchmarks.”ACM Trans. Arch. & Code Optimization 5(2), art. no. 10, Aug 2008, DOI:10.1145/1400112.1400115.Google Scholar
[387] , , , and , “Measuring benchmark similarity using inherent program characteristics.”IEEE Trans. Comput. 55(6), pp. 769–782, Jun 2006, DOI:10.1109/TC.2006.85.Google Scholar
[388] , , and , “Flash crowds and denial of service attacks: Characterization and implications for CDNs and web sites.” In 11th Intl. World Wide Web Conf., pp. 293–304, May 2002, DOI:10.1145/511446.511485.Google Scholar
[389] , , , and , “Web search clickstreams.” In 6th Internet Measurement Conf., pp. 245–250, Oct 2006, DOI:10.1145/1177080.1177110.Google Scholar
[390] and , “Nonparametric estimation from incomplete observations.”J. Am. Stat. Assoc. 53(282), pp. 457–481, Jun 1958.Google Scholar
[391] , , , , and , “Is P2P dying or just hiding?” In IEEE Globecom, vol. 3, pp. 1532–1538, Nov 2004, DOI:10.1109/GLOCOM.2004.1378239.Google Scholar
[392] , , , and , “Transport layer identification of P2P traffic.” In 4th Internet Measurement Conf., pp. 121–134, Oct 2004, DOI:10.1145/1028788.1028804.Google Scholar
[393] , , and , “A user-friendly self-similarity analysis tool.”Comput. Commun. Rev. 33(3), pp. 81–93, Jul 2003, DOI:10.1145/956993.957004.Google Scholar
[394] , , and , “Long-range dependence: Ten years of Internet traffic modeling.”IEEE Internet Computing 8(5), pp. 57–64, Sep-Oct 2004, DOI:10.1109/MIC.2004.46.Google Scholar
[395] , , , and , “Human mobility models for opportunistic networks.”IEEE Commun. Mag. 49(12), pp. 157–165, Dec 2011, DOI:10.1109/MCOM.2011.6094021.Google Scholar
[396] , , , and , “Characterization of storage workload traces from production Windows servers.” In IEEE Intl. Symp.|Workload Characterization, pp. 119–128, Sep 2008, DOI:10.1109/IISWC.2008.4636097.Google Scholar
[397] , , , , and , “Performance characterization of a quad Pentium Pro SMP using OLTP workloads.” In 25th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 15–26, Jun 1998, DOI:10.1145/279361.279364.Google Scholar
[398] , “A new measure of rank correlation.”Biometrika 30(1–2), pp. 81–93, 1938, DOI:10.1093/biomet/30.1-2.81.Google Scholar
[399] and , “The problem of m rankings.”Ann. Math. Statist. 10(3), pp. 275–287, Sep 1939.Google Scholar
[400] , , and , “A comparison of trace-sampling techniques for multi-megabyte caches.”IEEE Trans. Comput. 43(6), pp. 664–675, Jun 1994, DOI:10.1109/12.286300.Google Scholar
[401] , , and , “Extracting a mobility model from real user traces.” In 25th IEEE INFOCOM, Apr 2006, DOI:10.1109/INFOCOM.2006.173.Google Scholar
[402] and , “The RP3 program visualization environment.”IBM J. Res. Dev. 35(5/6), pp. 635–651, Sep/Nov 1991, DOI:10.1147/rd.355.0635.Google Scholar
[403] and , “SWSL: A synthetic workload specification language for real-time systems.”IEEE Trans. Softw. Eng. 20(10), pp. 798–811, Oct 1994, DOI:10.1109/32.328992.Google Scholar
[404] and , “Hierarchical dynamics, interarrival times, and performance.” In Supercomputing, art. no. 28, Nov 2003, DOI:10.1109/SC.2003.10040.Google Scholar
[405] and , “MinneSPEC: A new SPEC benchmark workload for simulation-based computer architecture research.”IEEE Comput. Arch. Let. 1(1), 2002, DOI:10.1109/L-CA.2002.8.Google Scholar
[406] and , “The Enron corpus: A new dataset for email classification research.” In 15th European Conf. Machine Learning, pp. 217–226, Springer-Verlag, 2004, DOI:10.1007/978-3-540-30115-8 22. Lect. Notes Comput. Sci.3201.Google Scholar
[408] , , and , “Remote physical device fingerprinting.”IEEE Trans. Dependable & Secure Comput. 2(2), pp. 93–108, Apr-Jun 2005, DOI:10.1109/TDSC.2005.26.Google Scholar
[409] , , and , “On the validity of trace-driven simulation for multiprocessors.” In 18th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 244–253, May 1991, DOI:10.1145/115953.115977.Google Scholar
[410] , , and , “Generalized ERSS tree model: Revisiting working sets.”Performance Evaluation 67(11), pp. 1139–1154, Nov 2010, DOI:10.1016/j.peva.2010.08.004.Google Scholar
[411] , “A systematic approach for workload modeling for parallel processing systems.”Parallel Comput. 22(13), pp. 1771–1787, Feb 1997, DOI:10.1016/S0167-8191(96)00076-2.Google Scholar
[412] and , “Practical prefetching techniques for parallel file systems.” In 1st Intl. Conf. Parallel & Distributed Inf. Syst., pp. 182–189, Dec 1991, DOI:10.1109/PDIS.1991.183101.Google Scholar
[413] and , “Analysis of a campus-wide wireless network.”Wireless Netw. 11(1-2), pp. 115–133, Jan 2005, DOI:10.1007/s11276-004-4750-0.Google Scholar
[414] , , , , , and , “Experimental evaluation of wireless simulation assumptions.” In 7th ACM Intl. Symp. Modeling, Analysis, and Simul. Wireless & Mobile Syst., pp. 78–82, Oct 2004, DOI:10.1145/1023663.1023679.Google Scholar
[415] and , “File-system workload on a scientific multiprocessor.”IEEE Parallel & Distributed Technology 3(1), pp. 51–60, Spring 1995, DOI:10.1109/88.384584.Google Scholar
[416] , , and , “A synthetic workload generation technique for stress testing session-based systems.”IEEE Trans. Softw. Eng. 32(11), pp. 868–882, Nov 2006, DOI:10.1109/TSE.2006.106.Google Scholar
[417] and , “The stealth distributed scheduler.” In 11th Intl. Conf. Distributed Comput. Syst., pp. 336–343, May 1991, DOI:10.1109/ICDCS.1991.148686.Google Scholar
[418] , , and , “Job scheduling is more important than processor allocation for hypercube computers.”IEEE Trans. Parallel & Distributed Syst. 5(5), pp. 488–497, May 1994, DOI:10.1109/71.282559.Google Scholar
[419] , , and , “Synthesizing representative I/O workloads using iterative distillation.” In 11th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 6–15, Oct 2003, DOI:10.1109/MASCOT.2003.1240637.Google Scholar
[420] , “Playing dirty.”IEEE Spectrum 44(12INT), pp. 30–35, Dec 2007, DOI:10.1109/MSPEC.2007.4390020.Google Scholar
[421] and , “Choosing representative slices of program execution for microarchitecture simulations: A preliminary application to the data stream.” In 3rd Workshop on Workload Characterization, Sep 2000.Google Scholar
[422] and , “Stretched exponential distributions in nature and economy: ‘Fat tails’ with characteristic scales.”European Physical J. B 2(4), pp. 525–539, May 1998, DOI:10.1007/s100510050276.Google Scholar
[423] , , and , “The cache performance and optimizations of blocked algorithms.” In 4th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 63–74, Apr 1991, DOI:10.1145/106972.106981.Google Scholar
[424] , “A comparative study of system response time on program developer productivity.”IBM Syst. J. 23(1), pp. 36–43, 1984, DOI:10.1147/sj.231.0036.Google Scholar
[425] and , “Rapid model parameterization from traffic measurements.”ACM Trans. Modeling & Comput. Simulation 12(3), pp. 201–229, Jul 2002, DOI:10.1145/643114.643117.Google Scholar
[427] , “The use of percentiles in modeling CPU service time distributions.” In Computer Performance, and (eds.), pp. 53–66, North-Holland, 1977.Google Scholar
[428] , Performance Evaluation of Computer and Communication Systems. EPFL Press, 2010. (Available from http://perfeval.epfl.ch/).
[429] , , and , “MediaBench: A tool for evaluating and synthesizing multimedia and communication systems.” In 13th Intl. Symp. Microarchitecture, pp. 330–335, Dec 1997, DOI:10.1109/MICRO.1997.645830.Google Scholar
[430] , , , and , “Are user runtime estimates inherently inaccurate?” In Job Scheduling Strategies for Parallel Processing, pp. 253–263, Springer-Verlag, 2004, DOI:10.1007/11407522 14. Lect. Notes Comput. Sci.3277.Google Scholar
[431] , , , , and , “Execution characteristics of desktop applications on Windows NT.” In 25th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 27–38, Jun 1998, DOI:10.1145/279358.279366.Google Scholar
[432] , , and , “The effectiveness of combining in shared memory parallel computers in the presence of ‘hot spots.’” In Intl. Conf. Parallel Processing, pp. 35–41, Aug 1986.Google Scholar
[433] , “CNN.com: Facing a world crisis.”;Login: 27(1), p. 83, Feb 2002. (summary of invited talk at LISA 2001).Google Scholar
[434] and , “Load-balancing heuristics and process behavior.” In SIG-METRICS Conf. Measurement & Modeling of Comput. Syst., pp. 54–69, May 1986, DOI:10.1145/317499.317539.Google Scholar
[435] , , , and , “On the self-similar nature of Ethernet traffic.”IEEE/ACM Trans. Networking 2(1), pp. 1–15, Feb 1994, DOI:10.1109/90.282603.Google Scholar
[436] , “Where is client/server software headed?”Computer 28(4), pp. 49–55, Apr 1995, DOI:10.1109/2.375177.Google Scholar
[437] , , , , , and , “An empirical study of flash crowd dynamics in a P2P-based live video streaming system.” In IEEE Global Telecom. Conf., art. no. 339, Nov 2008, DOI:10.1109/GLOCOM.2008.ECP.339.Google Scholar
[438] and , “Model-driven simulation of grid scheduling strategies.” In 3rd IEEE Intl. Conf. e-Science & Grid Comput., pp. 287–294, Dec 2007, DOI:10.1109/ E-SCIENCE.2007.51.Google Scholar
[439] , , and , “Modeling correlated workloads by combining model based clustering and a localized sampling algorithm.” In 21st Intl. Conf. Supercomputing, pp. 64–72, Jun 2007, DOI:10.1145/1274971.1274983.Google Scholar
[440] , “Random texts exhibit Zipf's-law-like word frequency distribution.”IEEE Trans. Inf. Theory 38(6), pp. 1842–1845, Nov 1992, DOI:10.1109/18.165464.Google Scholar
[442] , “The ANL/IBM SP scheduling system.” In Job Scheduling Strategies for Parallel Processing, pp. 295–303, Springer-Verlag, 1995, DOI:10.1007/3-540-60153-8 35. Lect. Notes Comput. Sci.949.Google Scholar
[443] , Measuring Computer Performance: A Practitioner's Guide. Cambridge University Press, 2000.Google Scholar
[444] , , and , “Log-normal distributions across the sciences: Keys and clues.”BioScience 51(5), pp. 341–352, May 2001, DOI:10.1641/0006-3568(2001)051[0341:LNDATS]2.0.CO;2.Google Scholar
[445] , , and , “Traffic model and performance evaluation of web servers.”Performance Evaluation 46(2–3), pp. 77–100, Oct 2001, DOI:10.1016/S0166-5316(01)00046-3.Google Scholar
[446] , “Long-term memory in stock market prices.”Econometrica 59(5), pp. 1279–1313, Sep 1991.Google Scholar
[447] , , , , , and , “An analysis of database workload performance on simultaneous multithreaded processors.” In 25th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 39–50, Jun 1998, DOI:10.1145/279358.279367.Google Scholar
[448] and , “Job scheduling for prime time vs. non-prime time.” In 4th Intl. Conf. Cluster Comput., pp. 488–493, Sep 2002, DOI:10.1109/CLUSTR.2002.1137789.Google Scholar
[449] , , and , “A comparative study of real workload traces and synthetic workload models for parallel job scheduling.” In Job Scheduling Strategies for Parallel Processing, pp. 25–46, Springer-Verlag, 1998, DOI:10.1007/BFb0053979. Lect. Notes Comput. Sci.1459.Google Scholar
[450] , “Business failures: Another example of the analysis of failure data.”J. Am. Stat. Assoc. 49(268), pp. 847–852, Dec 1954, DOI:10.1080/01621459.1954.10501239.Google Scholar
[451] , “Methods of measuring the concentration of wealth.”Pub. Am. Stat. Assoc. 9(70), pp. 209–219, Jun 1905.Google Scholar
[452] , , , and , “Effects and implications of file size/service time correlation on web server scheduling policies.” In 13th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 258–267, 2005, DOI:10.1109/MASCOTS.2005.30.Google Scholar
[453] and , “The workload on parallel supercomputers: Modeling the characteristics of rigid jobs.”J. Parallel & Distributed Comput. 63(11), pp. 1105–1122, Nov 2003, DOI:10.1016/S0743-7315(03)00108-4.Google Scholar
[454] and , “A longitudinal study of P2P traffic classification.” In 14th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 179–188, Sep 2006, DOI:10.1109/MASCOTS.2006.6.Google Scholar
[455] and , “Characteristics of program localities.”Comm. ACM 19(5), pp. 285–294, May 1976, DOI:10.1145/360051.360227.Google Scholar
[456] and , “Learning nonstationary models of normal network traffic for detecting novel attacks.” In 8th Intl. Conf. Knowledge Discovery and Data Mining, pp. 376–385, Jul 2002, DOI:10.1145/775047.775102.Google Scholar
[457] , , , and , “On dominant characteristics of residential broadband Internet traffic.” In 9th Internet Measurement Conf., pp. 90–102, Nov 2009, DOI:10.1145/1644893.1644904.Google Scholar
[458] , , , , and , “An assessment of overt malicious activity manifest in residential networks.” In 8th Detection of Intrusion & Malware, & Vulnerability Assessment, pp. 144–163, Springer-Verlag, Jul 2011, DOI:10.1007/978-3-642-22424-9 9. Lect. Notes Comput. Sci.6739.Google Scholar
[459] , , and , “A first look at mobile hand-held device traffic.” In 11th Passive&Active Measurement Conf., pp. 161–170, Springer-Verlag, Apr 2010, DOI:10.1007/978-3-642-12334-4 17. Lect. Notes Comput. Sci.6032.Google Scholar
[460] , , and , “NAT usage in residential broadband networks.” In 12th Passive&Active Measurement Conf., pp. 32–41, Springer-Verlag, Mar 2011, DOI:10.1007/978-3-642-19260-9 4. Lect. Notes Comput. Sci.6579.Google Scholar
[461] , , , and , “Theoretical analysis and simulations of the generalized Lotka-Volterra model.”Phys. Rev. E 66(3), pp. 031102–1– 031102–6, 2002, DOI:10.1103/PhysRevE.66.031102.Google Scholar
[462] , , and , “Performance measurement intrusion and perturbation analysis.”IEEE Trans. Parallel & Distributed Syst. 3(4), pp. 433–450, Jul 1992, DOI:10.1109/71.149962.Google Scholar
[463] , “A note on a class of skew distribution functions: Analysis and critique of a paper by H. A. Simon.”Info. & Control 2(1), pp. 90–99, Apr 1959, DOI:10.1016/S0019-9958(59)90098-1.Google Scholar
[464] , “How long is the coast of Britain? Statistical self-similarity and fractional dimension.”Science 156(3775), pp. 636–638, 5 May 1967, DOI:10.1126/ science.156.3775.636.Google Scholar
[466] and , “Robust R/S analysis of long-run serial correlation.”Bulletin of the I.S.I.48, pp. 69–99, 1979.Google Scholar
[467] and , “Fractional Brownian motions, fractional noises and applications.”SIAM Rev. 10(4), pp. 422–437, Oct 1968, DOI:10.1137/1010093.Google Scholar
[468] and , “Some long-run properties of geophysical records.”Water Resources Res. 5(2), pp. 321–340, Apr 1969, DOI:10.1029/WR005i002p00321.Google Scholar
[469] , , and , “Approximate medians and other quantiles in one pass and with limited memory.” In SIGMOD Intl. Conf. Management of Data, pp. 426–435, Jun 1998, DOI:10.1145/276304.276342.Google Scholar
[470] , “Visualizing working sets.”Operating Syst. Rev. 31(4), pp. 3–11, Oct 1997, DOI:10.1145/271019.271021.Google Scholar
[471] and , “Load balancing vs. locality management in shared-memory multiprocessors.” In Intl. Conf. Parallel Processing, vol. I, pp. 258–265, Aug 1992.Google Scholar
[472] and , “The estimation of heavy-tailed probability density functions, their mixtures and quantiles.”Comput. Networks 40(3), pp. 459–474, Oct 2002, DOI:10.1016/S1389-1286(02)00306-7.Google Scholar
[473] , Jr., “The Kolmogorov-Smirnov test for goodness of fit.”J. Am. Stat. Assoc. 46(253), pp. 68–78, Mar 1951, DOI:10.1080/01621459.1951.10500769.Google Scholar
[474] , , , and , “Evaluation techniques for storage hierarchies.”IBM Syst. J. 9(2), pp. 78–117, 1970, DOI:10.1147/sj.92.0078.Google Scholar
[475] and , “Quantifying loop nest locality using SPEC'95 and the Perfect benchmarks.”ACM Trans. Comput. Syst. 17(4), pp. 288–336, Nov 1999, DOI:10.1145/329466.329484.Google Scholar
[476] , , , and , “A fast file system for UNIX.”ACMTrans. Comput. Syst. 2(3), pp. 181–197, Aug 1984, DOI:10.1145/989.990.Google Scholar
[479] , “‘…the very game…’: A tutorial on mathematical modeling.”www.causascientia.org/math stat/Tutorial.pdf, 1999.Google Scholar
[480] , “A compendium of common probability distributions.” www.causascientia.org/math stat/Dists/Compendium.html, 2001.
[481] , , and , “Sampling, log binning, fitting, and plotting durations of open and shut intervals from single channels and the effect of noise.”Pflügers Archiv Euro. J. Physiology 410(4-5), pp. 530–553, Nov 1987, DOI:10.1007/BF00586537.Google Scholar
[482] and , “On extracting session data from activity logs.” In 5th Intl. Syst. & Storage Conf., art. no. 3, Jun 2012, DOI:10.1145/2367589.2367592.Google Scholar
[483] , , and , “Measuring IP and TCP behavior on edge nodes with Tstat.”Comput. Networks 47(1), pp. 1–21, Jan 2005, DOI:10.1016/j.comnet.2004.06.026.Google Scholar
[484] , , and , Performance by Design: Computer Capacity Planning by Example. Prentice-Hall, 2004.Google Scholar
[485] , , , and , “A methodology for workload characterization of e-commerce sites.” In 1st ACM Conf. Electronic Commerce, pp. 119–128, Nov 1999, DOI:10.1145/336992.337024.Google Scholar
[486] , , , , and W. Meira Jr., “A hierarchical and multiscale approach to analyze E-business workloads.”Performance Evaluation 54(1), pp. 33–57, Sep 2003, DOI:10.1016/S0166-5316(02) 00228-6.Google Scholar
[487] and , “An efficient single-pass trace compression technique utilizing instruction streams.”ACM Trans. Modeling & Comput. Simulation 17(1), pp. 2.1–2.17, Jan 2007, DOI:10.1145/1189756.1189758.Google Scholar
[488] , “Some effects of intermittent silence.”Am. J. Psychology 70(2), pp. 311–314, Jun 1957, DOI:10.2307/1419346.Google Scholar
[489] and , “Towards a profound analysis of bags-of-tasks in parallel systems and their performance impact.” In 20th Intl. Symp. High Performance Distributed Comput., pp. 111–122, Jun 2011, DOI:10.1145/1996130.1996148.Google Scholar
[490] , , , and , “Towards characterizing cloud backend workloads: Insights from Google compute clusters.”Performance Evaluation Rev. 37(4), pp. 34–41, Mar 2010, DOI:10.1145/1773394.1773400.Google Scholar
[491] , , , , and , “Measurement and analysis of online social networks.” In 7th Internet Measurement Conf., pp. 29–42, Oct 2007, DOI:10.1145/1298306.1298311.Google Scholar
[492] and , “Dynamic 3D graphics workload characterization and the architectural implications.” In 32nd Intl. Symp. Microarchitecture, pp. 62–71, Nov 1999, DOI:10.1109/MICRO.1999.809444.Google Scholar
[493] , , , and , “Server-side bot detection in massively multiplayer online games.”IEEE Security & Privacy 7(3), pp. 29–36, May 2009, DOI:10.1109/MSP.2009.78.Google Scholar
[494] , , and , “Stable Paretian modeling in finance: Some empirical and theoretical aspects.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 79–110, Birkhäuser, 1998.Google Scholar
[495] , “The power of two choices in randomized load balancing.”IEEE Trans. Parallel & Distributed Syst. 12(10), pp. 1094–1104, Oct 2001, DOI:10.1109/71.963420.Google Scholar
[496] , “A brief history of generative models for power law and lognormal distributions.”Internet Math. 1(2), pp. 226–251, 2003.Google Scholar
[497] , “Dynamic models for file sizes and double Pareto distributions.”Internet Math. 1(3), pp. 305–333, 2004.Google Scholar
[498] , , , , , and , “Identifying and exploiting spatial regularity in data memory references.” In Supercomputing, Nov 2003, DOI:10.1145/1048935.1050199.Google Scholar
[499] and , “Identifying web browsing trends and patterns.”Computer 34(7), pp. 94–95, Jul 2001, DOI:10.1109/2.933515.Google Scholar
[500] and , Applied Statistics and Probability for Engineers. John Wiley & Sons, 2nd ed., 1999.Google Scholar
[501] , “Tests of Chi-squared type.” In Goodness-of-Fit Techniques, and (eds.), pp. 63–95, Marcel Dekker, Inc., 1986.
[502] , , and , “Workload characterization in multi-player online games.” In Intl. Conf. Computational Science & Applications, pp. 490–499, Springer-Verlag, May 2006, DOI:10.1007/11751540 52. Lect. Notes Comput. Sci.3980.Google Scholar
[503] and , A Model for Analyzing the Roles of Network and User Behavior in Congestion Control. Tech. Rep. MIT-LCS-TR898, MIT Lab. Computer Science, May 2003.Google Scholar
[504] , “MPI: A message-passing interface standard.”Intl. J. Supercomput. Appl. & High Performance Comput.8(3/4), pp. 159–416, Fall/Winter 1994.Google Scholar
[505] , “MPI2: A message passing interface standard.”Intl. J. High Performance Comput. Appl.12(1/2), pp. 1–299, Spring/Summer 1998.Google Scholar
[506] and , “Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling.”IEEE Trans. Parallel & Distributed Syst. 12(6), pp. 529–543, Jun 2001, DOI:10.1109/1.932708.Google Scholar
[507] , , , and , “The implications of working set analysis on supercomputing memory hierarchy design.” In 19th Intl. Conf. Supercomputing, pp. 332–340, Jun 2005, DOI:10.1145/1088149.1088193.Google Scholar
[508] , , and , “Identification of user sessions with hierarchical agglomerative clustering.” In Proc. Am. Soc. Inf. Sci. & Tech., vol. 43, 2006, DOI:10.1002/meet.14504301312.Google Scholar
[509] and , “The available capacity of a privately owned workstation environment.”Performance Evaluation 12(4), pp. 269–284, Jul 1991, DOI:10.1016/0166-5316(91)90005-N.Google Scholar
[510] , , and , “Unveiling Facebook: A measurement study of social based applications.” In 8th Internet Measurement Conf., pp. 43–56, Oct 2008, DOI:10.1145/1452520.1452527.Google Scholar
[511] and , “The Bayesian information criterion: Background, derivation, and applications.”WIREs Comput. Stat. 4(2), pp. 199–203, Mar/Apr 2012, DOI:10.1002/wics.199.Google Scholar
[512] , “The structure and function of complex networks.”SIAM Rev. 45(2), pp. 167–256, 2003, DOI:10.1137/S003614450342480.Google Scholar
[513] , “Power laws, Pareto distributions and Zipf's law.”Contemporary Physics 46(5), pp. 323–351, Sep-Oct 2005, DOI:10.1080/00107510500052444.Google Scholar
[514] , , and , “Parallel application characterization for multiprocessor scheduling policy design.” In Job Scheduling Strategies for Parallel Processing, pp. 175–199, Springer-Verlag, 1996, DOI:10.1007/BFb0022294. Lect. Notes Comput. Sci.1162.Google Scholar
[515] and , “Low-level interfaces for high-level parallel I/O.” In Input/Output in Parallel and Distributed Computer Systems, , , and (eds.), pp. 205–223, Kluwer Academic Publishers, 1996.
[516] , , , , and , “File-access characteristics of parallel scientific workloads.”IEEE Trans. Parallel & Distributed Syst. 7(10), pp. 1075–1089, Oct 1996, DOI:10.1109/71.539739.Google Scholar
[517] , “Why Kendall tau?”Teaching Statistics 3(2), pp. 41–43, May 1981, DOI:10.1111/j.1467-9639.1981.tb00422.x.Google Scholar
[518] , “Univariate stable distributions: Parameterization and software.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 527–533, Birkhäuser, 1998.Google Scholar
[519] , Stable Distributions: Models for Heavy Tailed Data. Birkhäusear, 2015. (In progress).Google Scholar
[520] , , and , “QBETS: Queue bounds estimation from time series.” In Job Scheduling Strategies for Parallel Processing, and (eds.), pp. 76–101, Springer-Verlag, Jun 2007, DOI:10.1007/978-3-540-78699-3 5. Lect. Notes Comput. Sci.4942.Google Scholar
[521] , , , and , “A compound model for TCP connection arrivals for LAN and WAN applications.”Comput. Networks 40(3), pp. 319–337, Oct 2002, DOI:10.1016/S1389-1286(02)00298-0.Google Scholar
[522] , , and , “Legal issues surrounding monitoring during network research.” In 7th Internet Measurement Conf., pp. 141–148, Oct 2007, DOI:10.1145/1298306.1298307.Google Scholar
[523] , , and , “Profiling computation jobs in grid systems.” In 7th IEEE Intl. Symp. Cluster Comput. & Grid, pp. 197–204, May 2007, DOI:10.1109/CCGRID.2007.87.Google Scholar
[524] and , “Hierarchical workload characterization for a busy web server.” In TOOLS, et al. (eds.), pp. 309–328, Springer-Verlag, Apr 2002, DOI:10.1007/3-540-46029-2 23. Lect. Notes Comput. Sci.2324.Google Scholar
[525] and , “Database system performance evaluation models: A survey.”Performance Evaluation 69(10), pp. 471–493, Oct 2012, DOI:10.1016/j.peva.2012.05.006.Google Scholar
[526] and , “Necessary and sufficient conditions for representing general distributions by Coxians.” In Computer Performance Evaluations, Modelling Techniques and Tools, and (eds.), pp. 182–199, Springer-Verlag, Sep 2003, DOI:10.1007/978-3-540-45232-4 12. Lect. Notes Comput. Sci.2794.Google Scholar
[527] and , “A closed-form solution for mapping general distributions to minimal PH distributions.” In Computer Performance Evaluations, Modelling Techniques and Tools, and (eds.), pp. 200–217, Springer-Verlag, 2003, DOI:10.1007/978-3-540-45232-4 13. Lect. Notes Comput. Sci.2794.Google Scholar
[528] , “Scheduling techniques for concurrent systems.” In 3rd Intl. Conf. Distributed Comput. Syst., pp. 22–30, Oct 1982.Google Scholar
[529] , , , , , and , “A trace-driven analysis of the UNIX 4.2 BSD file system.” In 10th Symp. Operating Systems Principles, pp. 15–24, Dec 1985, DOI:10.1145/323627.323631.Google Scholar
[530] , , , and , “Congestion control for high performance, stability and fairness in general networks.”IEEE/ACM Trans. Networking 13(1), pp. 43–56, Feb 2005, DOI:10.1109/TNET.2004.842216.Google Scholar
[531] , , , , , and , “A first look at modern enterprise traffic.” In 5th Internet Measurement Conf., pp. 15–28, Oct 2005.Google Scholar
[532] , , , and , “The devil and packet trace anonymization.”Comput. Commun. Rev. 36(1), pp. 29–38, Jan 2006, DOI:10.1145/1111322.1111330.Google Scholar
[533] “Parallel Workloads Archive.” www.cs.huji.ac.il/labs/parallel/workload/.
[534] , , , and , “Long-range dependence in a changing Internet traffic mix.”Comput. Networks 48(3), pp. 401–422, Jun 2005, DOI:10.1016/j.comnet.2004.11.018.Google Scholar
[535] , , , , and , “Capturing the elusive Poissonity in web traffic.” In 14th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 189–196, Sep 2006, DOI:10.1109/MASCOTS.2006.17.Google Scholar
[536] and (eds.), Self-Similar Network Traffic and Performance Evaluation. John Wiley & Sons, 2000.
[537] and , “Self-similar network traffic: An overview.” In Self-Similar Network Traffic and Performance Evaluation, and (eds.), pp. 1–38, John Wiley & Sons, 2000, DOI:10.1002/047120644X.ch1.Google Scholar
[538] , , and , “A picture of search.” In 1st Intl. Conf. Scalable Information Syst., Jun 2006, DOI:10.1145/1146847.1146848.Google Scholar
[539] and , “Wide-area traffic: The failure of Poisson modeling.”IEEE/ACM Trans. Networking 3(3), pp. 226–244, Jun 1995, DOI:10.1109/90.392383.Google Scholar
[540] and , “MMX technology extension to the Intel architecture.”IEEE Micro 16(4), pp. 42–50, Aug 1996, DOI:10.1109/40.526924.Google Scholar
[541] , , and , “Intel MMX for multimedia PCs.”Comm. ACM 40(1), pp. 25–38, Jan 1997, DOI:10.1145/242857.242865.Google Scholar
[542] , , and , “Analysis of the impact of memory in distributed parallel processing systems.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 5–18, May 1994, DOI:10.1145/183018.183021.Google Scholar
[543] , “Zipf's law, the central limit theorem, and the random division of the unit interval.”Phys. Rev. E 54(1), pp. 220–223, Jul 1996, DOI:10.1103/PhysRevE.54.220.Google Scholar
[545] , , , and , “Performance evaluation of the Quadrics interconnection network.”Cluster Comput. 6(2), pp. 125–142, Apr 2003, DOI:10.1023/A:1022852505633.Google Scholar
[546] and , “‘Hot-spot’ contention and combining in multistage interconnection networks.”IEEE Trans. Comput.C-34(10), pp. 943–948, Oct 1985, DOI:10.1109/TC.1985.6312198.Google Scholar
[547] and , “An inter-reference gap model for temporal locality in program behavior.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 291–300, May 1995, DOI:10.1145/223587.223620.Google Scholar
[548] , “A concurrent file system for a highly parallel mass storage subsystem.” In 4th Conf. Hypercubes, Concurrent Comput., & Appl., vol. I, pp. 155–160, Mar 1989.Google Scholar
[549] and , “Google predicts spread of flu using huge search data.”The Guardian, Nov 13, 2008. www.guardian.co.uk/technology/2008/nov/13/google-internet.Google Scholar
[550] and , “Predictive user click models based on click-through history.” In 16th Conf. Inf. & Knowledge Mgmt., pp. 175–182, Nov 2007, DOI:10.1145/1321440.1321467.CrossRefGoogle Scholar
[551] and , “Measuring the congesion responsiveness of Internet traffic.” In 8th Passive & Active Measurement Conf., pp. 176–185, Apr 2007, DOI:10.1007/978-3-540-71617-4 18.Google Scholar
[552] , , and , “A trace-driven simulator for performance evaluation of cache-based multiprocessor systems.”IEEE Trans. Parallel & Distributed Syst. 6(9), pp. 915–929, Sep 1995, DOI:10.1109/71.466630.Google Scholar
[553] , “A general theory of bibliometric and other cumulative advantage processes.”J. Am. Soc. Inf. Sci. 27(5), pp. 292–306, Sep 1976, DOI:10.1002/asi.4630270505.Google Scholar
[554] , , , , and , “Characterizing parallel file-access patterns on a large-scale multiprocessor.” In 9th Intl. Parallel Processing Symp., pp. 165–172, Apr 1995, DOI:10.1109/IPPS.1995.395928.Google Scholar
[555] , “Cluster analysis and workload classification.”Performance Evaluation Rev. 20(4), pp. 24–30, May 1993, DOI:10.1145/155775.155781.Google Scholar
[556] , “A tutorial on hidden Markov models and selected applications in speech recognition.”Proc. IEEE 77(2), pp. 257–286, Feb 1989, DOI:10.1109/5.18626.Google Scholar
[557] , , and , “Generative workload models for a single server environment.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 118–127, May 1994, DOI:10.1145/183018.183031.Google Scholar
[558] , , and , “Workload modeling of stateful protocols using HMMs.” In 31st Comput. Measurement Group Intl. Conf., pp. 673–682, Dec 2005.Google Scholar
[559] and , “High-speed prefix-preserving IP address anonymization for passive measurement systems.”IEEE/ACM Trans. Networking 15(1), pp. 26–39, Feb 2007, DOI:10.1109/TNET.2006.890128.Google Scholar
[560] and , “Mixture densities, maximum likelihood and the EM algorithm.”SIAM Rev. 26(2), pp. 195–239, Apr 1984, DOI:10.1137/1026034.Google Scholar
[561] and , “From gene families and genera to incomes and internet file sizes: Why power laws are so common in nature.”Phys. Rev. E 66(6), pp. 067103– 1–067103–4, 2002, DOI:10.1103/PhysRevE.66.067103.Google Scholar
[562] , , , , and , “Heterogeneity and dynamicity of clouds at scale: Google trace analysis.” In 3rd Symp. Cloud Comput., art. no. 7, Oct 2012, DOI:10.1145/2391229.2391236.Google Scholar
[563] , , and , “Obfuscatory obscanturism: Making workload traces of commercially-sensitive systems safe to release.” In Network Operations & Management Symp., pp. 1279–1286, Apr 2012, DOI:10.1109/NOMS.2012.6212064.Google Scholar
[564] , “Why non-linearities can ruin the heavy-tailed modeler's day.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 219–239, Birkhäuser, 1998.Google Scholar
[565] , “Variation of the frequency of fatal quarrels with magnitude.”J. Am. Stat. Assoc. 43(244), pp. 523–546, Dec 1948, DOI:10.2307/2280704.Google Scholar
[566] , , , and , “A multifractal wavelet model with applications to network traffic.”IEEE Trans. Information Theory 45(3), pp. 992–1018, Apr 1999, DOI:10.1109/18.761337.Google Scholar
[567] , , and , “Efficient fitting of long-tailed data sets into phase-type distributions.”Performance Evaluation Rev. 30(3), pp. 6–8, Dec 2002, DOI:10.1145/605521.605525.Google Scholar
[568] , , and , “An EM-based technique for approximating long-tailed data sets with PH distributions.”Performance Evaluation55(1-2), pp. 147–164, Jan 2004, DOI:10.1016/S0166-5316(03)00101-9.Google Scholar
[569] and , “Disk drive level workload characterization.” In USENIX Ann. Tech. Conf., pp. 97–102, Jun 2006.Google Scholar
[570] and , “M/G/1-type Markov processes: A tutorial.” In Performance Evaluation of Complex Systems: Techniques and Tools, and (eds.), pp. 36–63, Springer-Verlag, 2002, DOI:10.1007/3-540-45798-4 3. Lect. Notes Comput. Sci. 2459.Google Scholar
[571] , , and , “File popularity characterisation.”Performance Evaluation Rev. 27(4), pp. 45–50, Mar 2000, DOI:10.1145/346000.346014.Google Scholar
[572] , , , , , and , “Initial starting point analysis for k-means clustering: A case study.” In Conf. Applied Research in Information Tech., Mar 2006.Google Scholar
[573] , , , , , and , “Workload characterization of 3D games.” In IEEE Intl. Symp. Workload Characterization, pp. 17–26, Oct 2006, DOI:10.1109/IISWC.2006.302726.Google Scholar
[574] , , and , “LiTGen, a lightweight traffic generator: Applications to P2P and mail wireless traffic.” In 8th Passive & Active Measurement Conf., pp. 52–62, Springer-Verlag, Apr 2007, DOI:10.1007/978-3-540-71617-4 6. Lect. Notes Comput. Sci.4427.
[575] , , and , “Catching IP traffic burstiness with a lightweight generator.” In 6th IFIP Networking 2007, pp. 924–934, Springer-Verlag, May 2007, DOI:10.1007/978-3-540-72606-7 79. Lect. Notes Comput. Sci.4479.Google Scholar
[576] , , , and , “Complete computer system simulation: The SimOS approach.”IEEE Parallel & Distributed Technology 3(4), pp. 34–43, Winter 1995, DOI:10.1109/88.473612.Google Scholar
[577] and , “The design and implementation of a log-structured file system.”ACM Trans. Comput. Syst. 10(1), pp. 26–52, Feb 1992, DOI:10.1145/146941.146943.Google Scholar
[578] , “What is actually taking place on web sites: E-commerce lessons from web server logs.” In ACM Conf. Electronic Commerce, pp. 38–43, Oct 2000, DOI:10.1145/352871.352876.Google Scholar
[579] , “Determining a computing center environment.”Comm. ACM 8(7), pp. 465–468, Jul 1965, DOI:10.1145/364995.365690.Google Scholar
[581] , , and , “User patience and the web: A hands-on investigation.” In IEEE Globecom, vol. 7, pp. 4163–4168, Dec 2003, DOI:10.1109/GLOCOM.2003.1259011.Google Scholar
[582] , , , and , “Models of parallel applications with large computation and I/O requirements.”IEEE Trans. Softw. Eng. 28(3), pp. 286–307, Mar 2002, DOI:10.1109/32.991321.Google Scholar
[583] and , “Call centers with hyperexponential patience modeling.”Intl. J. Production Economics 141(1), pp. 307–315, Jan 2013, DOI:10.1016/j.ijpe.2012.08.011.Google Scholar
[584] , , and , “Debugging parallel programs in parallel.” In Workshop on Parallel and Distributed Debugging, pp. 216–225, SIGPLAN/SIGOPS, May 1988, DOI:10.1145/68210.69236.Google Scholar
[585] and , “UNIX disk access patterns.” In USENIX Winter Conf. Proc., pp. 405–420, Jan 1993.Google Scholar
[586] and , “An introduction to disk drive modeling.”Computer 27(3), pp. 17–28, Mar 1994, DOI:10.1109/2.268881.Google Scholar
[587] , “Understanding correlation.” www.mega.nu:8080/ampp/rummel/uc.htm, 1976.
[588] , “Long range dependence.”Foundations & Trends in Stochastic Systems 1(3), pp. 163–257, 2007, DOI:10.1561/0900000004.Google Scholar
[589] and , Stable Non-Gaussian Random Processes: Stochastic Models with Infinite Variance. Chapman & Hall, 1994.Google Scholar
[590] , , , , and , “Leveraging Zipf's law for traffic offloading.”Comput. Commun. Rev. 42(1), pp. 17–22, Jan 2012, DOI:10.1145/2096149.2096152.Google Scholar
[591] , , and , “Connection-level analysis and modeling of network traffic.” In 1st Internet Measurement Workshop, pp. 99–103, Nov 2001, DOI:10.1145/505202.505215.Google Scholar
[592] , “The evolution of Coda.”ACM Trans. Comput. Syst. 20(2), pp. 85–124, May 2002, DOI:10.1145/507052.507053.Google Scholar
[593] , , and , “The interactive performance of SLIM: A stateless thin-client architecture.” In 17th Symp. Operating Systems Principles, pp. 32–47, Dec 1999, DOI:10.1145/319344.319154.Google Scholar
[594] , , , and , “The new web: Characterizing AJAX traffic.” In 9th Passive & Active Measurement Conf., pp. 31–40, Apr 2008, DOI:10.1007/978-3-540-79232-1_4. Lect. Notes Comput. Sci. 4979.Google Scholar
[595] , , , , and , “Pitfalls in HTTP traffic measurements and analysis.” In 13th Passive & Active Measurement Conf., pp. 242–251, Springer-Verlag, Mar 2012, DOI:10.1007/978-3-642-28537-0_24. Lect. Notes Comput. Sci. 7192.Google Scholar
[596] , , and , “Packet capture in 10-Gigabit Ethernet environments using contemporary commodity hardware.” In 8th Passive & Active Measurement Conf., pp. 207–217, Springer-Verlag, Apr 2007, DOI:10.1007/978-3-540-71617-4_21. Lect. Notes Comput. Sci. 4427.Google Scholar
[597] and , “Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?” In 5th USENIX Conf. File & Storage Technologies, pp. 1–16, Feb 2007.Google Scholar
[598] and , “Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness.”Cluster Comput. 7(2), pp. 151–161, Apr 2004, DOI:10.1023/B:CLUS.0000018564.05723.a2.Google Scholar
[599] and , “Web servers under overload: How scheduling can help.”ACM Trans. Internet Technology 6(1), pp. 20–52, Feb 2006.Google Scholar
[600] , , and , “Open versus closed: A cautionary tale.” In 3rd Networked Systems Design & Implementation, pp. 239–252, May 2006.Google Scholar
[602] , “Estimating the dimension of a model.”Ann. Statist. 6(2), pp. 461–464, Mar 1978.Google Scholar
[603] , “On optimal and data-based histograms.”Biometrika 66(3), pp. 605–610, 1979, DOI:10.1093/biomet/66.3.605.Google Scholar
[604] and , “The use of feedback in multiprocessors and its application to tree saturation control.”IEEE Trans. Parallel & Distributed Syst. 1(4), pp. 385–398, Oct 1990, DOI:10.1109/71.80178.Google Scholar
[605] and , “The MetaCrawler architecture for resource aggregation on the web.”IEEE Expert 12(1), pp. 11–14, Jan-Feb 1997, DOI:10.1109/64.577468.Google Scholar
[606] , “Characterization of parallelism in applications and their use in scheduling.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 171–180, May 1989, DOI:10.1145/75108.75391.Google Scholar
[607] , “Application scheduling and processor allocation in multiprogrammed parallel processing systems.”Performance Evaluation 19(2–3), pp. 107–140, Mar 1994, DOI:10.1016/0166-5316(94)90036-1.Google Scholar
[608] and , “An interconnection network that exploits locality of communication.” In 8th Intl. Conf. Distributed Comput. Syst., pp. 74–85, Jun 1988, DOI:10.1109/DCS.1988.12502.Google Scholar
[609] , , and , “Load-sensitive routing of long-lived IP flows.” In ACM SIGCOMM Conf., pp. 215–226, Aug 1999, DOI:10.1145/316194.316225.Google Scholar
[610] , , , , , and , “Analysis of input-dependent program behavior using active profiling.” In Workshop on Experimental Computer Science, art. no. 5, Jun 2007, DOI:10.1145/1281700.1281705.Google Scholar
[611] , , and , “Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system.”Comm. ACM 15(12), pp. 1063–1069, Dec 1972, DOI:10.1145/361598.361626.Google Scholar
[612] , , , and , “Automatically characterizing large scale program behavior.” In 10th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 45–57, Oct 2002, DOI:10.1145/605397.605403.Google Scholar
[613] and , “Using site-level modeling to evaluate the performance of parallel system schedulers.” In 14th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 167–176, Sep 2006, DOI:10.1109/MASCOTS.2006.50.Google Scholar
[614] and , “Uncovering the effect of system performance on user behavior from traces of parallel systems.” In 15th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 274–280, Oct 2007, DOI:10.1109/MASCOTS.2007.67.Google Scholar
[615] and , “On simulation and design of parallel-systems schedulers: Are we doing the right thing?”IEEE Trans. Parallel & Distributed Syst. 20(7), pp. 983–996, Jul 2009, DOI:10.1109/TPDS.2008.152.Google Scholar
[617] and , Search Session Extraction: A User Model of Searching. Tech. rep., Bell Labs, Jan 2002.Google Scholar
[619] , “Performance analysis and workload characterization of the 3DMark05 benchmark on modern parallel computer platforms.”Comput. Arch. News 35(3), pp. 44–52, Jun 2007, DOI:10.1145/1294313.1294315.Google Scholar
[620] , “On a distribution law for word frequencies.”J. Am. Stat. Assoc. 70(351), pp. 542–547, Sep 1975, DOI:10.1080/01621459.1975.10482469.Google Scholar
[621] and , “On the contribution of TCP to the self-similarity of network traffic.” In Intl. Workshop Digital Commun., (ed.), pp. 596–613, Springer-Verlag, Sep 2001, DOI:10.1007/3-540-45400-4_38. Lect. Notes Comput. Sci. 2170.Google Scholar
[622] , , , and , “Analysis of a very large web search engine query log.”SIGIR Forum 33(1), pp. 6–12, Fall 1999, DOI:10.1145/331403.331405.Google Scholar
[623] and , “A comparison of logical and physical parallel I/O patterns.”Intl. J. High Performance Comput. Appl. 12(3), pp. 364–380, Sep 1998, DOI:10.1177/109434209801200305.Google Scholar
[624] and , “A mathematical theory of citing.”J. Am. Soc. Inf. Sci. & Tech. 58(11), pp. 1661–1673, Sep 2007, DOI:10.1002/asi.20653.Google Scholar
[625] and , “Re-inventing Willis.”Phys. Rep. 502(1), pp. 1–35, May 2011, DOI:10.1016/j.physrep.2010.12.004.Google Scholar
[626] , “On a class of skew distribution functions.”Biometrika 42(3/4), pp. 425–440, Dec 1955, DOI:10.1093/biomet/42.3-4.425.Google Scholar
[627] , “Some further notes on a class of skew distribution functions.”Info. & Control 3(1), pp. 80–88, Mar 1960, DOI:10.1016/S0019-9958(60)90302-8.Google Scholar
[628] and , “Synthetic workload generation for experimentation with multiprocessors.” In 3rd Intl. Conf. Distributed Comput. Syst., pp. 778–785, Oct 1982.Google Scholar
[629] , , and , “Scaling parallel programs for multiprocessors: Methodology and examples.”Computer 26(7), pp. 42–50, Jul 1993, DOI:10.1109/MC.1993.274941.Google Scholar
[630] , , and , “A model of workloads and its use in missrate prediction for fully associative caches.”IEEE Trans. Comput. 41(7), pp. 811–825, Jul 1992, DOI:10.1109/12.256450.Google Scholar
[631] , , and , “SPLASH: Stanford parallel applications for shared-memory.”Comput. Arch. News 20(1), pp. 5–44, Mar 1992, DOI:10.1145/130823.130824.Google Scholar
[632] and , “Design and characterization of the Berkeley multimedia workload.”Multimedia Systems 8(4), pp. 315–327, Jul 2002, DOI:10.1007/s005300200052.Google Scholar
[633] and , “Workload characterization of input/output intensive parallel applications.” In 9th Intl. Conf. Comput. Performance Evaluation, pp. 169–180, Springer-Verlag, Jun 1997, DOI:10.1007/BFb0022205. Lect. Notes Comput. Sci. 1245.Google Scholar
[634] , “Cache memories.”ACM Comput. Surv. 14(3), pp. 473–530, Sep 1982, DOI:10.1145/356887.356892.Google Scholar
[635] , “Workloads (creation and use).”Comm. ACM 50(11), pp. 45–50, Nov 2007, DOI:10.1145/1297797.1297821.Google Scholar
[636] , “A study of branch prediction strategies.” In 8th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 135–148, May 1981.Google Scholar
[637] , “Characterizing computer performance with a single number.”Comm. ACM 31(10), pp. 1202–1206, Oct 1988, DOI:10.1145/63039.63043.Google Scholar
[638] and , “File system aging – increasing the relevance of file system benchmarks.” In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 203–213, Jun 1997, DOI:10.1145/258612.258689.Google Scholar
[640] and , “Self-configuring network traffic generation.” In 4th Internet Measurement Conf., pp. 68–81, Oct 2004, DOI:10.1145/1028788.1028798.Google Scholar
[641] , , and , “A framework for malicious workload generation.” In 4th Internet Measurement Conf., pp. 82–87, Oct 2004, DOI:10.1145/1028788.1028799.Google Scholar
[642] , , and , “Parallel computer workload modeling with Markov chains.” In Job Scheduling Strategies for Parallel Processing, pp. 47–62, Springer-Verlag, 2004, DOI:10.1007/11407522_3. Lect. Notes Comput. Sci. 3277.Google Scholar
[643] , “The proof and measurement of association between two things.”Am. J. Psychology 15(1), pp. 72–101, Jan 1904.Google Scholar
[644] , , and , “Using color to code quantity in spatial displays.”J. Experimental Psychology: Applied 5(4), pp. 393–412, 1999.Google Scholar
[645] , , , and , “From e-sex to e-commerce: Web search changes.”Computer 35(3), pp. 107–109, Mar 2002, DOI:10.1109/2.989940.Google Scholar
[646] , , and , “Sexual and pornographic web searching: Trends analysis.”First Monday 11(9), Sep 2006. www.firstmonday.org/issues/issue11_9/spink/.Google Scholar
[648] and , “Experiments with program locality.” In AFIPS Fall Joint Comput. Conf., vol. I, pp. 611–621, Dec 1972, DOI:10.1145/1479992.1480078.Google Scholar
[649] and , “Impression fraud in online advertising via pay-per-view networks.” In 22nd USENIX Security Symp., pp. 211–226, Aug 2013.Google Scholar
[650] , “The basics of performance-monitoring hardware.”IEEE Micro 22(4), pp. 64–71, Jul-Aug 2002, DOI:10.1109/MM.2002.1028477.Google Scholar
[651] , “Pentium 4 performance-monitoring features.”IEEE Micro 22(4), pp. 72–82, Jul-Aug 2002, DOI:10.1109/MM.2002.1028478.Google Scholar
[652] , , and , “Analysis of job arrival patterns and parallel scheduling performance.”Performance Evaluation36–37, pp. 137–163, Aug 1999, DOI:10.1016/S0166-5316(99)00035-8.Google Scholar
[653] and , “On the construction of a representative synthetic workload.”Comm. ACM 17(3), pp. 127–133, Mar 1974, DOI:10.1145/360860.360863.Google Scholar
[654] “Standard performance evaluation corporation.” www.spec.org.
[655] Standard Performance Evaluation Corp., “SPECweb2005.” www.spec.org/web2005/, 2005.
[656] and , “Probabilistic methods in web caching.”Performance Evaluation 46(2–3), pp. 125–137, Oct 2001, DOI:10.1016/S0166-5316(01)00045-1.Google Scholar
[657] and , “Web robot detection: A probabilistic reasoning approach.”Computer Networks 53(3), pp. 265–278, Feb 2009, DOI:10.1016/j.comnet.2008.09.021.Google Scholar
[658] , “EDF statistics for goodness of fit and some comparisons.”J. Am. Stat. Assoc. 69(347), pp. 730–737, Sep 1974, DOI:10.1080/01621459.1974.10480196.Google Scholar
[659] , “Tests based on EDF statistics.” In Goodness-of-Fit Techniques, and (eds.), pp. 97–193, Marcel Dekker, Inc., 1986.Google Scholar
[660] , , and , “A detailed comparison of two transaction processing workloads.” In 5th Workshop on Workload Characterization, pp. 37–48, Nov 2002, DOI:10.1109/WWC.2002.1226492.Google Scholar
[661] , , and , “Exploiting nonstationarity for performance prediction.” In 2nd EuroSys, pp. 31–44, Mar 2007, DOI:10.1145/1272996.1273002.Google Scholar
[662] , , , and , “On the wavelet spectrum diagnostic for Hurst parameter estimation in the analysis of Internet traffic.”Comput. Networks 48(3), pp. 423–445, Jun 2005, DOI:10.1016/j.comnet.2004.11.017.Google Scholar
[664] , , , , , and , “Behavior-based modeling and its application to email analysis.”ACM Trans. Internet Technology 6(2), pp. 187–221, May 2006, DOI:10.1145/1149121.1149125.Google Scholar
[665] , “Spam back to 94% of all e-mail.”New York Times (Technology Section), Mar 31, 2009.Google Scholar
[666] and , “Set-associative cache simulation using generalized binomial trees.”ACM Trans. Comput. Syst. 13(1), pp. 32–56, Feb 1995, DOI:10.1145/200912.200918.Google Scholar
[667] and , “Power laws of research output: Evidence for journals of economics.”Scientometrics 51(2), pp. 405–414, Jun 2001, DOI:10.1023/ A:1012757802706.Google Scholar
[668] and , “Improving and stabilizing parallel computer performance using adaptive backfilling.” In 19th Intl. Parallel & Distributed Processing Symp., Apr 2005, DOI:10.1109/IPDPS.2005.252.Google Scholar
[669] , , and , “Comparing logs and models of parallel workloads using the Co-plot method.” In Job Scheduling Strategies for Parallel Processing, pp. 43–66, Springer-Verlag, 1999, DOI:10.1007/3-540-47954-6 3. Lect. Notes Comput. Sci. 1659.Google Scholar
[670] , , and , “A co-plot analysis of logs and models of parallel workloads.”ACM Trans. Modeling & Comput. Simulation 12(3), art. no. 12, Jul 2007, DOI:10.1145/1243991.1243993.Google Scholar
[672] , , and , “Bottlenecks in multimedia processing with SIMD style extensions and architectural enhancements.”IEEE Trans. Comput. 52(8), pp. 1015–1031, Aug 2003, DOI:10.1109/TC.2003.1223637.Google Scholar
[673] , , and , “File size distribution on UNIX systems – then and now.”Operating Syst. Rev. 40(1), pp. 100–104, Jan 2006, DOI:10.1145/1113361.1113364.Google Scholar
[674] , , , and , “Modeling and generating realistic streaming media server workloads.”Comput. Networks 51(1), pp. 336–356, Jan 2007, DOI:10.1016/j.comnet.2006.05.003.Google Scholar
[675] and , “Robustness of Whittle-type estimators for time series with long-range dependence.”Stochastic Models 13(4), pp. 723–757, 1997, DOI:10.1080/15326349708807449.Google Scholar
[676] and , “On estimating the intensity of long-range dependence in finite and infinite variance time series.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 177–217, Birkhäauser, 1998.Google Scholar
[677] , , and , “Is network traffic self-similar or multi-fractal?”Fractals 5(1), pp. 63–73, Mar 1997, DOI:10.1142/S0218348X97000073.Google Scholar
[678] , , and , “Proof of a fundamental result in self-similar traffic modeling.”Comput. Commun. Rev. 27(2), pp. 5–23, Apr 1997, DOI:10.1145/263876.263879.Google Scholar
[679] , “Order in Pollock's chaos.”Scientific American 287(6), pp. 84–89, Dec 2002.
[680] , , , and M. , “Information re-retrieval: Repeat queries in Yahoo's logs.” In 30th SIGIR Conf. Information Retrieval, pp. 151–158, Jul 2007, DOI:10.1145/1277741.1277770.Google Scholar
[681] , , and , “A critical look at Lo's modified R/S statistic.”J. Statistical Planning & Inference 80(1-2), pp. 211–227, Aug 1999, DOI:10.1016/S0378-3758(98)00250-X.Google Scholar
[682] , “On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio.”IEEE Trans. Comput. 38(7), pp. 1012–1026, Jul 1989, DOI:10.1109/12.30852.Google Scholar
[683] , , and , “Synthetic traces for trace-driven simulation of cache memories.”IEEE Trans. Comput. 41(4), pp. 388–410, Apr 1992, DOI:10.1109/12.135552.(Correctedin IEEE Trans. Comput. 42(5) p. 635, May 1993).Google Scholar
[684] , , , , , , , , and , “Hive – awarehousing solution over a map-reduce framework.”Proc. VLDB Endowment 2(2), pp. 1626–1629, Aug 2009.Google Scholar
[685] , “The analysis and detection of outliers.” In Goodness-of-Fit Techniques, and (eds.), pp. 497–522, Marcel Dekker, Inc., 1986.Google Scholar
[686] , , , and , “A nine year study of file system and storage benchmarking.”ACM Trans. Storage 4(2), pp. 5:1–5:56, May 2008, DOI:10.1145/1367829.1367831.Google Scholar
[687] , , and , “SAX: A tool for studying congestion-induced surfer behavior.” In 7th Passive&Active Measurement Conf., Mar 2006.Google Scholar
[688] Transaction Processing Performance Council (TPC), “TPC benchmark DS standard specification version 1.1.0.” www.tpc.org/tpcds/spec/tpcds_1.1.0.pdf, Apr 2012.
[689] and , Zipf's Law Revisited. Tech. Rep. 2007-115, School of Computer Science and Engineering, Hebrew University of Jerusalem, Aug 2007.Google Scholar
[690] , Probability and Statistics with Reliability, Queueing, and Computer Science Applications. John Wiley & Sons, 2nd ed., 2002.Google Scholar
[691] and , “Software reliability and rejuvenation: Modeling and analysis.” In Performance Evaluation of Complex Systems: Techniques and Tools, and (eds.), pp. 318–345, Springer-Verlag, 2002, DOI:10.1007/3-540-45798-4 14. Lect. Notes Comput. Sci. 2459.Google Scholar
[692] , “Using inaccurate estimates accurately.” In Job Scheduling Strategies for Parallel Processing, and (eds.), pp. 208–221, Springer, 2010, DOI:10.1007/978-3-642-16505-4 12. Lect. Notes Comput. Sci. 6253.Google Scholar
[693] , , and , “Modeling user runtime estimates.” In Job Scheduling Strategies for Parallel Processing, pp. 1–35, Springer-Verlag, 2005, DOI:10.1007/11605300 1. Lect. Notes Comput. Sci. 3834.Google Scholar
[694] , , and , “Backfilling using system-generated predictions rather than user runtime estimates.”IEEE Trans. Parallel & Distributed Syst. 18(6), pp. 789–803, Jun 2007, DOI:10.1109/TPDS.2007.70606.Google Scholar
[695] and , “Instability in parallel job scheduling simulation: The role of workload flurries.” In 20th Intl. Parallel & Distributed Processing Symp., Apr 2006, DOI:10.1109/IPDPS.2006.1639311.Google Scholar
[696] and , “The dynamics of backfilling: Solving the mystery of why increased inaccuracy may help.” In IEEE Intl. Symp. Workload Characterization, pp. 131–141, Oct 2006, DOI:10.1109/IISWC.2006.302737.Google Scholar
[697] , , and , “A noninvasive architecture to monitor real-time distributed systems.”Computer 23(3), pp. 11–23, Mar 1990, DOI:10.1109/2.50269.Google Scholar
[702] , , , , , , , and , “Scheduling parallelizable tasks to minimize average response time.” In 6th Symp. Parallel Algorithms & Architectures, pp. 200–209, Jun 1994, DOI:10.1145/181014.181331.Google Scholar
[703] and , “Large scale query log analysis of re-finding.” In 3rd Web Search & Data Mining, pp. 191–200, Feb 2010, DOI:10.1145/1718487.1718512.Google Scholar
[704] and , “Trace-driven memory simulation: A survey.”ACM Comput. Surv. 29(2), pp. 128–170, Jun 1997, DOI:10.1145/254180.254184.Google Scholar
[705] , “A bridging model for parallel computation.”Comm. ACM 33(8), pp. 103–111, Aug 1990.Google Scholar
[706] , , and , “Multifractality in TCP/IP traffic: The case against.”Comput. Networks 48(3), pp. 293–313, Jun 2005, DOI:10.1016/j.comnet.2004.11.011.Google Scholar
[707] and , “Communication characteristics of large-scale scientific applications for contemporary cluster architectures.”J. Parallel & Distributed Comput. 63(9), pp. 853–865, Sep 2003, DOI:10.1016/S0743-7315(03)00104-7.Google Scholar
[708] , , , and , “Intrusion detection for grid and cloud computing.”ITProfessional 12(4), pp. 38–43, Jul-Aug 2010, DOI:10.1109/MITP.2009.89.Google Scholar
[709] and , “Swing: Realistic and responsive network traffic generation.”IEEE/ACM Trans. Networking 17(3), pp. 712–725, Jun 2009, DOI:10.1109/TNET.2009.2020830.Google Scholar
[710] , “File system usage in Windows NT 4.0.” In 17th Symp. Operating Systems Principles, pp. 93–109, Dec 1999, DOI:10.1145/319344.319158.Google Scholar
[711] , , , , and , “Fractal nature of software-cache interaction.”IBM J. Res. Dev. 27(2), pp. 164–170, Mar 1983, DOI:10.1147/rd.272.0164.Google Scholar
[712] , “TREC: Improving information access through evaluation.”Bulletin Am. Soc. Information science & Tech. 32(1), pp. 16–21, Oct/Nov 2005, DOI:10.1002/bult.2003.1720320105.Google Scholar
[713] , “TREC: Continuing information retrieval's tradition of experimentation.”Comm. ACM 50(11), pp. 51–54, Nov 2007, DOI:10.1145/1297797.1297822.Google Scholar
[714] , “On test collections for adaptive information retrieval.”Inf. Process. & Management 44(6), pp. 1879–1885, Nov 2008, DOI:10.1016/j.ipm.2007.12.011.Google Scholar
[715] and (eds.), TREC: Experiment and Evaluation in Information Retrieval. MIT Press, 2005.
[716] and , “Further analysis of a computing center environment.”Comm. ACM 10(5), pp. 266–272, May 1967, DOI:10.1145/363282.363294.Google Scholar
[717] , , , and , “A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm.” In Job Scheduling Strategies for Parallel Processing, pp. 48–64, Springer-Verlag, 1996, DOI:10.1007/BFb0022287. Lect. Notes Comput. Sci. 1162.Google Scholar
[718] , , , and , “A simulation approach to evaluating design decisions in MapReduce setups.” In 17th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., Sep 2009, DOI:10.1109/MASCOT.2009.5366973.Google Scholar
[719] , , and , “Capturing the spatio-temporal behavior of real traffic data.”Performance Evaluation 49(1–4), pp. 147–163, Aug 2002, DOI:10.1016/S0166-5316(02)00108-6.Google Scholar
[721] , , Jr., and , “Automatic modeling of file system workloads using two-level arrival processes.”ACM Trans. Modeling & Comput. Simulation 8(3), pp. 305–330, Jul 1998, DOI:10.1145/290274.290317.Google Scholar
[722] , “Benchmarking.” In Performance Evaluation of Complex Systems: Techniques and Tools, and (eds.), pp. 179–207, Springer-Verlag, 2002, DOI:10.1007/3-540-45798-4 9. Lect. Notes Comput. Sci. 2459.Google Scholar
[723] , “An overview of common benchmarks.”Computer 23(12), pp. 65–75, Dec 1990, DOI:10.1109/2.62094.Google Scholar
[724] , , , , and , “Tmix: A tool for generating realistic TCP application workloads in ns-2.”Comput. Commun. Rev. 36(3), pp. 67–76, Jul 2006, DOI:10.1145/1140086.1140094.Google Scholar
[725] , , and , “Data cleaning methods for client and proxy logs.” In Workshop on Logging Traces of Web Activity: The Mechanics of Data Collection, May 2006.Google Scholar
[726] , , , and , “Not quite the average: An empirical study of web use.”ACM Trans. Web 2(1), art. no. 5, Feb 2008, DOI:10.1145/1326561.1326566.Google Scholar
[727] , “Note on a method for calculating corrected sums of squares and products.”Technometrics 4(3), pp. 419–420, Aug 1962, DOI:10.1080/ 00401706.1962.10490022.Google Scholar
[728] , , , and , “Web workload characterization: Ten years later.” In Web Content Delivery, , , and (eds.), chap. 1, pp. 3–21, Springer Science+Business Media, Inc., 2005, DOI:10.1007/0-387-27727-7 1.Google Scholar
[729] , , and , “Self-similarity and heavy tails: Structural modeling of network traffic.” In A Practical Guide to Heavy Tails, , , and (eds.), pp. 27–53, Birkhäauser, 1998.Google Scholar
[730] , , , and , “Self-similarity through high variability: Statistical analysis of Ethernet LAN traffic at the source level.”IEEE/ACM Trans. Networking 5(1), pp. 71–86, Feb 1997, DOI:10.1109/90.554723.Google Scholar
[731] , “A man/machine workload model.”ACM SIGSIM Simulation Digest 8(1), pp. 45–52, Oct 1976, DOI:10.1145/1103189.1103203.Google Scholar
[732] , , , and , “Dynamic storage allocation: A survey and critical review.” In Intl. Workshop Memory Management, Springer-Verlag, Sep 1995, DOI:10.1007/3-540-60368-9 19. Lect. Notes Comput. Sci. 986.Google Scholar
[733] , , , , and , “A comparison of workload traces from two production parallel machines.” In 6th Symp. Frontiers Massively Parallel Comput., pp. 319–326, Oct 1996, DOI:10.1109/FMPC.1996.558107.Google Scholar
[734] and , “Effect of TCP on self-similarity of network traffic.” In 12th IEEE Intl. Conf. Computer Communications & Networks, pp. 370–373, Oct 2003, DOI:10.1109/ICCCN.2003.1284196.Google Scholar
[735] , , , and , “A parallel hash join algorithm for managing data skew.”IEEE Trans. Parallel & Distributed Syst. 4(12), pp. 1355–1371, Dec 1993, DOI:10.1109/71.250117.Google Scholar
[736] , , , and , “An architecture for distributed real-time passive network measurement.” In 14th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 335–344, Sep 2006, DOI:10.1109/MASCOTS.2006.11.Google Scholar
[737] , “Dynamically forecasting network performance using the network weather service.”Cluster Comput. 1(1), pp. 119–132, 1998, DOI:10.1023/A:1019025230054.Google Scholar
[738] , , , , and , “System utilization benchmark on the Cray T3E and IBM SP2.” In Job Scheduling Strategies for Parallel Processing, pp. 56–67, Springer-Verlag, 2000, DOI:10.1007/3-540-39997-6 4. Lect. Notes Comput. Sci. 1911.Google Scholar
[739] , , , , and , “The SPLASH-2 programs: Characterization and methodological considerations.” In 22nd Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 24–36, Jun 1995, DOI:10.1145/223982.223990.Google Scholar
[740] , “The effect of time constraints on scaled speedup.”SIAM J. Sci. Statist. Comput. 11(5), pp. 838–858, Sep 1990, DOI:10.1137/0911050.Google Scholar
[741] , , and , “Cacheminer: A runtime approach to exploit cache locality on SMP.”IEEE Trans. Parallel & Distributed Syst. 11(4), pp. 357–374, Apr 2000, DOI:10.1109/71.850833.Google Scholar
[742] and , “Bandwidth sharing: The role of user impatience.” In IEEE Globecom, vol. 4, pp. 2258–2262, Nov 2001, DOI:10.1109/GLOCOM.2001.966181.Google Scholar
[743] and , “Simulation of computer architectures: Simulators, benchmarks, methodologies, and recommendations.”IEEE Trans. Comput. 55(3), pp. 268–280, Mar 2006, DOI:10.1109/TC.2006.44.Google Scholar
[744] , , , , , and , “Evaluating benchmark subsetting approaches.” In IEEE Intl. Symp. Workload Characterization, pp. 93–104, Oct 2006, DOI:10.1109/IISWC.2006.302733.Google Scholar
[745] , , , and , “Understanding user behavior in large-scale video-on-demand systems.” In EuroSys, pp. 333–344, Apr 2006, DOI:10.1145/1217935.1217968.Google Scholar
[746] , “A mathematical theory of evolution, based on the conclusions of Dr. J.C. Willis, F.R.S.”Phil. Trans. Royal Soc. London Series B 213(402-410), pp. 21–87, Jan 1925, DOI:10.1098/rstb.1925.0002.Google Scholar
[747] and , “On identifying user session boundaries in parallel workload logs.” In Job Scheduling Strategies for Parallel Processing, et al. (eds.), pp. 216–234, Springer-Verlag, 2012, DOI:10.1007/978-3-642-35867-8 12. Lect. Notes Comput. Sci. 7698.Google Scholar
[748] and , “Workload resampling for performance evaluation of parallel job schedulers.” In 4th Intl. Conf. Performance Engineering, pp. 149–159, Apr 2013, DOI:10.1145/2479871.2479893.Google Scholar
[749] and , “Workload resampling for performance evaluation of parallel job schedulers.”Concurrency & Computation – Pract. & Exp. 26(12), pp. 2079–2105, Aug 2014, DOI:10.1002/cpe.3240.Google Scholar
[750] and , “Preserving user behavior characteristics in trace-based simulation of parallel job scheduling.” In 22nd Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 51–60, Sep 2014, DOI:10.1109/MASCOTS.2014.15.Google Scholar
[751] and , “Experimental validation of the ON–OFF packet-level model for IP traffic.”Comput. Commun. 30(5), pp. 975–989, Mar 2007, DOI:10.1016/j.comcom.2006.08.029.Google Scholar
[752] , , and , “Estimation of Hurst parameter by variance-time plots.” In IEEE Pacific Rim Conf. Comm., Comput. & Signal Proc., vol. 2, pp. 883–886, Aug 1997, DOI:10.1109/PACRIM.1997.620401.Google Scholar
[753] , , , , , and , “Synthesizing representative I/O workloads for TPC-H.” In 10th Intl. Symp. High Performance Comput. Arch., pp. 142–151, 2004, DOI:10.1109/HPCA.2004.10019.Google Scholar
[754] , , , , , and , “A comprehensive toolset for workload characterization, performance modeling, and online control.” In Computer Performance Evaluations, Modelling Techniques and Tools, and (eds.), pp. 63–77, Springer-Verlag, Sep 2003, DOI:10.1007/978-3-540-45232-4 5. Lect. Notes Comput. Sci. 2794.Google Scholar
[755] , , , , and , “Workload-aware load balancing for clustered web servers.”IEEE Trans. Parallel & Distributed Syst. 16(3), pp. 219–233, Mar 2005, DOI:10.1109/TPDS.2005.38.Google Scholar
[756] and , “Some observations on user search behavior.” In 11th Australasian Document Computing Symp., Dec 2006.Google Scholar
[757] , , and , “Frequent value locality and value-centric data cache design.” In 9th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 150–159, Nov 2000, DOI:10.1145/356989.357003.Google Scholar
[758] , , , , and , “Decision-support workload characteristics on a clustered database server from the OS perspective.” In 23rd Intl. Conf. Distributed Comput. Syst., pp. 386–393, May 2003, DOI:10.1109/ICDCS.2003.1203488.Google Scholar
[759] and , “Analysis of personal computer workloads.” In 7th Modeling, Anal. & Simulation of Comput. & Telecomm. Syst., pp. 208–217, Oct 1999, DOI:10.1109/MASCOT.1999.805057.Google Scholar
[760] , , and , “Addressing shared resource contention in multicore processors via scheduling.” In 15th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 129–142, Mar 2010, DOI:10.1145/1736020.1736036.Google Scholar
[761] , , and , “What is worth learning from parallel workloads? A user and session based analysis.” In 19th Intl. Conf. Supercomputing, pp. 377–386, Jun 2005, DOI:10.1145/1088149.1088200.Google Scholar
[763] and , “Job-length estimation and performance in backfilling schedulers.” In 8th Intl. Symp. High Performance Distributed Comput., pp. 236–243, Aug 1999, DOI:10.1109/HPDC.1999.805303.Google Scholar
[764] , Trigonometric Series. Cambridge University Press, 2nd ed., 1959. (two volumes).Google Scholar