Relevant bibliographies by topics / Remote Direct Memory Access (RDMA)

Academic literature on the topic 'Remote Direct Memory Access (RDMA)'

Author: Grafiati
Published: 10 December 2022
Last updated: 27 January 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Remote Direct Memory Access (RDMA).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Remote Direct Memory Access (RDMA)"

1

Chen, Wei, Songping Yu, and Zhiying Wang. "Fast In-Memory Key–Value Cache System with RDMA." Journal of Circuits, Systems and Computers 28, no. 05 (May 2019): 1950074. http://dx.doi.org/10.1142/s0218126619500749.

Full text
Abstract:
The quick advances of Cloud and the advent of Fog computing impose more and more critical demand for computing and data transfer of low latency onto the underlying distributed computing infrastructure. Remote direct memory access (RDMA) technology has been widely applied for its low latency of remote data access. However, RDMA gives rise to a host of challenges in accelerating in-memory key–value stores, such as direct remote memory writes, making the remote system more vulnerable. This study presents an in-memory key–value system based on RDMA, named Craftscached, which enables: (1) buffering remote memory writes into a communication cache memory to eliminate direct remote memory writes to the data memory area; (2) dividing the communication cache memory into RDMA-writable and RDMA-readable memory zones to reduce the possibility of data corruption due to stray memory writes and caching data into an RDMA-readable memory zone to improve the remote memory read performance; and (3) adopting remote out-of-place direct memory write to achieve high performance of remote read and write. Experimental results in comparison with Memcached indicate that Craftscached provides a far better performance: (1) in the case of read-intensive workloads, the data access of Craftscached is about 7–43[Formula: see text] and 18–72.4% better than those of TCP/IP-based and RDMA-based Memcached, respectively; (2) the memory utilization of small objects is more efficient with only about 3.8% memory compaction overhead.
APA, Harvard, Vancouver, ISO, and other styles
2

Ziegler, Tobias, Viktor Leis, and Carsten Binnig. "RDMA Communciation Patterns." Datenbank-Spektrum 20, no. 3 (September 29, 2020): 199–210. http://dx.doi.org/10.1007/s13222-020-00355-7.

Full text
Abstract:
Abstract Remote Direct Memory Access (RDMA) is a networking protocol that provides high bandwidth and low latency accesses to a remote node’s main memory. Although there has been much work around RDMA, such as building libraries on top of RDMA or even applications leveraging RDMA, it remains a hard problem to identify the most suitable RDMA primitives and their combination for a given problem. While there have been some initial studies included in papers that aim to investigate selected performance characteristics of particular design choices, there has not been a systematic study to evaluate the communication patterns of scale-out systems. In this paper, we address this issue by systematically investigating how to efficiently use RDMA for building scale-out systems.
APA, Harvard, Vancouver, ISO, and other styles
3

Ziegler, Tobias, Jacob Nelson-Slivon, Viktor Leis, and Carsten Binnig. "Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMA." Proceedings of the ACM on Management of Data 1, no. 2 (June 13, 2023): 1–26. http://dx.doi.org/10.1145/3589276.

Full text
Abstract:
Remote data structures built with one-sided Remote Direct Memory Access (RDMA) are at the heart of many disaggregated database management systems today. Concurrent access to these data structures by thousands of remote workers necessitates a highly efficient synchronization scheme. Remarkably, our investigation reveals that existing synchronization schemes display substantial variations in performance and scalability. Even worse, some schemes do not correctly synchronize, resulting in rare and hard-to-detect data corruption. Motivated by these observations, we conduct the first comprehensive analysis of one-sided synchronization techniques and provide general principles for correct synchronization using one-sided RDMA. Our research demonstrates that adherence to these principles not only guarantees correctness but also results in substantial performance enhancements.
APA, Harvard, Vancouver, ISO, and other styles
4

Gerstenberger, Robert, Maciej Besta, and Torsten Hoefler. "Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided." Scientific Programming 22, no. 2 (2014): 75–91. http://dx.doi.org/10.1155/2014/571902.

Full text
Abstract:
Modern interconnects offer remote direct memory access (RDMA) features. Yet, most applications rely on explicit message passing for communications albeit their unwanted overheads. The MPI-3.0 standard defines a programming interface for exploiting RDMA networks directly, however, it's scalability and practicability has to be demonstrated in practice. In this work, we develop scalable bufferless protocols that implement the MPI-3.0 specification. Our protocols support scaling to millions of cores with negligible memory consumption while providing highest performance and minimal overheads. To arm programmers, we provide a spectrum of performance models for all critical functions and demonstrate the usability of our library and models with several application studies with up to half a million processes. We show that our design is comparable to, or better than UPC and Fortran Coarrays in terms of latency, bandwidth and message rate. We also demonstrate application performance improvements with comparable programming complexity.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhu, Bohong, Youmin Chen, Qing Wang, Youyou Lu, and Jiwu Shu. "Octopus + : An RDMA-Enabled Distributed Persistent Memory File System." ACM Transactions on Storage 17, no. 3 (August 31, 2021): 1–25. http://dx.doi.org/10.1145/3448418.

Full text
Abstract:
Non-volatile memory and remote direct memory access (RDMA) provide extremely high performance in storage and network hardware. However, existing distributed file systems strictly isolate file system and network layers, and the heavy layered software designs leave high-speed hardware under-exploited. In this article, we propose an RDMA-enabled distributed persistent memory file system, Octopus + , to redesign file system internal mechanisms by closely coupling non-volatile memory and RDMA features. For data operations, Octopus + directly accesses a shared persistent memory pool to reduce memory copying overhead, and actively fetches and pushes data all in clients to rebalance the load between the server and network. For metadata operations, Octopus + introduces self-identified remote procedure calls for immediate notification between file systems and networking, and an efficient distributed transaction mechanism for consistency. Octopus + is enabled with replication feature to provide better availability. Evaluations on Intel Optane DC Persistent Memory Modules show that Octopus + achieves nearly the raw bandwidth for large I/Os and orders of magnitude better performance than existing distributed file systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Koo, Bonmoo, Jaesang Hwang, Jonghyeok Park, and Wook-Hee Kim. "Converting Concurrent Range Index Structure to Range Index Structure for Disaggregated Memory." Applied Sciences 13, no. 20 (October 10, 2023): 11130. http://dx.doi.org/10.3390/app132011130.

Full text
Abstract:
In this work, we propose the Spread approach, which tailors a concurrent range index structure to a range index structure for disaggregated memory connected via RDMA (Remote Direct Memory Access). The Spread approach leverages the concept of tolerating transient inconsistencies in a concurrent range index structure to reduce the amount of expensive RDMA operations. Based on the Spread approach, we converted Blink-tree, a concurrent range index structure, to a range index structure for disaggregated memory called RF-tree. In our experimental study, RF-tree shows comparable performance to Sherman, a state-of-the-art and carefully crafted range index structure for disaggregated memory.
APA, Harvard, Vancouver, ISO, and other styles
7

Hemmatpour, Masoud, Bartolomeo Montrucchio, and Maurizio Rebaudengo. "Communicating Efficiently on Cluster-Based Remote Direct Memory Access (RDMA) over InfiniBand Protocol." Applied Sciences 8, no. 11 (October 24, 2018): 2034. http://dx.doi.org/10.3390/app8112034.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Zhonghua, Yixing Guo, Kai Lu, Jiguang Wan, Daohui Wang, Ting Yao, and Huatao Wu. "Rcmp: Reconstructing RDMA-Based Memory Disaggregation via CXL." ACM Transactions on Architecture and Code Optimization 21, no. 1 (January 19, 2024): 1–26. http://dx.doi.org/10.1145/3634916.

Full text
Abstract:
Memory disaggregation is a promising architecture for modern datacenters that separates compute and memory resources into independent pools connected by ultra-fast networks, which can improve memory utilization, reduce cost, and enable elastic scaling of compute and memory resources. However, existing memory disaggregation solutions based on remote direct memory access (RDMA) suffer from high latency and additional overheads including page faults and code refactoring. Emerging cache-coherent interconnects such as CXL offer opportunities to reconstruct high-performance memory disaggregation. However, existing CXL-based approaches have physical distance limitation and cannot be deployed across racks. In this article, we propose Rcmp, a novel low-latency and highly scalable memory disaggregation system based on RDMA and CXL. The significant feature is that Rcmp improves the performance of RDMA-based systems via CXL, and leverages RDMA to overcome CXL’s distance limitation. To address the challenges of the mismatch between RDMA and CXL in terms of granularity, communication, and performance, Rcmp (1) provides a global page-based memory space management and enables fine-grained data access, (2) designs an efficient communication mechanism to avoid communication blocking issues, (3) proposes a hot-page identification and swapping strategy to reduce RDMA communications, and (4) designs an RDMA-optimized RPC framework to accelerate RDMA transfers. We implement a prototype of Rcmp and evaluate its performance by using micro-benchmarks and running a key-value store with YCSB benchmarks. The results show that Rcmp can achieve 5.2× lower latency and 3.8× higher throughput than RDMA-based systems. We also demonstrate that Rcmp can scale well with the increasing number of nodes without compromising performance.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Hongzhi, Changji Li, Chenguang Zheng, Chenghuan Huang, Juncheng Fang, James Cheng, and Jian Zhang. "G-tran." Proceedings of the VLDB Endowment 15, no. 11 (July 2022): 2545–58. http://dx.doi.org/10.14778/3551793.3551813.

Full text
Abstract:
Graph transaction processing poses unique challenges such as random data access due to the irregularity of graph structures, low throughput and high abort rate due to the relatively large read/write sets in graph transactions. To address these challenges, we present G-Tran, a remote direct memory access (RDMA)-enabled distributed in-memory graph database with serializable and snapshot isolation support. First, we propose a graph-native data store to achieve good data locality and fast data access for transactional updates and queries. Second, G-Tran adopts a fully decentralized architecture that leverages RDMA to process distributed transactions with the massively parallel processing (MPP) model, which can achieve high performance by utilizing all computing resources. In addition, we propose a new multi-version optimistic concurrency control (MV-OCC) protocol with two optimizations to address the issue of large read/write sets in graph transactions. Extensive experiments show that G-Tran achieves competitive performance compared with other popular graph databases on benchmark workloads.
APA, Harvard, Vancouver, ISO, and other styles
10

Wei, Xingda, Rong Chen, Haibo Chen, and Binyu Zang. "XStore : Fast RDMA-Based Ordered Key-Value Store Using Remote Learned Cache." ACM Transactions on Storage 17, no. 3 (August 31, 2021): 1–32. http://dx.doi.org/10.1145/3468520.

Full text
Abstract:
RDMA ( Remote Direct Memory Access ) has gained considerable interests in network-attached in-memory key-value stores. However, traversing the remote tree-based index in ordered key-value stores with RDMA becomes a critical obstacle, causing an order-of-magnitude slowdown and limited scalability due to multiple round trips. Using index cache with conventional wisdom—caching partial data and traversing them locally—usually leads to limited effect because of unavoidable capacity misses, massive random accesses, and costly cache invalidations. We argue that the machine learning (ML) model is a perfect cache structure for the tree-based index, termed learned cache . Based on it, we design and implement XStore , an RDMA-based ordered key-value store with a new hybrid architecture that retains a tree-based index at the server to perform dynamic workloads (e.g., inserts) and leverages a learned cache at the client to perform static workloads (e.g., gets and scans). The key idea is to decouple ML model retraining from index updating by maintaining a layer of indirection from logical to actual positions of key-value pairs. It allows a stale learned cache to continue predicting a correct position for a lookup key. XStore ensures correctness using a validation mechanism with a fallback path and further uses speculative execution to minimize the cost of cache misses. Evaluations with YCSB benchmarks and production workloads show that a single XStore server can achieve over 80 million read-only requests per second. This number outperforms state-of-the-art RDMA-based ordered key-value stores (namely, DrTM-Tree, Cell, and eRPC+Masstree) by up to 5.9× (from 3.7×). For workloads with inserts, XStore still provides up to 3.5× (from 2.7×) throughput speedup, achieving 53M reqs/s. The learned cache can also reduce client-side memory usage and further provides an efficient memory-performance tradeoff, e.g., saving 99% memory at the cost of 20% peak throughput.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Remote Direct Memory Access (RDMA)"

1

Dulong, Rémi. "Towards new memory paradigms : Integrating non-volatile main memory and remote direct memory access in modern systems." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS027.

Full text
Abstract:
Les ordinateurs modernes sont construits autour de deux éléments : leur CPU etleur mémoire principale volatile, ou RAM. Depuis les années 1970, ce principe a étéconstamment amélioré pour offrir toujours plus de fonctionnalités et de performances.Dans cette thèse, nous étudions deux paradigmes de mémoire qui proposent denouvelles façons d'interagir avec la mémoire dans les systèmes modernes : la mémoirenon-volatile et les accès mémoire distants. Nous mettons en œuvre des outils logicielsqui exploitent ces nouvelles approches afin de les rendre compatibles et d'exploiterleurs performances avec des applications concrètes. Nous analysons égalementl'impact des technologies utilisées, et les perspectives de leur évolution dans lesannées à venir.Pour la mémoire non-volatile, comme les performances de la mémoire sont essentiellespour atteindre le potentiel d'un CPU, cette fonctionnalité a historiquement été abandonnée.Même si les premiers ordinateurs ont été conçus avec des formes de mémoire nonvolatiles, les architectes informatiques ont commencé à utiliser la RAM volatilepour ses performances inégalées, et n'ont jamais remis en question cette décisionpendant des années. Cependant, en 2019, Intel a commercialisé un nouveau composantappelé Optane DCPMM qui rend possible l'utilisation de NVMM. Ce produit proposeune nouvelle façon de penser la persistance des données. Mais il remet égalementen question l'architecture de nos machines et la manière dont nous les programmons.Avec cette nouvelle forme de mémoire, nous avons implémenté NVCACHE, un cacheen mémoire non-volatile qui permet d'accélérer les interactions avec des supportsde stockage persistants plus lents, tels que les SSD. Nous montrons que NVCACHEest particulièrement performant pour les tâches qui nécessitent une granularitéélevée des garanties de persistance, tout en étant aussi simple à utiliser que l'interfacePOSIX traditionnelle. Comparé aux systèmes de fichiers conçus pour NVMM, NVCACHEpeut atteindre un débit similaire ou supérieur lorsque la mémoire non volatile estutilisée. De plus, NVCACHE permet aux programmes d'exploiter les performancesde NVMM sans être limité par la quantité de NVMM installée sur la machine.Un autre changement majeur dans le paysage informatique a été la popularité dessystèmes distribués. Alors que les machines ont individuellement tendance à atteindredes limites de performances, l'utilisation de plusieurs machines et le partage destâches sont devenus la nouvelle façon de créer des ordinateurs puissants. Bien quece mode de calcul permette d'augmenter le nombre de CPU utilisés simultanément,il nécessite une connexion rapide entre les nœuds de calcul. Pour cette raison,plusieurs protocoles de communication ont implémententé RDMA, un moyen delire ou d'écrire directement dans la mémoire d'un serveur distant. RDMA offre defaibles latences et un débit élevé, contournant de nombreuses étapes de la pileréseau.Cependant, RDMA reste limité dans ses fonctionnalités natives. Par exemple, iln'existe pas d'équivalent de multicast pour les fonctions RDMA les plus efficaces.Grâce à un switch programmable (le switch Intel Tofino), nous avons implémentéun mode spécial pour RDMA qui permet de lire ou d'écrire sur plusieurs serveursen même temps, sans pénalité de performances. Notre système appelé Byp4ss faitparticiper le switch aux transferts, en dupliquant les paquets RDMA. Grâce à Byp4ss,nous avons implémenté un protocole de consensus nommé DISMU. De par sa conception,DISMU est optimal en termes de latence et de débit, car il peut réduire au minimumle nombre de paquets échangés sur le réseau pour parvenir à un consensus.Enfin, en utilisant ces deux technologies, nous remarquons que les futures générationsde matériel pourraient nécessiter une nouvelle interface pour les mémoires detoutes sortes, afin de faciliter l'interopérabilité dans des systèmes qui ont tendanceà devenir de plus en plus hétérogènes et complexes
Modern computers are built around two main parts: their Central Processing Unit (CPU), and their volatile main memory, or Random Access Memory (RAM). The basis of this architecture takes its roots in the 1970's first computers. Since, this principle has been constantly upgraded to provide more functionnality and performance.In this thesis, we study two memory paradigms that drastically change the way we can interact with memory in modern systems: non-volatile memory and remote memory access. We implement software tools that leverage them in order to make them compatible and exploit their performance with concrete applications. We also analyze the impact of the technologies underlying these new memory medium, and the perspectives of their evolution in the coming years.For non-volatile memory, as the main memory performance is key to unlock the full potential of a CPU, this feature has historically been abandoned on the race for performance. Even if the first computers were designed with non-volatile forms of memory, computer architects started to use volatile RAM for its incomparable performance compared to durable storage, and never questioned this decision for years. However, in 2019 Intel released a new component called Optane DC Persistent Memory (DCPMM), a device that made possible the use of Non-Volatile Main Memory (NVMM). That product, by its capabilities, provides a new way of thinking about data persistence. Yet, it also challenges the hardware architecture used in our current machines and the way we program them.With this new form of memory we implemented NVCACHE, a cache designed for non-volatile memory that helps boosting the interactions with slower persistent storage medias, such as solid state drive (SSD). We find NVCACHE to be quite performant for workloads that require a high granularity of persistence guarantees, while being as easy to use as the traditional POSIX interface. Compared to file systems designed for NVMM, NVCACHE can reach similar or higher throughput when the non-volatile memory is used. In addition, NVCACHE allows the code to exploit NVMM performance while not being limited by the amount of NVMM installed in the machine.Another major change of in the computer landscape has been the popularity of distributed systems. As individual machines tend to reach performance limitations, using several machines and sharing workloads became the new way to build powerful computers. While this mode of computation allows the software to scale up the number of CPUs used simultaneously, it requires fast interconnection between the computing nodes. For that reason, several communication protocols implemented Remote Direct Memory Access (RDMA), a way to read or write directly into a distant machine's memory. RDMA provides low latencies and high throughput, bypassing many steps of the traditional network stack.However, RDMA remains limited in its native features. For instance, there is no advanced multicast equivalent for the most efficient RDMA functions. Thanks to a programmable switch (the Intel Tofino), we implemented a special mode for RDMA that allows a client to read or write in multiple servers at the same time, with no performance penalty. Our system called Byp4ss makes the switch participate in transfers, duplicating RDMA packets. On top of Byp4ss, we implement a consensus protocol named DISMU, which shows the typical use of Byp4ss features and its impact on performance. By design, DISMU is optimal in terms of latency and throughput, as it can reduce to the minimum the number of packets exchanged through the network to reach a consensus.Finally, by using these two technologies, we notice that future generations of hardware may require a new interface for memories of all kinds, in order to ease the interoperability in systems that tend to get more and more heterogeneous and complex
APA, Harvard, Vancouver, ISO, and other styles
2

Velusamy, Vijay. "Adapting Remote Direct Memory Access based file system to parallel Input-/Output." Master's thesis, Mississippi State : Mississippi State University, 2003. http://library.msstate.edu/etd/show.asp?etd=etd-11112003-092209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tsai, Chia-Tai, and 蔡嘉泰. "An Implementation of Remote Direct Memory Access." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/22697129825206075428.

Full text
Abstract:
碩士
國立交通大學
資訊科學系所
92
With the increase of network bandwidth from 10M to 10G bps, the factors that affect network system performance have found to be relevant with Network Protocol. In traditional architecture, the packets are copied among different protocol layers, before they are transmitted. The data copy consumes many recourses and leads to system inefficiency. However, few studies concern about increasing system efficiency from this point of view. In this thesis, we implement a new Network Protocol, called as Remote Direct Memory Access (RDMA), which can move data packets to a specific memory address. Therefore, the system performance can be improved. Numerical results show that RDMA can achieve a better performance if the packet size is large.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Remote Direct Memory Access (RDMA)"

1

Surminski, Sebastian, Christian Niesler, Lucas Davi, and Ahmad-Reza Sadeghi. "DMA’n’Play: Practical Remote Attestation Based on Direct Memory Access." In Applied Cryptography and Network Security, 32–61. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33491-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Chenchen, Huiqi Hu, Xuecheng Qi, Xuan Zhou, and Aoying Zhou. "RS-store: A SkipList-Based Key-Value Store with Remote Direct Memory Access." In Database Systems for Advanced Applications, 314–23. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59410-7_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vejesh, V., G. Reshma Nayar, and Shiju Sathyadevan. "Optimization of Hadoop Using Software-Internet Wide Area Remote Direct Memory Access Protocol and Unstructured Data Accelerator." In Software Engineering in Intelligent Systems, 261–70. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18473-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Remote Direct Memory Access and iWARP." In Attaining High Performance Communications, 217–40. Chapman and Hall/CRC, 2016. http://dx.doi.org/10.1201/b10249-15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Remote Direct Memory Access (RDMA)"

1

Magoutis, Kostas. "Memory Management Support for Multi-Programmed Remote Direct Memory Access (RDMA) Systems." In 2005 IEEE International Conference on Cluster Computing. IEEE, 2005. http://dx.doi.org/10.1109/clustr.2005.347031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lavrijsen, Wim, and Costin Iancu. "Application Level Reordering of Remote Direct Memory Access Operations." In 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2017. http://dx.doi.org/10.1109/ipdps.2017.98.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Huang, Haixin, Kaixin Huang, Litong You, and Linpeng Huang. "Forca: Fast and Atomic Remote Direct Access to Persistent Memory." In 2018 IEEE 36th International Conference on Computer Design (ICCD). IEEE, 2018. http://dx.doi.org/10.1109/iccd.2018.00045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Du, Jingwen, Fang Wang, Dan Feng, Weiguang Li, and Fan Li. "Fast and Consistent Remote Direct Access to Non-volatile Memory." In ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3472480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Murata, Naofumi, Hideyuki Kawashima, and Osamu Tatebe. "Accelerating read atomic multi-partition transaction with remote direct memory access." In 2017 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 2017. http://dx.doi.org/10.1109/bigcomp.2017.7881705.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Susukita, Ryutaro, Yoshiyuki Morie, Takeshi Nanri, and Hidetomo Shibamura. "NSIM-ACE: An Interconnection Network Simulator for Evaluating Remote Direct Memory Access." In 6th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SCITEPRESS - Science and Technology Publications, 2016. http://dx.doi.org/10.5220/0005978802540261.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cohen, David, Thomas Talpey, Arkady Kanevsky, Uri Cummings, Michael Krause, Renato Recio, Diego Crupnicoff, Lloyd Dickman, and Paul Grun. "Remote Direct Memory Access over the Converged Enhanced Ethernet Fabric: Evaluating the Options." In 2009 17th Annual IEEE Symposium on High-Performance Interconnects (HOTI). IEEE, 2009. http://dx.doi.org/10.1109/hoti.2009.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Panel: Remote Direct Memory Access over the Converged Enhanced Ethernet Fabric: Evaluating the Options." In 2009 17th Annual IEEE Symposium on High-Performance Interconnects (HOTI). IEEE, 2009. http://dx.doi.org/10.1109/hoti.2009.31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Remote Direct Memory Access (RDMA)"

1

Shah, H., F. Marti, W. Noureddine, A. Eiriksson, and R. Sharp. Remote Direct Memory Access (RDMA) Protocol Extensions. RFC Editor, June 2014. http://dx.doi.org/10.17487/rfc7306.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharp, R., and S. Wise. Enhanced Remote Direct Memory Access (RDMA) Connection Establishment. Edited by A. Kanevsky and C. Bestler. RFC Editor, April 2012. http://dx.doi.org/10.17487/rfc6581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Romanow, A., J. Mogul, T. Talpey, and S. Bailey. Remote Direct Memory Access (RDMA) over IP Problem Statement. RFC Editor, December 2005. http://dx.doi.org/10.17487/rfc4297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Talpey, T., and C. Juszczak. Network File System (NFS) Remote Direct Memory Access (RDMA) Problem Statement. RFC Editor, May 2009. http://dx.doi.org/10.17487/rfc5532.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Coene, L. Applicability of Remote Direct Memory Access Protocol (RDMA) and Direct Data Placement (DDP). Edited by C. Bestler. RFC Editor, October 2007. http://dx.doi.org/10.17487/rfc5045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lever, C. Remote Direct Memory Access - Connection Manager (RDMA-CM) Private Data for RPC-over-RDMA Version 1. RFC Editor, June 2020. http://dx.doi.org/10.17487/rfc8797.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ko, M., M. Chadalapaka, J. Hufferd, U. Elzur, H. Shah, and P. Thaler. Internet Small Computer System Interface (iSCSI) Extensions for Remote Direct Memory Access (RDMA). RFC Editor, October 2007. http://dx.doi.org/10.17487/rfc5046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bailey, S., and T. Talpey. The Architecture of Direct Data Placement (DDP) and Remote Direct Memory Access (RDMA) on Internet Protocols. RFC Editor, December 2005. http://dx.doi.org/10.17487/rfc4296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ko, M., and A. Nezhinsky. Internet Small Computer System Interface (iSCSI) Extensions for the Remote Direct Memory Access (RDMA) Specification. RFC Editor, April 2014. http://dx.doi.org/10.17487/rfc7145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pinkerton, J., and E. Deleganes. Direct Data Placement Protocol (DDP) / Remote Direct Memory Access Protocol (RDMAP) Security. RFC Editor, October 2007. http://dx.doi.org/10.17487/rfc5042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Remote Direct Memory Access (RDMA)' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography