Locality Refinement
نویسندگان
چکیده
We study refinement in the setting of local reasoning. In particular, we explore general translations that preserve and that break locality.
منابع مشابه
A New Distributed Resource-Allocation Algorithm with Optimal Failure Locality
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.
متن کاملCrafting Data Structures: A Study of Reference Locality in Refinement-Based Pathfinding
The widening gap between processor speed and memory latency increases the importance of crafting data structures and algorithms to exploit temporal and spatial locality. Refinement-based pathfinding algorithms, such as Classic Refinement, find near-optimal paths in very large sparse graphs where traditional search techniques fail to generate paths in acceptable time. In this paper we present a ...
متن کاملGeographical Locality and Dynamic Data Migration for OpenMP Implementations of Adaptive PDE Solvers
On cc-NUMA multi-processors, the non-uniformity of main memory latencies motivates the need for co-location of threads and data. We call this special form of data locality, geographical locality. In this article, we study the performance of a parallel PDE solver with adaptive mesh refinement. The solver is parallelized using OpenMP and the adaptive mesh refinement makes dynamic load balancing n...
متن کاملAssemblies of Objects ∗
We present a data-centric programming model and a language for irregular, heap-manipulating parallel applications, such as Delaunay mesh refinement or epidemiological simulations. Our aim is to syntactically capture locality of access in such applications — the property that accesses to large, global data structures are often restricted to small, contiguous, dynamically determined “neighborhoods.”
متن کاملExtendability in the Sheaf-theoretic Approach: Construction of Bell Models from Kochen-Specker Models
Extendability of an empirical model was shown by Abramsky & Brandenburger to correspond in a unified manner to both locality and non-contextuality. We develop their approach by presenting a refinement of the notion of extendability that can also be useful in characterising the properties of sub-models. The refinement is found to have another useful application: it is shown that a particular, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010