Research Area
Year Published

124 Results

June 12, 2014

There is no Fork: an Abstraction for Efficient, Concurrent, and Concise Data Access

ACM SIGPLAN International Conference on Functional Programming (ICFP)

We describe a new programming idiom for concurrency, based on Applicative Functors, where concurrency is implicit in the Applicative <*> operator. The result is that concurrent programs can be written in a natural applicative style, and they retain a high degree of clarity and modularity while executing with maximal concurrency.

By: Simon Marlow, Louis Brandy, Jon Coens, Jon Purdy
April 7, 2014

Deduplicating a Places Database

International World Wide Web Conference (WWW)

We consider the problem of resolving duplicates in a database of places, where a place is defined as any entity that has a name and a physical location. When other auxiliary attributes like phone and full address are not available, deduplication based solely on names and approximate location becomes an extremely challenging problem that requires both domain knowledge as well an local geographical knowledge.

By: Philip Bohannon, Nilesh Dalvi, Marian Olteanu, Manish Raghavan
April 2, 2014

Libra: Divide and Conquer to Verify Forwarding Tables in Huge Networks

USENIX Symposium on Networked Systems Design and Implementation (NSDI)

Data center networks often have errors in the forwarding tables, causing packets to loop indefinitely, fall into black-holes or simply get dropped before they reach the correct destination. Finding fo…

By: James Hongyi Zeng, Shidong Zhang, Fei Ye, Vimalkumar Jeyakumar, Mickey Ju, Junda Liu, Nick McKeown, Amin Vahdat
February 17, 2014

Analysis of HDFS Under HBase: A Facebook Messages Case Study

USENIX Conference on File Storage Technologies (FAST)

We present a multilayer study of the Facebook Messages stack, which is based on HBase and HDFS. We collect and analyze HDFS traces to identify potential improvements, which we then evaluate via simulation.

By: Tyler Harter, Dhruba Borthakur, Siying Dong, Amitanand Aiyer, Liyin Tang, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
January 22, 2014

The Essence of Reynolds

ACM Symposium on Principles of Programming Languages (POPL)

John Reynolds (1935-2013) was a pioneer of programming languages research. In this paper we pay tribute to the man, his ideas, and his influence.

By: Stephen Brookes, Peter O'Hearn, Uday S. Reddy
November 4, 2013

An Analysis of Facebook Photo Caching

ACM Symposium on Operating Systems Principles (SOSP)

This paper examines the workload of Facebook’s photo-serving stack and the effectiveness of the many layers of caching it employs. Facebook’s image-management infrastructure is complex and geographically distributed. It includes browser caches on end-user systems, Edge Caches at ~20 PoPs, an Origin Cache, and for some kinds of images, additional caching via Akamai. The underlying image storage layer is widely distributed, and includes multiple data centers.

By: Qi Huang, Ken Birman, Robbert van Renesse, Wyatt Lloyd, Sanjeev Kumar, Harry Li
October 1, 2013

Virtual Network Diagnosis as a Service

ACM Symposium on Cloud Computing (SoCC)

Today’s cloud network platforms allow tenants to construct sophisticated virtual network topologies among their VMs on a shared physical network infrastructure. However, these platforms provide little…

By: Wenfei Wu, Guohui Wang, Aditya Akella, Anees Shaikh
August 27, 2013

Scuba: Diving into Data at Facebook

International Conference on Very Large Data Bases (VLDB)

Facebook takes performance monitoring seriously. Performance issues can impact over one billion users so we track thousands of servers, hundreds of PB of daily network traffic, hundreds of daily code…

By: Lior Abraham, John Allen, Oleksandr Barykin, Vinayak Borkar, Bhuwan Chopra, Ciprian Gerea, Dan Merl, Josh Metzler, David Reiss, Subbu Subramanian, Janet Wiener, Okay Zed
August 26, 2013

Unicorn: A System for Searching the Social Graph

International Conference on Very Large Data Bases (VLDB)

Unicorn is an online, in-memory social graph-aware indexing system designed to search trillions of edges between tens of billions of users and entities on thousands of commodity servers. Unicorn is based on standard concepts in information retrieval, but it includes features to promote results with good social proximity. It also supports queries that require multiple round-trips to leaves in order to retrieve objects that are more than one edge away from source nodes.

By: Mike Curtiss, Iain Becker, Tudor Bosman, Sergey Doroshenko, Lucian Adrian Grijincu, Tom Jackson, Sandhya Kunnatur, Soren Lassen, Philip Pronin, Sriram Sankar, Guanghao Shen, Gintaras Woss, Chao Yang, Ning Zhang
August 26, 2013

XORing Elephants: Novel Erasure Codes for Big Data

International Conference on Very Large Data Bases (VLDB)

Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of three-replicated systems. Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability.

By: Maheshwaran Sathiamoorthy, Megasthenis Asteris, Dimitris Papailiopoulos, Alexandros G. Dimakis, Ramkumar Vadali, Scott Chen, Dhruba Borthakur