Semantic Scholar uses AI to extract papers important to this topic.
There has been significant recent interest in parallel frameworks for processing graphs due to their applicability in studying… Expand "I hope that readers will learn to use the full expressibility and power of OpenMP. This book should provide an excellent… Expand At its most elemental level, OpenMP is a set of compiler directives and callable runtime library routines that extend Fortran… Expand Scalable shared-memory multiprocessors distribute memory among the processors and use scalable interconnection networks to… Expand The memory consistency model of a system affects performance, programmability, and portability. We aim to describe memory… Expand Busy-wait techniques are heavily used for mutual exclusion andbarrier synchronization in shared-memory parallel programs… Expand Publisher Summary
This chapter discusses parallel algorithms for shared-memory machines. Parallel computation is rapidly… Expand The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for… Expand This paper introduces a general formulation of atonuc wzap~hot rnenzory, a shared memory partitioned into words written (apduted… Expand Abstract We give a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and… Expand