Recent approaches to causal modeling rely upon the Causal Markov Condition, which specifies which probability distributions are compatible with a Directed Acyclic Graph (DAG). Further principles are required in order to choose among the large number of DAGs compatible with a given probability distribution. Here we present a principle that we call frugality. This principle tells one to choose th...

In 7] a hierarchy of directed acyclic graph (dag) algebras is deened. The dags belonging to an algebra are deened up to an isomorphism which can be expressed by a congruence over a free term algebra, i.e. a dag is described by a congruence class of terms. In this paper we deal with the following problem: can be deened a canonical form in every congruence class and a canonical (connuent and term...

As the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a parallel ...

With the wide application of heterogeneous multi-core processor real-time systems, existing analysis methods worst-case response time (WCRT) overestimate blocking information among tasks, resulting in a rather pessimistic estimation. To improve accuracy WCRT, we propose reconstruction-based WCRT method for multi-type directed acyclic graph (DAG) tasks scheduling algorithm(RMDS). The RMDS algori...

In this paper, we present a novel data structure, called the Mixture Graph. This structure allows us to compress, render, and query segmentation histograms. Such histograms arise when building mipmap of volume containing IDs. Each voxel in histogram contains convex combination (mixture) mixture represents distribution IDs respective voxel's children. Our method factorizes these mixtures into se...

We introduce the theoretical foundations of Tangle 2.0, a probabilistic leaderless consensus protocol based on directed acyclic graph (DAG) called Tangle. The naturally succeeds blockchain as its next evolutionary step it offers features suited to establish more efficient and scalable distributed ledger solutions. Consensus is no longer found in longest chain but heaviest DAG, where PoW replace...

In this paper, we describe the interface and implementation of the SuperMatrix runtime system. SuperMatrix exploits parallelism from matrix computations by mapping a linear algebra algorithm to a directed acyclic graph (DAG). We give detailed descriptions of how to dynamically construct a DAG where tasks consisting of matrix operations represent the nodes and data dependencies between tasks rep...

The goal of tracking the origin of short, distinctive phrases (memes) that propagate through the web in reaction to current events has been formalized as DAG Partitioning: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying undirected graph contains only one sink. Motivated by NP-hardness and hardness of approximation res...

A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag is then allocated and scheduled using various linear clustering techniques. The result is a highly scalable and efcient approach to harmonic balance simulation. Two large ex...

Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for worst-case insertion sequences or only evaluated experimentally on random DAGs. We present the first averagecase analysis of incremental topological ...