IP Library › Granted Patent US 12,641,150
Granted Patent B2
US 12,641,150 · App. 18/102,033 · Granted May 26, 2026

System and method for one-sided read RMA using linked queues

Inventors: Shrijeet Mukherjee (Mountain View, CA); Thomas Norrie (Mountain View, CA); Carlo Contavalli (Mountain View, CA); Gurjeet Singh (Mountain View, CA); Adam Belay (Mountain View, CA)
Assignee: Enfabrica Corporation
H04L67/1097H04L69/164H04L69/22
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,641,150
App. No.
18/102,033
Granted
May 26, 2026
Kind
B2
Abstract

A system for one-sided read remote memory access is disclosed. In some embodiments, the system is configured to receive, at a responder SFA, a first packet comprising a read request to read a remote memory of a second host from a first host, wherein a payload of the first packet is mapped to be a transmit header queue (TxHQ) entry (TxHQE), and the TxHQE includes a pointer to a memory map; separate, the received packet into portions including a upper level protocol (ULP) portion, the ULP portion being the TxHQE; create a ULP header queue for the TxHQE; generate a read response based on mapping the ULP header queue into hardware as the TxHQ, wherein the TxHQE includes a pointer to data from a valid memory region of the second host identified by the memory mapping; and transmit a read response packet with the data identified by the pointer using the TxHQ to the first host.

Claims (54)

1 . A server fabric adapter (SFA) communication system comprising:

a requester SFA communicatively coupled to a first host, the first host comprising a local memory; and

a responder SFA communicatively coupled to a second host, the second host comprising a remote memory;

wherein the requester SFA is configured to:

receive, from the first host, a first packet comprising a read request to read the remote memory of the second host, the first packet including a pointer to a memory mapping at the second host;

receive, from the responder SFA, a second packet comprising a read response and data retrieved from the second host using the memory mapping, wherein a completion queue (CQ) counter associated with a responder receive header queue (RxHQ) of the second host is mapped to a doorbell address of a responder transmit header queue (TxHQ), and the second packet is sent in response to a ringing of a doorbell identified by the doorbell address; and

separate the second packet into the completion queue counter and a receive header queue entry (RxHQE) in a requester RxHQ of the first host, wherein the RxHQE of the first host includes the data retrieved using the memory mapping.

2 . The SFA communication system of claim 1 , wherein a CQ corresponds to the requester RxHQ and indicates the RxHQE where the second packet is stored.

3 . The SFA communication system of claim 1 , prior to receiving the first packet comprising the read request, the requester SFA is further configured to:

receive, from the first host, a communication message for registering the remote memory of the second host;

receive memory mappings of the second host as a response to the communication message; and

transmit the memory mappings of the second host to the first host, wherein the first host mirrors the memory mappings of the second host as its local memory mappings in the first host.

4 . The SFA communication system of claim 1 , wherein the requester SFA is further configured to:

map a payload of the first packet as a transmit header queue entry (TxHQE) in a requester transmit header queue (TxHQ), the TxHQE including the pointer to a scatter gather list (SGL).

5 . The SFA communication system of claim 1 , wherein the requester SFA is further configured to:

receive an interrupt triggered by a CQ associated with the requester RxHQ to examine an entry in the requester RxHQ.

6 . The SFA communication system of claim 1 , wherein the first and second packets are transmitted using a network protocol, and the network protocol includes user datagram protocol (UDP).

7 . The SFA communication system of claim 1 , wherein the responder SFA is configured to:

receive the first packet;

generate the second packet; and

send the second packet to the requester SFA.

8 . The SFA communication system of claim 7 , wherein the responder SFA is further configured to:

create the responder receive header queue (RxHQ) for storing packet headers and the read request included in the first packet; and

create a CQ associated with the responder RxHQ for storing the CQ counter associated with the responder RxHQ.

9 . The SFA communication system of claim 8 , wherein a payload of the first packet includes a requester transmit header queue entry (TxHQE) in a requester TxHQ, and the requester TxHQE includes the pointer, and wherein the notification counter indicates a number of responder RxHQ entries that have been received at the second host and also indicates a number of valid responder TxHQEs.

10 . The SFA communication system of claim 9 , wherein the responder SFA is further configured to:

map the notification counter to the doorbell address, wherein the doorbell identified by the doorbell address indicates that the responder TxHQ is ready to be consumed.

11 . The SFA communication system of claim 7 , wherein the responder SFA is further configured to:

create a CQ associated with the responder TxHQ, wherein the CQ associated with the responder TxHQ indicates that a transmission is completed; and

in response to a transmission being completed, release the memory mapping and corresponding buffers.

12 . The SFA communication system of claim 11 , wherein the responder SFA is further configured to:

communicate with the first host to determine if data retransmission is needed; and

mark a buffer of the second host as invalid before releasing the buffer.

13 . The SFA communication system of claim 11 , wherein the responder SFA is further configured to fire an interrupt when the CQ associated with the responder TxHQ has activity.

14 . The SFA communication system of claim 7 , wherein the responder SFA is further configured to:

control a mapped memory of the second host, wherein the control includes canceling a requested read operation.

15 . A method for one-sided read remote memory access, the method comprising:

receiving, at a requester server fabric adapter (SFA) and from a first host, a first packet comprising a read request to read a remote memory of a second host, the first packet including a pointer to a memory mapping at the second host;

receiving, from a responder SFA associated with the second host, a second packet comprising a read response and data retrieved from the second host using the memory mapping, wherein a completion queue (CQ) counter associated with a responder receive header queue (RxHQ) of the second host is mapped to a doorbell address of a responder transmit header queue (TxHQ), and the second packet is sent in response to a ringing of a doorbell identified by the doorbell address; and

separating, by the requester SFA, the second packet into a completion queue counter and a receive header queue entry (RxHQE) in a requester RxHQ of the first host, wherein the RxHQE of the first host includes the data retrieved using the memory mapping.

16 . The method of claim 15 , further comprising:

receiving, from the first host, a communication message for registering the remote memory of the second host;

receiving memory mappings of the second host as a response to the communication message; and

transmitting the memory mappings of the second host to the first host, wherein the first host mirrors the memory mappings of the second host as its local memory mappings in the first host.

17 . The method of claim 15 , further comprising:

receiving the first packet at the responder SFA, the first packet comprising the read request;

generating the second packet at the responder SFA; and

sending the second packet from the responder SFA to the requester SFA.

18 . The method of claim 17 , further comprising:

creating, by the responder SFA, the responder RxHQ for storing packet headers and the read request included in the first packet; and

creating, by the responder SFA, a CQ associated with the responder RxHQ for storing a notification counter associated with the responder RxHQ.

19 . The method of claim 18 , wherein a payload of the first packet includes a requester transmit header queue entry (TxHQE) in a requester TxHQ, and the requester TxHQE includes the pointer, and wherein the notification counter indicates a number of responder RxHQ entries that have been received at the second host and also indicates a number of valid responder TxHQEs.

20 . The method of claim 19 , further comprising:

mapping the notification counter to the responder TxHQ doorbell address, wherein the doorbell indicates that the responder TxHQ is ready to be consumed.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2025
From: MUKHERJEE, SHRIJEET; NORRIE, THOMAS; CONTAVALLI, CARLO; SINGH, GURJEET; BELAY, ADAM
To: ENFABRICA CORPORATION
Reel/Frame 073124/0509 →
Continuity (2)
Provisional Application 63303340 · Jan 26, 2022
Related Publication 20230239351A1 · Jul 27, 2023
References Cited (205)
US 6594712B1 · Pettey et al. · 2003 [cited by applicant]
US 6667974B1 · Shigeta · 2003 [cited by applicant]
US 7181541B1 · Burton et al. · 2007 [cited by applicant]
US 7191225B1 · Borthakur · 2007 [cited by applicant]
US 7245586B2 · Bitar et al. · 2007 [cited by applicant]
US 7293129B2 · Johnsen et al. · 2007 [cited by applicant]
US 7697422B1 · Arad et al. · 2010 [cited by applicant]
US 7937447B1 · Cohen et al. · 2011 [cited by applicant]
US 8234407B2 · Sugumar et al. · 2012 [cited by applicant]
US 8301717B2 · Deshpande · 2012 [cited by applicant]
US 8719456B2 · Wilkinson · 2014 [cited by applicant]
US 8917734B1 · Brown · 2014 [cited by applicant]
US 9049265B1 · Greenfield et al. · 2015 [cited by applicant]
US 9164702B1 · Nesbit · 2015 [cited by examiner]
US 9275071B2 · O'Hare et al. · 2016 [cited by applicant]
US 9448901B1 · Aslam et al. · 2016 [cited by applicant]
US 9648102B1 · Davis · 2017 [cited by examiner]
US 9684597B1 · Eiriksson · 2017 [cited by applicant]
US 9864519B2 · Meyer et al. · 2018 [cited by applicant]
US 9934152B1 · Bryant et al. · 2018 [cited by applicant]
US 10152428B1 · Alshawabkeh et al. · 2018 [cited by applicant]
US 10169279B2 · Yokoyama · 2019 [cited by applicant]
US 10374945B1 · Dhanabalan et al. · 2019 [cited by applicant]
US 10447767B2 · Baptist et al. · 2019 [cited by applicant]
US 10503658B2 · Basu et al. · 2019 [cited by applicant]
US 10778521B2 · Liguori et al. · 2020 [cited by applicant]
US 10880204B1 · Shalev et al. · 2020 [cited by applicant]
US 10931588B1 · Matthews et al. · 2021 [cited by applicant]
US 10944660B2 · Hurson et al. · 2021 [cited by applicant]
US 11934318B2 · Fan et al. · 2024 [cited by applicant]
US 11947483B2 · Helps et al. · 2024 [cited by applicant]
US 11972292B1 · Fan · 2024 [cited by applicant]
US 20010046212A1 · Nakajima · 2001 [cited by applicant]
US 20020071450A1 · Gasbarro · 2002 [cited by examiner]
US 20020078271A1 · Berry · 2002 [cited by applicant]
US 20020129272A1 · Terrell et al. · 2002 [cited by applicant]
US 20020159385A1 · Susnow et al. · 2002 [cited by applicant]
US 20020184452A1 · Simmons et al. · 2002 [cited by applicant]
US 20020191599A1 · Parthasarathy et al. · 2002 [cited by applicant]
US 20030058875A1 · Arndt et al. · 2003 [cited by applicant]
US 20030154412A1 · Hetzler et al. · 2003 [cited by applicant]
US 20040049603A1 · Boyd et al. · 2004 [cited by applicant]
US 20050068798A1 · Lee et al. · 2005 [cited by applicant]
US 20050080920A1 · Bender et al. · 2005 [cited by applicant]
US 20050089033A1 · Gupta et al. · 2005 [cited by applicant]
US 20050223118A1 · Tucker · 2005 [cited by examiner]
US 20060004941A1 · Shah et al. · 2006 [cited by applicant]
US 20060056308A1 · Gusat et al. · 2006 [cited by applicant]
US 20060056405A1 · Chang et al. · 2006 [cited by applicant]
US 20060059242A1 · Blackmore · 2006 [cited by examiner]
US 20060090014A1 · Wong et al. · 2006 [cited by applicant]
US 20060236063A1 · Hausauer et al. · 2006 [cited by applicant]
US 20060242352A1 · Torudbakken et al. · 2006 [cited by applicant]
US 20060251109A1 · Muller et al. · 2006 [cited by applicant]
US 20060253619A1 · Torudbakken et al. · 2006 [cited by applicant]
US 20060271713A1 · Xie et al. · 2006 [cited by applicant]
US 20070038794A1 · Purcell et al. · 2007 [cited by applicant]
US 20070104102A1 · Opsasnick · 2007 [cited by applicant]
US 20070255802A1 · Aloni et al. · 2007 [cited by applicant]
US 20070283123A1 · Vick et al. · 2007 [cited by applicant]
US 20080031266A1 · Tallet et al. · 2008 [cited by applicant]
US 20080043732A1 · Desai et al. · 2008 [cited by applicant]
US 20080168194A1 · Gregg et al. · 2008 [cited by applicant]
US 20090083392A1 · Wong et al. · 2009 [cited by applicant]
US 20090113143A1 · Domsch et al. · 2009 [cited by applicant]
US 20090172301A1 · Ebersole · 2009 [cited by examiner]
US 20100064070A1 · Yoshimura et al. · 2010 [cited by applicant]
US 20100103837A1 · Jungck et al. · 2010 [cited by applicant]
US 20100161870A1 · Daniel · 2010 [cited by applicant]
US 20100232448A1 · Sugumar et al. · 2010 [cited by applicant]
US 20100312850A1 · Deshpande · 2010 [cited by applicant]
US 20110072204A1 · Chang et al. · 2011 [cited by applicant]
US 20110072234A1 · Chinya et al. · 2011 [cited by applicant]
US 20110268119A1 · Pong et al. · 2011 [cited by applicant]
US 20110271010A1 · Kenchammana et al. · 2011 [cited by applicant]
US 20120166690A1 · Regula · 2012 [cited by applicant]
US 20130024591A1 · Sun · 2013 [cited by applicant]
US 20130031328A1 · Kelleher et al. · 2013 [cited by applicant]
US 20130132536A1 · Zhang et al. · 2013 [cited by applicant]
US 20130318322A1 · Shetty et al. · 2013 [cited by applicant]
US 20140108726A1 · Laurich et al. · 2014 [cited by applicant]
US 20140237156A1 · Regula et al. · 2014 [cited by applicant]
US 20150026286A1 · Sharp · 2015 [cited by examiner]
US 20150082000A1 · Hong et al. · 2015 [cited by applicant]
US 20150089009A1 · Tsirkin et al. · 2015 [cited by applicant]
US 20160070475A1 · Zhang et al. · 2016 [cited by applicant]
US 20160085450A1 · Ahn et al. · 2016 [cited by applicant]
US 20160094553A1 · Azgin et al. · 2016 [cited by applicant]
US 20160162422A1 · Weber · 2016 [cited by applicant]
US 20170097909A1 · Simionescu et al. · 2017 [cited by applicant]
US 20170132148A1 · Liu et al. · 2017 [cited by applicant]
US 20170177520A1 · Kampe et al. · 2017 [cited by applicant]
US 20170177528A1 · Harriman et al. · 2017 [cited by applicant]
US 20170185528A1 · Hansson et al. · 2017 [cited by applicant]
US 20170372088A1 · Zhao et al. · 2017 [cited by applicant]
US 20180004703A1 · Sharma et al. · 2018 [cited by applicant]
US 20180024938A1 · Paltashev et al. · 2018 [cited by applicant]
US 20180046411A1 · Coburn et al. · 2018 [cited by applicant]
US 20180052793A1 · Fang · 2018 [cited by applicant]
US 20180176134A1 · Pignataro et al. · 2018 [cited by applicant]
US 20180191623A1 · Marty · 2018 [cited by examiner]
US 20180198715A1 · Shmilovici et al. · 2018 [cited by applicant]
US 20180241629A1 · Sato et al. · 2018 [cited by applicant]
US 20180359219A1 · Israel et al. · 2018 [cited by applicant]
US 20190102310A1 · Ramrakhyani et al. · 2019 [cited by applicant]
US 20190109793A1 · Dalal · 2019 [cited by applicant]
US 20190116121A1 · Friedman et al. · 2019 [cited by applicant]
US 20190141041A1 · Bhabbur et al. · 2019 [cited by applicant]
US 20190173810A1 · Shpiner et al. · 2019 [cited by applicant]
US 20190188146A1 · Dusanapudi et al. · 2019 [cited by applicant]
US 20190220425A1 · Zemach et al. · 2019 [cited by applicant]
US 20190258415A1 · Imamura · 2019 [cited by applicant]
US 20190305951A1 · Grubin et al. · 2019 [cited by applicant]
US 20190320019A1 · Hamrick, Jr. · 2019 [cited by applicant]
US 20190324917A1 · Cui et al. · 2019 [cited by applicant]
US 20190334828A1 · Fairhurst et al. · 2019 [cited by applicant]
US 20190370173A1 · Boyer et al. · 2019 [cited by applicant]
US 20190379767A1 · Sharma et al. · 2019 [cited by applicant]
US 20190384733A1 · Jen et al. · 2019 [cited by applicant]
US 20200004685A1 · Guim Bernat et al. · 2020 [cited by applicant]
US 20200119753A1 · Chirca et al. · 2020 [cited by applicant]
US 20200159669A1 · Duncan et al. · 2020 [cited by applicant]
US 20200177513A1 · Zhang · 2020 [cited by applicant]
US 20200204489A1 · Pianigiani et al. · 2020 [cited by applicant]
US 20200236052A1 · Srinivasan et al. · 2020 [cited by applicant]
US 20200264985A1 · Lee · 2020 [cited by applicant]
US 20200280518A1 · Lee et al. · 2020 [cited by applicant]
US 20200371955A1 · Goodacre et al. · 2020 [cited by applicant]
US 20200387405A1 · Xiao et al. · 2020 [cited by applicant]
US 20210019069A1 · Sen et al. · 2021 [cited by applicant]
US 20210037107A1 · Klenk et al. · 2021 [cited by applicant]
US 20210075633A1 · Sen et al. · 2021 [cited by applicant]
US 20210083981A1 · Shmilovici et al. · 2021 [cited by applicant]
US 20210132999A1 · Haywood et al. · 2021 [cited by applicant]
US 20210149803A1 · Bernat · 2021 [cited by applicant]
US 20210232312A1 · Prasad et al. · 2021 [cited by applicant]
US 20210234706A1 · Nair et al. · 2021 [cited by applicant]
US 20210297350A1 · Vegesna et al. · 2021 [cited by applicant]
US 20210311643A1 · Shanbhogue et al. · 2021 [cited by applicant]
US 20210318961A1 · Peterson et al. · 2021 [cited by applicant]
US 20210345112A1 · Elliott et al. · 2021 [cited by applicant]
US 20220004512A1 · Cannata et al. · 2022 [cited by applicant]
US 20220060422A1 · Sommers · 2022 [cited by applicant]
US 20220085916A1 · Debbage et al. · 2022 [cited by applicant]
US 20220109587A1 · Sapio et al. · 2022 [cited by applicant]
US 20220197787A1 · Han et al. · 2022 [cited by applicant]
US 20220200906A1 · Ye et al. · 2022 [cited by applicant]
US 20220214912A1 · Julien et al. · 2022 [cited by applicant]
US 20220217085A1 · Sankar et al. · 2022 [cited by applicant]
US 20220222118A1 · Wang et al. · 2022 [cited by applicant]
US 20220248251A1 · Ryu et al. · 2022 [cited by applicant]
US 20220283964A1 · Burstein et al. · 2022 [cited by applicant]
US 20220291875A1 · Diaz-Cuellar et al. · 2022 [cited by applicant]
US 20220394014A1 · Wang et al. · 2022 [cited by applicant]
US 20230038094A1 · Velasco · 2023 [cited by applicant]
US 20230044342A1 · Wilkinson · 2023 [cited by applicant]
US 20230051781A1 · Patel et al. · 2023 [cited by applicant]
US 20230093247A1 · Kumar et al. · 2023 [cited by applicant]
US 20230096451A1 · Johnson et al. · 2023 [cited by applicant]
US 20230254253A1 · Hong et al. · 2023 [cited by applicant]
US 20240028209A1 · Berke et al. · 2024 [cited by applicant]
US 20240098023A1 · Guo · 2024 [cited by applicant]
US 20240296138A1 · Helps et al. · 2024 [cited by applicant]
US 20240311310A1 · Fan et al. · 2024 [cited by applicant]
US 20240414087A1 · Ranjan et al. · 2024 [cited by applicant]
US 20240422100A1 · Helps et al. · 2024 [cited by applicant]
EP 2768188A1 · 2014 [cited by applicant]
EP 3661141A1 · 2020 [cited by applicant]
WO WO2005106693A2 · 2005 [cited by applicant]
WO WO2009120798A2 · 2009 [cited by applicant]
WO WO2020055921A1 · 2020 [cited by applicant]
WO WO2022005322A1 · 2022 [cited by examiner]
WO WO2022108498A1 · 2022 [cited by applicant]
WO WO2022198552A1 · 2022 [cited by applicant]
WO WO2024102915A1 · 2024 [cited by applicant]
Emulex Corporation. “Emulex provides 10Gb Ethernet Virtual Fabric Adapter 5 for New Lenovo Servers.” Business Wire. Dec. 15, 2014 (Dec. 15, 2014) Retrieved on Mar. 7, 2022 (Mar. 7, 2022 from: <https://www.businesswire.c… [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/011491, dated Mar. 24, 2022 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/32841, dated Nov. 21, 2022 (10 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2022/74833, dated Dec. 6, 2022 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/062168, dated May 12, 2023 (54 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/61405, dated Jul. 11, 2023 (6 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/082132, dated Jun. 6, 2024 (8 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/029723, dated Aug. 22, 2024 (14 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2023/029887, dated Oct. 26, 2023 (13 pages). [cited by applicant]
“Using Non-transparent Bridging in PCI Express Systems,” by Jack Regula, Jun. 1, 2004, Jun. 1, 2004, pp. 4-30, XP002686987, U RL:http :/ /www.plxtech.com/files/pdf/technical/expresslane/NontransparentBridging .pdf. [cited by applicant]
U.S. Appl. No. 18/755,372, filed Jun. 26, 224, Transparent Remote Memory Access Over Network Protocol, Thomas Norrie, et al. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/039765, dated Oct. 22, 2024 (15 pages). [cited by applicant]
U.S. Appl. No. 17/570,261, filed Jan. 6, 2022, Server Fabric Adapter for I/O Scaling of Heterogeneous and Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 18/747,118, filed Jun. 18, 2024, Optimally Balanced Network Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 18/778,611, filed Jul. 19, 2024, Server Fabric Adapter for I/O Scaling of Heterogeneous and Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 19/037,768, filed Jan. 27, 2025, Server Fabric Adapter for I/O Scaling of Heterogeneous and Accelerated Compute Systems, Rochan Sankar, et al. [cited by applicant]
U.S. Appl. No. 17/836,532, filed Jun. 9, 2022, Transparent Remote Memory Access Over Network Protocol, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 18/755,372, filed Jun. 26, 2024, Transparent Remote Memory Access Over Network Protocol, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 17/886,026, filed Aug. 11, 2022, System and Method for Congestion Control Using a Flow Level Transmit Mechanism, Shrijeet Mukherjee et al. [cited by applicant]
U.S. Appl. No. 18/107,324, filed Feb. 8, 2023, System and Method for Using Dynamic Thresholds With Route Isolation for Heterogeneous Traffic in Shared Memory Packet Buffers, Ari Aravinthan, et al. [cited by applicant]
U.S. Appl. No. 18/447,180, filed Aug. 9, 2023, System and Method for Ghost Bridging, Thomas Norrie, et al. [cited by applicant]
U.S. Appl. No. 18/666,548, filed May 16, 2024, System and Method for an Optimized Staging Buffer for Broadcast/Multicast Operations, Shrijeet Mukherjee, et al. [cited by applicant]
U.S. Appl. No. 18/526,727, filed Dec. 1, 2023, A Modular Datacenter Interconnection System, David Skirmont, et al. [cited by applicant]
U.S. Appl. No. 18/785,542, filed Jul. 26, 2024, Method and System for Tracking and Moving Pages Within a Memory Hierarchy, Shrijeet Mukhrjee, et al. [cited by applicant]
U.S. Appl. No. 18/920,558, filed Oct. 18, 2024, System and Method for Optimally Balanced Network Multipathing, Shrijeet Mukhrjee, et al. [cited by applicant]
U.S. Appl. No. 19/034,371, filed Jan. 22, 2025, Input/Output System Interconnect Redundancy and Failover, Frederic Vecoven, et al. [cited by applicant]
Sanker, Foundational Fabrics for AI: Introducing the Accelerated Compute Fabric Switch AI Hardware Summit, Sep. 13, 2023. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2024/052073, dated Apr. 28, 2024 (15 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US2025/012514, dated Jul. 30, 2025 (11 pages). [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/US20252/033933, dated Sep. 17, 2025 (11 pages). [cited by applicant]