Results 1 - 10 of 257

Notes on Optimal Coalescing

by Daniel Grund
"... Abstract. This short paper can be seen as an appendix to “A Fast Cutting-Plane Algorithm for Optimal Coalescing ” [1] and that is exactly the way one should read it to grasp its full meaning. 1 Optimizing fixed points is only an approximation This section deals with the subtle point that minimizing ..."
Abstract - Add to MetaCart
Abstract. This short paper can be seen as an appendix to “A Fast Cutting-Plane Algorithm for Optimal Coalescing ” [1] and that is exactly the way one should read it to grasp its full meaning. 1 Optimizing fixed points is only an approximation This section deals with the subtle point that minimizing

Live-range Unsplitting for Faster Optimal Coalescing

by Sandrine Blazy, Benoît Robillard
"... Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting after each statement) enables optimal solutions based on ILP, for both spilling and coalescing. However, while the solutions ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting after each statement) enables optimal solutions based on ILP, for both spilling and coalescing. However, while

A fast cutting-plane algorithm for optimal coalescing

by Daniel Grund, Sebastian Hack - IN PROC. OF THE 16 TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC ’07 , 2007
"... Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorithm for the coalescing subproblem that relies on this separation. The algorithm uses 0/1 Linear Programming (ILP), a general-purpo ..."
Abstract - Cited by 16 (1 self) - Add to MetaCart
-purpose optimization technique, to derive optimal solutions. We provide the first optimal solutions for a benchmark called “Optimal Coalescing Challenge”, i.e., our ILP model outperforms previous approaches. Additionally, we use these optimal solutions to assess the quality of well-known heuristics. A second benchmark

Lightweight remote procedure call

by Brian N. Bershad, Thomas E. Anderson, Edward D. Lazowska, Henry M. Levy - ACM Transactions on Computer Systems , 1990
"... Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily high cost when used for the type of communication ..."
Abstract - Cited by 292 (26 self) - Add to MetaCart
Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily high cost when used for the type of communication

Punctual coalescing

by O Magno Quintão Pereira, Jens Palsberg, Belo Horizonte - In Proceedings of the International Conference on Compiler Construction, CC'10 , 2010
"... Abstract. Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented a polynomial-time ap-proach, while Scholz and Eckstein (2002) presented an optimal, exponen-tial-time approac ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented a polynomial-time ap-proach, while Scholz and Eckstein (2002) presented an optimal, exponen

Coalescing Brownian . . .

by Christophe Garban, Arnab Sen, et al. , 2014
"... The coalescing Brownian flow on R is a process which was introduced by Arratia (1979) and Tóth and Werner (1997), and which formally corresponds to starting coalescing Brow-nian motions from every space-time point. We provide a new state space and topology for this process and obtain an invariance ..."
Abstract - Add to MetaCart
principle for coalescing random walks. This result holds under a finite variance assumption and is thus optimal. In previous works by Fontes et al. (2004), Newman et al. (2005), the topology and state-space required a moment of order 3 − for this convergence to hold. The proof relies crucially on recent

On the complexity of register coalescing

by Florent Bouchez, Alain Darte, Fabrice Rastello - In Proc. of the International Symposium on Code Generation and Optimization (CGO ’07 , 2006
"... Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which revisit not only the spilling problem but also the coalescing problem. Indeed, a more aggressive strategy to avoid load/s ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which revisit not only the spilling problem but also the coalescing problem. Indeed, a more aggressive strategy to avoid load

STOCHASTIC COALESCENCE IN LOGARITHMIC TIME

by Po-shen Loh, Eyal Lubetzky
"... Abstract. The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process, where each round is as follows: Every cluster fli ..."
Abstract - Add to MetaCart
Abstract. The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process, where each round is as follows: Every cluster

Monocular SLAM as a Graph of Coalesced Observations

by Ethan Eade, Tom Drummond
"... We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimizing the resulting graph. We choose coordinates that minimize the nonlinearity of the updates in the nodes, and suggest a ..."
Abstract - Cited by 38 (3 self) - Add to MetaCart
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimizing the resulting graph. We choose coordinates that minimize the nonlinearity of the updates in the nodes, and suggest a

Fast copy coalescing and live-range identification

by Zoran Budimlić, Keith D. Cooper, Timothy J. Harvey, Ken Kennedy, Timothy S. Oberg, Steven W. Reeves - In Proceedings of the ACM Sigplan Conference on Programming Language Design and Implementation (PLDI’02 , 2002
"... This paper presents a fast new algorithm for modeling and reasoning about interferences for variables in a program without constructing an interference graph. It then describes how to use this information to minimize copy insertion for φ-node instantiation during the conversion of the static single ..."
Abstract - Cited by 38 (3 self) - Add to MetaCart
coalescing optimization that shows a decrease in memory usage of up to three orders of magnitude and a decrease of a factor of two in compilation time, while providing the exact same results. We present experimental results that demonstrate that our algorithm is almost as precise (within one percent
Results 1 - 10 of 257