Large-scale parallel discrete event simulations of massive networks, such as the Internet, are “Grand Challenge” problems: packet level simulation of even a small fraction of ...
Robert R. Henry, Simon Kahan, Jason Liu, David M. ...
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Accurate performance predictions are difficult to achieve for parallel applications executing on production distributed systems. Conventional point-valued performance parameters a...
An effective way to reduce the number of aborts in software transactional memory (STM) is to keep multiple versions of transactional objects. In this paper, we study inherent prop...
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...