Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (445)
+
Events (410)
 
Groups (142)
+
News (2624)
 
People (736)
 
Projects (1066)
+
Publications (12096)
+
Videos (5323)
Labs
Research areas
Algorithms and theory47205 (290)
Communication and collaboration47188 (189)
Computational linguistics47189 (189)
Computational sciences47190 (198)
Computer systems and networking47191 (691)
Computer vision208594 (876)
Data mining and data management208595 (73)
Economics and computation47192 (95)
Education47193 (79)
Gaming47194 (71)
Graphics and multimedia47195 (207)
Hardware and devices47196 (196)
Health and well-being47197 (78)
Human-computer interaction47198 (792)
Machine learning and intelligence47200 (769)
Mobile computing208596 (35)
Quantum computing208597 (20)
Search, information retrieval, and knowledge management47199 (625)
Security and privacy47202 (273)
Social media208598 (26)
Social sciences47203 (247)
Software development, programming principles, tools, and languages47204 (564)
Speech recognition, synthesis, and dialog systems208599 (78)
Technology for emerging markets208600 (27)
1–25 of 691
Sort
Show 25 | 50 | 100
1234567Next 
Sudip Roy, Arnd Christian König, Igor Dvorkin, and Manish Kumar

Cloud platforms involve multiple independently developed components, often executing on diverse hardware configurations and across multiple data centers. This complexity makes tracking various key performance indicators (KPIs) and manual diagnosing of anomalies in system behavior both difficult and expensive. In this paper, we describe Argus, an automated system for mining service logs to identify anomalies and help formulate data-driven hypotheses.

Argus includes a suite of efficient mining...

Publication details
Date: 15 April 2015
Type: Inproceeding
Publisher: IEEE
Gordon Stewart, Mahanth Gowda, Geoffrey Mainland, Bozidar Radunovic, Dimitrios Vytiniotis, and Cristina Luengo Agulló

Software-defined radio (SDR) brings the flexibility of software to wireless protocol design, promising an ideal platform for innovation and rapid protocol deployment. However, implementing modern wireless protocols on existing SDR platforms often requires careful hand-tuning of low-level code, which can undermine the advantages of software.

Ziria is a new domain-specific language (DSL) that offers programming abstractions suitable for wireless physical (PHY) layer tasks while emphasizing the...

Publication details
Date: 1 March 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Ashish Vulimiri, Carlo Curino, Brighten Godfrey, Konstantinos Karanasos, and George Varghese

Large organizations today operate data centers around the globe where massive amounts of data are produced and consumed by local users. Despite their geographically diverse origin, such data must be analyzed/mined as a whole. We call the problem of supporting rich DAGs of computation across geographically distributed data: Wide-Area Big-Data (WABD) . To the best of our knowledge, WABD is not supported by currently deployed systems nor sufficiently studied in literature; it is addressed today by...

Publication details
Date: 1 January 2015
Type: Article
Publisher: ACM – Association for Computing Machinery
Zhenyu Guo, Cheng Chen, Haoxiang Lin, Sean McDirmid, Fan Yang, Xueying Guo, Mao Yang, and Lidong Zhou

Our cloud services are losing too many battles to faults like software bugs, resource interference, and hardware failures. Many tools can help us win these battles: model checkers to verify, fault injection to find bugs, replay to debug, and many more. Unfortunately, tools are currently afterthoughts in cloud service designs that must either be tediously tangled into service implementations or integrated transparently in ways that fail to effectively capture the service’s problematic non-deterministic...

Publication details
Date: 26 November 2014
Type: Technical report
Publisher: Microsoft Research
Number: MSR-TR-2014-150
Minjie Wang, Tianjun Xiao, Jianpeng Li, Jiaxing Zhang, Chuntao Hong, and Zheng Zhang

The tooling landscape of deep learning is fragmented by a growing gap between the generic and productivity-oriented tools that optimize for algorithm development and the task-specific ones that optimize for speed and scale. This creates an artificial barrier to bring new innovations into real-world applications. Minerva addresses this issue with a layered design that provides language flexibility and execution efficiency simultaneously within one coherent framework. It proposes a matrix-based API,...

Publication details
Date: 8 November 2014
Type: Proceedings
Publisher: ACM – Association for Computing Machinery
Eric Chen, Yutong Pei, Shuo Chen, Yuan Tian, Robert Kotcher, and Patrick Tague

OAuth is undoubtedly a highly influential protocol today, because of its swift and wide adoption in the industry. The initial objective of the protocol was specific: it serves the authorization needs for websites. What motivates our work is the realization that the protocol has been significantly re-purposed and re-targeted over the years: (1) all major identity providers, e.g., Facebook, Google, Microsoft and Twitter, have re-purposed OAuth for user authentication; (2)...

Publication details
Date: 1 November 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Dan Alistarh, Thomas Sauerwald, and Milan Vojnovic

In this work, we consider the following random process, motivated by the analysis of lock-free concurrent algorithms under stochastic schedulers. In each step, a new ball is allocated into one of $n$ bins, according to a distribution $\vect{p} = (p_1, p_2, \ldots, p_n)$, where each ball goes to bin $i$ with probability $p_i$. When some bin first reaches a set threshold of balls, it registers a \emph{win}, and resets its ball count to $1$. At the same time, bins whose ball count was close to the...

Publication details
Date: 1 November 2014
Type: Technical report
Number: MSR-TR-2014-153
Chieh-Jan Mike Liang, Kaifei Chen, Nissanka Bodhi Priyantha, Jie Liu, and Feng Zhao

Network traffic prioritization is gaining attention in the WSN community, as more and more features are being integrated into sensor networks. Real-world deployment experience suggests that WSN brings new challenges to existing problems, such as resource constraints, low data-rate radios, and diverse application scenarios. We present the RushNet framework that prioritizes two common traffic patterns in multi-hop sensor networks: low-priority (LP) traffic that is large-volume but delay-tolerant, and...

Publication details
Date: 1 November 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Dan Alistarh, Rati Gelashvili, and Adrian Vladu

We give message-optimal randomized algorithms for two fundamental
distributed assignment tasks, leader election and renaming.
In leader election, all n participants compete for a single item, whereas in renaming the n participants
each compete for one of n distinct items, or names.
The setting is the classic asynchronous message-passing model, where the n
processors communicate over unreliable channels, while timing and t < n / 2 processor crashes are controlled
by a...

Publication details
Date: 1 November 2014
Type: Technical report
Number: MSR-TR-2014-18
Chang Liu, Jiaxing Zhang, Hucheng Zhou, Sean McDirmid, Zhenyu Guo, and Thomas Moscibroda

Partial aggregation is of great importance in many distributed data-parallel systems. Most notably, it is commonly applied by MapReduce programs to optimize I/O by successively aggregating partially reduced results into a final result, as opposed to aggregating all input records at once. In spite of its importance, programmers currently enable partial aggregation by tediously encoding their reduce functionality into separate reduce and combine functions. This is error prone and often leads to missed...

Publication details
Date: 1 November 2014
Type: Inproceeding
Publisher: SOCC
Carlo Curino, Djellel E. Difallah, Chris Douglas, Subru Krishnan, Raghu Ramakrishnan, and Sriram Rao

The continuous shift towards data-driven approaches to business, and a growing attention to improving return on investments (ROI) for cluster infrastructures is generating new challenges for big-data frameworks. Systems originally designed for big batch jobs now handle an increasingly complex mix of computations. Moreover, they are expected to guarantee stringent SLAs for production jobs and minimize latency for best-effort jobs.

In this paper, we introduce reservation-based scheduling,...

Publication details
Date: 1 November 2014
Type: Article
Publisher: ACM – Association for Computing Machinery
Andrew Baumann, Marcus Peinado, and Galen Hunt

Today's cloud computing infrastructure requires substantial trust. Cloud users rely on both the provider's staff and its globally-distributed software/hardware platform not to expose any of their private data.

We introduce the notion of shielded execution, which protects the confidentiality and integrity of a program and its data from the platform on which it runs (i.e., the cloud operator's OS, VM and firmware). Our prototype, Haven, is the first system to achieve shielded execution of...

Publication details
Date: 6 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Chris Hawblitzel, Jon Howell, Jacob R. Lorch, Arjun Narayan, Bryan Parno, Danfeng Zhang, and Brian Zill

An Ironclad App lets a user securely transmit her data to a remote machine with the guarantee that every instruction executed on that machine adheres to a formal abstract specification of the app’s behavior. This does more than eliminate implementation vulnerabilities such as buffer overflows, parsing errors, or data leaks; it tells the user exactly how the app will behave at all times. We provide these guarantees via complete, low-level software verification. We then use cryptography and secure...

Publication details
Date: 6 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Shobana Balakrishnan, Richard Black, Austin Donnelly, Paul England, Adam Glass, Dave Harper, Sergey Legtchenko, Aaron Ogus, Eric Peterson, and Antony Rowstron

A significant fraction of data stored in cloud storage is rarely accessed. This data is referred to as cold data; cost-effective storage for cold data has become a challenge for cloud providers. Pelican is a rack-scale hard disk based storage unit designed as the basic building block for exabyte scale storage for cold data. In Pelican, server, power, cooling and interconnect bandwidth resources are provisioned by design to support cold data workloads; this right-provisioning...

Publication details
Date: 6 October 2014
Type: Inproceeding
Publisher: 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI '14)
Andrew Baumann, Chris Hawblitzel, Kornilios Kourtis, Tim Harris, and Timothy Roscoe

This paper tackles the problem of providing familiar OS abstractions for I/O (such as pipes, network sockets, and a shared file system) to applications on heterogeneous cores including accelerators, co-processors, and offload engines. We aim to isolate the implementation of these facilities from the details of a platform's memory architecture, which is likely to include a combination of cache-coherent shared memory, non-cache-coherent shared memory, and non-shared memory, all in the same...

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Sebastian Angel, Hitesh Ballani, Thomas Karagiannis, Greg O'Shea, and Eno Thereska

The lack of performance isolation in multi-tenant datacenters at appliances like middleboxes and storage servers results in volatile application performance. To insulate tenants, we propose giving them the abstraction of a dedicated virtual datacenter (VDC). VDCs encapsulate end-to-end throughput guarantees---specified in a new metric based on virtual request cost---that hold across distributed appliances and the intervening network.

We present Pulsar, a system that offers tenants their own...

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, and Yoav Tzur

Most discovery systems for silent failures work in two phases: a continuous monitoring phase that detects presence of failures through probe packets and a localization phase that pinpoints the faultyelement(s). We focus on the monitoring phase, where the goal is to balance the probing overhead with the cost associated with longer failure detection times.

We formulate a general model for the underlying fundamental subset-test scheduling problem. We unify the treatment of schedulers and cost...

Publication details
Date: 1 October 2014
Type: Technical report
Publisher: Elsevier
Number: MSR-TR-2014-113
Dan Alistarh, James Aspnes, Valerie King, and Jared Saia

We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary.

We describe a new randomized consensus protocol for this model with expected message...

Publication details
Date: 1 October 2014
Type: Technical report
Number: MSR-TR-2014-15
Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: European Association for Theoretical Computer Science
Rifat Shahriyar, Stephen M. Blackburn, and Kathryn S. McKinley

Garbage collectors are {xact or conservative. An exact collector identifies all references precisely and may move referents and update references, whereas a conservative collector treats one or more of stack, register, and heap references as ambiguous. Ambiguous references constrain collectors in two ways. (1) Since they may be pointers, the collectors must retain referents. (2) Since they may be values, the collectors cannot modify them, pinning their referents.

We explore conservative...

Publication details
Date: 1 October 2014
Type: Article
Nuno Santos and Nuno P. Lopes

In the last years, it has emerged a market of virtual appliances, i.e., virtual machine images specifically configured to provide a given service (e.g., web hosting). The virtual appliance model greatly reduces the burden of configuring virtual machines from scratch. However, the current model involves risks: security threats, misconfigurations, privacy loss, etc. In this paper, we propose an approach to build dependable virtual machines. It is based on trusted computing and model checking: trusted...

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Chloe Brown, Christos Efstratiou, Ilias Leontiadis, Daniele Quercia, Cecilia Mascolo, James Scott, and Peter Key

The layouts of the buildings we live in shape our everyday lives. In office environments, building spaces affect employees’ communication, which is crucial for productivity and innovation. However, accurate measurement of how spatial layouts affect interactions is a major challenge and traditional techniques may not give an objective view.

We measure the impact of building spaces on social interactions using wearable sensing devices. We study a single organization that moved between two...

Publication details
Date: 13 September 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Yoram Bachrach, Vasilis Syrgkanis, Eva Tardos, and Milan Vojnovic

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of non-cooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes. Our coalitional smoothness framework captures existing results bounding the strong price of anarchy of network design games. Moreover, we give novel strong price of anarchy results...

Publication details
Date: 1 September 2014
Type: Inproceeding
Publisher: Springer
Adrian Sampson, Jacob Nelson, Karin Strauss, and Luis Ceze

Memories today expose an all-or-nothing correctness model that incurs significant costs in performance, energy, area, and design complexity. But not all applications need high-precision storage for all of their data structures all of the time. This article proposes mechanisms that enable applications to store data approximately and shows that doing so can improve the performance, lifetime, or density of solid-state memories. We propose two mechanisms. The first allows errors in multilevel cells by...

Publication details
Date: 1 September 2014
Type: Article
Publisher: ACM – Association for Computing Machinery
Number: 3
Dan Alistarh, Justin Kopinsky, Jerry Li, and Nir Shavit

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a...

Publication details
Date: 1 September 2014
Type: Technical report
Number: MSR-TR-2014-16
1–25 of 691
Sort
Show 25 | 50 | 100
1234567Next 
> Our research