We study the fifo and causal multicast problem, two group-communication abstractions that deliver messages in an order consistent with their context. With fifo multicast, the context of a message m at a process p is all messages that were previously multicast by m’s sender and addressed to p. Causal multicast extends the notion of context to all messages that are causally linked to m by a...
|
Uniformly sampling nodes from deployed peer-to-peer (P2P) networks has proven to be a difficult problem, as current techniques suffer from sample bias and limited applicability. A sampling service which randomly samples nodes from a uniform distribution across all members of a network offers a platform on which it is easy to construct unstructured search, data replication, and monitoring...
|
In this paper, we study atomic multicast, a fundamental abstraction for building fault-tolerant systems. We suppose a system composed of data centers, or groups, that host many processes connected through high-end local links; a few groups exist, interconnected through high-latency communication links. In this context, a recent paper has shown that no multicast protocol can deliver messages...
|
Compiling for extensible processors includes searching the application’s data-flow graphs for code sequences that can be added (as custom instructions) to the core instruction set, as well as finding optimal ways to use these sequences at runtime. Depending on the targeted architecture, different algorithms may be adopted, but toolchains for different architectures often share two common...
|
In: Journal of approximation theory, 2011, vol. 163, no. 4, p. 413-437
In this paper, we study the ability of convergent subdivision schemes to reproduce polynomials in the sense that for initial data, which is sampled from some polynomial function, the scheme yields the same polynomial in the limit. This property is desirable because the reproduction of polynomials up to some degree d implies that a scheme has approximation order d+1. We first show that any...
|
|
|
We address the problem of computing critical area for open faults (opens) in a circuit layout in the presence of multilayer loops and redundant interconnects. The extraction of critical area is the main computational bottleneck in predicting the yield loss of a VLSI design due to random manufacturing defects. We first model the problem as a geometric graph problem and we solve it efficiently by...
|
In: ACM transactions on graphics, 2010, vol. 29, no. 4, p. 120
We present a method for parameterizing subdivision surfaces in an as-rigid- as-possible fashion. While much work has concentrated on parameterizing polygon meshes, little if any work has focused on subdivision surfaces despite their popularity. We show that polygon parameterization methods produce suboptimal results when applied to subdivision surfaces and describe how these methods may be...
|
In: Applied and computational harmonic analysis, 2010, vol. 29, no. 1, p. 104-110
Dual pseudo-splines are a new family of refinable functions that generalize both the even degree B-splines and the limit functions of the dual 2n-point subdivision schemes. They were introduced by Dyn et al. [10] as limits of subdivision schemes. In [10], simple algebraic considerations are needed to derive the approximation order of the members of this family. In this paper, we use Fourier...
|
In: Computer graphics forum, 2010, vol. 29, no. 2, p. 309-318
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is robust but fails to preserve local shape. Most recent approaches identify local affine transformations for parts of the mesh, model desired interpolations of the affine transformations, and then optimize vertex...
|
