Efficient Logging in Non-Volatile Memory by Exploiting Coherency Protocols

Non-volatile memory (NVM) technologies such as PCM, ReRAM and STT-RAM allow processors to directly write values to persistent storage at speeds that are significantly faster than previous durable media such as hard drives or SSDs. Many applications of NVM are constructed on a logging subsystem, which enables operations to appear to execute atomically and facilitates recovery from failures. Writes to NVM, however, pass through a processor's memory system, which can delay and reorder them and can impair the correctness and cost of logging algorithms. Reordering arises because of out-of-order execution in a CPU and the inter-processor cache coherence protocol. By carefully considering the properties of these reorderings, this paper develops a logging protocol that requires only one round trip to non-volatile memory while avoiding expensive computations. We show how to extend the logging protocol to building a persistent set (hash map) that also requires only a single round trip to non-volatile memory for insertion, updating, or deletion

The Artificial Medium Laws Theory

This paper articulates the Artificial Medium Laws Theory. The theory is comprised of Perceived Psychological Dimensions, namely: sound, picture, moving picture, time and interaction. These dimensions are the building blocks of the theory’s five laws: 1) The Truth in the Medium is Context Dependent, 2) The Stronger Dimension Prevails, 3) Medium with Time Dimension Determines its Usage Length, 4) The More Dimensions the Medium Poses the Weaker the User’s Imagination, and 5) The User is Bound to All the Laws. The theory seeks to explain the artificial medium influence on human users and to suggest potential implications

Is There Anybody Out There? Analyzing the Regulation of Children’s Privacy Online in the United States of America and the European Union According to the TBGI Analytical Framework by Eberlein et al

This article analyzes the regulation of children’s privacy online, especially in the context of personal information collection as a commodity, in the United States of America (USA) and the European Union (EU) according to the Transnational Business Governance Interactions analytical framework proposed by Eberlein et al. This article reviews the regulatory structure of the field in these two jurisdictions, including global organizations, according to Elberlein et al components and questions. In the analysis, a map of the regulatory interactions within this global realm will be presented and discussed. Analysis of the influence of each interacting party and the degree of interaction between parties demonstrates that there is a clear dominance of the industry in the regulatory realm of children’s privacy protection online. Therefore it is suggested to include an analysis of the regulatory interactions (e.g., using the TBGI analytical framework by Eberlein et al.) when discussing new or amended regulatory measures in each one of the levels described in this article. This will allow a better understanding of the overall regulatory picture and may prevent a bias towards more powerful actors, such as the industry

The Artificial Medium Laws Theory

This paper articulates the Artificial Medium Laws Theory. The theory is comprised of Perceived Psychological Dimensions, namely: sound, picture, moving picture, time and interaction. These dimensions are the building blocks of the theory’s five laws: 1) The Truth in the Medium is Context Dependent, 2) The Stronger Dimension Prevails, 3) Medium with Time Dimension Determines its Usage Length, 4) The More Dimensions the Medium Poses the Weaker the User’s Imagination, and 5) The User is Bound to All the Laws. The theory seeks to explain the artificial medium influence on human users and to suggest potential implications

Linked Democracy 3.0 - Global machine translated legislation and compliance in the age of artificial intelligence

This paper outlines the efforts made by Global-Regulation, a world legislation search engine, to engage artificial intelligence in two ways: (i) employing machine translation to translate the world’s legislation to English and, (ii) creating an automated system to identify compliance clauses and extract penalties from legislation. This paper describes Global- Regulation’s vision and technology in the context of linked democracy and the democratization of artificial intelligence

Fine-Grain Checkpointing with In-Cache-Line Logging

Non-Volatile Memory offers the possibility of implementing high-performance, durable data structures. However, achieving performance comparable to well-designed data structures in non-persistent (transient) memory is difficult, primarily because of the cost of ensuring the order in which memory writes reach NVM. Often, this requires flushing data to NVM and waiting a full memory round-trip time. In this paper, we introduce two new techniques: Fine-Grained Checkpointing, which ensures a consistent, quickly recoverable data structure in NVM after a system failure, and In-Cache-Line Logging, an undo-logging technique that enables recovery of earlier state without requiring cache-line flushes in the normal case. We implemented these techniques in the Masstree data structure, making it persistent and demonstrating the ease of applying them to a highly optimized system and their low (5.9-15.4\%) runtime overhead cost.Comment: In 2019 Architectural Support for Programming Languages and Operating Systems (ASPLOS 19), April 13, 2019, Providence, RI, US

Approximating minimum-power edge-multicovers

Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph $G=(V,E)$ with edge costs and degree bounds $\{r(v):v \in V\}$, the {\sf Minimum-Power Edge-Multi-Cover} ({\sf MPEMC}) problem is to find a minimum-power subgraph $J$ of $G$ such that the degree of every node $v$ in $J$ is at least $r(v)$. We give two approximation algorithms for {\sf MPEMC}, with ratios $O(\log k)$ and $k+1/2$, where $k=\max_{v \in V} r(v)$ is the maximum degree bound. This improves the previous ratios $O(\log n)$ and $k+1$, and implies ratios $O(\log k)$ for the {\sf Minimum-Power $k$-Outconnected Subgraph} and $O(\log k \log \frac{n}{n-k})$ for the {\sf Minimum-Power $k$-Connected Subgraph} problems; the latter is the currently best known ratio for the min-cost version of the problem