The most basic functionality of a distributed hash table, or DHT, is to partition a key space across the set of nodes in a distributed system such that all nodes agree on the partitioning. For example ...

[1] Maar, L, Draschbacher, F., Lamster, L., Mangard, S., Defects-in-Depth: Analyzing the Integration of Effective Defenses against One-Day Exploits in Android Kernels ...

The mutex primitive provides mutual exclusion for one or more data objects. Two versions of the mutex primitive are provided: spin mutexes and sleep mutexes. Spin mutexes are a simple spin lock. If ...

Eleftherios Kokoris Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford, École Polytechnique Fédérale de Lausanne (EPFL) ...

William Melicher, Blase Ur, Sean M. Segreti, Saranga Komanduri, Lujo Bauer, Nicolas Christin, and Lorrie Faith Cranor, Carnegie Mellon University ...

Rajesh Nishtala, Hans Fugal, Steven Grimm, Marc Kwiatkowski, Herman Lee, Harry C. Li, Ryan McElroy, Mike Paleczny, Daniel Peek, Paul Saab, David Stafford, Tony Tung ...

Stephen Checkoway, Damon McCoy, Brian Kantor, Danny Anderson, Hovav Shacham, and Stefan Savage, University of California, San Diego; Karl Koscher, Alexei Czeskis, Franziska Roesner, and Tadayoshi ...

Fast Sockets is an implementation of the Sockets API that provides high-performance communication and inter-operability with existing programs. It yields high-performance communication through a ...

Yupeng Zhang, Jonathan Katz, and Charalampos Papamanthou, University of Maryland ...

Scott Hendrickson, Stephen Sturdevant, and Tyler Harter, University of Wisconsin—Madison; Venkateshwaran Venkataramani; Andrea C. Arpaci-Dusseau and Remzi H. Arpaci-Dusseau, University of ...

Daniel Lowe Wheeler, Dropbox Inc.

Eduardo Pinheiro, Wolf-Dietrich Weber, and Luiz André Barroso, Google Inc.