The recently proposed dataplanes for microsecond scale applications, such as IX and
ZygOS, use non-preemptive policies to schedule requests to cores. For the many real-world …

Recent advances in computing have led to an explosion in the amount of data being
generated. Processing the ever-growing data in a timely manner has made throughput …

The memory coherence problem in designing and implementing a shared virtual memory on
loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized …

Arachne is a new user-level implementation of threads that provides both low latency and
high throughput for applications with extremely short-lived threads (only a few …

As technology scales ever further, device unreliability is creating excessive complexity for
hardware to maintain the illusion of perfect operation. In this paper, we consider whether …

In this paper, we address an open problem of zero-shot learning. Its principle is based on
learning a map** that associates feature vectors extracted from ie images and attribute …

Work stealing has proven to be an effective method for scheduling parallel programs on
multicore computers. To achieve high performance, work stealing distributes tasks between …

With the shift towards chip multiprocessors (CMPs), exploiting and managing parallelism
has become a central problem in computing systems. Many issues of parallelism …

We present Swarm, a novel architecture that exploits ordered irregular parallelism, which is
abundant but hard to mine with current software and hardware techniques. In this …

To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit
fine-grain parallelism. However, managing tasks of a few thousand instructions is …