Optimizing Local Queue Management for Efficient Data Transmission
Dive into the world of local queue management with a focus on traditional views, memory optimization, fixed allocations, variable entry sizes, and more. Explore how to handle application requests, manage queue attributes, calculate padding, and effectively handle injected data in the queue space.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Transmit and Receive Contexts Sean Hefty
Local Queue Management Traditional view Fixed number of entries Each entry a fixed size Memory optimized Fixed allocation Entries variable size 2 www.openfabrics.org
Local Queue Data Application request Specified operation 0 or more IO vectors (SGEs) Provider limits Size of transmit queue Maximum number of IOVs 3 www.openfabrics.org
Local Queue Data Size to record operation Size to record IO vector Max IOVs Size in bytes Alignment restriction 4 www.openfabrics.org
Local Queue Management Queue attributes Total size, in bytes IOV limit max number of IOVs for a single operation Operation alignment, in bytes Calculate padding with each operation Domain attributes Operation size, in bytes Amount of space consumed to track each request IOV size, in bytes Amount of space consumed for each IOV 5 www.openfabrics.org
Local Queue Management Generic calculation done by app: needed = ((op_size + iov_size * nsge) + op_alignment - 1) & ~(op_alignment - 1) For queues with fixed sized entries: needed = op_alignment For queues with variable sized entries needed = op_size + iov_size * nsge 6 www.openfabrics.org
Injected (inline) Data Queue attribute Maximum injected data size Queue space calculation needed = op_size + inject_size (Subject to alignment) 7 www.openfabrics.org
