MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ (Q4820143): Difference between revisions

@@ Property / cites work @@
+The uniform memory hierarchy model of computation
@@ Property / cites work: The uniform memory hierarchy model of computation / rank @@
+Normal rank
@@ Property / cites work @@
+Designing broadcasting algorithms in the postal model for message-passing systems
+Normal rank
@@ Property / cites work @@
+The expected advantage of asynchrony
@@ Property / cites work: The expected advantage of asynchrony / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128927
@@ Property / cites work: Q3128927 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds on the Complexity of Parallel Sorting
+Normal rank
@@ Property / cites work @@
+Q4003887
@@ Property / cites work: Q4003887 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for parallel memory. II: Hierarchical multilevel memories
+Normal rank