The Experts below are selected from a list of 516 Experts worldwide ranked by ideXlab platform

Y.s. Cheung - One of the best experts on this subject based on the ideXlab platform.

  • on the Doubly Linked List protocol for distributed shared memory multiprocessor systems
    International Conference on Algorithms and Architectures for Parallel Processing, 1995
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed. >

  • On the Doubly-Linked List protocol for distributed shared memory multiprocessor systems
    Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, 1
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.published_or_final_versio

  • Performance analysis of the Doubly-Linked List protocol family for distributed shared memory systems
    Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing ICA sup 3 PP '96, 1
    Co-Authors: A.c.k. Lau, N.h.c. Yung, Y.s. Cheung
    Abstract:

    The Doubly-Linked List (DLL) protocol provides a memory efficient, scalable, high-performance and yet easy to implement method to maintain memory coherence in distributed shared memory (DSM) systems. In this paper, the performance analysis of the DLL family of protocols is presented. Theoretically, the DLL protocol with stable owners has the shortest remote memory access latency among the DLL protocol family. According to the simulated performance evaluation, the DLL-S protocol is 65.7% faster than the DDM algorithm for the linear equation solver; and is 16.5% faster for the matrix multiplier. From the trend of the performance figures, it is predicted that the improvement in performance due to the DLL-S protocol will be considerably greater when a larger number of processors are used, indicating that the DLL-S protocol is also the most scalable of the protocols tested.

A.c.k. Lau - One of the best experts on this subject based on the ideXlab platform.

  • on the Doubly Linked List protocol for distributed shared memory multiprocessor systems
    International Conference on Algorithms and Architectures for Parallel Processing, 1995
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed. >

  • On the Doubly-Linked List protocol for distributed shared memory multiprocessor systems
    Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, 1
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.published_or_final_versio

  • Performance analysis of the Doubly-Linked List protocol family for distributed shared memory systems
    Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing ICA sup 3 PP '96, 1
    Co-Authors: A.c.k. Lau, N.h.c. Yung, Y.s. Cheung
    Abstract:

    The Doubly-Linked List (DLL) protocol provides a memory efficient, scalable, high-performance and yet easy to implement method to maintain memory coherence in distributed shared memory (DSM) systems. In this paper, the performance analysis of the DLL family of protocols is presented. Theoretically, the DLL protocol with stable owners has the shortest remote memory access latency among the DLL protocol family. According to the simulated performance evaluation, the DLL-S protocol is 65.7% faster than the DDM algorithm for the linear equation solver; and is 16.5% faster for the matrix multiplier. From the trend of the performance figures, it is predicted that the improvement in performance due to the DLL-S protocol will be considerably greater when a larger number of processors are used, indicating that the DLL-S protocol is also the most scalable of the protocols tested.

N.h.c. Yung - One of the best experts on this subject based on the ideXlab platform.

  • on the Doubly Linked List protocol for distributed shared memory multiprocessor systems
    International Conference on Algorithms and Architectures for Parallel Processing, 1995
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed. >

  • On the Doubly-Linked List protocol for distributed shared memory multiprocessor systems
    Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, 1
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.published_or_final_versio

  • Performance analysis of the Doubly-Linked List protocol family for distributed shared memory systems
    Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing ICA sup 3 PP '96, 1
    Co-Authors: A.c.k. Lau, N.h.c. Yung, Y.s. Cheung
    Abstract:

    The Doubly-Linked List (DLL) protocol provides a memory efficient, scalable, high-performance and yet easy to implement method to maintain memory coherence in distributed shared memory (DSM) systems. In this paper, the performance analysis of the DLL family of protocols is presented. Theoretically, the DLL protocol with stable owners has the shortest remote memory access latency among the DLL protocol family. According to the simulated performance evaluation, the DLL-S protocol is 65.7% faster than the DDM algorithm for the linear equation solver; and is 16.5% faster for the matrix multiplier. From the trend of the performance figures, it is predicted that the improvement in performance due to the DLL-S protocol will be considerably greater when a larger number of processors are used, indicating that the DLL-S protocol is also the most scalable of the protocols tested.

K.h.w. Leung - One of the best experts on this subject based on the ideXlab platform.

  • on the Doubly Linked List protocol for distributed shared memory multiprocessor systems
    International Conference on Algorithms and Architectures for Parallel Processing, 1995
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed. >

  • On the Doubly-Linked List protocol for distributed shared memory multiprocessor systems
    Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, 1
    Co-Authors: A.c.k. Lau, K.h.w. Leung, N.h.c. Yung, Y.s. Cheung
    Abstract:

    This paper introduces the Doubly-Linked List (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two Linked Lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.published_or_final_versio

Philippas Tsigas - One of the best experts on this subject based on the ideXlab platform.

  • lock free and practical Doubly Linked List based deques using single word compare and swap
    International Conference on Principles of Distributed Systems, 2004
    Co-Authors: Hakan Sundell, Philippas Tsigas
    Abstract:

    We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a general lock-free Doubly Linked List, and only requires single-word compare-and-swap atomic primitives. It also allows pointers with full precision, and thus supports dynamic deque sizes. We have performed an empirical study using full implementations of the most efficient known algorithms of lock-free deques. For systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture. In addition, the proposed solution also implements a general Doubly Linked List, the first lock-free implementation that only needs the single-word compare-and-swap atomic primitive.

  • Lock-Free and Practical Deques using Single-Word Compare-And-Swap
    arXiv: Distributed Parallel and Cluster Computing, 2004
    Co-Authors: Hakan Sundell, Philippas Tsigas
    Abstract:

    We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a Doubly Linked List, and only requires single-word compare-and-swap atomic primitives, even for dynamic memory sizes. We have performed an empirical study using full implementations of the most efficient algorithms of lock-free deques known. For systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture.