IP Library Granted Patent US 12,224,906
Granted Patent B2
US 12,224,906 · App. 18/582,794 · Granted Feb 11, 2025

Formation of compute units from converged and disaggregated component pools

Inventors: James Scott Cannata (Denver, CO); Phillip Clark (Boulder, CO); Bryan Nagel (Denver, CO); Henry Lee Harris (Redding, CA); Bryan Schramm (Broomfield, CO); Sumit Puri (Calabasas, CA)
Assignee: Liqid Inc.
H04L41/0893G06F9/5077G06F13/4022H04L41/0803H04L47/10H04L49/35H04L69/08G06F2209/5011G06F2213/0026
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,224,906
App. No.
18/582,794
Filed
Feb 21, 2024
Granted
Feb 11, 2025
Kind
B2
Art Unit
2453
USPC
709/223
Abstract

Deployment of arrangements of computing components coupled over communication fabrics are presented herein. In one example, a method includes forming a compute unit to include at least a selected disaggregated computing component and at least a selected converged computing element. The selected disaggregated computing component is added to the compute unit from a pool of disaggregated computing components having a granularity comprising the disaggregated computing components arbitrarily and separately coupled to a communication fabric. The selected converged computing element is added to the compute unit from a pool of converged computing elements having a granularity comprising sets of computing components with fixed relationships to associated processors.

Claims (43)

1. A method comprising:

in a user interface, receiving user instructions to form a compute unit to include at least a selected disaggregated computing component and at least a selected converged computing element;

wherein the selected disaggregated computing component is added to the compute unit with a granularity of an individual computing component from a pool of disaggregated computing components arbitrarily and individually segregable into logical groupings within a communication fabric; and

wherein the selected converged computing element is added to the compute unit with a granularity having a fixed set of computing components from a pool of converged computing elements comprising sets of computing components having fixed relationships to associated processors.

2. The method of claim 1 , wherein the selected converged computing element is communicatively coupled to an additional communication fabric different from the communication fabric.

3. The method of claim 2 , wherein the communication fabric comprises a first communication fabric type corresponding to communication protocols from at least one among Peripheral Component Interconnect Express (PCIe), Gen-Z, and Compute Express Link (CXL), and wherein the additional communication fabric comprises a second communication fabric type corresponding to at least one among Ethernet, and InfiniBand, and FibreChannel.

4. The method of claim 2 , wherein forming the compute unit comprises establishing one or more logical domains within at least one among the communication fabric and the additional communication fabric that make selected computing components for the compute unit accessible to each other.

5. The method of claim 1 , wherein adding the selected disaggregated computing component into the compute unit comprises individually associating the selected disaggregated computing component into a logical arrangement comprising the compute unit; and

wherein adding the selected converged computing element into the compute unit comprises associating into the logical arrangement a set of computing components having a fixed relationship to an associated processor.

6. The method of claim 1 , wherein the converged computing elements correspond to computing assemblies that each include at least a processing component, a data storage component, and a network interface component that communicatively couples each computing assembly using a network communication protocol; and

wherein the disaggregated computing components correspond to at least individual ones among processing components, data storage components, and network interface components arbitrarily and individually coupled to the communication fabric using a point-to-point communication protocol.

7. The method of claim 1 , comprising:

in the user interface, receiving additional user instructions to deploy software for execution by at least a corresponding processor component of the compute unit.

8. The method of claim 1 , comprising:

in the user interface, receiving additional user instructions to assign network addressing for a network interface component of the selected converged computing element, wherein traffic for the selected converged computing element is directed through the network interface component.

9. The method of claim 1 , further comprising:

performing a discovery process over the communication fabric associated with the selected disaggregated computing component and an additional communication fabric associated with the converged disaggregated computing element to identify first computing components as disaggregated computing components and identify second computing components as converged computing components; and

for the converged computing components, determining ones among the converged computing components that share a chassis as the sets of computing components;

maintaining one or more data structures which indicates a communication fabric type for each of the first computing components and each of the second computing components and indicates the sets of computing components that share corresponding chassis.

10. The method of claim 1 , wherein the pool of disaggregated computing components and the pool of converged computing elements each include one or more among graphics processing units (GPUs), central processing units (CPUs), network interface cards (NICs), field-programmable gate arrays (FPGAs), data storage devices, and memory devices.

11. An apparatus, comprising:

one or more computer readable storage media; and

program instructions stored on the one or more computer readable storage media, the program instructions executable by a processing system to direct the processing system to at least:

a user interface configured to receive user instructions to form a compute unit to include at least a selected disaggregated computing component and at least a selected converged computing element;

wherein the selected disaggregated computing component is added to the compute unit with a granularity of an individual computing component from a pool of disaggregated computing components arbitrarily and individually segregable into logical groupings within a communication fabric; and

wherein the selected converged computing element is added to the compute unit with a granularity having a fixed set of computing components from a pool of converged computing elements comprising sets of computing components having fixed relationships to associated processors.

12. The apparatus of claim 11 , wherein the selected converged computing element is communicatively coupled to an additional communication fabric different from the communication fabric.

13. The apparatus of claim 12 , wherein the communication fabric comprises a first communication fabric type corresponding to communication protocols from at least one among Peripheral Component Interconnect Express (PCIe), Gen-Z, and Compute Express Link (CXL), and wherein the additional communication fabric comprises a second communication fabric type corresponding to at least one among Ethernet, and InfiniBand, and FibreChannel.

14. The apparatus of claim 12 , wherein forming the compute unit comprises establishing one or more logical domains within at least one among the communication fabric and the additional communication fabric that make selected computing components for the compute unit accessible to each other.

15. The apparatus of claim 11 , comprising program instructions stored on the one or more computer readable storage media, the program instructions executable by the processing system to direct the processing system to at least:

the user interface configured to receive the user instructions to add the selected disaggregated computing component into the compute unit by at least individually associating the selected disaggregated computing component into a logical arrangement comprising the compute unit; and

the user interface configured to receive the user instructions to add the selected converged computing element into the compute unit by at least associating into the logical arrangement a set of computing components having a fixed relationship to an associated processor.

16. The apparatus of claim 11 , wherein the converged computing elements correspond to computing assemblies that each include at least a processing component, a data storage component, and a network interface component that communicatively couples each computing assembly using a network communication protocol; and

wherein the disaggregated computing components correspond to at least individual ones among processing components, data storage components, and network interface components arbitrarily and individually coupled to the communication fabric using a point-to-point communication protocol.

17. The apparatus of claim 11 , comprising program instructions stored on the one or more computer readable storage media, the program instructions executable by the processing system to direct the processing system to at least:

the user interface configured to receive additional user instructions to deploy software for execution by at least a corresponding processor component of the compute unit.

18. The apparatus of claim 11 , comprising program instructions stored on the one or more computer readable storage media, the program instructions executable by the processing system to direct the processing system to at least:

the user interface configured to receive additional user instructions to assign network addressing for a network interface component of the selected converged computing element, wherein traffic for the selected converged computing element is directed through the network interface component.

19. The apparatus of claim 11 , comprising program instructions stored on the one or more computer readable storage media, the program instructions executable by the processing system to direct the processing system to at least:

perform a discovery process over the communication fabric associated with the selected disaggregated computing component and an additional communication fabric associated with the converged disaggregated computing element to identify first computing components as disaggregated computing components and identify second computing components as converged computing components; and

for the converged computing components, determine ones among the converged computing components that share a chassis as the sets of computing components;

maintain one or more data structures which indicates a communication fabric type for each of the first computing components and each of the second computing components and indicates the sets of computing components that share corresponding chassis.

20. The apparatus of claim 11 , wherein the pool of disaggregated computing components and the pool of converged computing elements each include one or more among graphics processing units (GPUs), central processing units (CPUs), network interface cards (NICs), field-programmable gate arrays (FPGAs), data storage devices, and memory devices.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2024
From: CANNATA, JAMES SCOTT; CLARK, PHILLIP; NAGEL, BRYAN; HARRIS, HENRY LEE; SCHRAMM, BRYAN; PURI, SUMIT
To: LIQID INC.
Reel/Frame 066510/0137 →
Continuity (5)
Continuation 17578874 · Jan 19, 2022
Continuation 16858045 · Apr 24, 2020
Provisional Application 62934703 · Nov 13, 2019
Provisional Application 62838504 · Apr 25, 2019
Related Publication 20240195693A1 · Jun 13, 2024
References Cited (155)
US 652266A · Herr · 1900 [cited by applicant]
US 678579A · Mauk · 1901 [cited by applicant]
US 685261A · Crane · 1901 [cited by applicant]
US 5828207A · Saadeh · 1998 [cited by applicant]
US 6061750A · Beardsley et al. · 2000 [cited by applicant]
US 6208345B1 · Sheard et al. · 2001 [cited by applicant]
US 6325636B1 · Hipp et al. · 2001 [cited by applicant]
US 7243145B1 · Poortman · 2007 [cited by applicant]
US 7260487B2 · Brey et al. · 2007 [cited by applicant]
US 7340578B1 · Khanzode · 2008 [cited by applicant]
US 7505889B2 · Salmonsen et al. · 2009 [cited by applicant]
US 7606960B2 · Munguia · 2009 [cited by applicant]
US 7685261B1 · Scammell et al. · 2010 [cited by applicant]
US 7725757B2 · Padweka et al. · 2010 [cited by applicant]
US 7877542B2 · Chow et al. · 2011 [cited by applicant]
US 8125919B1 · Khanka et al. · 2012 [cited by applicant]
US 8150800B2 · Webman et al. · 2012 [cited by applicant]
US 8656117B1 · Wong et al. · 2014 [cited by applicant]
US 8688926B2 · Breakstone et al. · 2014 [cited by applicant]
US 8880771B2 · Subramaniyan et al. · 2014 [cited by applicant]
US 9223634B2 · Chang et al. · 2015 [cited by applicant]
US 9270489B1 · Wells et al. · 2016 [cited by applicant]
US 9602437B1 · Bernath · 2017 [cited by applicant]
US 9891984B1 · Hayward · 2018 [cited by applicant]
US 10372362B2 · Guim Bernat et al. · 2019 [cited by applicant]
US 10382279B2 · Roese et al. · 2019 [cited by applicant]
US 10536349B1 · Hayward · 2020 [cited by applicant]
US 10652266B1 · Tautschnig et al. · 2020 [cited by applicant]
US 10678579B2 · Rivera et al. · 2020 [cited by applicant]
US 10999403B2 · Watt et al. · 2021 [cited by applicant]
US 11210133B1 · Barker et al. · 2021 [cited by applicant]
US 11281498B1 · Kinney et al. · 2022 [cited by applicant]
US 11949559B2 · Cannata · 2024 [cited by examiner]
US 11973650B2 · Cannata · 2024 [cited by examiner]
US 20020059428A1 · Susai et al. · 2002 [cited by applicant]
US 20030110423A1 · Helms et al. · 2003 [cited by applicant]
US 20030126478A1 · Burns et al. · 2003 [cited by applicant]
US 20050188191A1 · Yoshida et al. · 2005 [cited by applicant]
US 20050223136A1 · Tanaka et al. · 2005 [cited by applicant]
US 20060259810A1 · Hosoya et al. · 2006 [cited by applicant]
US 20060277206A1 · Bailey et al. · 2006 [cited by applicant]
US 20070067432A1 · Tarui et al. · 2007 [cited by applicant]
US 20070067481A1 · Sharma et al. · 2007 [cited by applicant]
US 20080034153A1 · Lee et al. · 2008 [cited by applicant]
US 20080123559A1 · Haviv et al. · 2008 [cited by applicant]
US 20080155100A1 · Ahmed et al. · 2008 [cited by applicant]
US 20080198744A1 · Menth · 2008 [cited by applicant]
US 20080281938A1 · Rai et al. · 2008 [cited by applicant]
US 20080320121A1 · Altaf et al. · 2008 [cited by applicant]
US 20090006837A1 · Rothman et al. · 2009 [cited by applicant]
US 20090100280A1 · Lindsay · 2009 [cited by applicant]
US 20090132699A1 · Sharma et al. · 2009 [cited by applicant]
US 20090190427A1 · Brittain et al. · 2009 [cited by applicant]
US 20090193201A1 · Brittain et al. · 2009 [cited by applicant]
US 20090193203A1 · Brittain et al. · 2009 [cited by applicant]
US 20090276551A1 · Brown et al. · 2009 [cited by applicant]
US 20090276773A1 · Brown et al. · 2009 [cited by applicant]
US 20100049851A1 · Garrison et al. · 2010 [cited by applicant]
US 20100088467A1 · Lee et al. · 2010 [cited by applicant]
US 20100100655A1 · Dowedeit · 2010 [cited by applicant]
US 20100138768A1 · Lonkar et al. · 2010 [cited by applicant]
US 20100153965A1 · Arimilli et al. · 2010 [cited by applicant]
US 20110119423A1 · Kishore et al. · 2011 [cited by applicant]
US 20110154101A1 · Van Der Merwe et al. · 2011 [cited by applicant]
US 20110289510A1 · Lin et al. · 2011 [cited by applicant]
US 20110299317A1 · Shaeffer et al. · 2011 [cited by applicant]
US 20110302349A1 · Griggs · 2011 [cited by applicant]
US 20110320861A1 · Bayer et al. · 2011 [cited by applicant]
US 20120030544A1 · Fisher-Jeffes · 2012 [cited by applicant]
US 20120089854A1 · Breakstone et al. · 2012 [cited by applicant]
US 20120151118A1 · Flynn et al. · 2012 [cited by applicant]
US 20120166699A1 · Kumar et al. · 2012 [cited by applicant]
US 20120210163A1 · Cho · 2012 [cited by applicant]
US 20120254597A1 · Delling et al. · 2012 [cited by applicant]
US 20120311154A1 · Morgan · 2012 [cited by applicant]
US 20120317433A1 · Ellis et al. · 2012 [cited by applicant]
US 20130132643A1 · Huang · 2013 [cited by applicant]
US 20130159910A1 · Bostic et al. · 2013 [cited by applicant]
US 20130185416A1 · Larkin et al. · 2013 [cited by applicant]
US 20130204933A1 · Cardona et al. · 2013 [cited by applicant]
US 20130223438A1 · Tripathi et al. · 2013 [cited by applicant]
US 20130291052A1 · Hadar · 2013 [cited by applicant]
US 20130297845A1 · Ziakas et al. · 2013 [cited by applicant]
US 20130346994A1 · Chen et al. · 2013 [cited by applicant]
US 20140047166A1 · Asnaashari et al. · 2014 [cited by applicant]
US 20140056319A1 · Hellwig · 2014 [cited by applicant]
US 20140059265A1 · Iyer et al. · 2014 [cited by applicant]
US 20140075235A1 · Chandhoke et al. · 2014 [cited by applicant]
US 20140103955A1 · Avritch et al. · 2014 [cited by applicant]
US 20140108846A1 · Berke et al. · 2014 [cited by applicant]
US 20140181825A1 · He et al. · 2014 [cited by applicant]
US 20140365714A1 · Sweere et al. · 2014 [cited by applicant]
US 20150026385A1 · Egi et al. · 2015 [cited by applicant]
US 20150052282A1 · Dong · 2015 [cited by applicant]
US 20150074322A1 · Galles · 2015 [cited by applicant]
US 20150103826A1 · Davis · 2015 [cited by applicant]
US 20150120479A1 · Bastien et al. · 2015 [cited by applicant]
US 20150121115A1 · Chandra et al. · 2015 [cited by applicant]
US 20150128245A1 · Brown et al. · 2015 [cited by applicant]
US 20150186437A1 · Molaro · 2015 [cited by applicant]
US 20150212755A1 · Asnaashari · 2015 [cited by applicant]
US 20150254088A1 · Chou et al. · 2015 [cited by applicant]
US 20150271010A1 · Shetty et al. · 2015 [cited by applicant]
US 20150304423A1 · Satoyama et al. · 2015 [cited by applicant]
US 20150373115A1 · Breakstone et al. · 2015 [cited by applicant]
US 20160188365A1 · Bodas et al. · 2016 [cited by applicant]
US 20160197996A1 · Barton et al. · 2016 [cited by applicant]
US 20160248631A1 · Duchesneau · 2016 [cited by applicant]
US 20170054603A1 · Kulkarni et al. · 2017 [cited by applicant]
US 20170118115A1 · Tsuji · 2017 [cited by applicant]
US 20170255584A1 · Oh · 2017 [cited by applicant]
US 20180004703A1 · Sharma et al. · 2018 [cited by applicant]
US 20180034908A1 · Li · 2018 [cited by applicant]
US 20180046338A1 · Breakstone et al. · 2018 [cited by applicant]
US 20180046509A1 · Arata et al. · 2018 [cited by applicant]
US 20180046514A1 · Breakstone et al. · 2018 [cited by applicant]
US 20180069899A1 · Lang et al. · 2018 [cited by applicant]
US 20180152373A1 · Logue et al. · 2018 [cited by applicant]
US 20180188974A1 · Cayton et al. · 2018 [cited by applicant]
US 20180213369A1 · Dong et al. · 2018 [cited by applicant]
US 20180248949A1 · Siddappa et al. · 2018 [cited by applicant]
US 20180285009A1 · Guim Bernat et al. · 2018 [cited by applicant]
US 20180322081A1 · Breakstone et al. · 2018 [cited by applicant]
US 20180341619A1 · Slik · 2018 [cited by applicant]
US 20190034367A1 · Kakaiya et al. · 2019 [cited by applicant]
US 20190050261A1 · Schmisseur et al. · 2019 [cited by applicant]
US 20190108158A1 · Kachare et al. · 2019 [cited by applicant]
US 20190324820A1 · Krishnan et al. · 2019 [cited by applicant]
US 20200028800A1 · Strathman et al. · 2020 [cited by applicant]
US 20200067769A1 · Dixon et al. · 2020 [cited by applicant]
US 20200133876A1 · Bielski et al. · 2020 [cited by applicant]
US 20200174838A1 · Li et al. · 2020 [cited by applicant]
US 20200218678A1 · Prabhakar et al. · 2020 [cited by applicant]
US 20200241926A1 · Guim Bernat · 2020 [cited by applicant]
US 20200250787A1 · Cheng et al. · 2020 [cited by applicant]
US 20200341930A1 · Cannata et al. · 2020 [cited by applicant]
US 20200344125A1 · Cannata et al. · 2020 [cited by applicant]
JP 2004046372A · 2004 [cited by applicant]
WO 02065322A1 · 2002 [cited by applicant]
WO 2007146368A2 · 2007 [cited by applicant]
WO 2016196766A2 · 2016 [cited by applicant]
Aragon, Juan L. et al., “Control Speculation for Energy-Efficient Next-Generation Superscalar Processors,” IEEE Transactions on Computers, vol. 55, No. 3, pp. 281-291, Mar. 2006. [cited by applicant]
Extended European Search Report for EP Application No. 20794234.3, mailed Jan. 2, 2023; 14 pages. [cited by applicant]
Extended European Search Report for EP Application No. 20794977.7, mailed Nov. 18, 2022; 18 pages. [cited by applicant]
Extended European Search Report for EP Application No. 20795595.6, mailed Nov. 16, 2022; 11 pages. [cited by applicant]
Extended European Search Report for EP Application No. 20796151.7, mailed Dec. 19, 2022; 9 pages. [cited by applicant]
International Application No. PCT/US2017/046602, International Search Report & Written Opinion, 8 pages, Oct. 19, 2017. [cited by applicant]
International Application No. PCT/US2017/046607, International Search Report & Written Opinion, 7 pages, Oct. 23, 2017. [cited by applicant]
International Application No. PCT/US2020/029709, International Search Report & Written Opinion, 14 pages, Jul. 17, 2020. [cited by applicant]
International Application No. PCT/US2020/029716, International Search Report & Written Opinion, 14 pages, Jul. 2, 2020. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2022/016993 which was filed Feb. 18, 2022; mailed Jun. 28, 2022; 9 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2021/058947, filed Nov. 11, 2021; mailed Feb. 9, 2022; 11 pages. [cited by applicant]
Lu, Yingping et al., “Performance Study of iSCSI-Based Storage Subsystems,” IEEE Communications Magazine, pp. 76-82, Aug. 2003. [cited by applicant]
Mehta et al.; “A model-driven approach to job/task compositions in cluster computing;” 2007 IEEE International Parallel and Distributed Processing Symposium, IEEE, 2007, Mar. 26, 2007 (Abstract). [cited by applicant]
Extended European Search Report for EP Application No. 21904088.8, mailed Mar. 13, 2024; 12 pages. [cited by applicant]
Cited By (1)
US 12,579,006