Such processing is analogous to servicing people in a queue area on a first-come, first-served (FCFS) basis, i.e. 1991.In computing and in systems theory, FIFO is an acronym for first in, first out (the first in is the first out), a method for organizing the manipulation of a data structure (often, specifically a data buffer) where the oldest (first) entry, or "head" of the queue, is processed first. IEEE Transactions on Parallel and Distributed Systems, PDS-2(2):180-198, Apr. The eyect of scheduling discipline on spin overhead in shared memory parallel processors. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 24-37, New York, June 22-24 1995.
The SPLASH-2 programs: Characteriation and methodological considerations. PhD thesis, Rensselaer Polytechnic Institute, Department of Computer Science, 1995. A nonblocking algorithm for shared queues using compare-and-swap. Journal of Parallel and Distributed Computing, 51(1):1-26. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 9(1):21-65, Feb. Algorithms for scalable synchronization on shared-memory multiprocessors. Technical Report CUCS-005-91, Columbia University, 1991. In Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA-97), volume 25,2 of Computer Architecture News, pages 241-251, New YOrk, June 2-4 1997.
The SGI origin: A ccNUMA highly scalable server. ACM Transactions on Programming Languages and Systems, 5(2):190-222, Apr. In Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles Operating Systems Review (13th SOSP 1991), pages 41-55, Pacific Grove, CA, Oct. Empirical studies of competitive spinning for a shared-memory multiprocessor. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 13(1):124-149, Jan. Origin 2000 and onyx2 performance tuning and optimization guide. In our construction we selected to use compare-and-swap since compare-and-swap is an atomic primitive that scales well under contention and either is supported by modern multiprocessors or can be implemented efficiently on them. The first lowers the contention to key variables used by the concurrent enqueue and/or dequeue operations which consequently results in the good performance of the algorithm, the second deals with the pointer recycling problem, an inconsistency problem that all non-blocking algorithms based on the compare-and-swap synchronisation primitive have to address. This work introduces two new, simple algorithmic mechanisms. Experiments on a 64-node SUN Enterprise 10000 - a symmetric multiprocessorsystem - and on a 64-node SGI Origin 2000 - a cache coherent non uniform memory access multiprocessorsystem - indicate that our algorithm considerably outperforms the best of the known alternatives in both multiprocessors in any level of multiprogramming.
The algorithm is very simple, fast and scales very well in both symmetric and non-symmetric multiprocessor shared memory systems. A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this paper.
0 kommentar(er)
