Dynamic Shared Memory Pool Management Method in Soft Real-Time Systems

Nyrkov, Anatoliy; Ianiushkin, Konstantin; Nyrkov, Andrey A.; Romanova, Yulia; Gaskarov, Vagiz D.

doi:10.1109/eiconrus49466.2020.9039354

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Key-value lookups uses our implementation to look up random keys. Each bucket has a various number of slots for data, which had two levels of blocks as described in [21] and were counted as one segment. As for special cases, colliding items are kept in a linked list when the bucket capacity is exceeded.…”

Section: Resultsmentioning

confidence: 99%

Data structures access model for remote shared memory

et al. 2021

View full text Add to dashboard Cite

Recent achievements in high-performance computing significantly narrow the performance gap between single and multi-node computing, and open up opportunities for systems with remote shared memory. The combination of in-memory storage, remote direct memory access and remote calls requires rethinking how data organized, protected and queried in distributed systems. Reviewed models let us implement new interpretations of distributed algorithms allowing us to validate different approaches to avoid race conditions, decrease resource acquisition or synchronization time. In this paper, we describe the data model for mixed memory access with analysis of optimized data structures. We also provide the result of experiments, which contain a performance comparison of data structures, operating with different approaches, evaluate the limitations of these models, and show that the model does not always meet expectations. The purpose of this paper to assist developers in designing data structures that will help to achieve architectural benefits or improve the design of existing distributed system.

show abstract

Section: Resultsmentioning

confidence: 99%