RDMA buffer dynamic allocation method based on iterative approximation
An RDMA and dynamic allocation technology, applied in the computer field, can solve the problems of RDMA buffer memory occupation, insufficient RDMA buffer, memory waste, etc., and achieve the effect of reducing the number of RDMA buffers, reducing memory consumption, and high bandwidth
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0033]Embodiment: A method for dynamic allocation of RDMA buffers based on iterative approximation, including the following steps:
[0034]S1. During initialization, the RDMA initiator makes the following settings: record the number of buffers requested to be allocated as rbuf_thresh, the initial value is set to 4, the time of rbuf_thresh expansion is recorded as epoch_start, the initial value is set to the current time, rbuf_thresh before rbuf_thresh expansion Denoted as Rmin , The initial value is set to 2, and the expanded rbuf_thresh after rbuf_thresh is recorded as Rmax , The initial value is set to 4, R after rbuf_thresh is expandedmax Reduce to Rmin The time is denoted as K, initialized as K=, Where C is a constant coefficient;
[0035]S2. The RDMA initiator checks the list of RDMA buffers stored locally. This RDMA buffer list contains all available RDMA buffers allocated by the RDMA passive party to the RDMA initiator, and judges whether the RDMA passive party has available RDMA ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com