10-millisecond Computing

by   Gang Lu, et al.

Despite computation becomes much complex on data with an unprecedented scale, we argue computers or smart devices should and will consistently provide information and knowledge to human being in the order of a few tens milliseconds. We coin a new term 10-millisecond computing to call attention to this class of workloads. 10-millisecond computing raises many challenges for both software and hardware stacks. In this paper, using a typical workload-memcached on a 40-core server (a main-stream server in near future), we quantitatively measure 10-ms computing's challenges to conventional operating systems. For better communication, we propose a simple metric-outlier proportion to measure quality of service: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier threshold t, the outlier proportion is M/N . For a 1K-scale system running Linux (version 2.6.32), LXC (version 0.7.5) or XEN (version 4.0.0), respectively, we surprisingly find that so as to reduce the service outlier proportion to 10 degradation), the outlier proportion of a single server has to be reduced by 871X, 2372X, 2372X accordingly. Also, we discuss the possible design spaces of 10-ms computing systems from perspectives of datacenter architectures, networking, OS and scheduling, and benchmarking.


page 1

page 2

page 3

page 4


Learning to Dispatch Multi-Server Jobs in Bipartite Graphs with Unknown Service Rates

Multi-server jobs are imperative in modern cloud computing systems. A mu...

Full Version – Server Cloud Scheduling

Consider a set of jobs connected to a directed acyclic task graph with a...

Machine Learning Based Prediction and Classification of Computational Jobs in Cloud Computing Centers

With the rapid growth of the data volume and the fast increasing of the ...

Covert Cycle Stealing in a Single FIFO Server

Consider a setting where Willie generates a Poisson stream of jobs and r...

Scheduling Multi-Server Jobs with Sublinear Regrets via Online Learning

Nowadays, multi-server jobs, which request multiple computing devices an...

Group-Server Queues

By analyzing energy-efficient management of data centers, this paper pro...

Dynamic scheduling in a partially fluid, partially lossy queueing system

We consider a single server queueing system with two classes of jobs: ea...

Please sign up or login with your details

Forgot password? Click here to reset