All Research Areas
Research Areas
Year Published

112 Results

October 6, 2014

The Mystery Machine: End-to-end Performance Analysis of Large-scale Internet Services

Operating Systems Design and Implementation

Current debugging and optimization methods scale poorly to deal with the complexity of modern Internet services, in which a single request triggers parallel execution of numerous heterogeneous softwar…

By: Mike Chow, David Meisner, Jason Flinn, Daniel Peek, Thomas Wenisch
September 18, 2014

Mining Energy Traces to Aid in Software Development: An Empirical Case Study

ACM / IEEE International Symposium on Empirical Software Engineering and Measurement

With the advent of increased computing on mobile devices such as phones and tablets, it has become crucial to pay attention to the energy consumption of mobile applications.

By: Ashish Gupta, Thomas Zimmermann, Christian Bird, Nachiappan Nagappan, Thirumalesh Bhat, Syed Emran
August 24, 2014

Streamed Approximate Counting of Distinct Elements

ACM Conference on Knowledge Discovery and Data Mining (KDD)

Counting the number of distinct elements in a large dataset is a common task in web applications and databases. This problem is difficult in limited memory settings where storing a large hash table ta…

By: Daniel Ting
August 18, 2014

Fastpass: A Centralized “Zero-Queue” Datacenter Network

ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM)

Current datacenter networks inherit the principles that went into the design of the Internet, where packet transmission and path selection decisions are distributed among the endpoints and routers. In…

By: Jonathan Perry, Amy Ousterhout, Hari Balakrishnan, Devavrat Shah, Hans Fugal
August 18, 2014

A Hitchhiker’s Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers

ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM)

Erasure codes such as Reed-Solomon (RS) codes are being extensively deployed in data centers since they offer significantly higher reliability than data replication methods at much lower storage overheads. These codes however mandate much higher resources with respect to network bandwidth and disk IO during reconstruction of data that is missing or otherwise unavailable.

By: K.V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran
June 23, 2014

Adaptive HTER Estimation for Document-Specific MT Post-Editing

Annual Conference of Association of Computational Linguistics (ACL)

We present an adaptive translation quality estimation (QE) method to predict the human targeted translation error rate (HTER) for a document-specific machine translation model. We first introduce fea…

By: Fei Huang, Jianming Xu, Abraham Ittycheriah, Salim Roukos
June 22, 2014

Fast Database Restarts at Facebook

ACM Special Interest Group on Management of Data (SIGMOD)

Facebook engineers query multiple databases to monitor and analyze Facebook products and services. The fastest of these databases is Scuba, which achieves subsecond query response time by storing all…

By: Aakash Goel, Bhuwan Chopra, Ciprian Gerea, Dhrúv Mátáni, Josh Metzler, Fahim Ul Haq, Janet Wiener
June 20, 2014

vCacheShare: Automated Server Flash Cache Space Management in a Virtualization Environment

USENIX Annual Technical Conference (ATC)

Server Flash Cache (SFC) is being increasingly adopted in virtualization environments for IO acceleration. Deciding the optimal SFC allocation among VMs or VM disks is a major pain-point, dominantly handled manually by administrators.

By: Fei Meng, Li Zhou, Xiaosong Ma, Sandeep Uttamchandani, Deng Liu
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