Our research
##### Content type
+
+
Events (444)

Groups (151)
+
News (2727)

People (739)

Projects (1102)
+
Publications (12529)
+
Videos (5665)
##### Research areas
Algorithms and theory47205 (335)
Communication and collaboration47188 (214)
Computational linguistics47189 (234)
Computational sciences47190 (220)
Computer systems and networking47191 (758)
Computer vision208594 (906)
Data mining and data management208595 (105)
Economics and computation47192 (104)
Education47193 (82)
Gaming47194 (76)
Graphics and multimedia47195 (233)
Hardware and devices47196 (215)
Health and well-being47197 (91)
Human-computer interaction47198 (887)
Machine learning and intelligence47200 (881)
Mobile computing208596 (54)
Quantum computing208597 (32)
Search, information retrieval, and knowledge management47199 (674)
Security and privacy47202 (309)
Social media208598 (42)
Social sciences47203 (261)
Software development, programming principles, tools, and languages47204 (620)
Speech recognition, synthesis, and dialog systems208599 (129)
Technology for emerging markets208600 (32)
1–25 of 758
Sort
Show 25 | 50 | 100
1234567Next

Temporal graphs that capture graph changes over time are attracting increasing interest from research communities, for functions such as understanding temporal characteristics of social interactions on a time-evolving social graph. ImmortalGraph is a storage and execution engine designed and optimized specifically for temporal graphs. Locality is at the center of ImmortalGraph’s design: temporal graphs are carefully laid out in both persistent storage and memory, taking into account data locality in...

##### Publication details
Date: 1 December 2015
Type: Article
Publisher: ACM – Association for Computing Machinery
##### Publication details
Date: 1 August 2015
Type: Inproceeding
Publisher: KDD

To reduce the impact of network congestion on big data jobs, cluster management frameworks use various heuristics to schedule compute tasks and/or network flows. Most of these schedulers consider the job input data fixed and greedily schedule the tasks and flows that are ready to run. However, a large fraction of production jobs are recurring with predictable characteristics, which allows us to plan ahead for them. Coordinating the placement of data and tasks of these jobs allows for significantly...

##### Publication details
Date: 1 August 2015
Type: Inproceeding
Publisher: ACM SIGCOMM
##### Publication details
Date: 1 August 2015
Type: Proceedings
Publisher: HOTCHIPS

Many cloud applications can benefit from guaranteed latency for their network messages, however providing such predictability is hard, especially in multi-tenant datacenters. We identify three key requirements for such predictability: guaranteed network bandwidth, guaranteed packet delay and guaranteed burst allowance. We present Silo, a system that offers these guarantees in multi-tenant datacenters. Silo leverages the tight coupling between bandwidth and delay: controlling tenant bandwidth leads to...

##### Publication details
Date: 1 August 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
##### Publication details
Date: 1 August 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Rack-scale computers, comprising a large number of micro-servers connected by a direct-connect topology, are poised to replace servers as the building block in data centers. We focus on the problem of routing and congestion control across the rack's network, and find that high path diversity in rack topologies, in combination with workload diversity across it, means that traditional solutions are inadequate.

We present R2C2, a network stack for rack-scale computers providing flexible and...

##### Publication details
Date: 1 August 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Size and weight constraints on wearables limit their battery capacity and restrict them from providing rich functionality. The need for durable and secure storage for personal data further compounds this problem as these features incur energy-intensive operations. This paper
presents WearDrive, a fast storage system for wearables based on battery-backed RAM and an efficient means to offload energy intensive tasks to the phone. WearDrive leverages low-power network connectivity available on...

##### Publication details
Date: 10 July 2015
Type: Inproceeding
Publisher: USENIX

The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority....

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

To cope with the ever growing availability of training data, there have been several proposals to scale machine learning computation beyond a single server and distribute it across a cluster. While this enables reducing the training time, the observed speed up is often limited by network bottlenecks.

To address this, we design MLNet, a host-based communication layer that aims to improve the network performance of distributed machine learning systems. This is achieved through a combination of...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association

In this work, we consider the following random process, motivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of $n$ threads, according to a distribution $\vect{p} = (p_1, p_2, \ldots, p_n)$, where thread $i$ is scheduled with probability $p_i$. When some thread first reaches a set threshold of executed steps, it registers a \emph{win}, completing its current operation, and resets its step count to $1$. At...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Datacenter-scale computing for analytics workloads is increasingly common. High operational costs force heterogeneous applications to share cluster resources for achieving economy of scale. Scheduling such large and diverse workloads is inherently hard, and existing approaches tackle this in two alternative ways: 1) centralized solutions offer strict, secure enforcement of scheduling invariants (e.g., fairness, capacity) for heterogeneous applications, 2) distributed solutions offer...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association

Current data storage on smartphones mostly inherits from desktop/server systems a flash-centric design: The memory (DRAM) effectively acts as an I/O cache for the relatively slow flash. To improve both app responsiveness and energy efficiency, this paper proposes MobiFS, a memory-centric design for smartphone data storage. This design no longer exercises cache writeback at short fixed periods or on file synchronization calls. Instead, it incrementally checkpoints app data into flash at appropriate...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association

Applications can map data on SSDs into virtual memory to transparently scale beyond DRAM capacity, permitting them to leverage high SSD capacities with few code changes. Obtaining good performance for memory-mapped SSD content, however, is hard because the virtual memory layer, the file system and the flash translation layer (FTL) perform address translations, sanity and permission checks independently from each other. We introduce FlashMap, an SSD interface that is
optimized for memory-mapped...

##### Publication details
Date: 13 June 2015
Type: Inproceeding
Publisher: ACM/IEEE

Gaming on phones, tablets and laptops is very popular. Cloud gaming -- where remote servers perform game execution and rendering on behalf of thin clients that simply send input and display output frames -- promises any device the ability to play any game any time. Unfortunately, the reality is that wide-area network latencies are often prohibitive; cellular, Wi-Fi and even wired residential end host round trip times (RTTs) can exceed 100ms, a threshold above which many gamers tend to deem...

##### Publication details
Date: 3 June 2015
Type: Proceedings
Publisher: ACM – Association for Computing Machinery
##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ISCA

Troubleshooting large operational networks is extremely difficult due to the extensive usage of multipath routing. We present NetSonar, a system that localizes performance problems in such networks. It uses planned tomography, whose input comes from a novel test technique that maximizes component coverage while minimizing probing overhead. Earlier techniques are either white box (assuming complete knowledge of network’s forwarding state) or black box (assuming no knowledge). We argue that the...

##### Publication details
Date: 1 June 2015
Type: Technical report
Number: MSR-TR-2015-55

The ubiquitous growth in the popularity of public cloud computing platforms as seen today entails an inherent risk: the shared nature of data center networks (DCNs) renders co-hosted tenants susceptible to attacks from within the network. In this paper, we discuss the security mechanisms offered by popular cloud service providers at present, and explore the extent to which existing data center networks might be vulnerable to internal denial-of-service attacks. We describe two categories of attacks: the...

##### Publication details
Date: 1 June 2015
Type: Technical report
Number: MSR-TR-2015-52

Modern software applications and services operate nowadays on top of large clusters and datacenters. To reduce the underlying infrastructure cost and increase utilization, different services share the same physical resources (e.g., CPU, bandwidth, I/O, memory). Consequently, the cluster provider often has to decide in real-time how to allocate resources in overbooked systems, taking into account the different characteristics and requirements of users. In this paper, we consider an important problem...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Page-based virtual memory improves programmer productivity, security, and memory utilization, but incurs performance overheads due to costly page table walks after TLB misses. This overhead can reach 50% for modern workloads that access increasingly vast memory with stagnating TLB sizes.

To reduce the overhead of virtual memory, this paper proposes Redundant Memory Mappings (RMM), which leverage ranges of pages and provides an efficient, alternative representation...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM/IEEE International Symposium on Computer Architecture (ISCA)
##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

We study the problem of placing streaming queries into servers. Unlike previous work, we focus on queries that consume events of relative low rates, each computed in a single server (i.e. no scaling out per query). However, we need to place a very large and dynamic number of queries in relatively few servers. Our focus is motivated by the need to support a platform for hosting end-user streaming queries that may come from a variety of applications, such as the Cortana personal assistant.

The...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM Mobihoc 2015

Developers and architects spend a lot of time trying to understand and eliminate performance problems. Unfortunately, the root causes of many problems occur at a fine granularity that existing continuous profiling and direct measurement approaches cannot observe. This paper presents the design and implementation of SHIM, a continuous profiler that samples at resolutions as fine as 15 cycles; three to five orders of magnitude finer than current continuous profilers. SHIM’s...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM/IEEE International Symposium on Computer Architecture (ISCA)
1–25 of 758
Sort
Show 25 | 50 | 100
1234567Next
> Our research