Annual ACM Symposium on Parallel Algorithms and Architectures, 第 13 巻

ACM Symposium Alice and Bob allocation architecture array assigned blocks broadcasting buffer cache CDAG cluster column communication compare-and-swap competitive ratio complexity Computer Science consider constant copies cost defined denote destination deterministic disk distributed edges efficient execution fetch-and-add FIFO Figure function graph Hence hot-potato routing hypergraphs IEEE implementation input integer label latency least Lemma lookahead lower bound memory mesh multiprocessor node number of processors O(log operations optimal output P₁ packets Parallel Algorithms parallel computation parameters partitioning path performance permutation phase placement pointer port number prefetching problem Proc PROOF protocol quantum algorithm queue random requests requires room synchronization scheduling sequence sequential sequential consistency servers sorting step streams superscalar tasks THEOREM threads tile tion total number tree tuple update vector vertex vertices