Results 1 to 10 of about 99,104 (292)
Proceedings of the 12th ACM SIGOPS Asia-Pacific Workshop on Systems, 2021 As computational infrastructure extends to the edge, it will increasingly offer the same fine-grained resource provisioning mechanisms used in large-scale cloud datacenters, and advances in low-latency, wireless networking technology will allow service providers to blur the distinction between local and remote resources for commodity computing.
openaire +4 more sources
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
ACM Transactions on Algorithms, 2023 Coalescing random walks is a fundamental distributed process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk.
Varun Kanade +2 more
openaire +5 more sources
Proceedings of the National Academy of Sciences, 2019 An approach to the coalescent, the fractional coalescent ( f -coalescent), is introduced. The derivation is based on the discrete-time Cannings population model in which the variance of the number of ...
Mashayekhi, Somayeh, Beerli, Peter
openaire +2 more sources
On the Complexity of Register Coalescing [PDF]
International Symposium on Code Generation and Optimization (CGO'07), 2007 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.
Bouchez, Florent +2 more
openaire +2 more sources
The Coalescent in Peripatric Metapopulations [PDF]
Journal of Applied Probability, 2015 We consider a dynamic metapopulation involving one large population of sizeNsurrounded by colonies of size εNN, usually called peripheral isolates in ecology, whereN→ ∞ and εN→ 0 in such a way that εNN→ ∞. The main population, as well as the colonies, independently send propagules to found new colonies (emigration), and each colony independently ...
Lambert, Amaury, Ma, Chunhua
openaire +5 more sources
, 2010 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 approach, while Scholz and Eckstein (2002) presented an optimal, exponential-time approach together with a near-optimal, quadratic-time heuristic.
Fernando Magno Quintão Pereira +1 more
openaire +2 more sources
The segregated $\Lambda$-coalescent [PDF]
The Annals of Probability, 2015 We study a natural generalization of the Λ-coalescent to a spatial continuum. We introduce the process, which is known as the Segregated Λ-coalescent, via its connections to the (non-spatial) Λ-coalescent and the Spatial Λ-Fleming-Viot process. The main new results contained in this thesis are as follows.
openaire +4 more sources
Dynamics of Fullerene Coalescence [PDF]
Physical Review Letters, 2003 4 pages, 2 figures, 1 supplementary movie at http://dielc.kaist.ac.kr/yonghyun/coal.mpeg.
Kim, YH Kim, Yong-Hyun +3 more
openaire +3 more sources
The Coalescent With Gene Conversion [PDF]
Genetics, 2000 Abstract In this article we develop a coalescent model with intralocus gene conversion. The distribution of the tract length is geometric in concordance with results published in the literature. We derive a simulation scheme and deduce a number of analytical results for this coalescent with gene conversion.
Wiuf, Carsten, Hein, J
openaire +4 more sources