Under Google's decentralized research model, we've been able to build an industry-leading systems infrastructure, while allowing the same engineers that have contributed to those innovations to remain members of the research community. The impact of their research is amplified by the fact that their ideas have usually been tested through real product implementation by the time of publication. Google's systems research portfolio has to a significant degree established the state-of-the-art for how cloud computing should be architected (e.g., map-reduce and very large-scale cluster computing), with publications that range from cluster architecture and energy efficiency to distributed file systems and cluster-level programming models.
“Projecting Disk Usage Based on Historical Trends in a Cloud Environment”, Murray Stokely, Amaan Mehrabian, Christoph Albrecht, Francois Labelle, Arif Merchant, Proceedings of the 3rd international workshop on Scientific cloud computing, 2012 (to appear).
[abstract] [search]
“Recursion in Scalable Protocols via Distributed Data Flows”, Krzysztof Ostrowski, Languages for Distributed Algorithms, 2012 (to appear).
[abstract] [pdf] [search]
“A Tight Unconditional Lower Bound on Distributed Random Walk Computation”, Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan, ACM Symposium on Principles of Distributed Computing (PODC), 2011.
[search]
“Characterizing Task Usage Shapes in Google Compute Clusters”, Qi Zhang, Joseph Hellerstein, Raouf Boutaba, Proceedings of the 5th International Workshop on Large Scale Distributed Systems and Middleware (2011).
[abstract] [pdf] [search]
“Design and Implementation of FAITH, an Experimental System to Intercept and Manipulate Online Social Informatics”, Ruaylong Lee, Roozbeh Nia, Jason Hsu, Karl N. Levitt, Jeff Rowe, S. Felix Wu, Shaozhi Ye, International Conference on Advances in Social Networks Analysis and Mining, 2011, pp. 195-202.
[computer.org] [search]
“Diagnosing Latency in Multi-Tier Black-Box Services”, Krzysztof Ostrowski, Gideon Mann, Mark Sandler, 5th Workshop on Large Scale Distributed Systems and Middleware (LADIS 2011) (to appear).
[abstract] [pdf] [search]
“Exploiting Service Usage Information for Optimizing Server Resource Management”, Alexander Totok, Vijay Karamcheti, ACM Transactions on Internet Technology (TOIT), vol. 11 (2011), pp. 1-26.
[abstract] [dx.doi.org] [pdf] [search]
“Megastore: Providing Scalable, Highly Available Storage for Interactive Services”, Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh, Proceedings of the Conference on Innovative Data system Research (CIDR), 2011, pp. 223-234.
[abstract] [cidrdb.org] [pdf] [search]
“Modeling and Synthesizing Task Placement Constraints in Google Compute Clusters”, Victor Chudnovsky, Rasekh Rifaat, Joseph Hellerstein, Bikash Sharma, Chita Das, Symposium on Cloud Computing, 2011.
[abstract] [pdf] [search]
“PowerNap: An Energy Efficient MAC Layer for Random Routing in Wireless Sensor Networks”, Onur Soysal, Sami Ayyorgun, Murat Demirbas, IEEE SECON 2011.
[abstract] [search]
“Tenzing A SQL Implementation On The MapReduce Framework”, Biswapesh Chattopadhyay, Liang Lin, Weiran Liu, Sagar Mittal, Prathyusha Aragonda, Vera Lychagina, Younghee Kwon, Michael Wong, Proceedings of the VLDB Endowment, vol. 4 (2011), pp. 1318-1327.
[abstract] [pdf] [search]
“The Emerging Optical Data Center”, Amin Vahdat, Hong Liu, Xiaoxue Zhao, Chris Johnson, OFC 2011 (2011), OTuH2.
[abstract] [pdf] [search]
“Thialfi: A Client Notification Service for Internet-Scale Applications”, Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek, Proc. 23rd ACM Symposium on Operating Systems Principles (SOSP), 2011, pp. 129-142.
[abstract] [sigops.org] [pdf] [search]
“Warehouse-scale Computing: entering the teenage decade”, Luiz André Barroso, ACM Federated Computing Research Conference (2011).
[abstract] [dl.acm.org] [search]
“Analyzing and enhancing the parallel sort operation on multithreaded architectures”, Layali K. Rashid, Wessam Hassanein, Moustafa A. Hammad, The Journal of Supercomputing, vol. 53 (2010), pp. 293-312.
[dx.doi.org] [search]
“Anti-Omega: the weakest failure detector for set agreement”, Piotr Zielinski, Distributed Computing, vol. 22 (2010), pp. 335-348.
[search]
“Availability in Globally Distributed Storage Systems”, Daniel Ford, Francois Labelle, Florentina Popovici, Murray Stokely, Van-Anh Truong, Luiz Barroso, Carrie Grimes, Sean Quinlan, Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, 2010.
[abstract] [pdf] [search]
“Dapper, a Large-Scale Distributed Systems Tracing Infrastructure”, Benjamin H. Sigelman, Luiz André Barroso, Mike Burrows, Pat Stephenson, Manoj Plakal, Donald Beaver, Saul Jaspan, Chandan Shanbhag, 2010.
[abstract] [research.google.com] [pdf] [search]
“Datacenter-scale Computing”, Luiz André Barroso, Parthasarathy Ranganathan, IEEE Micro, vol. 30 (2010), pp. 6-7.
[abstract] [computer.org] [search]
“Dremel: Interactive Analysis of Web-Scale Datasets”, Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis, Proc. of the 36th Int'l Conf on Very Large Data Bases, 2010, pp. 330-339.
[abstract] [vldb2010.org] [pdf] [search]
“FlumeJava: Easy, Efficient Data-Parallel Pipelines”, Craig Chambers, Ashish Raniwala, Frances Perry, Stephen Adams, Robert Henry, Robert Bradshaw, Nathan, ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2010.
[search]
“Large-scale Incremental Processing Using Distributed Transactions and Notifications”, Daniel Peng, Frank Dabek, Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, 2010.
[abstract] [pdf] [search]
“MapReduce: a flexible data processing tool”, Jeffrey Dean, Sanjay Ghemawat, Commun. ACM, vol. 53 (2010), pp. 72-77.
[doi.acm.org] [search]
“Optimizing Utilization of Resource Pools in Web Application Servers”, Alexander Totok, Vijay Karamcheti, Concurrency and Computation: Practice and Experience, vol. 22 (2010), pp. 2421-2444.
[abstract] [dx.doi.org] [pdf] [search]
“A unified format for traces of peer-to-peer systems”, Boxun Zhang, Alexandru Iosup, Pawel Garbacki, Johan Pouwelse, LSAP '09: Proceedings of the 1st ACM workshop on Large-Scale system and application performance, 2009, pp. 27-34.
[abstract] [doi.acm.org] [search]
“Causeway: a message-oriented distributed debugger”, Terry Stanley, Tyler Close, Mark S. Miller, 2009.
[abstract] [hpl.hp.com] [pdf] [search]
“Machine Learning-Based Prefetch Optimization for Data Center Applications”, Shih-wei Liao, Tzu-Han Hung, Donald Nguyen, Chinyen Chou, Chiaheng Tu, Hucheng Zhou, Proceedings of Supercomputing, 2009.
[doi.acm.org] [search]
“MapReduce: The programming model and practice”, Jerry Zhao, Jelena Pjesivac-Grbovic, SIGMETRICS'09 Tutorial, 2009.
[abstract] [research.google.com] [pdf] [search]
“Parallel algorithms for mining large-scale rich-media data”, Edward Y. Chang, Hongjie Bai, Kaihua Zhu, MM '09: Proceedings of the seventeen ACM international conference on Multimedia, 2009, pp. 917-918.
[doi.acm.org] [search]
“Prefetch optimizations on large-scale applications via parameter value prediction”, Shih-wei Liao, Tzu-Han Hung, Donald Nguyen, Hucheng Zhou, Chinyen Chou, Chiaheng Tu, ICS, 2009, pp. 519-520.
[doi.acm.org] [search]
“Pregel: A System for Large-Scale Graph Processing”, Grzegorz Malewicz, Matthew H. Austern, Aart J.C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski, 28th ACM Symposium on Principles of Distributed Computing, 2009, pp. 6-6.
[doi.acm.org] [search]
“Using a Market Economy to Provision Compute Resources Across Planet-wide Clusters”, Murray Stokely, Jim Winget, Ed Keyes, Carrie Grimes, Benjamin Yolken, Proceedings for the International Parallel and Distributed Processing Symposium 2009, pp. 1-8.
[abstract] [stokely.org] [pdf] [search]
“Why we're able to Google”, Alfred Z. Spector, Proceeding CRASS '09 Computing Research that Changed the World: Reflections and Perspectives, 2009.
[pdf] [search]
“Anti-Omega: the weakest failure detector for set agreement”, Piotr Zielinski, 27th ACM Symposium on Principles of Distributed Computing (PODC 2008).
[search]
“Enhancing Community Authorization Services”, Kumar Abhishek, Kumar Kapil, 16th Euromicro International Conference on Parallel, Distributed and network-based Processing, 2008 (to appear).
[search]
“Extending IC-Scheduling via the Sweep Algorithm”, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, 16th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, 2008, pp. 366-373.
[search]
“MapReduce: Simplified Data Processing on Large Clusters”, Jeffrey Dean, Sanjay Ghemawat, Communications of the ACM, vol. 51, no. 1 (2008), pp. 107-113.
[research.google.com] [search]
“Parallel Spectral Clustering”, Yangqiu Song, Wen-Yen Chen, Hongjie Bai, Chih-Jen Lin, Edward Chang, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD), 2008, pp. 374-389.
[abstract] [pdf] [search]
“Physics Aware Programming Paradigm: Approach and Evaluation”, Salim Hariri, Yaser Jararweh, Yeliang Zhang, Talal Moukabary, Proc. 6th International Workshop on Challenges of Large Applications in Distributed Environments, 2008, pp. 1-6.
[doi.acm.org] [search]
“RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks”, Ziv Bar-Yossef, Roy Friedman, Gabi Kliot, ACM Transactions on Computer Systems, vol. 26 (2008), pp. 1-66.
[ee.technion.ac.il] [pdf] [search]
“Age-based Packet Arbitration in Large k-ary n-cubes”, Dennis Abts, Deborah Weisser, SC, 2007.
[abstract] [sc07.supercomputing.org] [pdf] [search]
“Applying IC-Scheduling Theory to Familiar Classes of Computations”, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, Workshop on Large-Scale and Volatile Desktop Grids in conjunction with IPDPS'07, 2007, pp. 1-8.
[doi] [search]
“Architect's dream or developer's nightmare?”, Gregor Hohpe, Proc. 2007 inaugural international conference on distributed event-based systems, pp. 188-188.
[doi.acm.org] [search]
“Distributed Programming with MapReduce”, Jeffrey Dean, Sanjay Ghemawat, Beautiful Code, 2007, Chapter 23.
[oreilly.com] [pdf] [search]
“Engineering Reliability into Web Sites: Google SRE”, Alexander R. Perry, Proceedings of LinuxWorld, 2007.
[abstract] [research.google.com] [pdf] [search]
“Let's Have a Conversation”, Gregor Hohpe, IEEE Internet Computing, vol. 11, no. 3 (2007), pp. 78-81.
[doi.ieeecomputersociety.org] [pdf] [search]
“MRPSO: MapReduce Particle Swarm Optimization”, Andrew W. McNabb, Christopher K. Monson, Kevin D. Seppi, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007).
[abstract] [search]
“Parallel Approximate Matrix Factorization for Kernel Methods”, Kaihua Zhu, Hang Cui, Hongjie Bai, Jian Li, Zhihuan Qiu, Hao Wang, Hui Xu, Edward Y. Chang, IEEE International Conference on Multimedia and Expo(ICME), 2007.
[ieeexplore.ieee.org] [search]
“Parallel PSO Using MapReduce”, Andrew W. McNabb, Christopher K. Monson, Kevin D. Seppi, Proceedings of the IEEE Congress on Evolutionary Computation, 2007, pp. 7-14.
[bouncingchairs.net] [search]
“Parallelizing Support Vector Machines on Distributed Computers”, Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai, Jian Li, Zhihuan Qiu, Hang Cui, Neural Information Processing Systems (NIPS), 2007.
[abstract] [books.nips.cc] [pdf] [search]
“Paxos Made Live - An Engineering Perspective (2006 Invited Talk)”, Tushar Deepak Chandra, Robert Griesemer, Joshua Redstone, Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, 2007.
[abstract] [chandrakin.com] [search]
“A Tool for Prioritizing DAGMan Jobs and Its Evaluation”, Grzegorz Malewicz, Ian Foster, Arnold Rosenberg, Michael Wilde, Proceedings of the IEEE International Symposium on High-Performance Distributed Computing (HPDC06), 2006, pp. 156-167.
[pdf] [search]
“An Autonomic Routing Framework for Sensor Networks”, Yu He, Cauligi S. Raghavendra, Steven Berson, Robert Braden, Cluster Computing, Special Issue on Autonomic Computing (Kluwer Academic Pulishers), vol. 9 (2006), pp. 191-200.
[search]
“An Experimental Study of the Skype Peer-to-Peer VoIP System”, Saikat Guha, Neil Daswani, Ravi Jain, Proceedings of The 5th International Workshop on Peer-to-Peer Systems (IPTPS '06), 2006.
[pdf] [search]
“Bigtable: A Distributed Storage System for Structured Data”, Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber, 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006, pp. 205-218.
[research.google.com] [search]
“Data Management for Internet-Scale Single-Sign-On”, Sharon E. Perl, Margo Seltzer, Proceedings of the 3rd Workshop on Real, Large Distributed Systems, 2006.
[usenix.org] [pdf] [search]
“Experiences with MapReduce, an abstraction for large-scale computation”, Jeffrey Dean, Proc. 15th International Conference on Parallel Architectures and Compilation Techniques, 2006, pp. 1.
[pdf] [search]
Java Concurrency in Practice, Brian Goetz, Tim Peierls, Joshua Bloch, Joseph Bowbeer, David Holmes, Doug Lea, 2006.
[javaconcurrencyinpractice.com] [search]
“Minimizing the Stretch when Scheduling Flows of Biological Requests”, Arnaud Legrand, Alan Su, Frédéric Vivien, Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures, 2006.
[search]
“On Scheduling Expansive and Reductive Dags for Internet-Based Computing”, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, 26th IEEE International Conference on Distributed Computing Systems, 2006, pp. 29.
[doi.ieeecomputersociety.org] [search]
“Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems”, David R. Karger, Matthias Ruhl, Theory of Computing Systems, vol. 39, no. 6 (2006), pp. 787-804.
[doi] [pdf] [search]
“The Chubby lock service for loosely-coupled distributed systems”, Mike Burrows, 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006.
[research.google.com] [search]
“Decentralized algorithms using both local and random probes for P2P load balancing”, Krishnaram Kenthapadi, Gurmeet Singh Manku, SPAA 2005 (17th ACM Symposium on Parallelism in Algorithms an Architectures), pp. 135-144.
[doi.acm.org] [search]
“Interpreting the Data: Parallel Analysis with Sawzall”, Rob Pike, Sean Dorward, Robert Griesemer, Sean Quinlan, Scientific Programming Journal, vol. 13 (2005), pp. 277-298.
[abstract] [research.google.com] [pdf] [search]
“Papillon: Greedy Routing in Rings”, Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku, DISC, 2005, pp. 514-515.
[doi] [pdf] [search]
“MapReduce: Simplified Data Processing on Large Clusters”, Jeffrey Dean, Sanjay Ghemawat, OSDI'04: Sixth Symposium on Operating System Design and Implementation, 2004, pp. 137-150.
[research.google.com] [search]
“Web Search for a Planet: The Google Cluster Architecture”, Luiz Andre Barroso, Jeffrey Dean, Urs Hölzle, IEEE Micro, vol. 23 (2003), pp. 22-28.
[abstract] [research.google.com] [pdf] [search]