The Experts below are selected from a list of 72165 Experts worldwide ranked by ideXlab platform
Philippas Tsigas - One of the best experts on this subject based on the ideXlab platform.
-
cache aware lock Free queues for multiple producers consumers and weak Memory consistency
International Conference on Principles of Distributed Systems, 2010Co-Authors: Anders Gidenstam, Hakan Sundell, Philippas TsigasAbstract:A lock-Free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak Memory models. It has been designed to be cache-aware and work directly on weak Memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-Free Memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8- way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-Free algorithms.
-
efficient and reliable lock Free Memory reclamation based on reference counting
IEEE Transactions on Parallel and Distributed Systems, 2009Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free method for semiautomatic (application-guided) Memory reclamation based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upper bound on the amount of Memory waiting to be reclaimed. To the best of our knowledge, this is the first lock-Free method that provides all of these properties. We provide analytical and experimental study of the method. The experiments conducted have shown that the method can also provide significant performance improvements for lock-Free algorithms of dynamic data structures that require strong Memory management.
-
efficient and reliable lock Free Memory reclamation based on reference counting
International Symposium on Parallel Architectures Algorithms and Networks, 2005Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free implementation of a Memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the Memory prevented for reuse. To the best of our knowledge, this is the first lock-Free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-Free algorithms of dynamic data structures that require strong garbage collection support.
Anders Gidenstam - One of the best experts on this subject based on the ideXlab platform.
-
cache aware lock Free queues for multiple producers consumers and weak Memory consistency
International Conference on Principles of Distributed Systems, 2010Co-Authors: Anders Gidenstam, Hakan Sundell, Philippas TsigasAbstract:A lock-Free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak Memory models. It has been designed to be cache-aware and work directly on weak Memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-Free Memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8- way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-Free algorithms.
-
efficient and reliable lock Free Memory reclamation based on reference counting
IEEE Transactions on Parallel and Distributed Systems, 2009Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free method for semiautomatic (application-guided) Memory reclamation based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upper bound on the amount of Memory waiting to be reclaimed. To the best of our knowledge, this is the first lock-Free method that provides all of these properties. We provide analytical and experimental study of the method. The experiments conducted have shown that the method can also provide significant performance improvements for lock-Free algorithms of dynamic data structures that require strong Memory management.
-
efficient and reliable lock Free Memory reclamation based on reference counting
International Symposium on Parallel Architectures Algorithms and Networks, 2005Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free implementation of a Memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the Memory prevented for reuse. To the best of our knowledge, this is the first lock-Free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-Free algorithms of dynamic data structures that require strong garbage collection support.
Yonggang Zhao - One of the best experts on this subject based on the ideXlab platform.
-
built in homojunction dominated intrinsically rectifying resistive switching in nio nanodots for selection device Free Memory application
arXiv: Mesoscale and Nanoscale Physics, 2017Co-Authors: Zhong Sun, Linlin Wei, Ce Feng, Peixian Miao, Meiqi Guo, Huaixin Yang, Yonggang ZhaoAbstract:The intrinsically rectifying-resistive switching (IR-RS) has been regarded as an effective way to address the crosstalk issue, due to the Schottky diodes formed at the metal/oxide interfaces in the ON states to suppress the sneak current at reverse biases. In this letter, we report for the first time another type of IR-RS that is related to the built-in homojunction. The IR-RS study was usually limited to macroscopic samples with micron-order pad-type electrodes, while this work is on NiO nanodots fabricated with ultrathin anodic-aluminum-oxide templates and acting as nanoscaled analogs of real devices. The NiO nanodots show high storage density and high uniformity, and the IR-RS behaviors are of good device performances in terms of retention, endurance, switching ratio and rectification ratio. The feasibility of the IR-RS for selection device-Free Memory application has been demonstrated, by calculating the maximum crossbar array size under the worst-case scenario to be 3 Mbit.
-
built in homojunction dominated intrinsically rectifying resistive switching in nio nanodots for selection device Free Memory application
Advanced electronic materials, 2017Co-Authors: Zhong Sun, Linlin Wei, Ce Feng, Peixian Miao, Meiqi Guo, Huaixin Yang, Yonggang ZhaoAbstract:Intrinsically rectifying-resistive switching (IR-RS) has been regarded as an effective way to address the crosstalk issue, due to the Schottky diodes formed at the metal/oxide interfaces in the ON states to suppress the sneak current at reverse biases. In this paper, the authors report for the first time another type of IR-RS that is related to the built-in homojunction. The IR-RS study is usually limited to macroscopic samples with micrometer-order pad-type electrodes, while this work is on NiO nanodots fabricated with ultrathin anodic-aluminum-oxide templates and acting as nanoscaled analogs of real devices. The NiO nanodots show high storage density and high uniformity, and the IR-RS behaviors are of good device performances in terms of retention, endurance, switching ratio, and rectification ratio. The feasibility of the IR-RS for selection device-Free Memory application is demonstrated by calculating the maximum crossbar array size under the worst-case scenario to be 3 Mbit.
Maged M Michael - One of the best experts on this subject based on the ideXlab platform.
-
scalable lock Free dynamic Memory allocation
Programming Language Design and Implementation, 2004Co-Authors: Maged M MichaelAbstract:Dynamic Memory allocators (malloc/Free) rely on mutual exclusion locks for protecting the consistency of their shared data structures under multithreading. The use of locking has many disadvantages with respect to performance, availability, robustness, and programming flexibility. A lock-Free Memory allocator guarantees progress regardless of whether some threads are delayed or even killed and regardless of scheduling policies. This paper presents a completely lock-Free Memory allocator. It uses only widely-available operating system support and hardware atomic instructions. It offers guaranteed availability even under arbitrary thread termination and crash-failure, and it is immune to deadlock regardless of scheduling policies, and hence it can be used even in interrupt handlers and real-time applications without requiring special scheduler support. Also, by leveraging some high-level structures from Hoard, our allocator is highly scalable, limits space blowup to a constant factor, and is capable of avoiding false sharing. In addition, our allocator allows finer concurrency and much lower latency than Hoard. We use PowerPC shared Memory multiprocessor systems to compare the performance of our allocator with the default AIX 5.1 libc malloc, and two widely-used multithread allocators, Hoard and Ptmalloc. Our allocator outperforms the other allocators in virtually all cases and often by substantial margins, under various levels of parallelism and allocation patterns. Furthermore, our allocator also offers the lowest contention-Free latency among the allocators by significant margins.
-
high performance dynamic lock Free hash tables and list based sets
ACM Symposium on Parallel Algorithms and Architectures, 2002Co-Authors: Maged M MichaelAbstract:Lock-Free (non-blocking) shared data structures promise more robust performance and reliability than conventional lock-based implementations. However, all prior lock-Free algorithms for sets and hash tables suffer from serious drawbacks that prevent or limit their use in practice. These drawbacks include size inflexibility, dependence on atomic primitives not supported on any current processor architecture, and dependence on highly-inefficient or blocking Memory management techniques.Building on the results of prior researchers, this paper presents the first CAS-based lock-Free list-based set algorithm that is compatible with all lock-Free Memory management methods. We use it as a building block of an algorithm for lock-Free hash tables. In addition to being lock-Free, the new algorithm is dynamic, linearizable, and space-efficient.Our experimental results show that the new algorithm outperforms the best known lock-Free as well as lock-based hash table implementations by significant margins, and indicate that it is the algorithm of choice for implementing shared hash tables.
-
safe Memory reclamation for dynamic lock Free objects using atomic reads and writes
Principles of Distributed Computing, 2002Co-Authors: Maged M MichaelAbstract:A major obstacle to the wide use of lock-Free data structures, despite their many performance and reliability advantages, is the absence of a practical lock-Free method for reclaiming the Memory of dynamic nodes removed from dynamic lock-Free objects for arbitrary reuse.The only prior lock-Free Memory reclamation method depends on the DCAS atomic primitive, which is not supported on any current processor architecture. Other Memory management methods are blocking, require special operating system support, or do not allow arbitrary Memory reuse.This paper presents the first lock-Free Memory management method for dynamic lock-Free objects that allows arbitrary Memory reuse, and does not require special operating system or hardware support. It guarantees an upper bound on the number of removed nodes not yet Freed at any time, regardless of thread failures and delays. Furthermore, it is wait-Free, it is only logarithmically contention-sensitive, and it uses only atomic reads and writes for its operations. In addition, it can be used to prevent the ABA problem for pointers to dynamic nodes in most algorithms, without requiring extra space per pointer or per node.
Hakan Sundell - One of the best experts on this subject based on the ideXlab platform.
-
cache aware lock Free queues for multiple producers consumers and weak Memory consistency
International Conference on Principles of Distributed Systems, 2010Co-Authors: Anders Gidenstam, Hakan Sundell, Philippas TsigasAbstract:A lock-Free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak Memory models. It has been designed to be cache-aware and work directly on weak Memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-Free Memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8- way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-Free algorithms.
-
efficient and reliable lock Free Memory reclamation based on reference counting
IEEE Transactions on Parallel and Distributed Systems, 2009Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free method for semiautomatic (application-guided) Memory reclamation based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The method guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives that are available in modern computer systems, and provides an upper bound on the amount of Memory waiting to be reclaimed. To the best of our knowledge, this is the first lock-Free method that provides all of these properties. We provide analytical and experimental study of the method. The experiments conducted have shown that the method can also provide significant performance improvements for lock-Free algorithms of dynamic data structures that require strong Memory management.
-
efficient and reliable lock Free Memory reclamation based on reference counting
International Symposium on Parallel Architectures Algorithms and Networks, 2005Co-Authors: Anders Gidenstam, Hakan Sundell, Marina Papatriantafilou, Philippas TsigasAbstract:We present an efficient and practical lock-Free implementation of a Memory reclamation scheme based on reference counting, aimed for use with arbitrary lock-Free dynamic data structures. The scheme guarantees the safety of local as well as global references, supports arbitrary Memory reuse, uses atomic primitives which are available in modern computer systems and provides an upper bound on the Memory prevented for reuse. To the best of our knowledge, this is the first lock-Free algorithm that provides all of these properties. Experimental results indicate significant performance improvements for lock-Free algorithms of dynamic data structures that require strong garbage collection support.
