Failure locality measures an algorithm’s robustness to process failures. We present a new algorithm for the dining philosophers problem — a classic problem in distributed resource allocation — that has optimal failure locality. As a refinement, the algorithm can be easily parameterized by a simple failure model to achieve super-optimal failure locality in the average case.

We reconsider the consequences of the observed violations of Bell’s inequalities. Two common responses to these violations are: (i) the rejection of realism and the retention of locality, and (ii) the rejection of locality and the retention of realism. Here we critique response (i). We argue that locality contains an implicit form of realism, since in a world view that embraces locality, spacet...

We reconsider the consequences of the observed violations of Bell’s inequalities. Two common responses to these violations are: (i) the rejection of realism and the retention of locality, and (ii) the rejection of locality and the retention of realism. Here we critique response (i). We argue that locality contains an implicit form of realism, since in a world view that embraces locality, spacet...

We reconsider the consequences of the observed violations of Bell’s inequalities. Two common responses to these violations are: (i) the rejection of realism and the retention of locality, and (ii) the rejection of locality and the retention of realism. Here we critique response (i). We argue that locality contains an implicit form of realism, since in a world view that embraces locality, spacet...

We reconsider the consequences of the observed violations of Bell’ s inequalities. Two common responses to these violations are (i) the rejection of realism and the retention of locality and (ii) the rejection of locality and the retention of realism . Here we critique response (i). We argue that locality contains an implicit form of realism, since in a worldview that embraces locality, spaceti...

Several practical inductive logic programming systems eeciently learn \determinate" clauses of constant depth. Recently it has been shown that while nonrecursive constant-depth determi-nate clauses are pac-learnable, most of the obvious syntactic generalizations of this language are not pac-learnable. In this paper we introduce a new restriction on logic programs called \locality", and present ...

The exploitation of locality of reference in shared memory multiprocessors is one of the most important problems in parallel processing today. Locality can be managed in several levels: hardware, operating system , runtime environment of the compiler, user level. In this paper we investigate the problem of exploiting locality at the operating system level and its interactions with the compiler ...

The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality are based on the fitness landscape, we emphasize the explicit relation between genotypes and phenotypes. Statistical measures are demonstrated to reliably predict locality properties of selected decoder-based EAs for th...

The goal of the Alewife experiment is to demonstrate that a parallel computer system can be made both scalable and easily programmable. Scalability will be achieved through an architecture that allows the exploitation of locality. That is, for programs that display communication locality, scalable machines can o er proportionally better performance with more processing nodes. A program running ...

Many parallel programming platforms, such as Cilk Plus, implement a work-stealing scheduler to load-balance parallel computations, since it provides a provably good execution time bound and performs well in practice. However, most work-stealing schedulers, including the Cilk Plus scheduler, do not utilize shared caches and memory efficiently. The Cilk Locality runtime was developed to address t...