101,313 research outputs found

    DeltaTree: A Practical Locality-aware Concurrent Search Tree

    Full text link
    As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality. However, existing highly-concurrent search trees such as red-black trees and AVL trees do not consider data locality while existing locality-aware search trees such as those based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations. This paper presents DeltaTree, a practical locality-aware concurrent search tree that combines both locality-optimisation techniques from vEB-based trees and concurrency-optimisation techniques from non-blocking highly-concurrent search trees. DeltaTree is a kk-ary leaf-oriented tree of DeltaNodes in which each DeltaNode is a size-fixed tree-container with the van Emde Boas layout. The expected memory transfer costs of DeltaTree's Search, Insert, and Delete operations are O(logBN)O(\log_B N), where N,BN, B are the tree size and the unknown memory block size in the ideal cache model, respectively. DeltaTree's Search operation is wait-free, providing prioritised lanes for Search operations, the dominant operation in search trees. Its Insert and {\em Delete} operations are non-blocking to other Search, Insert, and Delete operations, but they may be occasionally blocked by maintenance operations that are sometimes triggered to keep DeltaTree in good shape. Our experimental evaluation using the latest implementation of AVL, red-black, and speculation friendly trees from the Synchrobench benchmark has shown that DeltaTree is up to 5 times faster than all of the three concurrent search trees for searching operations and up to 1.6 times faster for update operations when the update contention is not too high

    Balanced Locally Repairable Codes

    Full text link
    We introduce a family of balanced locally repairable codes (BLRCs) [n,k,d][n, k, d] for arbitrary values of nn, kk and dd. Similar to other locally repairable codes (LRCs), the presented codes are suitable for applications that require a low repair locality. The novelty that we introduce in our construction is that we relax the strict requirement the repair locality to be a fixed small number ll, and we allow the repair locality to be either ll or l+1l+1. This gives us the flexibility to construct BLRCs for arbitrary values of nn and kk which partially solves the open problem of finding a general construction of LRCs. Additionally, the relaxed locality criteria gives us an opportunity to search for BLRCs that have a low repair locality even when double failures occur. We use metrics such as a storage overhead, an average repair bandwidth, a Mean Time To Data Loss (MTTDL) and an update complexity to compare the performance of BLRCs with existing LRCs.Comment: Accepted for presentation at International Symposium on Turbo Codes and Iterative Information Processing 201

    Locality bound for effective four-dimensional action of domain-wall fermion

    Get PDF
    We discuss locality in the domain-wall QCD through the effective four-dimensional Dirac operator which is defined by the transfer matrix of the five-dimensional Wilson fermion. We first derive an integral representation for the effective operator, using the inverse five-dimensional Wilson-Dirac operator with the anti-periodic boundary condition in the fifth direction. Exponential bounds are obtained from it for gauge fields with small lattice field strength.Comment: 22 pages, LaTeX, a few corrections, references added and update

    Affine holomorphic quantization

    Full text link
    We present a rigorous and functorial quantization scheme for affine field theories, i.e., field theories where local spaces of solutions are affine spaces. The target framework for the quantization is the general boundary formulation, allowing to implement manifest locality without the necessity for metric or causal background structures. The quantization combines the holomorphic version of geometric quantization for state spaces with the Feynman path integral quantization for amplitudes. We also develop an adapted notion of coherent states, discuss vacuum states, and consider observables and their Berezin-Toeplitz quantization. Moreover, we derive a factorization identity for the amplitude in the special case of a linear field theory modified by a source-like term and comment on its use as a generating functional for a generalized S-matrix.Comment: 42 pages, LaTeX + AMS; v2: expanded to improve readability, new sections 3.1 (geometric data) and 3.3 (core axioms), minor corrections, update of references; v3: further update of reference

    Conformal invariance and rationality in an even dimensional quantum field theory

    Full text link
    Invariance under finite conformal transformations in Minkowski space and the Wightman axioms imply strong locality (Huygens principle) and rationality of correlation functions, thus providing an extension of the concept of vertex algebra to higher dimensions. Gibbs (finite temperature) expectation values appear as elliptic functions in the conformal time. We survey and further pursue our program of constructing a globally conformal invariant model of a hermitean scalar field L of scale dimension four in Minkowski space-time which can be interpreted as the Lagrangian density of a gauge field theory.Comment: 33 pages, misprints corrected, references update
    corecore