95 search results - page 8 / 19 » Constructive, Deterministic Implementation of Shared Memory ... |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
STACS
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
PPL
2007
14 years 9 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...