As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
Locating content efficiently and conveniently is the key issue in P2P systems. In this paper we present SemanticPeer, an Ontology-Based P2P lookup service, to address this problem,...
This paper proposes DCC (Dynamic Cache Clustering), a novel distributed cache management scheme for large-scale chip multiprocessors. Using DCC, a per-core cache cluster is compri...