When to Hedge in Interactive Services

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (32)

Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...

2018

Causal Consistency and Latency Optimality: Friend or Foe?

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

ASSOC COMPUTING MACHINERY2018

Network-Compute Co-Design for Distributed In-Memory Computing

Alexandros Daglis

The booming popularity of online services is rapidly raising the demands for modern datacenters. In order to cope with data deluge, growing user bases, and tight quality of service constraints, service providers deploy massive datacenters with tens to hund ...

EPFL2018

Flow control for Latency-Critical RPCs

Edouard Bugnion, Evangelos Marios Kogias

In today’s modern datacenters, the waiting time spent within a server’s queue is a major contributor of the end-to-end tail latency of μs-scale remote procedure calls. In traditional TCP, congestion control handles in-network congestion, while flow control ...

2018

The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy

Arpan Mukhopadhyay

This paper addresses the mean-field behavior of large-scale systems of parallel servers with a processor sharing service discipline when arrivals are Poisson and jobs have general service time distributions when an SQ(d) routing policy is used. Under this ...

ELSEVIER SCIENCE BV2018

Single-server Multi-user Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018

Energy Proportionality in Near-Threshold Computing Servers and Cloud Data Centers: Consolidating or Not?

David Atienza Alonso, Marina Zapater Sancho, Luca Benini, Ali Pahlevan, Yasir Mahmood Qureshi

Cloud Computing aims to efficiently tackle the increasing demand of computing resources, and its popularity has led to a dramatic increase in the number of computing servers and data centers worldwide. However, as effect of post-Dennard scaling, computing ...

2018

Hybrid, Job-Aware, and Preemptive Datacenter Scheduling

Pamela Isabel Delgado Borda

Scheduling in datacenters is an important, yet challenging problem. Datacenters are composed of a large number, typically tens of thousands, of commodity computers running a variety of data-parallel jobs. The role of the scheduler is to assign cluster reso ...

EPFL2018

Adding flexibility to multi-tenant networks

Georgios Ioannidis

Cloud computing has been experiencing sharp development over the last years, leading to an increased demand for application migration to the cloud. Cloud providers, in an effort to attract more customers and earn their confidence, offer to tenants the illu ...

EPFL2018

System and method for providing a collective decentralized authority for sharing sensitive data

Jean-Pierre Hubaux, Bryan Alexander Ford, Jean Louis Raisaro, Zhicong Huang, Patricia Egger

A method of sharing private and/or sensitive data from plurality of data providers to a data user, the data user having a private key and a public key, the method comprising the steps of providing a first data set and encrypting the first data set at a ter ...

2018

Page 3 sur 4