Nessie: A Decoupled, Client-Driven Key-Value Store Using RDMA

Cassell, Benjamin; Szepesi, Tyler; Wong, Bernard; Brecht, Tim; Ma, Jonathan; Liu, Xiaoyi

doi:10.1109/tpds.2017.2729545

Cited by 25 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Taking into account the positive world experience of cryptographic competitions CRYPTREC [13], NESSIE [14], AES [15] and SHA3 [16], the State Service for Special Communications and Data Protection of Ukraine successfully held a national open competition of symmetric block cryptographic algorithms in 2007-2010 [17], which defeated the algorithm "Kalyna" [18], Kharkiv developers of the Institute of Information Technology [19], on the basis of which the national standard of Ukraine was developed [20]. As it has been described above, the new algorithm should provide greater cryptographic transformation speed compared to the AES algorithm [5], as well as have a higher level of stability against AES [5].…”

Section: Analysis Of Recent Research and Publicationsmentioning

confidence: 99%

Features of Using Large Keys in "Kalyna" Algorithm

Zaiats¹,

Bilenko²,

Hlukhov³

2022

ACPS

View full text Add to dashboard Cite

The information security is playing an incre- asingly important role nowadays. Therefore, virus can be transmitted through the information in encrypted form. This is also applied to embedded systems. In this regard, the article is assigned to the topic of cryptocurrency pro- tection in embedded systems. The article is focused on the algorithm of symmetric block transformation "Kalyna". The algorithm has been developed in cooperation with the State Special Communications Service and leading Ukrainian scientists. The experience and results of interna- tional and open national competition of cryptographic algorithms have been taken into account. The algorithm is intended for gradual replacement of the interstate standard DSTU GOST 28147: 2009. Its differences from other data encryption standards used, both in Ukraine and in the world, have been ana- lyzed. The stability of the "Kalyna" algorithm has been also analyzed using a high-bit key (512 bits) and its speed has been compared with other cryptographic protection algorithms.

show abstract

Section: Analysis Of Recent Research and Publicationsmentioning

confidence: 99%

Features of Using Large Keys in "Kalyna" Algorithm

Zaiats¹,

Bilenko²,

Hlukhov³

2022

ACPS

View full text Add to dashboard Cite

show abstract

“…They employ a privilege for accesses to the memory area outside a local machine, known as remote memory. Some of them rely on the native network stack of TCP/IP [16][17][18], [22], [25][26], whereas others either exploit such features as RDMA [11][12][13][14][15], [19][20][21] or adopt new network protocols [53]. In particular, RDMA and its variants [11][12][13][14][15] expose remote memory to users directly via a collection of programming APIs, allowing users to manipulate remote memory by means of considerable application modifications.…”

Section: Programming Remote Memorymentioning

confidence: 99%

“…In addition, RDMA library is available only in a few limited programming languages. Key-value storage [16][17][18][19][20][21][22] and RDMA key-value storage [19][20][21] offer simpler API abstractions, allocating DRAM chunks from connected machines to form a large global pool of DRAM memory for storing application data. They permit applications to read their data directly from a DRAM memory pool, avoiding a huge latency from slow storage.…”

Section: Programming Remote Memorymentioning

confidence: 99%

Cooperative Memory Expansion via OS Kernel Support for Networked Computing Systems

Srinuan

Yuan

Tzeng

2020

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

The growing popularity of in-memory computing for bigdata analytics often causes performance bottlenecks to memory subsystem resided in operating systems (OS). This article purposes cooperative memory expansion (COMEX), an OS kernel extension. COMEX establishes a stable pool of memory collectively across nodes in a cluster and enhances OS's memory subsystem for memory aggregation from connected machines by allowing process's page table to track remote memory page frames without programmer effort or modifications to application codes. COMEX employs Remote Direct Memory Access (RDMA) for low-latency data transfer with destination kernel bypassed and does not rely on an old design of the I/O block subsystem usually adopted by all known remote paging. COMEX fits soundly in the emerging system design approach of resource disaggregation which breaks hard walls between server-centric machines into a new design paradigm of separated resource pools. The new architecture facilitates both system scaling-up and scaling-out, also eliminates imbalance resources existing in datacenters. We have implemented COMEX based on Linux kernel 3.10.87 and deployed on our 32 networked servers. Performance evaluation results under ten applications from two benchmark suites reveal the speedup of up to 170 times when application execution footprints are 10 times larger than available system memory. Index Terms-I/O block devices, memory management, networked computer systems, operating systems (OS), page tables, remote direct memory access (RDMA).

show abstract

“…In-memory key-value stores support single statement transactions consisting of either Get or Put to read or update a data. Recently, in-memory key-value stores are exploiting RDMA to reduce the communication overhead [7][8][9]17,22].…”

Section: In-memory Key-value Storementioning

confidence: 99%

Communicating Efficiently on Cluster-Based Remote Direct Memory Access (RDMA) over InfiniBand Protocol

2018

View full text Add to dashboard Cite

Distributed systems are commonly built under the assumption that the network is the primary bottleneck, however this assumption no longer holds by emerging high-performance RDMA enabled protocols in datacenters. Designing distributed applications over such protocols requires a fundamental rethinking in communication components in comparison with traditional protocols (i.e., TCP/IP). In this paper, communication paradigms in existing systems and new possible paradigms have been investigated. Advantages and drawbacks of each paradigm have been comprehensively analyzed and experimentally evaluated. The experimental results show that writing the requests to server and reading the response presents up to 10 times better performance comparing to other communication paradigms. To further expand the investigation, the proposed communication paradigm has been substituted in a real-world distributed application, and the performance has been enhanced up to seven times.

show abstract

Nessie: A Decoupled, Client-Driven Key-Value Store Using RDMA

Cited by 25 publications

References 12 publications

Features of Using Large Keys in "Kalyna" Algorithm

Features of Using Large Keys in "Kalyna" Algorithm

Cooperative Memory Expansion via OS Kernel Support for Networked Computing Systems

Communicating Efficiently on Cluster-Based Remote Direct Memory Access (RDMA) over InfiniBand Protocol

Contact Info

Product

Resources

About