Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
This paper proposes new network interface controller (NIC) designs that take advantage of integration with the host CPU to provide increased flexibility for operating system kerne...
Nathan L. Binkert, Ali G. Saidi, Steven K. Reinhar...
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
Daniel S. Myers, Jennifer N. Carlisle, James A. Co...