Notes
1. Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, 1979).
2. “Watson: A System Designed for Answers: The Future of Workload Optimized Systems Design,” IBM Systems and Technology, February, 2011. www-03.ibm.com/innovation/us/watson/what-is-watson/a-system-designed-for-answers.html
3. Gene M. Amdahl, “Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities,” AFIPS Conference Proceedings, Vol. 30 (Atlantic City, N.J., Apr. 18–20), AFIPS Press, Reston, Va., 1967, pp. 483–485. turing.eas.asu.edu/cse520fa08/Alaw.pdf.
4. Ibid.
5. Luiz André Barroso, Jeffrey Dean, and Urs Hölzle, “Web Search for a Planet: The Google Cluster Architecture,” IEEE Micro (March–April 2003): 22–28. static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/archive/googlecluster-ieee.pdf.
6. Stephen Shankland, “We’re all Guinea Pigs in Google’s Search Experiment,” CNet News, May 29, 2008. http://news.cnet.com/8301-10784_3-9954972-7.html?tag=mncol;txt.
7. Kai-Hui Chang and Chris Browy, “Parallel Logic Simulation: Myth or Reality?” Computer, April, 2012, pp. 67–73. www.computer.org/csdl/mags/co/2012/04/mco2012040067-abs.html.
8. Paul Roberts, “The Cloud Makes Short Work of Strong Encryption,” threatpost, Kaspersky Lab, November 19, 2010. http://threatpost.com/en_us/blogs/cloud-makes-short-work-strong-encryption-111910.
Get Cloudonomics: The Business Value of Cloud Computing, + Website now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
