Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for generating random permutations on a shared memory machine
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Concurrent reading and writing
Communications of the ACM
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Efficient Parallel Algorithms Can Be Made Robust
Efficient Parallel Algorithms Can Be Made Robust
| Hi-index | 0.00 |
The contributions of this paper are twofold. First, we outline criteria by which any model of asynchronous shared memory parallel computation can be judged. Previous models are considered with respect to these factors. Next, we introduce a new model, and show that this model fulfils all the listed requirements. We also analyze in our model the complexity of several fundamental parallel algorithms.