Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Koval, Nikita"'
Asynchronous programming has gained significant popularity over the last decade: support for this programming pattern is available in many popular languages via libraries and native language implementations, typically in the form of coroutines or the
Externí odkaz:
http://arxiv.org/abs/2211.04986
Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, the
Externí odkaz:
http://arxiv.org/abs/2111.12682
Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given $n$ threads and $m\ge n$ distinct priority queues, task insertions are performed uniformly at random
Externí odkaz:
http://arxiv.org/abs/2109.00657
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic mini
Externí odkaz:
http://arxiv.org/abs/2105.08098
Concurrent data structures often require additional memory for handling synchronization issues in addition to memory for storing elements. Depending on the amount of this additional memory, implementations can be more or less memory-friendly. A memor
Externí odkaz:
http://arxiv.org/abs/2104.15003
Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant
Externí odkaz:
http://arxiv.org/abs/2003.09363
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this
Externí odkaz:
http://arxiv.org/abs/1911.06347
Artifacts which contain everything required for replicating experiments presented inMulti-Queues Can Be State-of-the-Art Priority Schedulerspaper. multiqueue-based-schedulers.zip— the source code which contains an implementation of the schedulers,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09c1ff77fb59d3686462d406bc0d388a
In addition to the memory used for storing data elements, a concurrent implementation of a dynamic data structure exhibits a metadata overhead related to resolving synchronization issues caused by concurrent data accesses. An implementation can be mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b146e38b3688dc8ea8aa90013b31fa8
http://arxiv.org/abs/2104.15003
http://arxiv.org/abs/2104.15003
Autor:
Vorobyov, Maxim Sergeevich, Petrikova, Elizaveta Alekseevna, Shin, Vladislav Igorevich, Moskvin, Pavel Vladimirovich, Ivanov, Yurii Fedorovich, Koval, Nikolay Nikolaevich, Koval, Tamara Vasil'evna, Prokopenko, Nikita Andreevich, Kartavtsov, Ruslan Aleksandrovich, Shpanov, Dmitry Alekseevich
Publikováno v:
Coatings (2079-6412); Jun2023, Vol. 13 Issue 6, p1131, 17p
