Filters








216,083 Hits in 4.3 sec

A Concurrency-Optimal List-Based Set [article]

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang
2021 arXiv   pre-print
We propose a new algorithm for the list-based set based on a value-aware try-lock that we show to achieve optimal concurrency: it only rejects concurrent schedules that violate correctness of the implemented  ...  As we show in this paper, even for a data structure as simple as a linked list used to implement the set type, the most efficient algorithms known so far are not concurrency-optimal: they may reject correct  ...  However, even seemingly optimal versioning-based techniques for list-based sets fall short of providing concurrency-optimality.  ... 
arXiv:1502.01633v3 fatcat:eo36mi77yvfptczfxkwq2is66e

Optimism for Boosting Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2015 arXiv   pre-print
We propose a list-based set algorithm that is optimal in the sense that it accepts all correct concurrent schedules.  ...  As we show via experimentation, the optimality in terms of concurrency is reflected by scalability gains.  ...  The list-based set is denoted by (LL, set) (cf. formal definition in Appendix A). Concurrent implementations.  ... 
arXiv:1203.4751v8 fatcat:7pf6pognandedj47jwuts5yub4

Optimistic Transactional Boosting

Ahmed Hassan, Roberto Palmieri, Sebastiano Peluso, Binoy Ravindran
2017 IEEE Transactions on Parallel and Distributed Systems  
A large set of them has a common base principle: each operation is split into a read-only traversal phase, which scans the data structure without locking or monitoring, and a read-write commit phase, which  ...  In particular, we extended a recent approach that models concurrent data structures by including the two notions of optimism and composition of operations.  ...  As a result, TM-based data structures perform inferior to their optimized, concurrent counterparts.  ... 
doi:10.1109/tpds.2017.2725837 fatcat:647u7sl2rnhrtgerzjipywzkr4

On Developing Optimistic Transactional Lazy Set [chapter]

Ahmed Hassan, Roberto Palmieri, Binoy Ravindran
2014 Lecture Notes in Computer Science  
In this paper, we present OTB-Set, an efficient optimistic transactional lazy set based on both linked-list and skip-list implementations.  ...  We first provide general guidelines to show how to design a transactional (non-optimized) version of the highly concurrent lazy set with a minimal reengineering effort.  ...  As a result, STM-based transactional collections perform inferior to their optimized, concurrent (i.e. non-transactional) counterparts.  ... 
doi:10.1007/978-3-319-14472-6_29 fatcat:2bwtutsek5hx3au2n43dnlffsq

Optimistic transactional boosting

Ahmed Hassan, Roberto Palmieri, Binoy Ravindran
2014 SIGPLAN notices  
We present an optimistic methodology for boosting concurrent collections.  ...  Optimistic boosting allows greater data structure-specific optimizations, easier integration with STM frameworks, and lower restrictions on the boosted operations than the original boosting methodology  ...  To cover the read-after-write hazard, the write-set is scanned before the list traversal. Validation. List is validated in a similar way as its concurrent version [3] .  ... 
doi:10.1145/2692916.2555283 fatcat:b2ml3q3a7nh3havspocoy7nmvy

Optimistic transactional boosting

Ahmed Hassan, Roberto Palmieri, Binoy Ravindran
2014 Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14  
We present an optimistic methodology for boosting concurrent collections.  ...  Optimistic boosting allows greater data structure-specific optimizations, easier integration with STM frameworks, and lower restrictions on the boosted operations than the original boosting methodology  ...  To cover the read-after-write hazard, the write-set is scanned before the list traversal. Validation. List is validated in a similar way as its concurrent version [3] .  ... 
doi:10.1145/2555243.2555283 dblp:conf/ppopp/HassanPR14 fatcat:ntwdgghwararhnelnqmlaoazta

The Information Needed for Reproducing Shared Memory Experiments [chapter]

Vincent Gramoli
2017 Lecture Notes in Computer Science  
a concurrent experiment.  ...  Unfortunately, experiments involving concurrent programs are rarely reproducible.  ...  The Problem of Insufficient Description To illustrate the difficulty of reproducing a concurrent program execution, let us take a simple concurrent list-based set benchmark example.  ... 
doi:10.1007/978-3-319-58943-5_48 fatcat:vqypqymu7jebdg7hhaa3jfmvcm

In the Search of Optimal Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2016 arXiv   pre-print
In this paper, we treat this question formally by introducing the notion of a \emph{concurrency-optimal} implementation.  ...  However, when used \emph{as is}, a nontrivial sequential data structure, such as a linked list, a search tree, or a hash table, may expose incorrect behavior: lost updates, inconsistent responses, etc.  ...  Consider an execution of a concurrent list-based set depicted in Figure 3 . We assume here that the set initial state is {1, 3, 4}.  ... 
arXiv:1603.01384v1 fatcat:i6bru3syt5eobhloeh4a2zllra

StorkCloud

Tevfik Kosar, Engin Arslan, Brandon Ross, Bing Zhang
2013 Proceedings of the 4th ACM workshop on Scientific cloud computing - Science Cloud '13  
Wide-area transfer of large data sets is still a big challenge despite the deployment of high-bandwidth networks with speeds reaching 100 Gbps.  ...  We have developed a "data transfer scheduling and optimization system as a Cloud-hosted service", StorkCloud, which will mitigate the large-scale end-to-end data movement bottleneck by efficiently utilizing  ...  In this paper, we present two StorkCloud optimizers: (i) the "Single-Chunk Concurrency (SCC)" approach which divides the set of files into chunks based on file size, and then transfers each chunk with  ... 
doi:10.1145/2465848.2465855 dblp:conf/hpdc/KosarARZ13 fatcat:qccihbwwt5c5tbw2zxakyyemcm

A Dynamic and Distributed Scheduling for Data Aggregation in Ubiquitous Sensor Networks Using Power Control

S. Madhavi, Tai Honn Kim
2013 International Journal of Distributed Sensor Networks  
The traditional graph model does not model the interferences occurring from the concurrent transmissions in the Ubiquitous Sensor Networks.  ...  Hence in this paper we propose a new network model for the USN called a power control collision interference free model and a novel distributed data aggregation scheduling protocol which is adaptive to  ...  Let denote the number of nodes in USN and UV denote the set of all nodes in USN Step 2. for = 1, 2, 3, . . . , do Steps 3 to Steps 6 hop neighbors list of a node //non conflict set [ ] contains the list  ... 
doi:10.1155/2013/582656 fatcat:a6y5trk4ezfk5c6bc2dcnswi2u

Optimal Instrumentation of Data-flow in Concurrent Data Structures [chapter]

Samaneh Navabpour, Borzoo Bonakdarpour, Sebastian Fischmeister
2011 Lecture Notes in Computer Science  
We formulate an optimization problem that aims at minimizing the size of the latter set. In order to cope with the exponential complexity of the problem, we present a SAT-based solution.  ...  Observability in a concurrent program enables a debugger to extract the value of a set of desired variables through instrumenting another (possibly smaller) set of variables.  ...  In particular, we use our mutex-based implementation of concurrent linked lists and the algorithm in [5] for concurrent red-black trees (with 656 lines of code and 57 desired variables). 2.  ... 
doi:10.1007/978-3-642-25873-2_34 fatcat:b5bp3rzuwfgqfnvlxtsiichr4q

Optimistic concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis
2016 SIGPLAN notices  
We illustrate the power of our OPTIK pattern and its implementation by introducing four new algorithms and by optimizing four state-of-the-art algorithms for linked lists, skip lists, hash tables, and  ...  We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures.  ...  A version number is coupled with a lock that protects a set of data (e.g., one list node).  ... 
doi:10.1145/3016078.2851146 fatcat:6cpogpvdqzhjzgal4bet4yts5i

Optimistic concurrency with OPTIK

Rachid Guerraoui, Vasileios Trigonakis
2016 Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16  
We illustrate the power of our OPTIK pattern and its implementation by introducing four new algorithms and by optimizing four state-of-the-art algorithms for linked lists, skip lists, hash tables, and  ...  We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures.  ...  A version number is coupled with a lock that protects a set of data (e.g., one list node).  ... 
doi:10.1145/2851141.2851146 dblp:conf/ppopp/GuerraouiT16 fatcat:bdxf2f77hrhsriycuxe4h73fku

Concurrent transformation components using contention context sensors

Erik Österlund, Welf Löwe
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
We implemented this architecture for concurrent queues, sets, and ordered sets. In all three cases, experimental evaluation shows close to optimal performance regardless of the actual contention.  ...  Based on the thread contention monitored at runtime, context-aware composition and optimization select the appropriate mechanism.  ...  The lock-based solution uses a double-linked list for performance improvements.  ... 
doi:10.1145/2642937.2642995 dblp:conf/kbse/OsterlundL14 fatcat:hnngcccecvedpo47wb3enhzyue

Asynchronized Concurrency

Tudor David, Rachid Guerraoui, Vasileios Trigonakis
2015 Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS '15  
We introduce "asynchronized concurrency (ASCY)," a paradigm consisting of four complementary programming patterns.  ...  ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts.  ...  Part of this work was funded from the SNSF projects 200021-143915 (Reusable Concurrent Data Types) and 200021-147067 (Scalable and Secure Computing in Social Networks).  ... 
doi:10.1145/2694344.2694359 dblp:conf/asplos/DavidGT15 fatcat:ieknmbpx6fg2how7f5ty74ikiu
« Previous Showing results 1 — 15 out of 216,083 results