119
Bibliography
[1] G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. SIGCOMM Comput.
Commun. Rev., 34(4):281–292, Aug. 2004. DOI: 10.1145/1030194.1015499. 26, 28, 50,
62, 86, 99, 130
[2] R. Bakhshi, D. Gavidia, W. Fokkink, and M. Steen. An analytical model of information
dissemination for a gossip-based protocol. In Proc. Int. Conf. Distributed Computing and
Networking (ICDCN), pages 230–242, Berlin, Heidelberg, 2009. Springer-Verlag. DOI:
10.1007/978-3-540-92295-7_29. 62, 70, 87, 100, 128
[3] P. A. Bernstein, A. Fekete, H. Guo, R. Ramakrishnan, and P. Tamma. Relaxed-currency
serializability for middle-tier caching and replication. In Proc. ACM SIGMOD Int. Conf.
Management of Data, pages 599–610, June 2006. DOI: 10.1145/1142473.1142540. 49, 51,
52, 69, 85, 98, 128
[4] T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research.
Wireless Communications & Mobile Computing (WCMC): Special Issue on Mobile Ad Hoc Net-
working: Research, Trends and Applications, 2:483–502, 2002. DOI: 10.1002/wcm.72. 85,
129
[5] A. Chesnais, E. Gelenbe, and I. Mitrani. On the modeling of parallel access to shared data.
Commun. ACM, 26(3):196–202, March 1983. DOI: 10.1145/358061.358073. 92, 127, 129
[6] J. Cho. Crawling the Web: Discovery and Maintenance of a Large-Scale Web Dat a. PhD
thesis, Stanford University, November 2001. 12
[7] J. Cho and H. Garcia-Molina. e evolution of the web and implications for an incremental
crawler. In Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 200–209, San Francisco,
CA, USA, 2000. Morgan Kaufmann Publishers Inc. 11, 86, 99, 131
[8] P. J. Courtois. Decomposability, instabilities, and saturation in multiprogramming systems.
Commun. of ACM, 18(7):371–377, 1975. DOI: 10.1145/360881.360887. 48, 66, 128
[9] P. J. Denning and J. P. Buzen. e operational analysis of queueing network models. ACM
Comput. Surv., 10(3):225–261, 1978. DOI: 10.1145/356733.356735. 41, 90, 128
[10] L. Dowdy and C. Lowery. P.S. to Operating Systems. Prentice-Hall, Inc., Upper Saddle
River, NJ, USA, 1993. 35, 129
120 BIBLIOGRAPHY
[11] B. Fan, D. G. Andersen, M. Kaminsky, and K. Papagiannaki. Balancing throughput, ro-
bustness, and in-order delivery in P2P VoD. In Proc. Co-NEXT, pages 10:1–10:12, New
York, NY, USA, 2010. ACM. DOI: 10.1145/1921168.1921182. 81, 90, 101, 129
[12] S. Floyd, M. Handley, J. Padhye, and J. Widmer. TCP Friendly Rate Control (TFRC):
Protocol Specification. RFC 5348, September 2008. 97
[13] E. Gabber, J. Fellin, M. Flaster, F. Gu, B. Hillyer, W. T. Ng, B. Özden, and E. A. M.
Shriver. Starfish: highly-available block storage. In Proc. USENIX Annual Tech. Conf.,
pages 151–163, June 2003. 18, 19, 27, 50, 59, 84, 130
[14] I. Gupta. On the design of distributed protocols from differential equations. In Proc. ACM
Symp. on Principles of Distributed Computing (PODC), pages 216–225, July 2004. DOI:
10.1145/1011767.1011799. 71, 99, 128
[15] P. Gupta and P. R. Kumar. e capacity of wireless networks. IEEE Trans. Information
eory, 46(2):388–404, 2000. DOI: 10.1109/18.825799. 7, 81, 88, 131
[16] V. Gupta and R. Nathuji. Analyzing performance asymmetric multicore processors for
latency sensitive datacenter applications. In Proc. Int. Conf. on Power Aware Computing and
Systems (HotPower), pages 1–8, Berkeley, CA, USA, 2010. USENIX Association. 18, 19,
86, 99, 113, 128
[17] M. Harchol-Balter. Performance Modeling and Design of Computer Systems: Queueing eory
in Action. Cambridge University Press, Cambridge, UK, 2013. 24, 40, 128
[18] A. Heindl, G. Pokam, and A.-R. Adl-Tabatabai. An analytic model of optimistic software
transactional memory. In Proc. IEEE Int. Symp. on Performance Analysis of Systems and
Software (ISPASS), pages 153–162, April 2009. DOI: 10.1109/ISPASS.2009.4919647. 26,
28, 52, 60, 71, 84, 97, 130
[19] M. D. Hill and M. R. Marty. Amdahl’s law in the multicore era. IEEE Computer, 41(7):33–
38, 2008. DOI: 10.1109/MC.2008.209. 19, 20
[20] J. R. Jackson. Jobshop-like queueing systems. Management Science, 10(1):131–142, 1963.
DOI: 10.1287/mnsc.10.1.131. 25, 128
[21] J. Kang, J. F. Naughton, and S. Viglas. Evaluating window joins over unbounded streams.
In Proc. Int. Conf. on Data Engineering (ICDE), pages 341–352, March 2003. DOI:
10.1109/ICDE.2003.1260804. 8, 11, 18, 19, 59, 81, 96, 130
[22] J. Kim, D. Park, C. Nicopoulos, N. Vijaykrishnan, and C. R. Das. Design and analysis of an
NoC architecture from performance, reliability and energy perspective. In Proc. ACM Symp.
Architecture for Networking and Communications Systems (ANCS), pages 173–182, October
2005. DOI: 10.1109/ANCS.2005.4675277. 61, 85, 98, 129

Get Analytical Performance Modeling for Computer Systems, 2nd Edition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.