Sciweavers

17840 search results - page 3138 / 3568
» Heterogeneous Parallel Computing
Sort
View
SPAA
1996
ACM
15 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
PDIS
1993
IEEE
15 years 11 months ago
Log-Based Directory Resolution in the Coda File System
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
Puneet Kumar, Mahadev Satyanarayanan
197
Voted
SPDP
1993
IEEE
15 years 11 months ago
How to Share an Object: A Fast Timing-Based Solution
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 ...
Rajeev Alur, Gadi Taubenfeld
PDIS
1994
IEEE
15 years 11 months ago
Achieving Transaction Scaleup on Unix
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
Marie-Anne Neimat, Donovan A. Schneider
ICS
2010
Tsinghua U.
15 years 11 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
« Prev « First page 3138 / 3568 Last » Next »