Zobrazeno 1 - 10 of 340 pro vyhledávání: '"Non-blocking algorithm"'
1
Duplicacy: A New Generation of Cloud Backup Tool Based on Lock-Free Deduplication
Autor: Gilbert Gang Chen, Yangdong Deng, Zonghui Li
Publikováno v: IEEE Transactions on Cloud Computing. 10:2508-2520
The pervasive deployment of cloud services poses an ever-increasing demand for cross-client deduplication solutions to save network bandwidth, lower storage costs, and improve backup speeds. However, existing solutions typically depend on lock based
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ad8f64cf68639d1599268422cc039d0f
https://doi.org/10.1109/tcc.2020.3047403
Zobrazit plný text záznamu
2
BQ: A Lock-Free Queue with Batching
Autor: Yossi Lev, Gal Milman, Erez Petrank, Victor Luchangco, Alex Kogan
Publikováno v: SPAA
Concurrent data structures provide fundamental building blocks for concurrent programming. Standard concurrent data structures may be extended by allowing a sequence of operations to be submitted as a batch for later execution. A sequence of such ope
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09985bfef90e95e5f6bce53cd41b24ce
https://doi.org/10.1145/3512757
Zobrazit plný text záznamu
3
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
Autor: Ivan Walulya, Bapi Chatterjee, Philippas Tsigas
Publikováno v: ICDCN
The Nearest neighbour search (NNS) is a fundamental problem in many application domains dealing with multidimensional data. In a concurrent setting, where dynamic modifications are allowed, a linearizable implementation of the NNS is highly desirable
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1394ce866fc73646c5b74858c6cdcb14
https://doi.org/10.1016/j.tcs.2021.06.041
Zobrazit plný text záznamu
4
On the implementation of memory reclamation methods in a lock-free hash trie design
Autor: Pedro Moreno, Miguel Areias, Ricardo Rocha
Publikováno v: Journal of Parallel and Distributed Computing. 155:1-13
Hash tries are a trie-based data structure with nearly ideal characteristics for the implementation of hash maps. Starting from a particular lock-free hash map data structure, named Lock-Free Hash Tries, we focus on solving the problem of memory recl
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::38a0549c69efec9a87e867dd8a81a383
https://doi.org/10.1016/j.jpdc.2021.04.007
Zobrazit plný text záznamu
5
Lock-free Contention Adapting Search Trees
Autor: SagonasKonstantinos, WinbladKjell, JonssonBengt
Publikováno v: ACM Transactions on Parallel Computing. 8:1-38
Concurrent key-value stores with range query support are crucial for the scalability and performance of many applications. Existing lock-free data structures of this kind use a fixed synchronization granularity. Using a fixed synchronization granular
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d806c4c29666b9f20a582b84661f3c13
https://doi.org/10.1145/3460874
Zobrazit plný text záznamu
6
On the correctness and efficiency of a novel lock-free hash trie map design
Autor: Miguel Areias, Ricardo Rocha
Publikováno v: Journal of Parallel and Distributed Computing. 150:184-195
Hash tries are a trie-based data structure with nearly ideal characteristics for the implementation of hash maps. In this paper, we present a novel, simple and scalable hash trie map design that fully supports the concurrent search, insert and remove
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::50c437b0fef49ac2c28767220236baaf
https://doi.org/10.1016/j.jpdc.2021.01.001
Zobrazit plný text záznamu
8
Concurrent updates to pages with fixed-size rows using lock-free algorithms
Autor: Hanuma Kodavalla, Raghavendra Thallam Kodandaramaih, Girish Mittur Venkataramanappa
Publikováno v: Proceedings of the VLDB Endowment. 13:3195-3203
Database systems based on ARIES [11] protocol rely on Write Ahead Logging (WAL) to recover the database in the event of a crash. WAL protocol requires changes to the database are recorded to the transaction log before updating the underlying database
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9775627006ad39b9c4757542091995f8
https://doi.org/10.14778/3415478.3415544
Zobrazit plný text záznamu
9
FEAST
Autor: Aravind Natarajan, Arunmoezhi Ramachandran, Neeraj Mittal
Publikováno v: ACM Transactions on Parallel Computing. 7:1-64
We present a lock-free algorithm for concurrent manipulation of a binary search tree (BST) in an asynchronous shared memory system that supports search, insert, and delete operations. In addition to read and write instructions, our algorithm uses (si
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3029e4bb76adb68da70089e87fe06c29
https://doi.org/10.1145/3391438
Zobrazit plný text záznamu
10
A Lock Free Approach To Parallelize The Cellular Potts Model: Application To Ductal Carcinoma In Situ
Autor: Alberto Salguero, Antonio J. Tomeu
Publikováno v: Journal of Integrative Bioinformatics, Vol 17, Iss 1, Pp 730-45 (2020)
Journal of Integrative Bioinformatics
Journal of Integrative Bioinformatics. 2020; 20190070
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Agencia Estatal de Meteorología (AEMET)
RODIN: Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Universidad de Cádiz
In the field of computational biology, in order to simulate multiscale biological systems, the Cellular Potts Model (CPM) has been used, which determines the actions that simulated cells can perform by determining a hamiltonian of energy that takes i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b68e654ad72bf79fb8e9dc70827a301
https://doaj.org/article/054cf6106d884c11ad5915952edd030f
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje