4586 search results - page 859 / 918 » Computing stable models in parallel |
112
click to vote
PODC
1997
ACM
15 years 4 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
119
click to vote
ASPLOS
1996
ACM
15 years 4 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
130
click to vote
SPAA
1996
ACM
15 years 4 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
111
click to vote
SPDP
1993
IEEE
15 years 4 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...