US20190052457A1 - Technologies for providing efficient sharing of encrypted data in a disaggregated architecture - Google Patents

Technologies for providing efficient sharing of encrypted data in a disaggregated architecture Download PDF

Info

Publication number
US20190052457A1
US20190052457A1 US15/941,114 US201815941114A US2019052457A1 US 20190052457 A1 US20190052457 A1 US 20190052457A1 US 201815941114 A US201815941114 A US 201815941114A US 2019052457 A1 US2019052457 A1 US 2019052457A1
Authority
US
United States
Prior art keywords
sled
data
data set
memory
request
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US15/941,114
Inventor
Patrick Connor
Scott Dubal
Andrew J. Herdrich
James R. Hearn
Kapil Sood
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intel Corp
Original Assignee
Intel Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intel Corp filed Critical Intel Corp
Priority to US15/941,114 priority Critical patent/US20190052457A1/en
Assigned to INTEL CORPORATION reassignment INTEL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SOOD, KAPIL, CONNOR, PATRICK, DUBAL, SCOTT, HEARN, JAMES, HERDRICH, ANDREW J.
Publication of US20190052457A1 publication Critical patent/US20190052457A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/18Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3003Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/3006Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3442Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for planning or managing the needed capacity
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/34Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3466Performance evaluation by tracing or monitoring
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/0223User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023Free address space management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/06Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/06Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
    • G06F12/0607Interleaved addressing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/14Protection against unauthorised use of memory or access to memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • G06F13/1605Handling requests for interconnection or transfer for access to memory bus based on arbitration
    • G06F13/1652Handling requests for interconnection or transfer for access to memory bus based on arbitration in a multiprocessor architecture
    • G06F13/1663Access to shared memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • G06F13/1668Details of memory controller
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/38Information transfer, e.g. on bus
    • G06F13/40Bus structure
    • G06F13/4063Device-to-bus coupling
    • G06F13/4068Electrical coupling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/38Information transfer, e.g. on bus
    • G06F13/42Bus transfer protocol, e.g. handshake; Synchronisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/161Computing infrastructure, e.g. computer clusters, blade chassis or hardware partitioning
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17306Intercommunication techniques
    • G06F15/17331Distributed shared memory [DSM], e.g. remote direct memory access [RDMA]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7867Architectures of general purpose stored program computers comprising a single central processing unit with reconfigurable architecture
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/11File system administration, e.g. details of archiving or snapshots
    • G06F16/119Details of migration of file systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/221Column-oriented storage; Management thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2237Vectors, bitmaps or matrices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2282Tablespace storage structures; Management thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2365Ensuring data consistency and integrity
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2453Query optimisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24553Query execution of query operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/248Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25Integrating or interfacing systems involving database management systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9014Indexing; Data structures therefor; Storage structures hash tables
    • G06F17/30079
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • G06F3/0605Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061Improving I/O performance
    • G06F3/0611Improving I/O performance in relation to response time
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061Improving I/O performance
    • G06F3/0613Improving I/O performance in relation to throughput
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • G06F3/0631Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • G06F3/0632Configuration or reconfiguration of storage systems by initialisation or re-initialisation of storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/0644Management of space entities, e.g. partitions, extents, pools
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0647Migration mechanisms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/065Replication mechanisms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0659Command handling arrangements, e.g. command buffers, queues, command scheduling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0662Virtualisation aspects
    • G06F3/0665Virtualisation aspects at area level, e.g. provisioning of virtual or logical volumes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0673Single storage device
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0685Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/30Circuit design
    • G06F30/34Circuit design for reconfigurable circuits, e.g. field programmable gate arrays [FPGA] or programmable logic devices [PLD]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/22Microcontrol or microprogram arrangements
    • G06F9/28Enhancement of operational speed, e.g. by using several microcontrol devices operating in parallel
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/4401Bootstrapping
    • G06F9/4406Loading of operating system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/4401Bootstrapping
    • G06F9/4411Configuring for operating with peripheral devices; Loading of device drivers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/448Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4494Execution paradigms, e.g. implementations of programming paradigms data driven
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022Mechanisms to release resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083Techniques for rebalancing the load in a distributed system
    • G06F9/5088Techniques for rebalancing the load in a distributed system involving task migration
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C29/00Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/02Detection or location of defective auxiliary circuits, e.g. defective refresh counters
    • G11C29/028Detection or location of defective auxiliary circuits, e.g. defective refresh counters with adaption or trimming of parameters
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C29/00Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/04Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
    • G11C29/08Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
    • G11C29/12Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
    • G11C29/36Data generation devices, e.g. data inverters
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C29/00Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/04Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
    • G11C29/08Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
    • G11C29/12Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
    • G11C29/38Response verification devices
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C29/00Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/04Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
    • G11C29/08Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
    • G11C29/12Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
    • G11C29/44Indication or identification of errors, e.g. for repair
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C8/00Arrangements for selecting an address in a digital store
    • G11C8/12Group selection circuits, e.g. for memory block selection, chip selection, array selection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/02Standardisation; Integration
    • H04L41/0213Standardised network management protocols, e.g. simple network management protocol [SNMP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0677Localisation of faults
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • H04L41/0813Configuration setting characterised by the conditions triggering a change of settings
    • H04L41/0816Configuration setting characterised by the conditions triggering a change of settings the condition being an adaptation, e.g. in response to network events
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0893Assignment of logical groups to network elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0896Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003Managing SLA; Interaction between SLA and QoS
    • H04L41/5019Ensuring fulfilment of SLA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003Managing SLA; Interaction between SLA and QoS
    • H04L41/5019Ensuring fulfilment of SLA
    • H04L41/5025Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/06Generation of reports
    • H04L43/065Generation of reports related to network devices
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/28Routing or path finding of packets in data switching networks using route fault recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/745Address table lookup; Address filtering
    • H04L45/7453Address table lookup; Address filtering using hashing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/11Identifying congestion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/78Architectures of resource allocation
    • H04L47/781Centralised allocation of resources
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/83Admission control; Resource allocation based on usage prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/35Switches specially adapted for specific applications
    • H04L49/351Switches specially adapted for specific applications for local area network [LAN], e.g. Ethernet switches
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/9005Buffering arrangements using dynamic buffer space allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004Server selection for load balancing
    • H04L67/1008Server selection for load balancing based on parameters of servers, e.g. available memory or workload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/12Protocol engines
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22Parsing or analysis of headers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/321Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0894Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/0001Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005Switch and router aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/0001Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062Network aspects
    • HELECTRICITY
    • H05ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
    • H05KPRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
    • H05K7/00Constructional details common to different types of electric apparatus
    • H05K7/14Mounting supporting structure in casing or on frame or rack
    • H05K7/1485Servers; Data center rooms, e.g. 19-inch computer racks
    • H05K7/1488Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures
    • H05K7/1489Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures characterized by the mounting of blades therein, e.g. brackets, rails, trays
    • HELECTRICITY
    • H05ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
    • H05KPRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
    • H05K7/00Constructional details common to different types of electric apparatus
    • H05K7/14Mounting supporting structure in casing or on frame or rack
    • H05K7/1485Servers; Data center rooms, e.g. 19-inch computer racks
    • H05K7/1498Resource management, Optimisation arrangements, e.g. configuration, identification, tracking, physical location
    • HELECTRICITY
    • H05ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
    • H05KPRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
    • H05K7/00Constructional details common to different types of electric apparatus
    • H05K7/18Construction of rack or frame
    • HELECTRICITY
    • H05ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
    • H05KPRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
    • H05K7/00Constructional details common to different types of electric apparatus
    • H05K7/20Modifications to facilitate cooling, ventilating, or heating
    • H05K7/20009Modifications to facilitate cooling, ventilating, or heating using a gaseous coolant in electronic enclosures
    • H05K7/20209Thermal management, e.g. fan control
    • HELECTRICITY
    • H05ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
    • H05KPRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
    • H05K7/00Constructional details common to different types of electric apparatus
    • H05K7/20Modifications to facilitate cooling, ventilating, or heating
    • H05K7/20709Modifications to facilitate cooling, ventilating, or heating for server racks or cabinets; for data centers, e.g. 19-inch computer racks
    • H05K7/20718Forced ventilation of a gaseous coolant
    • H05K7/20736Forced ventilation of a gaseous coolant within cabinets for removing heat from server blades
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10Address translation
    • G06F12/1027Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
    • G06F12/1045Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
    • G06F12/1054Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache the data cache being concurrently physically addressed
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/10Address translation
    • G06F12/1027Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
    • G06F12/1045Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
    • G06F12/1063Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache the data cache being concurrently virtually addressed
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/38Information transfer, e.g. on bus
    • G06F13/40Bus structure
    • G06F13/4004Coupling between buses
    • G06F13/4022Coupling between buses using switching circuits, e.g. switching matrix, connection or expansion network
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163Interprocessor communication
    • G06F15/173Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/1735Network adapters, e.g. SCI, Myrinet
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G06F21/105Arrangements for software license management or administration, e.g. for managing licenses at corporate level
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2200/00Indexing scheme relating to G06F1/04 - G06F1/32
    • G06F2200/20Indexing scheme relating to G06F1/20
    • G06F2200/201Cooling arrangements using cooling fluid
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/85Active fault masking without idle spares
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/86Event-based monitoring
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/885Monitoring specific for caches
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5019Workload prediction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/509Offload
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10Providing a specific technical effect
    • G06F2212/1041Resource optimization
    • G06F2212/1044Space efficiency improvement
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10Providing a specific technical effect
    • G06F2212/1052Security improvement
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/60Details of cache memory
    • G06F2212/601Reconfiguration of cache memory
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2213/00Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F2213/0026PCI express
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2213/00Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F2213/0064Latency reduction in handling transfers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2213/00Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F2213/38Universal adapter
    • G06F2213/3808Network interface controller
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/4401Bootstrapping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/485Task life-cycle, e.g. stopping, restarting, resuming execution
    • G06F9/4856Task life-cycle, e.g. stopping, restarting, resuming execution resumption being on a different machine, e.g. task migration, virtual machine migration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5044Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering hardware capabilities
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5055Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering software capabilities, i.e. software resources associated or available to the machine
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/06Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons
    • G06N3/063Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons using electronic means
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0283Price estimation or determination
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04Network management architectures or arrangements
    • H04L41/044Network management architectures or arrangements comprising hierarchical management structures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0895Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/142Network analysis or design using statistical or mathematical methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/149Network analysis or design for prediction of maintenance
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/16Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/34Signalling channels for network management communication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/40Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/16Threshold monitoring
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/20Arrangements for monitoring or testing data switching networks the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/40Constructional details, e.g. power supply, mechanical construction or backplane
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • VMs virtual machines
  • the applications in operation, may access data from numerous sources during the performance of various functions (e.g., convolution operations, data compression or decompression operations, packet inspection operations, etc.).
  • functions e.g., convolution operations, data compression or decompression operations, packet inspection operations, etc.
  • the data is encrypted on a per-VM or per-tenant basis to secure the data from being accessed maliciously by other users of the data center.
  • the copy operation may incur significant overhead, including additional time, memory, and compute resources for decrypting the data used by one VM, performing a bit-for-bit transfer of the data to another memory location used by another VM, and re-encrypting the data for use by the other VM.
  • FIG. 1 is a simplified diagram of at least one embodiment of a data center for executing workloads with disaggregated resources
  • FIG. 2 is a simplified diagram of at least one embodiment of a pod that may be included in the data center of FIG. 1 ;
  • FIG. 3 is a perspective view of at least one embodiment of a rack that may be included in the pod of FIG. 2 ;
  • FIG. 4 is a side elevation view of the rack of FIG. 3 ;
  • FIG. 5 is a perspective view of the rack of FIG. 3 having a sled mounted therein;
  • FIG. 6 is a is a simplified block diagram of at least one embodiment of a top side of the sled of FIG. 5 ;
  • FIG. 7 is a simplified block diagram of at least one embodiment of a bottom side of the sled of FIG. 6 ;
  • FIG. 8 is a simplified block diagram of at least one embodiment of a compute sled usable in the data center of FIG. 1 ;
  • FIG. 9 is a top perspective view of at least one embodiment of the compute sled of FIG. 8 ;
  • FIG. 10 is a simplified block diagram of at least one embodiment of an accelerator sled usable in the data center of FIG. 1 ;
  • FIG. 11 is a top perspective view of at least one embodiment of the accelerator sled of FIG. 10 ;
  • FIG. 12 is a simplified block diagram of at least one embodiment of a storage sled usable in the data center of FIG. 1 ;
  • FIG. 13 is a top perspective view of at least one embodiment of the storage sled of FIG. 12 ;
  • FIG. 14 is a simplified block diagram of at least one embodiment of a memory sled usable in the data center of FIG. 1 ;
  • FIG. 15 is a simplified block diagram of a system that may be established within the data center of FIG. 1 to execute workloads with managed nodes composed of disaggregated resources;
  • FIG. 16 is a simplified block diagram of at least one embodiment of a system for providing efficient sharing of encrypted data in a disaggregated architecture.
  • FIGS. 17-20 are a simplified block diagram of at least one embodiment of a method for providing efficient sharing of encrypted data that may be performed by a memory sled of FIG. 16 .
  • references in the specification to “one embodiment,” “an embodiment,” “an illustrative embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may or may not necessarily include that particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to effect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
  • items included in a list in the form of “at least one A, B, and C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C).
  • items listed in the form of “at least one of A, B, or C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C).
  • the disclosed embodiments may be implemented, in some cases, in hardware, firmware, software, or any combination thereof.
  • the disclosed embodiments may also be implemented as instructions carried by or stored on a transitory or non-transitory machine-readable (e.g., computer-readable) storage medium, which may be read and executed by one or more processors.
  • a machine-readable storage medium may be embodied as any storage device, mechanism, or other physical structure for storing or transmitting information in a form readable by a machine (e.g., a volatile or non-volatile memory, a media disc, or other media device).
  • a data center 100 in which disaggregated resources may cooperatively execute one or more workloads includes multiple pods 110 , 120 , 130 , 140 , each of which includes one or more rows of racks.
  • workloads e.g., applications on behalf of customers
  • each rack houses multiple sleds, each of which may be primarily equipped with a particular type of resource (e.g., memory devices, data storage devices, accelerator devices, general purpose processors), i.e., resources that can be logically coupled to form a composed node, which can act as, for example, a server.
  • resource e.g., memory devices, data storage devices, accelerator devices, general purpose processors
  • the sleds in each pod 110 , 120 , 130 , 140 are connected to multiple pod switches (e.g., switches that route data communications to and from sleds within the pod).
  • the pod switches connect with spine switches 150 that switch communications among pods (e.g., the pods 110 , 120 , 130 , 140 ) in the data center 100 .
  • the sleds may be connected with a fabric using Intel Omni-Path technology. In other embodiments, the sleds may be connected with other fabrics, such as InfiniBand or Ethernet.
  • resources within sleds in the data center 100 may be allocated to a group (referred to herein as a “managed node”) containing resources from one or more sleds to be collectively utilized in the execution of a workload.
  • the workload can execute as if the resources belonging to the managed node were located on the same sled.
  • the resources in a managed node may belong to sleds belonging to different racks, and even to different pods 110 , 120 , 130 , 140 .
  • some resources of a single sled may be allocated to one managed node while other resources of the same sled are allocated to a different managed node (e.g., one processor assigned to one managed node and another processor of the same sled assigned to a different managed node).
  • a data center comprising disaggregated resources can be used in a wide variety of contexts, such as enterprise, government, cloud service provider, and communications service provider (e.g., Telco's), as well in a wide variety of sizes, from cloud service provider mega-data centers that consume over 100,000 sq. ft. to single- or multi-rack installations for use in base stations.
  • contexts such as enterprise, government, cloud service provider, and communications service provider (e.g., Telco's)
  • Telco's communications service provider
  • the disaggregation of resources to sleds comprised predominantly of a single type of resource e.g., compute sleds comprising primarily compute resources, memory sleds containing primarily memory resources
  • the selective allocation and deallocation of the disaggregated resources to form a managed node assigned to execute a workload improves the operation and resource usage of the data center 100 relative to typical data centers comprised of hyperconverged servers containing compute, memory, storage and perhaps additional resources in a single chassis.
  • resources of a given type can be upgraded independently of other resources.
  • different resources types typically have different refresh rates, greater resource utilization and reduced total cost of ownership may be achieved.
  • a data center operator can upgrade the processors throughout their facility by only swapping out the compute sleds.
  • accelerator and storage resources may not be contemporaneously upgraded and, rather, may be allowed to continue operating until those resources are scheduled for their own refresh.
  • Resource utilization may also increase. For example, if managed nodes are composed based on requirements of the workloads that will be running on them, resources within a node are more likely to be fully utilized. Such utilization may allow for more managed nodes to run in a data center with a given set of resources, or for a data center expected to run a given set of workloads, to be built using fewer resources.
  • the pod 110 in the illustrative embodiment, includes a set of rows 200 , 210 , 220 , 230 of racks 240 .
  • Each rack 240 may house multiple sleds (e.g., sixteen sleds) and provide power and data connections to the housed sleds, as described in more detail herein.
  • the racks in each row 200 , 210 , 220 , 230 are connected to multiple pod switches 250 , 260 .
  • the pod switch 250 includes a set of ports 252 to which the sleds of the racks of the pod 110 are connected and another set of ports 254 that connect the pod 110 to the spine switches 150 to provide connectivity to other pods in the data center 100 .
  • the pod switch 260 includes a set of ports 262 to which the sleds of the racks of the pod 110 are connected and a set of ports 264 that connect the pod 110 to the spine switches 150 . As such, the use of the pair of switches 250 , 260 provides an amount of redundancy to the pod 110 .
  • the switches 150 , 250 , 260 may be embodied as dual-mode optical switches, capable of routing both Ethernet protocol communications carrying Internet Protocol (IP) packets and communications according to a second, high-performance link-layer protocol (e.g., Intel's Omni-Path Architecture's, InfiniBand, PCI Express) via optical signaling media of an optical fabric.
  • IP Internet Protocol
  • a second, high-performance link-layer protocol e.g., Intel's Omni-Path Architecture's, InfiniBand, PCI Express
  • each of the other pods 120 , 130 , 140 may be similarly structured as, and have components similar to, the pod 110 shown in and described in regard to FIG. 2 (e.g., each pod may have rows of racks housing multiple sleds as described above).
  • each pod 110 , 120 , 130 , 140 may be connected to a different number of pod switches, providing even more failover capacity.
  • pods may be arranged differently than the rows-of-racks configuration shown in FIGS. 1-2 .
  • a pod may be embodied as multiple sets of racks in which each set of racks is arranged radially, i.e., the racks are equidistant from a center switch.
  • each illustrative rack 240 of the data center 100 includes two elongated support posts 302 , 304 , which are arranged vertically.
  • the elongated support posts 302 , 304 may extend upwardly from a floor of the data center 100 when deployed.
  • the rack 240 also includes one or more horizontal pairs 310 of elongated support arms 312 (identified in FIG. 3 via a dashed ellipse) configured to support a sled of the data center 100 as discussed below.
  • One elongated support arm 312 of the pair of elongated support arms 312 extends outwardly from the elongated support post 302 and the other elongated support arm 312 extends outwardly from the elongated support post 304 .
  • each sled of the data center 100 is embodied as a chassis-less sled. That is, each sled has a chassis-less circuit board substrate on which physical resources (e.g., processors, memory, accelerators, storage, etc.) are mounted as discussed in more detail below.
  • the rack 240 is configured to receive the chassis-less sleds.
  • each pair 310 of elongated support arms 312 defines a sled slot 320 of the rack 240 , which is configured to receive a corresponding chassis-less sled.
  • each illustrative elongated support arm 312 includes a circuit board guide 330 configured to receive the chassis-less circuit board substrate of the sled.
  • Each circuit board guide 330 is secured to, or otherwise mounted to, a top side 332 of the corresponding elongated support arm 312 .
  • each circuit board guide 330 is mounted at a distal end of the corresponding elongated support arm 312 relative to the corresponding elongated support post 302 , 304 .
  • not every circuit board guide 330 may be referenced in each Figure.
  • Each circuit board guide 330 includes an inner wall that defines a circuit board slot 380 configured to receive the chassis-less circuit board substrate of a sled 400 when the sled 400 is received in the corresponding sled slot 320 of the rack 240 .
  • a user aligns the chassis-less circuit board substrate of an illustrative chassis-less sled 400 to a sled slot 320 .
  • the user, or robot may then slide the chassis-less circuit board substrate forward into the sled slot 320 such that each side edge 414 of the chassis-less circuit board substrate is received in a corresponding circuit board slot 380 of the circuit board guides 330 of the pair 310 of elongated support arms 312 that define the corresponding sled slot 320 as shown in FIG. 4 .
  • each type of resource can be upgraded independently of each other and at their own optimized refresh rate.
  • the sleds are configured to blindly mate with power and data communication cables in each rack 240 , enhancing their ability to be quickly removed, upgraded, reinstalled, and/or replaced.
  • the data center 100 may operate (e.g., execute workloads, undergo maintenance and/or upgrades, etc.) without human involvement on the data center floor.
  • a human may facilitate one or more maintenance or upgrade operations in the data center 100 .
  • each circuit board guide 330 is dual sided. That is, each circuit board guide 330 includes an inner wall that defines a circuit board slot 380 on each side of the circuit board guide 330 . In this way, each circuit board guide 330 can support a chassis-less circuit board substrate on either side. As such, a single additional elongated support post may be added to the rack 240 to turn the rack 240 into a two-rack solution that can hold twice as many sled slots 320 as shown in FIG. 3 .
  • the illustrative rack 240 includes seven pairs 310 of elongated support arms 312 that define a corresponding seven sled slots 320 , each configured to receive and support a corresponding sled 400 as discussed above.
  • the rack 240 may include additional or fewer pairs 310 of elongated support arms 312 (i.e., additional or fewer sled slots 320 ). It should be appreciated that because the sled 400 is chassis-less, the sled 400 may have an overall height that is different than typical servers. As such, in some embodiments, the height of each sled slot 320 may be shorter than the height of a typical server (e.g., shorter than a single rank unit, “1 U”).
  • the vertical distance between each pair 310 of elongated support arms 312 may be less than a standard rack unit “1 U.” Additionally, due to the relative decrease in height of the sled slots 320 , the overall height of the rack 240 in some embodiments may be shorter than the height of traditional rack enclosures. For example, in some embodiments, each of the elongated support posts 302 , 304 may have a length of six feet or less. Again, in other embodiments, the rack 240 may have different dimensions. For example, in some embodiments, the vertical distance between each pair 310 of elongated support arms 312 may be greater than a standard rack until “1 U”.
  • the increased vertical distance between the sleds allows for larger heat sinks to be attached to the physical resources and for larger fans to be used (e.g., in the fan array 370 described below) for cooling each sled, which in turn can allow the physical resources to operate at increased power levels.
  • the rack 240 does not include any walls, enclosures, or the like. Rather, the rack 240 is an enclosure-less rack that is opened to the local environment.
  • an end plate may be attached to one of the elongated support posts 302 , 304 in those situations in which the rack 240 forms an end-of-row rack in the data center 100 .
  • each elongated support post 302 , 304 includes an inner wall that defines an inner chamber in which interconnects may be located.
  • the interconnects routed through the elongated support posts 302 , 304 may be embodied as any type of interconnects including, but not limited to, data or communication interconnects to provide communication connections to each sled slot 320 , power interconnects to provide power to each sled slot 320 , and/or other types of interconnects.
  • the rack 240 in the illustrative embodiment, includes a support platform on which a corresponding optical data connector (not shown) is mounted.
  • Each optical data connector is associated with a corresponding sled slot 320 and is configured to mate with an optical data connector of a corresponding sled 400 when the sled 400 is received in the corresponding sled slot 320 .
  • optical connections between components (e.g., sleds, racks, and switches) in the data center 100 are made with a blind mate optical connection.
  • a door on each cable may prevent dust from contaminating the fiber inside the cable.
  • the door is pushed open when the end of the cable approaches or enters the connector mechanism. Subsequently, the optical fiber inside the cable may enter a gel within the connector mechanism and the optical fiber of one cable comes into contact with the optical fiber of another cable within the gel inside the connector mechanism.
  • the illustrative rack 240 also includes a fan array 370 coupled to the cross-support arms of the rack 240 .
  • the fan array 370 includes one or more rows of cooling fans 372 , which are aligned in a horizontal line between the elongated support posts 302 , 304 .
  • the fan array 370 includes a row of cooling fans 372 for each sled slot 320 of the rack 240 .
  • each sled 400 does not include any on-board cooling system in the illustrative embodiment and, as such, the fan array 370 provides cooling for each sled 400 received in the rack 240 .
  • Each rack 240 also includes a power supply associated with each sled slot 320 .
  • Each power supply is secured to one of the elongated support arms 312 of the pair 310 of elongated support arms 312 that define the corresponding sled slot 320 .
  • the rack 240 may include a power supply coupled or secured to each elongated support arm 312 extending from the elongated support post 302 .
  • Each power supply includes a power connector configured to mate with a power connector of the sled 400 when the sled 400 is received in the corresponding sled slot 320 .
  • the sled 400 does not include any on-board power supply and, as such, the power supplies provided in the rack 240 supply power to corresponding sleds 400 when mounted to the rack 240 .
  • Each power supply is configured to satisfy the power requirements for its associated sled, which can vary from sled to sled.
  • the power supplies provided in the rack 240 can operate independent of each other. That is, within a single rack, a first power supply providing power to a compute sled can provide power levels that are different than power levels supplied by a second power supply providing power to an accelerator sled.
  • the power supplies may be controllable at the sled level or rack level, and may be controlled locally by components on the associated sled or remotely, such as by another sled or an orchestrator.
  • each sled 400 in the illustrative embodiment, is configured to be mounted in a corresponding rack 240 of the data center 100 as discussed above.
  • each sled 400 may be optimized or otherwise configured for performing particular tasks, such as compute tasks, acceleration tasks, data storage tasks, etc.
  • the sled 400 may be embodied as a compute sled 800 as discussed below in regard to FIGS. 8-9 , an accelerator sled 1000 as discussed below in regard to FIGS. 10-11 , a storage sled 1200 as discussed below in regard to FIGS. 12-13 , or as a sled optimized or otherwise configured to perform other specialized tasks, such as a memory sled 1400 , discussed below in regard to FIG. 14 .
  • the illustrative sled 400 includes a chassis-less circuit board substrate 602 , which supports various physical resources (e.g., electrical components) mounted thereon.
  • the circuit board substrate 602 is “chassis-less” in that the sled 400 does not include a housing or enclosure. Rather, the chassis-less circuit board substrate 602 is open to the local environment.
  • the chassis-less circuit board substrate 602 may be formed from any material capable of supporting the various electrical components mounted thereon.
  • the chassis-less circuit board substrate 602 is formed from an FR-4 glass-reinforced epoxy laminate material. Of course, other materials may be used to form the chassis-less circuit board substrate 602 in other embodiments.
  • the chassis-less circuit board substrate 602 includes multiple features that improve the thermal cooling characteristics of the various electrical components mounted on the chassis-less circuit board substrate 602 .
  • the chassis-less circuit board substrate 602 does not include a housing or enclosure, which may improve the airflow over the electrical components of the sled 400 by reducing those structures that may inhibit air flow.
  • the chassis-less circuit board substrate 602 is not positioned in an individual housing or enclosure, there is no vertically-arranged backplane (e.g., a backplate of the chassis) attached to the chassis-less circuit board substrate 602 , which could inhibit air flow across the electrical components.
  • the chassis-less circuit board substrate 602 has a geometric shape configured to reduce the length of the airflow path across the electrical components mounted to the chassis-less circuit board substrate 602 .
  • the illustrative chassis-less circuit board substrate 602 has a width 604 that is greater than a depth 606 of the chassis-less circuit board substrate 602 .
  • the chassis-less circuit board substrate 602 has a width of about 21 inches and a depth of about 9 inches, compared to a typical server that has a width of about 17 inches and a depth of about 39 inches.
  • an airflow path 608 that extends from a front edge 610 of the chassis-less circuit board substrate 602 toward a rear edge 612 has a shorter distance relative to typical servers, which may improve the thermal cooling characteristics of the sled 400 .
  • the various physical resources mounted to the chassis-less circuit board substrate 602 are mounted in corresponding locations such that no two substantively heat-producing electrical components shadow each other as discussed in more detail below.
  • no two electrical components which produce appreciable heat during operation (i.e., greater than a nominal heat sufficient enough to adversely impact the cooling of another electrical component), are mounted to the chassis-less circuit board substrate 602 linearly in-line with each other along the direction of the airflow path 608 (i.e., along a direction extending from the front edge 610 toward the rear edge 612 of the chassis-less circuit board substrate 602 ).
  • the illustrative sled 400 includes one or more physical resources 620 mounted to a top side 650 of the chassis-less circuit board substrate 602 .
  • the physical resources 620 may be embodied as any type of processor, controller, or other compute circuit capable of performing various tasks such as compute functions and/or controlling the functions of the sled 400 depending on, for example, the type or intended functionality of the sled 400 .
  • the physical resources 620 may be embodied as high-performance processors in embodiments in which the sled 400 is embodied as a compute sled, as accelerator co-processors or circuits in embodiments in which the sled 400 is embodied as an accelerator sled, storage controllers in embodiments in which the sled 400 is embodied as a storage sled, or a set of memory devices in embodiments in which the sled 400 is embodied as a memory sled.
  • the sled 400 also includes one or more additional physical resources 630 mounted to the top side 650 of the chassis-less circuit board substrate 602 .
  • the additional physical resources include a network interface controller (NIC) as discussed in more detail below.
  • NIC network interface controller
  • the physical resources 630 may include additional or other electrical components, circuits, and/or devices in other embodiments.
  • the physical resources 620 are communicatively coupled to the physical resources 630 via an input/output ( 1 / 0 ) subsystem 622 .
  • the I/O subsystem 622 may be embodied as circuitry and/or components to facilitate input/output operations with the physical resources 620 , the physical resources 630 , and/or other components of the sled 400 .
  • the I/O subsystem 622 may be embodied as, or otherwise include, memory controller hubs, input/output control hubs, integrated sensor hubs, firmware devices, communication links (e.g., point-to-point links, bus links, wires, cables, waveguides, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations.
  • the I/O subsystem 622 is embodied as, or otherwise includes, a double data rate 4 (DDR4) data bus or a DDR5 data bus.
  • DDR4 double data rate 4
  • the sled 400 may also include a resource-to-resource interconnect 624 .
  • the resource-to-resource interconnect 624 may be embodied as any type of communication interconnect capable of facilitating resource-to-resource communications.
  • the resource-to-resource interconnect 624 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622 ).
  • the resource-to-resource interconnect 624 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to resource-to-resource communications.
  • QPI QuickPath Interconnect
  • UPI UltraPath Interconnect
  • the sled 400 also includes a power connector 640 configured to mate with a corresponding power connector of the rack 240 when the sled 400 is mounted in the corresponding rack 240 .
  • the sled 400 receives power from a power supply of the rack 240 via the power connector 640 to supply power to the various electrical components of the sled 400 . That is, the sled 400 does not include any local power supply (i.e., an on-board power supply) to provide power to the electrical components of the sled 400 .
  • the exclusion of a local or on-board power supply facilitates the reduction in the overall footprint of the chassis-less circuit board substrate 602 , which may increase the thermal cooling characteristics of the various electrical components mounted on the chassis-less circuit board substrate 602 as discussed above.
  • voltage regulators are placed on a bottom side 750 (see FIG. 7 ) of the chassis-less circuit board substrate 602 directly opposite of the processors 820 (see FIG. 8 ), and power is routed from the voltage regulators to the processors 820 by vias extending through the circuit board substrate 602 .
  • Such a configuration provides an increased thermal budget, additional current and/or voltage, and better voltage control relative to typical printed circuit boards in which processor power is delivered from a voltage regulator, in part, by printed circuit traces.
  • the sled 400 may also include mounting features 642 configured to mate with a mounting arm, or other structure, of a robot to facilitate the placement of the sled 600 in a rack 240 by the robot.
  • the mounting features 642 may be embodied as any type of physical structures that allow the robot to grasp the sled 400 without damaging the chassis-less circuit board substrate 602 or the electrical components mounted thereto.
  • the mounting features 642 may be embodied as non-conductive pads attached to the chassis-less circuit board substrate 602 .
  • the mounting features may be embodied as brackets, braces, or other similar structures attached to the chassis-less circuit board substrate 602 .
  • the particular number, shape, size, and/or make-up of the mounting feature 642 may depend on the design of the robot configured to manage the sled 400 .
  • the sled 400 in addition to the physical resources 630 mounted on the top side 650 of the chassis-less circuit board substrate 602 , the sled 400 also includes one or more memory devices 720 mounted to a bottom side 750 of the chassis-less circuit board substrate 602 . That is, the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board.
  • the physical resources 620 are communicatively coupled to the memory devices 720 via the I/O subsystem 622 .
  • the physical resources 620 and the memory devices 720 may be communicatively coupled by one or more vias extending through the chassis-less circuit board substrate 602 .
  • Each physical resource 620 may be communicatively coupled to a different set of one or more memory devices 720 in some embodiments. Alternatively, in other embodiments, each physical resource 620 may be communicatively coupled to each memory device 720 .
  • the memory devices 720 may be embodied as any type of memory device capable of storing data for the physical resources 620 during operation of the sled 400 , such as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory.
  • Volatile memory may be a storage medium that requires power to maintain the state of data stored by the medium.
  • Non-limiting examples of volatile memory may include various types of random access memory (RAM), such as dynamic random access memory (DRAM) or static random access memory (SRAM).
  • RAM random access memory
  • DRAM dynamic random access memory
  • SRAM static random access memory
  • SDRAM synchronous dynamic random access memory
  • DRAM of a memory component may comply with a standard promulgated by JEDEC, such as JESD79F for DDR SDRAM, JESD79-2F for DDR2 SDRAM, JESD79-3F for DDR3 SDRAM, JESD79-4A for DDR4 SDRAM, JESD209 for Low Power DDR (LPDDR), JESD209-2 for LPDDR2, JESD209-3 for LPDDR3, and JESD209-4 for LPDDR4.
  • LPDDR Low Power DDR
  • Such standards may be referred to as DDR-based standards and communication interfaces of the storage devices that implement such standards may be referred to as DDR-based interfaces.
  • the memory device is a block addressable memory device, such as those based on NAND or NOR technologies.
  • a memory device may also include next-generation nonvolatile devices, such as Intel 3D XPointTM memory or other byte addressable write-in-place nonvolatile memory devices.
  • the memory device may be or may include memory devices that use chalcogenide glass, multi-threshold level NAND flash memory, NOR flash memory, single or multi-level Phase Change Memory (PCM), a resistive memory, nanowire memory, ferroelectric transistor random access memory (FeTRAM), anti-ferroelectric memory, magnetoresistive random access memory (MRAM) memory that incorporates memristor technology, resistive memory including the metal oxide base, the oxygen vacancy base and the conductive bridge Random Access Memory (CB-RAM), or spin transfer torque (STT)-MRAM, a spintronic magnetic junction memory based device, a magnetic tunneling junction (MTJ) based device, a DW (Domain Wall) and SOT (Spin Orbit Transfer) based device, a thyristor based memory device, or a combination of any of the above, or other memory.
  • PCM Phase Change Memory
  • MRAM magnetoresistive random access memory
  • MRAM magnetoresistive random access memory
  • STT spin transfer torque
  • the memory device may refer to the die itself and/or to a packaged memory product.
  • the memory device may comprise a transistor-less stackable cross point architecture in which memory cells sit at the intersection of word lines and bit lines and are individually addressable and in which bit storage is based on a change in bulk resistance.
  • the sled 400 may be embodied as a compute sled 800 .
  • the compute sled 800 is optimized, or otherwise configured, to perform compute tasks.
  • the compute sled 800 may rely on other sleds, such as acceleration sleds and/or storage sleds, to perform such compute tasks.
  • the compute sled 800 includes various physical resources (e.g., electrical components) similar to the physical resources of the sled 400 , which have been identified in FIG. 8 using the same reference numbers.
  • the description of such components provided above in regard to FIGS. 6 and 7 applies to the corresponding components of the compute sled 800 and is not repeated herein for clarity of the description of the compute sled 800 .
  • the physical resources 620 are embodied as processors 820 . Although only two processors 820 are shown in FIG. 8 , it should be appreciated that the compute sled 800 may include additional processors 820 in other embodiments.
  • the processors 820 are embodied as high-performance processors 820 and may be configured to operate at a relatively high power rating. Although the processors 820 generate additional heat operating at power ratings greater than typical processors (which operate at around 155-230 W), the enhanced thermal cooling characteristics of the chassis-less circuit board substrate 602 discussed above facilitate the higher power operation.
  • the processors 820 are configured to operate at a power rating of at least 250 W. In some embodiments, the processors 820 may be configured to operate at a power rating of at least 350 W.
  • the compute sled 800 may also include a processor-to-processor interconnect 842 .
  • the processor-to-processor interconnect 842 may be embodied as any type of communication interconnect capable of facilitating processor-to-processor interconnect 842 communications.
  • the processor-to-processor interconnect 842 is embodied as a high-speed point-to-point interconnect (e.g., faster than the 110 subsystem 622 ).
  • processor-to-processor interconnect 842 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • QPI QuickPath Interconnect
  • UPI UltraPath Interconnect
  • point-to-point interconnect dedicated to processor-to-processor communications.
  • the compute sled 800 also includes a communication circuit 830 .
  • the illustrative communication circuit 830 includes a network interface controller (NIC) 832 , which may also be referred to as a host fabric interface (HFI).
  • NIC network interface controller
  • HFI host fabric interface
  • the NIC 832 may be embodied as, or otherwise include, any type of integrated circuit, discrete circuits, controller chips, chipsets, add-in-boards, daughtercards, network interface cards, or other devices that may be used by the compute sled 800 to connect with another compute device (e.g., with other sleds 400 ).
  • the NIC 832 may be embodied as part of a system-on-a-chip (SoC) that includes one or more processors, or included on a multichip package that also contains one or more processors.
  • the NIC 832 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 832 .
  • the local processor of the NIC 832 may be capable of performing one or more of the functions of the processors 820 .
  • the local memory of the NIC 832 may be integrated into one or more components of the compute sled at the board level, socket level, chip level, and/or other levels.
  • the communication circuit 830 is communicatively coupled to an optical data connector 834 .
  • the optical data connector 834 is configured to mate with a corresponding optical data connector of the rack 240 when the compute sled 800 is mounted in the rack 240 .
  • the optical data connector 834 includes a plurality of optical fibers which lead from a mating surface of the optical data connector 834 to an optical transceiver 836 .
  • the optical transceiver 836 is configured to convert incoming optical signals from the rack-side optical data connector to electrical signals and to convert electrical signals to outgoing optical signals to the rack-side optical data connector.
  • the optical transceiver 836 may form a portion of the communication circuit 830 in other embodiments.
  • the compute sled 800 may also include an expansion connector 840 .
  • the expansion connector 840 is configured to mate with a corresponding connector of an expansion chassis-less circuit board substrate to provide additional physical resources to the compute sled 800 .
  • the additional physical resources may be used, for example, by the processors 820 during operation of the compute sled 800 .
  • the expansion chassis-less circuit board substrate may be substantially similar to the chassis-less circuit board substrate, 602 discussed above and may include various electrical components mounted thereto. The particular electrical components mounted to the expansion chassis-less circuit board substrate may depend on the intended functionality of the expansion chassis-less circuit board substrate.
  • the expansion chassis-less circuit board substrate may provide additional compute resources, memory resources, and/or storage resources.
  • the additional physical resources of the expansion chassis-less circuit board substrate may include, but is not limited to, processors, memory devices, storage devices, and/or accelerator circuits including, for example, field programmable gate arrays (FPGA), application-specific integrated circuits (ASICs), security co-processors, graphics processing units (GPUs), machine learning circuits, or other specialized processors, controllers, devices, and/or circuits.
  • processors memory devices, storage devices, and/or accelerator circuits including, for example, field programmable gate arrays (FPGA), application-specific integrated circuits (ASICs), security co-processors, graphics processing units (GPUs), machine learning circuits, or other specialized processors, controllers, devices, and/or circuits.
  • FPGA field programmable gate arrays
  • ASICs application-specific integrated circuits
  • security co-processors graphics processing units (GPUs)
  • GPUs graphics processing units
  • machine learning circuits or other specialized processors, controllers, devices, and/or circuits.
  • the processors 820 , communication circuit 830 , and optical data connector 834 are mounted to the top side 650 of the chassis-less circuit board substrate 602 .
  • Any suitable attachment or mounting technology may be used to mount the physical resources of the compute sled 800 to the chassis-less circuit board substrate 602 .
  • the various physical resources may be mounted in corresponding sockets (e.g., a processor socket), holders, or brackets.
  • some of the electrical components may be directly mounted to the chassis-less circuit board substrate 602 via soldering or similar techniques.
  • the individual processors 820 and communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other.
  • the processors 820 and communication circuit 830 are mounted in corresponding locations on the top side 650 of the chassis-less circuit board substrate 602 such that no two of those physical resources are linearly in-line with others along the direction of the airflow path 608 .
  • the optical data connector 834 is in-line with the communication circuit 830 , the optical data connector 834 produces no or nominal heat during operation.
  • the memory devices 720 of the compute sled 800 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 400 . Although mounted to the bottom side 750 , the memory devices 720 are communicatively coupled to the processors 820 located on the top side 650 via the I/O subsystem 622 . Because the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board, the memory devices 720 and the processors 820 may be communicatively coupled by one or more vias, connectors, or other mechanisms extending through the chassis-less circuit board substrate 602 . Of course, each processor 820 may be communicatively coupled to a different set of one or more memory devices 720 in some embodiments.
  • each processor 820 may be communicatively coupled to each memory device 720 .
  • the memory devices 720 may be mounted to one or more memory mezzanines on the bottom side of the chassis-less circuit board substrate 602 and may interconnect with a corresponding processor 820 through a ball-grid array.
  • Each of the processors 820 includes a heatsink 850 secured thereto. Due to the mounting of the memory devices 720 to the bottom side 750 of the chassis-less circuit board substrate 602 (as well as the vertical spacing of the sleds 400 in the corresponding rack 240 ), the top side 650 of the chassis-less circuit board substrate 602 includes additional “free” area or space that facilitates the use of heatsinks 850 having a larger size relative to traditional heatsinks used in typical servers. Additionally, due to the improved thermal cooling characteristics of the chassis-less circuit board substrate 602 , none of the processor heatsinks 850 include cooling fans attached thereto. That is, each of the heatsinks 850 is embodied as a fan-less heatsink. In some embodiments, the heat sinks 850 mounted atop the processors 820 may overlap with the heat sink attached to the communication circuit 830 in the direction of the airflow path 608 due to their increased size, as illustratively suggested by FIG. 9 .
  • the sled 400 may be embodied as an accelerator sled 1000 .
  • the accelerator sled 1000 is configured, to perform specialized compute tasks, such as machine learning, encryption, hashing, or other computational-intensive task.
  • a compute sled 800 may offload tasks to the accelerator sled 1000 during operation.
  • the accelerator sled 1000 includes various components similar to components of the sled 400 and/or compute sled 800 , which have been identified in FIG. 10 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the accelerator sled 1000 and is not repeated herein for clarity of the description of the accelerator sled 1000 .
  • the physical resources 620 are embodied as accelerator circuits 1020 .
  • the accelerator sled 1000 may include additional accelerator circuits 1020 in other embodiments.
  • the accelerator sled 1000 may include four accelerator circuits 1020 in some embodiments.
  • the accelerator circuits 1020 may be embodied as any type of processor, co-processor, compute circuit, or other device capable of performing compute or processing operations.
  • the accelerator circuits 1020 may be embodied as, for example, field programmable gate arrays (FPGA), application-specific integrated circuits (ASICs), security co-processors, graphics processing units (GPUs), neuromorphic processor units, quantum computers, machine learning circuits, or other specialized processors, controllers, devices, and/or circuits.
  • FPGA field programmable gate arrays
  • ASICs application-specific integrated circuits
  • security co-processors graphics processing units
  • GPUs graphics processing units
  • neuromorphic processor units quantum computers
  • machine learning circuits or other specialized processors, controllers, devices, and/or circuits.
  • the accelerator sled 1000 may also include an accelerator-to-accelerator interconnect 1042 . Similar to the resource-to-resource interconnect 624 of the sled 600 discussed above, the accelerator-to-accelerator interconnect 1042 may be embodied as any type of communication interconnect capable of facilitating accelerator-to-accelerator communications. In the illustrative embodiment, the accelerator-to-accelerator interconnect 1042 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622 ).
  • the accelerator-to-accelerator interconnect 1042 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • the accelerator circuits 1020 may be daisy-chained with a primary accelerator circuit 1020 connected to the NIC 832 and memory 720 through the I/O subsystem 622 and a secondary accelerator circuit 1020 connected to the NIC 832 and memory 720 through a primary accelerator circuit 1020 .
  • FIG. 11 an illustrative embodiment of the accelerator sled 1000 is shown.
  • the accelerator circuits 1020 , communication circuit 830 , and optical data connector 834 are mounted to the top side 650 of the chassis-less circuit board substrate 602 .
  • the individual accelerator circuits 1020 and communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other as discussed above.
  • the memory devices 720 of the accelerator sled 1000 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 600 .
  • each of the accelerator circuits 1020 may include a heatsink 1070 that is larger than a traditional heatsink used in a server. As discussed above with reference to the heatsinks 870 , the heatsinks 1070 may be larger than traditional heatsinks because of the “free” area provided by the memory resources 720 being located on the bottom side 750 of the chassis-less circuit board substrate 602 rather than on the top side 650 .
  • the sled 400 may be embodied as a storage sled 1200 .
  • the storage sled 1200 is configured, to store data in a data storage 1250 local to the storage sled 1200 .
  • a compute sled 800 or an accelerator sled 1000 may store and retrieve data from the data storage 1250 of the storage sled 1200 .
  • the storage sled 1200 includes various components similar to components of the sled 400 and/or the compute sled 800 , which have been identified in FIG. 12 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the storage sled 1200 and is not repeated herein for clarity of the description of the storage sled 1200 .
  • the physical resources 620 are embodied as storage controllers 1220 . Although only two storage controllers 1220 are shown in FIG. 12 , it should be appreciated that the storage sled 1200 may include additional storage controllers 1220 in other embodiments.
  • the storage controllers 1220 may be embodied as any type of processor, controller, or control circuit capable of controlling the storage and retrieval of data into the data storage 1250 based on requests received via the communication circuit 830 .
  • the storage controllers 1220 are embodied as relatively low-power processors or controllers.
  • the storage controllers 1220 may be configured to operate at a power rating of about 75 watts.
  • the storage sled 1200 may also include a controller-to-controller interconnect 1242 .
  • the controller-to-controller interconnect 1242 may be embodied as any type of communication interconnect capable of facilitating controller-to-controller communications.
  • the controller-to-controller interconnect 1242 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622 ).
  • controller-to-controller interconnect 1242 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • QPI QuickPath Interconnect
  • UPI UltraPath Interconnect
  • point-to-point interconnect dedicated to processor-to-processor communications.
  • the data storage 1250 is embodied as, or otherwise includes, a storage cage 1252 configured to house one or more solid state drives (SSDs) 1254 .
  • the storage cage 1252 includes a number of mounting slots 1256 , each of which is configured to receive a corresponding solid state drive 1254 .
  • Each of the mounting slots 1256 includes a number of drive guides 1258 that cooperate to define an access opening 1260 of the corresponding mounting slot 1256 .
  • the storage cage 1252 is secured to the chassis-less circuit board substrate 602 such that the access openings face away from (i.e., toward the front of) the chassis-less circuit board substrate 602 .
  • solid state drives 1254 are accessible while the storage sled 1200 is mounted in a corresponding rack 204 .
  • a solid state drive 1254 may be swapped out of a rack 240 (e.g., via a robot) while the storage sled 1200 remains mounted in the corresponding rack 240 .
  • the storage cage 1252 illustratively includes sixteen mounting slots 1256 and is capable of mounting and storing sixteen solid state drives 1254 .
  • the storage cage 1252 may be configured to store additional or fewer solid state drives 1254 in other embodiments.
  • the solid state drivers are mounted vertically in the storage cage 1252 , but may be mounted in the storage cage 1252 in a different orientation in other embodiments.
  • Each solid state drive 1254 may be embodied as any type of data storage device capable of storing long term data. To do so, the solid state drives 1254 may include volatile and non-volatile memory devices discussed above.
  • the storage controllers 1220 , the communication circuit 830 , and the optical data connector 834 are illustratively mounted to the top side 650 of the chassis-less circuit board substrate 602 .
  • any suitable attachment or mounting technology may be used to mount the electrical components of the storage sled 1200 to the chassis-less circuit board substrate 602 including, for example, sockets (e.g., a processor socket), holders, brackets, soldered connections, and/or other mounting or securing techniques.
  • the individual storage controllers 1220 and the communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other.
  • the storage controllers 1220 and the communication circuit 830 are mounted in corresponding locations on the top side 650 of the chassis-less circuit board substrate 602 such that no two of those electrical components are linearly in-line with each other along the direction of the airflow path 608 .
  • the memory devices 720 of the storage sled 1200 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 400 . Although mounted to the bottom side 750 , the memory devices 720 are communicatively coupled to the storage controllers 1220 located on the top side 650 via the I/O subsystem 622 . Again, because the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board, the memory devices 720 and the storage controllers 1220 may be communicatively coupled by one or more vias, connectors, or other mechanisms extending through the chassis-less circuit board substrate 602 . Each of the storage controllers 1220 includes a heatsink 1270 secured thereto.
  • each of the heatsinks 1270 includes cooling fans attached thereto. That is, each of the heatsinks 1270 is embodied as a fan-less heatsink.
  • the sled 400 may be embodied as a memory sled 1400 .
  • the storage sled 1400 is optimized, or otherwise configured, to provide other sleds 400 (e.g., compute sleds 800 , accelerator sleds 1000 , etc.) with access to a pool of memory (e.g., in two or more sets 1430 , 1432 of memory devices 720 ) local to the memory sled 1200 .
  • a compute sled 800 or an accelerator sled 1000 may remotely write to and/or read from one or more of the memory sets 1430 , 1432 of the memory sled 1200 using a logical address space that maps to physical addresses in the memory sets 1430 , 1432 .
  • the memory sled 1400 includes various components similar to components of the sled 400 and/or the compute sled 800 , which have been identified in FIG. 14 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the memory sled 1400 and is not repeated herein for clarity of the description of the memory sled 1400 .
  • the physical resources 620 are embodied as memory controllers 1420 . Although only two memory controllers 1420 are shown in FIG. 14 , it should be appreciated that the memory sled 1400 may include additional memory controllers 1420 in other embodiments.
  • the memory controllers 1420 may be embodied as any type of processor, controller, or control circuit capable of controlling the writing and reading of data into the memory sets 1430 , 1432 based on requests received via the communication circuit 830 .
  • each memory controller 1420 is connected to a corresponding memory set 1430 , 1432 to write to and read from memory devices 720 within the corresponding memory set 1430 , 1432 and enforce any permissions (e.g., read, write, etc.) associated with sled 400 that has sent a request to the memory sled 1400 to perform a memory access operation (e.g., read or write).
  • a memory access operation e.g., read or write
  • the memory sled 1400 may also include a controller-to-controller interconnect 1442 .
  • the controller-to-controller interconnect 1442 may be embodied as any type of communication interconnect capable of facilitating controller-to-controller communications.
  • the controller-to-controller interconnect 1442 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622 ).
  • the controller-to-controller interconnect 1442 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • a memory controller 1420 may access, through the controller-to-controller interconnect 1442 , memory that is within the memory set 1432 associated with another memory controller 1420 .
  • a scalable memory controller is made of multiple smaller memory controllers, referred to herein as “chiplets”, on a memory sled (e.g., the memory sled 1400 ).
  • the chiplets may be interconnected (e.g., using EMIB (Embedded Multi-Die Interconnect Bridge)).
  • the combined chiplet memory controller may scale up to a relatively large number of memory controllers and I/O ports, (e.g., up to 16 memory channels).
  • the memory controllers 1420 may implement a memory interleave (e.g., one memory address is mapped to the memory set 1430 , the next memory address is mapped to the memory set 1432 , and the third address is mapped to the memory set 1430 , etc.).
  • the interleaving may be managed within the memory controllers 1420 , or from CPU sockets (e.g., of the compute sled 800 ) across network links to the memory sets 1430 , 1432 , and may improve the latency associated with performing memory access operations as compared to accessing contiguous memory addresses from the same memory device.
  • the memory sled 1400 may be connected to one or more other sleds 400 (e.g., in the same rack 240 or an adjacent rack 240 ) through a waveguide, using the waveguide connector 1480 .
  • the waveguides are 64 millimeter waveguides that provide 16 Rx (i.e., receive) lanes and 16 Tx (i.e., transmit) lanes.
  • Each lane in the illustrative embodiment, is either 16 GHz or 32 GHz. In other embodiments, the frequencies may be different.
  • Using a waveguide may provide high throughput access to the memory pool (e.g., the memory sets 1430 , 1432 ) to another sled (e.g., a sled 400 in the same rack 240 or an adjacent rack 240 as the memory sled 1400 ) without adding to the load on the optical data connector 834 .
  • the memory pool e.g., the memory sets 1430 , 1432
  • another sled e.g., a sled 400 in the same rack 240 or an adjacent rack 240 as the memory sled 1400
  • the system 1510 includes an orchestrator server 1520 , which may be embodied as a managed node comprising a compute device (e.g., a processor 820 on a compute sled 800 ) executing management software (e.g., a cloud operating environment, such as OpenStack) that is communicatively coupled to multiple sleds 400 including a large number of compute sleds 1530 (e.g., each similar to the compute sled 800 ), memory sleds 1540 (e.g., each similar to the memory sled 1400 ), accelerator sleds 1550 (e.g., each similar to the memory sled 1000 ), and storage sleds 1560 (e.g., each similar to the storage sled 1200 ).
  • a compute device e.g., a processor 820 on a compute sled 800
  • management software e.g., a cloud operating environment, such as OpenStack
  • multiple sleds 400 including a large number of compute
  • One or more of the sleds 1530 , 1540 , 1550 , 1560 may be grouped into a managed node 1570 , such as by the orchestrator server 1520 , to collectively perform a workload (e.g., an application 1532 executed in a virtual machine or in a container).
  • the managed node 1570 may be embodied as an assembly of physical resources 620 , such as processors 820 , memory resources 720 , accelerator circuits 1020 , or data storage 1250 , from the same or different sleds 400 .
  • the managed node may be established, defined, or “spun up” by the orchestrator server 1520 at the time a workload is to be assigned to the managed node or at any other time, and may exist regardless of whether any workloads are presently assigned to the managed node.
  • the orchestrator server 1520 may selectively allocate and/or deallocate physical resources 620 from the sleds 400 and/or add or remove one or more sleds 400 from the managed node 1570 as a function of quality of service (QoS) targets (e.g., performance targets associated with a throughput, latency, instructions per second, etc.) associated with a service level agreement for the workload (e.g., the application 1532 ).
  • QoS quality of service
  • the orchestrator server 1520 may receive telemetry data indicative of performance conditions (e.g., throughput, latency, instructions per second, etc.) in each sled 400 of the managed node 1570 and compare the telemetry data to the quality of service targets to determine whether the quality of service targets are being satisfied.
  • the orchestrator server 1520 may additionally determine whether one or more physical resources may be deallocated from the managed node 1570 while still satisfying the QoS targets, thereby freeing up those physical resources for use in another managed node (e.g., to execute a different workload).
  • the orchestrator server 1520 may determine to dynamically allocate additional physical resources to assist in the execution of the workload (e.g., the application 1532 ) while the workload is executing. Similarly, the orchestrator server 1520 may determine to dynamically deallocate physical resources from a managed node if the orchestrator server 1520 determines that deallocating the physical resource would result in QoS targets still being met.
  • the orchestrator server 1520 may identify trends in the resource utilization of the workload (e.g., the application 1532 ), such as by identifying phases of execution (e.g., time periods in which different operations, each having different resource utilizations characteristics, are performed) of the workload (e.g., the application 1532 ) and pre-emptively identifying available resources in the data center 100 and allocating them to the managed node 1570 (e.g., within a predefined time period of the associated phase beginning).
  • phases of execution e.g., time periods in which different operations, each having different resource utilizations characteristics, are performed
  • the orchestrator server 1520 may model performance based on various latencies and a distribution scheme to place workloads among compute sleds and other resources (e.g., accelerator sleds, memory sleds, storage sleds) in the data center 100 .
  • the orchestrator server 1520 may utilize a model that accounts for the performance of resources on the sleds 400 (e.g., FPGA performance, memory access latency, etc.) and the performance (e.g., congestion, latency, bandwidth) of the path through the network to the resource (e.g., FPGA).
  • the orchestrator server 1520 may determine which resource(s) should be used with which workloads based on the total latency associated with each potential resource available in the data center 100 (e.g., the latency associated with the performance of the resource itself in addition to the latency associated with the path through the network between the compute sled executing the workload and the sled 400 on which the resource is located).
  • the orchestrator server 1520 may generate a map of heat generation in the data center 100 using telemetry data (e.g., temperatures, fan speeds, etc.) reported from the sleds 400 and allocate resources to managed nodes as a function of the map of heat generation and predicted heat generation associated with different workloads, to maintain a target temperature and heat distribution in the data center 100 .
  • telemetry data e.g., temperatures, fan speeds, etc.
  • the orchestrator server 1520 may organize received telemetry data into a hierarchical model that is indicative of a relationship between the managed nodes (e.g., a spatial relationship such as the physical locations of the resources of the managed nodes within the data center 100 and/or a functional relationship, such as groupings of the managed nodes by the customers the managed nodes provide services for, the types of functions typically performed by the managed nodes, managed nodes that typically share or exchange workloads among each other, etc.). Based on differences in the physical locations and resources in the managed nodes, a given workload may exhibit different resource utilizations (e.g., cause a different internal temperature, use a different percentage of processor or memory capacity) across the resources of different managed nodes.
  • resource utilizations e.g., cause a different internal temperature, use a different percentage of processor or memory capacity
  • the orchestrator server 1520 may determine the differences based on the telemetry data stored in the hierarchical model and factor the differences into a prediction of future resource utilization of a workload if the workload is reassigned from one managed node to another managed node, to accurately balance resource utilization in the data center 100 .
  • the orchestrator server 1520 may send self-test information to the sleds 400 to enable each sled 400 to locally (e.g., on the sled 400 ) determine whether telemetry data generated by the sled 400 satisfies one or more conditions (e.g., an available capacity that satisfies a predefined threshold, a temperature that satisfies a predefined threshold, etc.). Each sled 400 may then report back a simplified result (e.g., yes or no) to the orchestrator server 1520 , which the orchestrator server 1520 may utilize in determining the allocation of resources to managed nodes.
  • a simplified result e.g., yes or no
  • a system 1610 for providing efficient sharing of encrypted data in a disaggregated architecture includes an orchestrator server 1620 similar to the orchestrator server 1520 , in communication with multiple sleds 1616 , including a compute sled 1630 that executes applications 1650 , 1652 (e.g., each a workload), similar to the application 1532 , on behalf of a client device 1614 .
  • another compute sled 1632 executes multiple applications 1654 , 1656 .
  • Each application 1650 , 1652 , 1654 , 1656 may be executed in a virtual machine (VM) and each application may be associated with a corresponding tenant (e.g., a customer of the system 1610 for whom applications are executed).
  • VM virtual machine
  • the system 1610 additionally includes memory sleds 1640 , 1642 , each of which includes a memory controller 1670 , 1672 , similar to the memory controller 1420 of FIG. 14 and corresponding memory devices 1680 , 1682 , which are similar to the memory resources 720 of FIG. 7 .
  • one or more of the memory sleds 1640 , 1642 coordinates the sharing (e.g., copying or moving) of data sets between applications 1650 , 1652 , 1654 , and 1656 by providing, to an application that is to receive access to the data set, a handle to the data set that is to be shared, rather than performing a bit-for-bit transfer of the data set to the working memory of the receiving application.
  • the data set in the illustrative embodiment, is present in the memory devices 1680 and/or 1682 .
  • the data set, and all other data residing in the memory devices 1680 , 1682 used by the applications 1650 , 1652 , 1654 , 1656 is encrypted with a key that is associated with the application, the VM executing the application, and/or the tenant for whom the application is executed.
  • the memory sled 1640 coordinates with an encryption key manager 1622 to provide the corresponding key to the application that is to receive access to the data set.
  • the encryption key manager 1622 may be embodied as software or any circuitry (e.g., a co-processor, an application specific integrated circuit (ASIC), etc.) that selectively provides keys to applications to enable those applications to utilize (e.g., decrypted and/or encrypt) a corresponding data set.
  • the encryption key manager 1622 may be hosted by one of the compute sleds 1630 , 1632 executing the corresponding applications 1650 , 1652 , 1654 , 1656 , by the orchestrator server 1620 , and/or by another compute sled 1634 that is dedicated to hosting the encryption key manager 1622 . In other embodiments, the encryption key manager 1622 may be hosted on another sled 1616 .
  • the system 1610 avoids the latency and processing overhead that would otherwise be incurred in performing bit-for-bit transfers of data sets between different applications and performing corresponding decryption (e.g., with one key) and re-encryption (e.g., with another key) operations with keys that are confined to each corresponding tenant, application, or VM.
  • the memory sled 1640 may greatly increase the speed at which an application migration may occur (e.g., from one compute sled to another compute sled).
  • the memory sled 1640 may also perform operations to move relatively infrequently used data sets to cold storage (e.g., infrequently used data storage devices on a data storage sled) and to store access control data (e.g., data indicative of credentials usable to access the data set) with the data set in the cold storage, as described in more detail herein. While the following description uses a memory sled 1640 as an example, it should be understood that the operations may alternatively be performed by a data storage sled 1560 and the corresponding non-volatile memory in the data storage 1250 .
  • the orchestrator server 1620 , the sleds 1616 , and the client device 1614 are illustratively in communication via a network 1612 , which may be embodied as any type of wired or wireless communication network, including global networks (e.g., the Internet), local area networks (LANs) or wide area networks (WANs), cellular networks (e.g., Global System for Mobile Communications (GSM), 3G, Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), etc.), digital subscriber line (DSL) networks, cable networks (e.g., coaxial networks, fiber networks, etc.), or any combination thereof.
  • GSM Global System for Mobile Communications
  • LTE Long Term Evolution
  • WiMAX Worldwide Interoperability for Microwave Access
  • DSL digital subscriber line
  • cable networks e.g., coaxial networks, fiber networks, etc.
  • the memory sled 1640 may execute a method 1700 for providing efficient sharing of encrypted data (e.g., in the system 1610 ).
  • the method 1700 begins with block 1702 , in which the memory sled 1640 is powered on.
  • the memory sled 1704 may detect any sleds 1616 that are compatible with the encrypted data sharing scheme described herein.
  • the memory sled 1640 may query other sleds (e.g., other memory sleds 1642 ) in the system 1610 to determine whether those sleds have memory devices 1682 that are configured to store encrypted data (e.g., in a shared pool) for one or more applications 1650 , 1652 , 1654 , 1656 . Further, as indicated in block 1706 , the memory sled 1640 may map memory addresses of the available memory (e.g., memory devices 1680 , 1682 ) of the present memory sled 1640 and other sleds 1616 (e.g., the memory sled 1642 ) that are compatible with the encrypted memory sharing scheme.
  • the available memory e.g., memory devices 1680 , 1682
  • the memory sled 1640 may move a cold data set (e.g., a relatively infrequently accessed file or other set of data) to cold storage (e.g., one or more data storage devices 1250 used for archiving data on a data storage sled 1560 ). In doing so, the memory sled 1640 may move, to cold storage, a data set that has not been accessed with at least a predefined frequency (e.g., at least once a week) over a predefined time period (e.g., one month), as indicated in block 1710 . The memory sled 1640 may do so by sending the data set to the corresponding data storage sled 1560 for storage thereon.
  • a predefined frequency e.g., at least once a week
  • time period e.g., one month
  • the memory sled 1640 causes the data storage sled 1560 to store, with the data set, access control data, which may be embodied as any data indicative of credentials (e.g., a key identifier, a list of identifiers of tenants allowed to access the data set, etc.) usable to access the data set, as indicated in block 1712 .
  • access control data may be embodied as any data indicative of credentials (e.g., a key identifier, a list of identifiers of tenants allowed to access the data set, etc.) usable to access the data set, as indicated in block 1712 .
  • the memory sled 1640 receives a data access request from another sled 1616 (e.g., a request initiated by the application 1650 executed by the compute sled 1630 ).
  • the data access request may be a request to share (e.g., copy or move) a data set present in the memory 1680 , 1682 .
  • the memory sled 1640 may receive a data access request to copy a data set between applications (e.g., copy a data set used by the application 1650 to the application 1654 ) or the memory sled 1640 may receive a data access request to move a data set between applications (e.g., from the application 1650 to the application 1654 ), as indicated in block 1720 .
  • the data access request may be to move the entire working data of an application that is to be migrated from one sled (e.g., the compute sled 1630 ) to another sled (e.g., the compute sled 1632 ).
  • the data access request may be a request to write data, as indicated in block 1724 or may be a request to read data, as indicated in block 1726 .
  • the memory sled 1640 determines the subsequent course of action to take as a function of whether a data access request has been received by the memory sled 1640 . If the memory sled 1640 has not received a memory access request, the method 1700 loops back to block 1704 , in which the memory sled 1640 continues to detect sleds 1616 that are compatible with the efficient memory sharing scheme. Otherwise, the method 1700 advances to block 1730 of FIG. 18 , in which the memory sled 1640 determines the subsequent actions to take based on whether the data access request is a data share request (e.g., a request to share a data set).
  • a data share request e.g., a request to share a data set
  • the method 1700 advances to block 1732 , in which the memory sled 1640 determines a key identifier (e.g., any data such as a number or alphanumeric code) that is associated with the data set to be shared and that uniquely identifies a key (e.g., a code) that is usable to perform cryptographic operations on the data set.
  • a key identifier e.g., any data such as a number or alphanumeric code
  • the memory sled 1640 may determine a key identifier associated with a memory address for the data share request, as indicated in block 1734 .
  • the memory sled 1640 may determine the memory address from a handle (e.g., data that uniquely identifies the data set) included in the data share request, as indicated in block 1736 . In doing so, the memory sled 1640 may determine the memory address from a database that associates handles to memory addresses and the corresponding sleds on which the memory is located (e.g., an address corresponding to a section of a memory device 1682 of the memory sled 1642 ), as indicated in block 1738 .
  • a handle e.g., data that uniquely identifies the data set
  • the memory sled 1640 may determine the memory address from a database that associates handles to memory addresses and the corresponding sleds on which the memory is located (e.g., an address corresponding to a section of a memory device 1682 of the memory sled 1642 ), as indicated in block 1738 .
  • the memory sled 1640 may determine one or more memory addresses (e.g., a range of memory addresses) for the working memory of an application that is to be migrated from one compute sled (e.g., the compute sled 1630 ) to another compute sled (e.g., the compute sled 1632 ), which may have a more powerful processor or otherwise may be more suitable for the present operations of the application.
  • the memory sled 1640 may look up the key identifier in a database that associates memory addresses with key identifiers, as indicated in block 1742 .
  • the memory sled 1640 may determine the key identifier as a subset of the memory address (e.g., a subset of the highest order bits, a subset of the lowest order bits, etc.). Alternatively, the memory sled 1640 may obtain the key identifier from a predefined register or data structure associated with a compute sled of the requesting application (e.g., a model specific register of the compute sled 1630 executing the application 1650 , a data structure present in a section of the memory 1680 , 1682 utilized by the application 1650 , etc.), as indicated in block 1746 . Subsequently, the method 1700 advances to block 1748 of FIG. 19 in which the memory sled 1640 requests the corresponding key from an encryption key manager (e.g., the encryption key manager 1622 ).
  • an encryption key manager e.g., the encryption key manager 1622
  • the memory sled 1640 may send the key identifier (e.g., the key identifier determined in block 1732 ) in a request to the encryption key manager 1622 , as indicated in block 1750 .
  • the memory sled 1640 may request a key that has been escrowed with the encryption key manager 1622 by a memory encryption engine (not shown) of the sled 1616 (e.g., the compute sled 1630 ) that sent the data share request to the memory sled 1640 .
  • the memory sled 1640 may send the request to an encryption key manager 1622 hosted by the orchestrator server 1620 , as indicated in block 1754 .
  • the encryption key manager 1622 may be hosted on a different sled.
  • the memory sled 1640 may send the key request to an encryption key manager 1622 in a compute sled 1630 , 1632 associated with the data share request (e.g., the data share request from block 1716 ). In doing so, the memory sled 1640 may send the key request to an encryption key manager 1622 hosted by a compute sled that is to share the data set, as indicated in block 1758 .
  • the memory sled 1640 may send the key request to the encryption key manager 1622 hosted by the compute sled 1630 .
  • the memory sled 1640 may send the key request to an encryption key manager 1622 hosted by the compute sled that is to receive access to the data set, as indicated in block 1760 .
  • the memory sled 1640 may send the key request to the compute sled 1632 executing the application 1654 .
  • the encryption key manager 1622 may be hosted on a different sled than the compute sleds 1630 , 1632 or the orchestrator server 1620 , and instead may be hosted by a separate compute sled 1634 (e.g., a compute sled that is dedicated to hosting the encryption key manager 1622 ) for use in all data sharing operations in the rack, pod, or across the data center, as indicated in block 1762 .
  • a separate compute sled 1634 e.g., a compute sled that is dedicated to hosting the encryption key manager 1622
  • the memory sled 1640 may obtain the key from the encryption key manager 1622 and, in block 1766 , may send the obtained key to the sled (e.g., the sled 1632 ) that is to access the data set to be shared. In doing so, the memory sled 1640 may send the obtained key to a target application (e.g., the application 1654 , in the scenario described above) executed on the compute sled 1632 , as indicated in block 1768 . In other embodiments, the encryption key manager 1622 provides the requested key directly to the application that is to access the data set (e.g., rather than relaying the key through the memory sled 1640 ).
  • the memory sled 1640 sends, to the sled that is to access the data set, a handle associated with an address where the data set is physically located in the memory 1680 , 1682 .
  • the handle is a level of indirection away from the logical or physical address of where the data set resides in the memory 1680 , 1682 .
  • the handle will still point to the data set (e.g., the handle will be remapped to the new address).
  • the method 1700 loops hack to block 1704 of FIG. 17 , in which the memory sled 1640 again detects any previously undetected sleds 1616 (e.g., sleds 1616 that have been added to the system 1610 ) that are compatible with the efficient memory sharing scheme.
  • the memory sled 1640 again detects any previously undetected sleds 1616 (e.g., sleds 1616 that have been added to the system 1610 ) that are compatible with the efficient memory sharing scheme.
  • the method 1700 instead advances to block 1772 of FIG. 20 , in which the memory sled 1640 determines whether the request is a write request. If so, the method 1700 advances to block 1774 , in which the memory sled 1640 determines whether the data set is presently shared by multiple tenants (e.g., the applications of different customers are concurrently accessing the same data set). If not, the method 1700 advances to block 1776 , in which the memory sled 1776 writes data (e.g., an encrypted payload) from the write request to the data set identified in the write request (e.g., by a handle).
  • data e.g., an encrypted payload
  • the method 1700 instead advances to block 1778 in which the memory sled 1640 forks the data set (e.g., makes a copy of the data set in the memory 1680 , 1682 ), and writes the data (e.g., encrypted data) from the write request to the forked data set, as indicated in block 1780 .
  • the memory sled 1640 sends a handle associated with the forked data set to the requesting sled 1616 (e.g., the compute sled 1630 ) to be used by the requesting sled 1616 in place of the original handle (e.g., the handle that was included in the write request).
  • the method 1700 loops back to block 1704 , in which the memory sled 1640 detects any previously undetected sleds 1616 that are compatible with the efficient memory sharing scheme.
  • the method 1700 advances to block 1784 , in which the memory sled 1640 reads a data set at an address associated with a handle included in the read request.
  • the memory sled 1640 sends the read data set (e.g., in its encrypted form) to the requesting sled (e.g., the compute sled 1630 ), as indicated in block 1786 .
  • the method 1700 loops back to block 1704 , in which the memory sled 1640 again detects any previously undetected sleds 1616 that are compatible with the efficient memory sharing scheme.
  • An embodiment of the technologies disclosed herein may include any one or more, and any combination of, the examples described below.
  • Example 1 includes a sled comprising a set of memory devices; and a controller connected to the set of memory devices, wherein the controller is to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 2 includes the subject matter of Example 1, and wherein the controller is further to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 3 includes the subject matter of any of Examples 1 and 2, and wherein the controller is further to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 4 includes the subject matter of any of Examples 1-3, and wherein sled is located in a data center and the controller is further map an address of memory that is present on at least one other sled in the data center.
  • Example 5 includes the subject matter of any of Examples 1-4, and wherein the controller is further to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 6 includes the subject matter of any of Examples 1-5, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 7 includes the subject matter of any of Examples 1-6, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 8 includes the subject matter of any of Examples 1-7, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 9 includes the subject matter of any of Examples 1-8, and wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
  • Example 10 includes the subject matter of any of Examples 1-9, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
  • Example 11 includes the subject matter of any of Examples 1-10, and wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
  • Example 12 includes the subject matter of any of Examples 1-11, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
  • Example 13 includes the subject matter of any of Examples 1-12, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.
  • Example 14 includes one or more non-transitory machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a sled to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 15 includes the subject matter of Example 14, and wherein, when executed, the plurality of instructions further cause the sled to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 16 includes the subject matter of any of Examples 14 and 15, and wherein, when executed, the plurality of instructions further cause the sled to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 17 includes the subject matter of any of Examples 14-16, and wherein the sled is located in a data center and wherein, when executed, the plurality of instructions further cause the sled to map an address of memory that is present on at least one other sled in the data center.
  • Example 18 includes the subject matter of any of Examples 14-17, and wherein, when executed, the plurality of instructions further cause the sled to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 19 includes the subject matter of any of Examples 14-18, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 20 includes the subject matter of any of Examples 14-19, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 21 includes the subject matter of any of Examples 14-20, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 22 includes a method comprising receiving, by a memory controller, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the memory controller; determining, by the memory controller and in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; sending, by the memory controller and to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and sending, by the memory controller and to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 23 includes the subject matter of Example 22, and further including determining, by the memory controller, whether the data set has been accessed with at least a predefined frequency over a predefined period of time; moving, by the memory controller and in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and storing, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 24 includes the subject matter of any of Examples 22 and 23, and further including receiving, by the memory controller, a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and sending, by the memory controller and to the second compute sled, a handle to the working data of the first application.
  • Example 25 includes the subject matter of any of Examples 22-24, and wherein the memory controller is in a sled that is located in a data center, the method further comprising mapping, by the memory controller, an address of memory that is present on at least one other sled in the data center.
  • Example 26 includes a sled comprising means for receiving, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled; means for determining, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; means for sending, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and means for sending, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 27 includes a controller connected to a set of memory devices, the controller comprising circuitry to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 28 includes the subject matter of Example 27, and wherein the circuitry is further to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 29 includes the subject matter of any of Examples 27 and 28, and wherein the circuitry is further to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 30 includes the subject matter of any of Examples 27-29, and wherein the controller is located in a sled in a data center and the circuitry is further to map an address of memory that is present on at least one other sled in the data center.
  • Example 31 includes the subject matter of any of Examples 27-30, and wherein the circuitry is further to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 32 includes the subject matter of any of Examples 27-31, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 33 includes the subject matter of any of Examples 27-32, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 34 includes the subject matter of any of Examples 27-33, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 35 includes the subject matter of any of Examples 27-34, and wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
  • Example 36 includes the subject matter of any of Examples 27-35, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
  • Example 37 includes the subject matter of any of Examples 27-36, and wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
  • Example 38 includes the subject matter of any of Examples 27-37, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
  • Example 39 includes the subject matter of any of Examples 27-38, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Human Computer Interaction (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Security & Cryptography (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Quality & Reliability (AREA)
  • Computational Linguistics (AREA)
  • Mathematical Physics (AREA)
  • Thermal Sciences (AREA)
  • Computing Systems (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • Environmental & Geological Engineering (AREA)
  • Cooling Or The Like Of Electrical Apparatus (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Multi Processors (AREA)
  • Robotics (AREA)
  • Power Engineering (AREA)
  • Mechanical Engineering (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Debugging And Monitoring (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Small-Scale Networks (AREA)
  • Storage Device Security (AREA)
  • Optical Communication System (AREA)

Abstract

Technologies for providing efficient sharing of encrypted data in a disaggregated architecture include a sled. The sled includes a set of memory devices and a controller connected to the set of memory devices. The memory controller is to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application. The data set is encrypted in one or more of the memory devices. Additionally, the controller is to determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set. Further, the controller is to send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • The present application claims the benefit of Indian Provisional Patent Application No. 201741030632, filed Aug. 30, 2017 and U.S. Provisional Patent Application No. 62/584,401, filed Nov. 10, 2017.
  • BACKGROUND
  • Large data centers may deploy thousands of virtual machines (VMs) to execute applications on behalf of customers (e.g., tenants). The applications, in operation, may access data from numerous sources during the performance of various functions (e.g., convolution operations, data compression or decompression operations, packet inspection operations, etc.). Increasingly, in such data centers, the data is encrypted on a per-VM or per-tenant basis to secure the data from being accessed maliciously by other users of the data center. However, when data is to be copied between VMs, the copy operation may incur significant overhead, including additional time, memory, and compute resources for decrypting the data used by one VM, performing a bit-for-bit transfer of the data to another memory location used by another VM, and re-encrypting the data for use by the other VM.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The concepts described herein are illustrated by way of example and not by way of limitation in the accompanying figures. For simplicity and clarity of illustration, elements illustrated in the figures are not necessarily drawn to scale. Where considered appropriate, reference labels have been repeated among the figures to indicate corresponding or analogous elements.
  • FIG. 1 is a simplified diagram of at least one embodiment of a data center for executing workloads with disaggregated resources;
  • FIG. 2 is a simplified diagram of at least one embodiment of a pod that may be included in the data center of FIG. 1;
  • FIG. 3 is a perspective view of at least one embodiment of a rack that may be included in the pod of FIG. 2;
  • FIG. 4 is a side elevation view of the rack of FIG. 3;
  • FIG. 5 is a perspective view of the rack of FIG. 3 having a sled mounted therein;
  • FIG. 6 is a is a simplified block diagram of at least one embodiment of a top side of the sled of FIG. 5;
  • FIG. 7 is a simplified block diagram of at least one embodiment of a bottom side of the sled of FIG. 6;
  • FIG. 8 is a simplified block diagram of at least one embodiment of a compute sled usable in the data center of FIG. 1;
  • FIG. 9 is a top perspective view of at least one embodiment of the compute sled of FIG. 8;
  • FIG. 10 is a simplified block diagram of at least one embodiment of an accelerator sled usable in the data center of FIG. 1;
  • FIG. 11 is a top perspective view of at least one embodiment of the accelerator sled of FIG. 10;
  • FIG. 12 is a simplified block diagram of at least one embodiment of a storage sled usable in the data center of FIG. 1;
  • FIG. 13 is a top perspective view of at least one embodiment of the storage sled of FIG. 12;
  • FIG. 14 is a simplified block diagram of at least one embodiment of a memory sled usable in the data center of FIG. 1;
  • FIG. 15 is a simplified block diagram of a system that may be established within the data center of FIG. 1 to execute workloads with managed nodes composed of disaggregated resources;
  • FIG. 16 is a simplified block diagram of at least one embodiment of a system for providing efficient sharing of encrypted data in a disaggregated architecture; and
  • FIGS. 17-20 are a simplified block diagram of at least one embodiment of a method for providing efficient sharing of encrypted data that may be performed by a memory sled of FIG. 16.
  • DETAILED DESCRIPTION OF THE DRAWINGS
  • While the concepts of the present disclosure are susceptible to various modifications and alternative forms, specific embodiments thereof have been shown by way of example in the drawings and will be described herein in detail. It should be understood, however, that there is no intent to limit the concepts of the present disclosure to the particular forms disclosed, but on the contrary, the intention is to cover all modifications, equivalents, and alternatives consistent with the present disclosure and the appended claims.
  • References in the specification to “one embodiment,” “an embodiment,” “an illustrative embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may or may not necessarily include that particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to effect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described. Additionally, it should be appreciated that items included in a list in the form of “at least one A, B, and C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C). Similarly, items listed in the form of “at least one of A, B, or C” can mean (A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C).
  • The disclosed embodiments may be implemented, in some cases, in hardware, firmware, software, or any combination thereof. The disclosed embodiments may also be implemented as instructions carried by or stored on a transitory or non-transitory machine-readable (e.g., computer-readable) storage medium, which may be read and executed by one or more processors. A machine-readable storage medium may be embodied as any storage device, mechanism, or other physical structure for storing or transmitting information in a form readable by a machine (e.g., a volatile or non-volatile memory, a media disc, or other media device).
  • In the drawings, some structural or method features may be shown in specific arrangements and/or orderings. However, it should be appreciated that such specific arrangements and/or orderings may not be required. Rather, in some embodiments, such features may be arranged in a different manner and/or order than shown in the illustrative figures. Additionally, the inclusion of a structural or method feature in a particular figure is not meant to imply that such feature is required in all embodiments and, in some embodiments, may not be included or may be combined with other features.
  • Referring now to FIG. 1, a data center 100 in which disaggregated resources may cooperatively execute one or more workloads (e.g., applications on behalf of customers) includes multiple pods 110, 120, 130, 140, each of which includes one or more rows of racks. Of course, although data center 100 is shown with multiple pods, in some embodiments, the data center 100 may be embodied as a single pod. As described in more detail herein, each rack houses multiple sleds, each of which may be primarily equipped with a particular type of resource (e.g., memory devices, data storage devices, accelerator devices, general purpose processors), i.e., resources that can be logically coupled to form a composed node, which can act as, for example, a server. In the illustrative embodiment, the sleds in each pod 110, 120, 130, 140 are connected to multiple pod switches (e.g., switches that route data communications to and from sleds within the pod). The pod switches, in turn, connect with spine switches 150 that switch communications among pods (e.g., the pods 110, 120, 130, 140) in the data center 100. In some embodiments, the sleds may be connected with a fabric using Intel Omni-Path technology. In other embodiments, the sleds may be connected with other fabrics, such as InfiniBand or Ethernet. As described in more detail herein, resources within sleds in the data center 100 may be allocated to a group (referred to herein as a “managed node”) containing resources from one or more sleds to be collectively utilized in the execution of a workload. The workload can execute as if the resources belonging to the managed node were located on the same sled. The resources in a managed node may belong to sleds belonging to different racks, and even to different pods 110, 120, 130, 140. As such, some resources of a single sled may be allocated to one managed node while other resources of the same sled are allocated to a different managed node (e.g., one processor assigned to one managed node and another processor of the same sled assigned to a different managed node).
  • A data center comprising disaggregated resources, such as data center 100, can be used in a wide variety of contexts, such as enterprise, government, cloud service provider, and communications service provider (e.g., Telco's), as well in a wide variety of sizes, from cloud service provider mega-data centers that consume over 100,000 sq. ft. to single- or multi-rack installations for use in base stations.
  • The disaggregation of resources to sleds comprised predominantly of a single type of resource (e.g., compute sleds comprising primarily compute resources, memory sleds containing primarily memory resources), and the selective allocation and deallocation of the disaggregated resources to form a managed node assigned to execute a workload improves the operation and resource usage of the data center 100 relative to typical data centers comprised of hyperconverged servers containing compute, memory, storage and perhaps additional resources in a single chassis. For example, because sleds predominantly contain resources of a particular type, resources of a given type can be upgraded independently of other resources. Additionally, because different resources types (processors, storage, accelerators, etc.) typically have different refresh rates, greater resource utilization and reduced total cost of ownership may be achieved. For example, a data center operator can upgrade the processors throughout their facility by only swapping out the compute sleds. In such a case, accelerator and storage resources may not be contemporaneously upgraded and, rather, may be allowed to continue operating until those resources are scheduled for their own refresh. Resource utilization may also increase. For example, if managed nodes are composed based on requirements of the workloads that will be running on them, resources within a node are more likely to be fully utilized. Such utilization may allow for more managed nodes to run in a data center with a given set of resources, or for a data center expected to run a given set of workloads, to be built using fewer resources.
  • Referring now to FIG. 2, the pod 110, in the illustrative embodiment, includes a set of rows 200, 210, 220, 230 of racks 240. Each rack 240 may house multiple sleds (e.g., sixteen sleds) and provide power and data connections to the housed sleds, as described in more detail herein. In the illustrative embodiment, the racks in each row 200, 210, 220, 230 are connected to multiple pod switches 250, 260. The pod switch 250 includes a set of ports 252 to which the sleds of the racks of the pod 110 are connected and another set of ports 254 that connect the pod 110 to the spine switches 150 to provide connectivity to other pods in the data center 100. Similarly, the pod switch 260 includes a set of ports 262 to which the sleds of the racks of the pod 110 are connected and a set of ports 264 that connect the pod 110 to the spine switches 150. As such, the use of the pair of switches 250, 260 provides an amount of redundancy to the pod 110. For example, if either of the switches 250, 260 fails, the sleds in the pod 110 may still maintain data communication with the remainder of the data center 100 (e.g., sleds of other pods) through the other switch 250, 260. Furthermore, in the illustrative embodiment, the switches 150, 250, 260 may be embodied as dual-mode optical switches, capable of routing both Ethernet protocol communications carrying Internet Protocol (IP) packets and communications according to a second, high-performance link-layer protocol (e.g., Intel's Omni-Path Architecture's, InfiniBand, PCI Express) via optical signaling media of an optical fabric.
  • It should be appreciated that each of the other pods 120, 130, 140 (as well as any additional pods of the data center 100) may be similarly structured as, and have components similar to, the pod 110 shown in and described in regard to FIG. 2 (e.g., each pod may have rows of racks housing multiple sleds as described above). Additionally, while two pod switches 250, 260 are shown, it should be understood that in other embodiments, each pod 110, 120, 130, 140 may be connected to a different number of pod switches, providing even more failover capacity. Of course, in other embodiments, pods may be arranged differently than the rows-of-racks configuration shown in FIGS. 1-2. For example, a pod may be embodied as multiple sets of racks in which each set of racks is arranged radially, i.e., the racks are equidistant from a center switch.
  • Referring now to FIGS. 3-5, each illustrative rack 240 of the data center 100 includes two elongated support posts 302, 304, which are arranged vertically. For example, the elongated support posts 302, 304 may extend upwardly from a floor of the data center 100 when deployed. The rack 240 also includes one or more horizontal pairs 310 of elongated support arms 312 (identified in FIG. 3 via a dashed ellipse) configured to support a sled of the data center 100 as discussed below. One elongated support arm 312 of the pair of elongated support arms 312 extends outwardly from the elongated support post 302 and the other elongated support arm 312 extends outwardly from the elongated support post 304.
  • In the illustrative embodiments, each sled of the data center 100 is embodied as a chassis-less sled. That is, each sled has a chassis-less circuit board substrate on which physical resources (e.g., processors, memory, accelerators, storage, etc.) are mounted as discussed in more detail below. As such, the rack 240 is configured to receive the chassis-less sleds. For example, each pair 310 of elongated support arms 312 defines a sled slot 320 of the rack 240, which is configured to receive a corresponding chassis-less sled. To do so, each illustrative elongated support arm 312 includes a circuit board guide 330 configured to receive the chassis-less circuit board substrate of the sled. Each circuit board guide 330 is secured to, or otherwise mounted to, a top side 332 of the corresponding elongated support arm 312. For example, in the illustrative embodiment, each circuit board guide 330 is mounted at a distal end of the corresponding elongated support arm 312 relative to the corresponding elongated support post 302, 304. For clarity of the Figures, not every circuit board guide 330 may be referenced in each Figure.
  • Each circuit board guide 330 includes an inner wall that defines a circuit board slot 380 configured to receive the chassis-less circuit board substrate of a sled 400 when the sled 400 is received in the corresponding sled slot 320 of the rack 240. To do so, as shown in FIG. 4, a user (or robot) aligns the chassis-less circuit board substrate of an illustrative chassis-less sled 400 to a sled slot 320. The user, or robot, may then slide the chassis-less circuit board substrate forward into the sled slot 320 such that each side edge 414 of the chassis-less circuit board substrate is received in a corresponding circuit board slot 380 of the circuit board guides 330 of the pair 310 of elongated support arms 312 that define the corresponding sled slot 320 as shown in FIG. 4. By having robotically accessible and robotically manipulable sleds comprising disaggregated resources, each type of resource can be upgraded independently of each other and at their own optimized refresh rate. Furthermore, the sleds are configured to blindly mate with power and data communication cables in each rack 240, enhancing their ability to be quickly removed, upgraded, reinstalled, and/or replaced. As such, in some embodiments, the data center 100 may operate (e.g., execute workloads, undergo maintenance and/or upgrades, etc.) without human involvement on the data center floor. In other embodiments, a human may facilitate one or more maintenance or upgrade operations in the data center 100.
  • It should be appreciated that each circuit board guide 330 is dual sided. That is, each circuit board guide 330 includes an inner wall that defines a circuit board slot 380 on each side of the circuit board guide 330. In this way, each circuit board guide 330 can support a chassis-less circuit board substrate on either side. As such, a single additional elongated support post may be added to the rack 240 to turn the rack 240 into a two-rack solution that can hold twice as many sled slots 320 as shown in FIG. 3. The illustrative rack 240 includes seven pairs 310 of elongated support arms 312 that define a corresponding seven sled slots 320, each configured to receive and support a corresponding sled 400 as discussed above. Of course, in other embodiments, the rack 240 may include additional or fewer pairs 310 of elongated support arms 312 (i.e., additional or fewer sled slots 320). It should be appreciated that because the sled 400 is chassis-less, the sled 400 may have an overall height that is different than typical servers. As such, in some embodiments, the height of each sled slot 320 may be shorter than the height of a typical server (e.g., shorter than a single rank unit, “1 U”). That is, the vertical distance between each pair 310 of elongated support arms 312 may be less than a standard rack unit “1 U.” Additionally, due to the relative decrease in height of the sled slots 320, the overall height of the rack 240 in some embodiments may be shorter than the height of traditional rack enclosures. For example, in some embodiments, each of the elongated support posts 302, 304 may have a length of six feet or less. Again, in other embodiments, the rack 240 may have different dimensions. For example, in some embodiments, the vertical distance between each pair 310 of elongated support arms 312 may be greater than a standard rack until “1 U”. In such embodiments, the increased vertical distance between the sleds allows for larger heat sinks to be attached to the physical resources and for larger fans to be used (e.g., in the fan array 370 described below) for cooling each sled, which in turn can allow the physical resources to operate at increased power levels. Further, it should be appreciated that the rack 240 does not include any walls, enclosures, or the like. Rather, the rack 240 is an enclosure-less rack that is opened to the local environment. Of course, in some cases, an end plate may be attached to one of the elongated support posts 302, 304 in those situations in which the rack 240 forms an end-of-row rack in the data center 100.
  • In some embodiments, various interconnects may be routed upwardly or downwardly through the elongated support posts 302, 304. To facilitate such routing, each elongated support post 302, 304 includes an inner wall that defines an inner chamber in which interconnects may be located. The interconnects routed through the elongated support posts 302, 304 may be embodied as any type of interconnects including, but not limited to, data or communication interconnects to provide communication connections to each sled slot 320, power interconnects to provide power to each sled slot 320, and/or other types of interconnects.
  • The rack 240, in the illustrative embodiment, includes a support platform on which a corresponding optical data connector (not shown) is mounted. Each optical data connector is associated with a corresponding sled slot 320 and is configured to mate with an optical data connector of a corresponding sled 400 when the sled 400 is received in the corresponding sled slot 320. In some embodiments, optical connections between components (e.g., sleds, racks, and switches) in the data center 100 are made with a blind mate optical connection. For example, a door on each cable may prevent dust from contaminating the fiber inside the cable. In the process of connecting to a blind mate optical connector mechanism, the door is pushed open when the end of the cable approaches or enters the connector mechanism. Subsequently, the optical fiber inside the cable may enter a gel within the connector mechanism and the optical fiber of one cable comes into contact with the optical fiber of another cable within the gel inside the connector mechanism.
  • The illustrative rack 240 also includes a fan array 370 coupled to the cross-support arms of the rack 240. The fan array 370 includes one or more rows of cooling fans 372, which are aligned in a horizontal line between the elongated support posts 302, 304. In the illustrative embodiment, the fan array 370 includes a row of cooling fans 372 for each sled slot 320 of the rack 240. As discussed above, each sled 400 does not include any on-board cooling system in the illustrative embodiment and, as such, the fan array 370 provides cooling for each sled 400 received in the rack 240. Each rack 240, in the illustrative embodiment, also includes a power supply associated with each sled slot 320. Each power supply is secured to one of the elongated support arms 312 of the pair 310 of elongated support arms 312 that define the corresponding sled slot 320. For example, the rack 240 may include a power supply coupled or secured to each elongated support arm 312 extending from the elongated support post 302. Each power supply includes a power connector configured to mate with a power connector of the sled 400 when the sled 400 is received in the corresponding sled slot 320. In the illustrative embodiment, the sled 400 does not include any on-board power supply and, as such, the power supplies provided in the rack 240 supply power to corresponding sleds 400 when mounted to the rack 240. Each power supply is configured to satisfy the power requirements for its associated sled, which can vary from sled to sled. Additionally, the power supplies provided in the rack 240 can operate independent of each other. That is, within a single rack, a first power supply providing power to a compute sled can provide power levels that are different than power levels supplied by a second power supply providing power to an accelerator sled. The power supplies may be controllable at the sled level or rack level, and may be controlled locally by components on the associated sled or remotely, such as by another sled or an orchestrator.
  • Referring now to FIG. 6, the sled 400, in the illustrative embodiment, is configured to be mounted in a corresponding rack 240 of the data center 100 as discussed above. In some embodiments, each sled 400 may be optimized or otherwise configured for performing particular tasks, such as compute tasks, acceleration tasks, data storage tasks, etc. For example, the sled 400 may be embodied as a compute sled 800 as discussed below in regard to FIGS. 8-9, an accelerator sled 1000 as discussed below in regard to FIGS. 10-11, a storage sled 1200 as discussed below in regard to FIGS. 12-13, or as a sled optimized or otherwise configured to perform other specialized tasks, such as a memory sled 1400, discussed below in regard to FIG. 14.
  • As discussed above, the illustrative sled 400 includes a chassis-less circuit board substrate 602, which supports various physical resources (e.g., electrical components) mounted thereon. It should be appreciated that the circuit board substrate 602 is “chassis-less” in that the sled 400 does not include a housing or enclosure. Rather, the chassis-less circuit board substrate 602 is open to the local environment. The chassis-less circuit board substrate 602 may be formed from any material capable of supporting the various electrical components mounted thereon. For example, in an illustrative embodiment, the chassis-less circuit board substrate 602 is formed from an FR-4 glass-reinforced epoxy laminate material. Of course, other materials may be used to form the chassis-less circuit board substrate 602 in other embodiments.
  • As discussed in more detail below, the chassis-less circuit board substrate 602 includes multiple features that improve the thermal cooling characteristics of the various electrical components mounted on the chassis-less circuit board substrate 602. As discussed, the chassis-less circuit board substrate 602 does not include a housing or enclosure, which may improve the airflow over the electrical components of the sled 400 by reducing those structures that may inhibit air flow. For example, because the chassis-less circuit board substrate 602 is not positioned in an individual housing or enclosure, there is no vertically-arranged backplane (e.g., a backplate of the chassis) attached to the chassis-less circuit board substrate 602, which could inhibit air flow across the electrical components. Additionally, the chassis-less circuit board substrate 602 has a geometric shape configured to reduce the length of the airflow path across the electrical components mounted to the chassis-less circuit board substrate 602. For example, the illustrative chassis-less circuit board substrate 602 has a width 604 that is greater than a depth 606 of the chassis-less circuit board substrate 602. In one particular embodiment, for example, the chassis-less circuit board substrate 602 has a width of about 21 inches and a depth of about 9 inches, compared to a typical server that has a width of about 17 inches and a depth of about 39 inches. As such, an airflow path 608 that extends from a front edge 610 of the chassis-less circuit board substrate 602 toward a rear edge 612 has a shorter distance relative to typical servers, which may improve the thermal cooling characteristics of the sled 400. Furthermore, although not illustrated in FIG. 6, the various physical resources mounted to the chassis-less circuit board substrate 602 are mounted in corresponding locations such that no two substantively heat-producing electrical components shadow each other as discussed in more detail below. That is, no two electrical components, which produce appreciable heat during operation (i.e., greater than a nominal heat sufficient enough to adversely impact the cooling of another electrical component), are mounted to the chassis-less circuit board substrate 602 linearly in-line with each other along the direction of the airflow path 608 (i.e., along a direction extending from the front edge 610 toward the rear edge 612 of the chassis-less circuit board substrate 602).
  • As discussed above, the illustrative sled 400 includes one or more physical resources 620 mounted to a top side 650 of the chassis-less circuit board substrate 602. Although two physical resources 620 are shown in FIG. 6, it should be appreciated that the sled 400 may include one, two, or more physical resources 620 in other embodiments. The physical resources 620 may be embodied as any type of processor, controller, or other compute circuit capable of performing various tasks such as compute functions and/or controlling the functions of the sled 400 depending on, for example, the type or intended functionality of the sled 400. For example, as discussed in more detail below, the physical resources 620 may be embodied as high-performance processors in embodiments in which the sled 400 is embodied as a compute sled, as accelerator co-processors or circuits in embodiments in which the sled 400 is embodied as an accelerator sled, storage controllers in embodiments in which the sled 400 is embodied as a storage sled, or a set of memory devices in embodiments in which the sled 400 is embodied as a memory sled.
  • The sled 400 also includes one or more additional physical resources 630 mounted to the top side 650 of the chassis-less circuit board substrate 602. In the illustrative embodiment, the additional physical resources include a network interface controller (NIC) as discussed in more detail below. Of course, depending on the type and functionality of the sled 400, the physical resources 630 may include additional or other electrical components, circuits, and/or devices in other embodiments.
  • The physical resources 620 are communicatively coupled to the physical resources 630 via an input/output (1/0) subsystem 622. The I/O subsystem 622 may be embodied as circuitry and/or components to facilitate input/output operations with the physical resources 620, the physical resources 630, and/or other components of the sled 400. For example, the I/O subsystem 622 may be embodied as, or otherwise include, memory controller hubs, input/output control hubs, integrated sensor hubs, firmware devices, communication links (e.g., point-to-point links, bus links, wires, cables, waveguides, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations. In the illustrative embodiment, the I/O subsystem 622 is embodied as, or otherwise includes, a double data rate 4 (DDR4) data bus or a DDR5 data bus.
  • In some embodiments, the sled 400 may also include a resource-to-resource interconnect 624. The resource-to-resource interconnect 624 may be embodied as any type of communication interconnect capable of facilitating resource-to-resource communications. In the illustrative embodiment, the resource-to-resource interconnect 624 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622). For example, the resource-to-resource interconnect 624 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to resource-to-resource communications.
  • The sled 400 also includes a power connector 640 configured to mate with a corresponding power connector of the rack 240 when the sled 400 is mounted in the corresponding rack 240. The sled 400 receives power from a power supply of the rack 240 via the power connector 640 to supply power to the various electrical components of the sled 400. That is, the sled 400 does not include any local power supply (i.e., an on-board power supply) to provide power to the electrical components of the sled 400. The exclusion of a local or on-board power supply facilitates the reduction in the overall footprint of the chassis-less circuit board substrate 602, which may increase the thermal cooling characteristics of the various electrical components mounted on the chassis-less circuit board substrate 602 as discussed above. In some embodiments, voltage regulators are placed on a bottom side 750 (see FIG. 7) of the chassis-less circuit board substrate 602 directly opposite of the processors 820 (see FIG. 8), and power is routed from the voltage regulators to the processors 820 by vias extending through the circuit board substrate 602. Such a configuration provides an increased thermal budget, additional current and/or voltage, and better voltage control relative to typical printed circuit boards in which processor power is delivered from a voltage regulator, in part, by printed circuit traces.
  • In some embodiments, the sled 400 may also include mounting features 642 configured to mate with a mounting arm, or other structure, of a robot to facilitate the placement of the sled 600 in a rack 240 by the robot. The mounting features 642 may be embodied as any type of physical structures that allow the robot to grasp the sled 400 without damaging the chassis-less circuit board substrate 602 or the electrical components mounted thereto. For example, in some embodiments, the mounting features 642 may be embodied as non-conductive pads attached to the chassis-less circuit board substrate 602. In other embodiments, the mounting features may be embodied as brackets, braces, or other similar structures attached to the chassis-less circuit board substrate 602. The particular number, shape, size, and/or make-up of the mounting feature 642 may depend on the design of the robot configured to manage the sled 400.
  • Referring now to FIG. 7, in addition to the physical resources 630 mounted on the top side 650 of the chassis-less circuit board substrate 602, the sled 400 also includes one or more memory devices 720 mounted to a bottom side 750 of the chassis-less circuit board substrate 602. That is, the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board. The physical resources 620 are communicatively coupled to the memory devices 720 via the I/O subsystem 622. For example, the physical resources 620 and the memory devices 720 may be communicatively coupled by one or more vias extending through the chassis-less circuit board substrate 602. Each physical resource 620 may be communicatively coupled to a different set of one or more memory devices 720 in some embodiments. Alternatively, in other embodiments, each physical resource 620 may be communicatively coupled to each memory device 720.
  • The memory devices 720 may be embodied as any type of memory device capable of storing data for the physical resources 620 during operation of the sled 400, such as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory. Volatile memory may be a storage medium that requires power to maintain the state of data stored by the medium. Non-limiting examples of volatile memory may include various types of random access memory (RAM), such as dynamic random access memory (DRAM) or static random access memory (SRAM). One particular type of DRAM that may be used in a memory module is synchronous dynamic random access memory (SDRAM). In particular embodiments, DRAM of a memory component may comply with a standard promulgated by JEDEC, such as JESD79F for DDR SDRAM, JESD79-2F for DDR2 SDRAM, JESD79-3F for DDR3 SDRAM, JESD79-4A for DDR4 SDRAM, JESD209 for Low Power DDR (LPDDR), JESD209-2 for LPDDR2, JESD209-3 for LPDDR3, and JESD209-4 for LPDDR4. Such standards (and similar standards) may be referred to as DDR-based standards and communication interfaces of the storage devices that implement such standards may be referred to as DDR-based interfaces.
  • In one embodiment, the memory device is a block addressable memory device, such as those based on NAND or NOR technologies. A memory device may also include next-generation nonvolatile devices, such as Intel 3D XPoint™ memory or other byte addressable write-in-place nonvolatile memory devices. In one embodiment, the memory device may be or may include memory devices that use chalcogenide glass, multi-threshold level NAND flash memory, NOR flash memory, single or multi-level Phase Change Memory (PCM), a resistive memory, nanowire memory, ferroelectric transistor random access memory (FeTRAM), anti-ferroelectric memory, magnetoresistive random access memory (MRAM) memory that incorporates memristor technology, resistive memory including the metal oxide base, the oxygen vacancy base and the conductive bridge Random Access Memory (CB-RAM), or spin transfer torque (STT)-MRAM, a spintronic magnetic junction memory based device, a magnetic tunneling junction (MTJ) based device, a DW (Domain Wall) and SOT (Spin Orbit Transfer) based device, a thyristor based memory device, or a combination of any of the above, or other memory. The memory device may refer to the die itself and/or to a packaged memory product. In some embodiments, the memory device may comprise a transistor-less stackable cross point architecture in which memory cells sit at the intersection of word lines and bit lines and are individually addressable and in which bit storage is based on a change in bulk resistance.
  • Referring now to FIG. 8, in some embodiments, the sled 400 may be embodied as a compute sled 800. The compute sled 800 is optimized, or otherwise configured, to perform compute tasks. Of course, as discussed above, the compute sled 800 may rely on other sleds, such as acceleration sleds and/or storage sleds, to perform such compute tasks. The compute sled 800 includes various physical resources (e.g., electrical components) similar to the physical resources of the sled 400, which have been identified in FIG. 8 using the same reference numbers. The description of such components provided above in regard to FIGS. 6 and 7 applies to the corresponding components of the compute sled 800 and is not repeated herein for clarity of the description of the compute sled 800.
  • In the illustrative compute sled 800, the physical resources 620 are embodied as processors 820. Although only two processors 820 are shown in FIG. 8, it should be appreciated that the compute sled 800 may include additional processors 820 in other embodiments. Illustratively, the processors 820 are embodied as high-performance processors 820 and may be configured to operate at a relatively high power rating. Although the processors 820 generate additional heat operating at power ratings greater than typical processors (which operate at around 155-230 W), the enhanced thermal cooling characteristics of the chassis-less circuit board substrate 602 discussed above facilitate the higher power operation. For example, in the illustrative embodiment, the processors 820 are configured to operate at a power rating of at least 250 W. In some embodiments, the processors 820 may be configured to operate at a power rating of at least 350 W.
  • In some embodiments, the compute sled 800 may also include a processor-to-processor interconnect 842. Similar to the resource-to-resource interconnect 624 of the sled 400 discussed above, the processor-to-processor interconnect 842 may be embodied as any type of communication interconnect capable of facilitating processor-to-processor interconnect 842 communications. In the illustrative embodiment, the processor-to-processor interconnect 842 is embodied as a high-speed point-to-point interconnect (e.g., faster than the 110 subsystem 622). For example, the processor-to-processor interconnect 842 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • The compute sled 800 also includes a communication circuit 830. The illustrative communication circuit 830 includes a network interface controller (NIC) 832, which may also be referred to as a host fabric interface (HFI). The NIC 832 may be embodied as, or otherwise include, any type of integrated circuit, discrete circuits, controller chips, chipsets, add-in-boards, daughtercards, network interface cards, or other devices that may be used by the compute sled 800 to connect with another compute device (e.g., with other sleds 400). In some embodiments, the NIC 832 may be embodied as part of a system-on-a-chip (SoC) that includes one or more processors, or included on a multichip package that also contains one or more processors. In some embodiments, the NIC 832 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 832. In such embodiments, the local processor of the NIC 832 may be capable of performing one or more of the functions of the processors 820. Additionally or alternatively, in such embodiments, the local memory of the NIC 832 may be integrated into one or more components of the compute sled at the board level, socket level, chip level, and/or other levels.
  • The communication circuit 830 is communicatively coupled to an optical data connector 834. The optical data connector 834 is configured to mate with a corresponding optical data connector of the rack 240 when the compute sled 800 is mounted in the rack 240. Illustratively, the optical data connector 834 includes a plurality of optical fibers which lead from a mating surface of the optical data connector 834 to an optical transceiver 836. The optical transceiver 836 is configured to convert incoming optical signals from the rack-side optical data connector to electrical signals and to convert electrical signals to outgoing optical signals to the rack-side optical data connector. Although shown as forming part of the optical data connector 834 in the illustrative embodiment, the optical transceiver 836 may form a portion of the communication circuit 830 in other embodiments.
  • In some embodiments, the compute sled 800 may also include an expansion connector 840. In such embodiments, the expansion connector 840 is configured to mate with a corresponding connector of an expansion chassis-less circuit board substrate to provide additional physical resources to the compute sled 800. The additional physical resources may be used, for example, by the processors 820 during operation of the compute sled 800. The expansion chassis-less circuit board substrate may be substantially similar to the chassis-less circuit board substrate, 602 discussed above and may include various electrical components mounted thereto. The particular electrical components mounted to the expansion chassis-less circuit board substrate may depend on the intended functionality of the expansion chassis-less circuit board substrate. For example, the expansion chassis-less circuit board substrate may provide additional compute resources, memory resources, and/or storage resources. As such, the additional physical resources of the expansion chassis-less circuit board substrate may include, but is not limited to, processors, memory devices, storage devices, and/or accelerator circuits including, for example, field programmable gate arrays (FPGA), application-specific integrated circuits (ASICs), security co-processors, graphics processing units (GPUs), machine learning circuits, or other specialized processors, controllers, devices, and/or circuits.
  • Referring now to FIG. 9, an illustrative embodiment of the compute sled 800 is shown. As shown, the processors 820, communication circuit 830, and optical data connector 834 are mounted to the top side 650 of the chassis-less circuit board substrate 602. Any suitable attachment or mounting technology may be used to mount the physical resources of the compute sled 800 to the chassis-less circuit board substrate 602. For example, the various physical resources may be mounted in corresponding sockets (e.g., a processor socket), holders, or brackets. In some cases, some of the electrical components may be directly mounted to the chassis-less circuit board substrate 602 via soldering or similar techniques.
  • As discussed above, the individual processors 820 and communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other. In the illustrative embodiment, the processors 820 and communication circuit 830 are mounted in corresponding locations on the top side 650 of the chassis-less circuit board substrate 602 such that no two of those physical resources are linearly in-line with others along the direction of the airflow path 608. It should be appreciated that, although the optical data connector 834 is in-line with the communication circuit 830, the optical data connector 834 produces no or nominal heat during operation.
  • The memory devices 720 of the compute sled 800 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 400. Although mounted to the bottom side 750, the memory devices 720 are communicatively coupled to the processors 820 located on the top side 650 via the I/O subsystem 622. Because the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board, the memory devices 720 and the processors 820 may be communicatively coupled by one or more vias, connectors, or other mechanisms extending through the chassis-less circuit board substrate 602. Of course, each processor 820 may be communicatively coupled to a different set of one or more memory devices 720 in some embodiments. Alternatively, in other embodiments, each processor 820 may be communicatively coupled to each memory device 720. In some embodiments, the memory devices 720 may be mounted to one or more memory mezzanines on the bottom side of the chassis-less circuit board substrate 602 and may interconnect with a corresponding processor 820 through a ball-grid array.
  • Each of the processors 820 includes a heatsink 850 secured thereto. Due to the mounting of the memory devices 720 to the bottom side 750 of the chassis-less circuit board substrate 602 (as well as the vertical spacing of the sleds 400 in the corresponding rack 240), the top side 650 of the chassis-less circuit board substrate 602 includes additional “free” area or space that facilitates the use of heatsinks 850 having a larger size relative to traditional heatsinks used in typical servers. Additionally, due to the improved thermal cooling characteristics of the chassis-less circuit board substrate 602, none of the processor heatsinks 850 include cooling fans attached thereto. That is, each of the heatsinks 850 is embodied as a fan-less heatsink. In some embodiments, the heat sinks 850 mounted atop the processors 820 may overlap with the heat sink attached to the communication circuit 830 in the direction of the airflow path 608 due to their increased size, as illustratively suggested by FIG. 9.
  • Referring now to FIG. 10, in some embodiments, the sled 400 may be embodied as an accelerator sled 1000. The accelerator sled 1000 is configured, to perform specialized compute tasks, such as machine learning, encryption, hashing, or other computational-intensive task. In some embodiments, for example, a compute sled 800 may offload tasks to the accelerator sled 1000 during operation. The accelerator sled 1000 includes various components similar to components of the sled 400 and/or compute sled 800, which have been identified in FIG. 10 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the accelerator sled 1000 and is not repeated herein for clarity of the description of the accelerator sled 1000.
  • In the illustrative accelerator sled 1000, the physical resources 620 are embodied as accelerator circuits 1020. Although only two accelerator circuits 1020 are shown in FIG. 10, it should be appreciated that the accelerator sled 1000 may include additional accelerator circuits 1020 in other embodiments. For example, as shown in FIG. 11, the accelerator sled 1000 may include four accelerator circuits 1020 in some embodiments. The accelerator circuits 1020 may be embodied as any type of processor, co-processor, compute circuit, or other device capable of performing compute or processing operations. For example, the accelerator circuits 1020 may be embodied as, for example, field programmable gate arrays (FPGA), application-specific integrated circuits (ASICs), security co-processors, graphics processing units (GPUs), neuromorphic processor units, quantum computers, machine learning circuits, or other specialized processors, controllers, devices, and/or circuits.
  • In some embodiments, the accelerator sled 1000 may also include an accelerator-to-accelerator interconnect 1042. Similar to the resource-to-resource interconnect 624 of the sled 600 discussed above, the accelerator-to-accelerator interconnect 1042 may be embodied as any type of communication interconnect capable of facilitating accelerator-to-accelerator communications. In the illustrative embodiment, the accelerator-to-accelerator interconnect 1042 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622). For example, the accelerator-to-accelerator interconnect 1042 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications. In some embodiments, the accelerator circuits 1020 may be daisy-chained with a primary accelerator circuit 1020 connected to the NIC 832 and memory 720 through the I/O subsystem 622 and a secondary accelerator circuit 1020 connected to the NIC 832 and memory 720 through a primary accelerator circuit 1020.
  • Referring now to FIG. 11, an illustrative embodiment of the accelerator sled 1000 is shown. As discussed above, the accelerator circuits 1020, communication circuit 830, and optical data connector 834 are mounted to the top side 650 of the chassis-less circuit board substrate 602. Again, the individual accelerator circuits 1020 and communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other as discussed above. The memory devices 720 of the accelerator sled 1000 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 600. Although mounted to the bottom side 750, the memory devices 720 are communicatively coupled to the accelerator circuits 1020 located on the top side 650 via the I/O subsystem 622 (e.g., through vias). Further, each of the accelerator circuits 1020 may include a heatsink 1070 that is larger than a traditional heatsink used in a server. As discussed above with reference to the heatsinks 870, the heatsinks 1070 may be larger than traditional heatsinks because of the “free” area provided by the memory resources 720 being located on the bottom side 750 of the chassis-less circuit board substrate 602 rather than on the top side 650.
  • Referring now to FIG. 12, in some embodiments, the sled 400 may be embodied as a storage sled 1200. The storage sled 1200 is configured, to store data in a data storage 1250 local to the storage sled 1200. For example, during operation, a compute sled 800 or an accelerator sled 1000 may store and retrieve data from the data storage 1250 of the storage sled 1200. The storage sled 1200 includes various components similar to components of the sled 400 and/or the compute sled 800, which have been identified in FIG. 12 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the storage sled 1200 and is not repeated herein for clarity of the description of the storage sled 1200.
  • In the illustrative storage sled 1200, the physical resources 620 are embodied as storage controllers 1220. Although only two storage controllers 1220 are shown in FIG. 12, it should be appreciated that the storage sled 1200 may include additional storage controllers 1220 in other embodiments. The storage controllers 1220 may be embodied as any type of processor, controller, or control circuit capable of controlling the storage and retrieval of data into the data storage 1250 based on requests received via the communication circuit 830. In the illustrative embodiment, the storage controllers 1220 are embodied as relatively low-power processors or controllers. For example, in some embodiments, the storage controllers 1220 may be configured to operate at a power rating of about 75 watts.
  • In some embodiments, the storage sled 1200 may also include a controller-to-controller interconnect 1242. Similar to the resource-to-resource interconnect 624 of the sled 400 discussed above, the controller-to-controller interconnect 1242 may be embodied as any type of communication interconnect capable of facilitating controller-to-controller communications. In the illustrative embodiment, the controller-to-controller interconnect 1242 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622). For example, the controller-to-controller interconnect 1242 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications.
  • Referring now to FIG. 13, an illustrative embodiment of the storage sled 1200 is shown. In the illustrative embodiment, the data storage 1250 is embodied as, or otherwise includes, a storage cage 1252 configured to house one or more solid state drives (SSDs) 1254. To do so, the storage cage 1252 includes a number of mounting slots 1256, each of which is configured to receive a corresponding solid state drive 1254. Each of the mounting slots 1256 includes a number of drive guides 1258 that cooperate to define an access opening 1260 of the corresponding mounting slot 1256. The storage cage 1252 is secured to the chassis-less circuit board substrate 602 such that the access openings face away from (i.e., toward the front of) the chassis-less circuit board substrate 602. As such, solid state drives 1254 are accessible while the storage sled 1200 is mounted in a corresponding rack 204. For example, a solid state drive 1254 may be swapped out of a rack 240 (e.g., via a robot) while the storage sled 1200 remains mounted in the corresponding rack 240.
  • The storage cage 1252 illustratively includes sixteen mounting slots 1256 and is capable of mounting and storing sixteen solid state drives 1254. Of course, the storage cage 1252 may be configured to store additional or fewer solid state drives 1254 in other embodiments. Additionally, in the illustrative embodiment, the solid state drivers are mounted vertically in the storage cage 1252, but may be mounted in the storage cage 1252 in a different orientation in other embodiments. Each solid state drive 1254 may be embodied as any type of data storage device capable of storing long term data. To do so, the solid state drives 1254 may include volatile and non-volatile memory devices discussed above.
  • As shown in FIG. 13, the storage controllers 1220, the communication circuit 830, and the optical data connector 834 are illustratively mounted to the top side 650 of the chassis-less circuit board substrate 602. Again, as discussed above, any suitable attachment or mounting technology may be used to mount the electrical components of the storage sled 1200 to the chassis-less circuit board substrate 602 including, for example, sockets (e.g., a processor socket), holders, brackets, soldered connections, and/or other mounting or securing techniques.
  • As discussed above, the individual storage controllers 1220 and the communication circuit 830 are mounted to the top side 650 of the chassis-less circuit board substrate 602 such that no two heat-producing, electrical components shadow each other. For example, the storage controllers 1220 and the communication circuit 830 are mounted in corresponding locations on the top side 650 of the chassis-less circuit board substrate 602 such that no two of those electrical components are linearly in-line with each other along the direction of the airflow path 608.
  • The memory devices 720 of the storage sled 1200 are mounted to the bottom side 750 of the of the chassis-less circuit board substrate 602 as discussed above in regard to the sled 400. Although mounted to the bottom side 750, the memory devices 720 are communicatively coupled to the storage controllers 1220 located on the top side 650 via the I/O subsystem 622. Again, because the chassis-less circuit board substrate 602 is embodied as a double-sided circuit board, the memory devices 720 and the storage controllers 1220 may be communicatively coupled by one or more vias, connectors, or other mechanisms extending through the chassis-less circuit board substrate 602. Each of the storage controllers 1220 includes a heatsink 1270 secured thereto. As discussed above, due to the improved thermal cooling characteristics of the chassis-less circuit board substrate 602 of the storage sled 1200, none of the heatsinks 1270 include cooling fans attached thereto. That is, each of the heatsinks 1270 is embodied as a fan-less heatsink.
  • Referring now to FIG. 14, in some embodiments, the sled 400 may be embodied as a memory sled 1400. The storage sled 1400 is optimized, or otherwise configured, to provide other sleds 400 (e.g., compute sleds 800, accelerator sleds 1000, etc.) with access to a pool of memory (e.g., in two or more sets 1430, 1432 of memory devices 720) local to the memory sled 1200. For example, during operation, a compute sled 800 or an accelerator sled 1000 may remotely write to and/or read from one or more of the memory sets 1430, 1432 of the memory sled 1200 using a logical address space that maps to physical addresses in the memory sets 1430, 1432. The memory sled 1400 includes various components similar to components of the sled 400 and/or the compute sled 800, which have been identified in FIG. 14 using the same reference numbers. The description of such components provided above in regard to FIGS. 6, 7, and 8 apply to the corresponding components of the memory sled 1400 and is not repeated herein for clarity of the description of the memory sled 1400.
  • In the illustrative memory sled 1400, the physical resources 620 are embodied as memory controllers 1420. Although only two memory controllers 1420 are shown in FIG. 14, it should be appreciated that the memory sled 1400 may include additional memory controllers 1420 in other embodiments. The memory controllers 1420 may be embodied as any type of processor, controller, or control circuit capable of controlling the writing and reading of data into the memory sets 1430, 1432 based on requests received via the communication circuit 830. In the illustrative embodiment, each memory controller 1420 is connected to a corresponding memory set 1430, 1432 to write to and read from memory devices 720 within the corresponding memory set 1430, 1432 and enforce any permissions (e.g., read, write, etc.) associated with sled 400 that has sent a request to the memory sled 1400 to perform a memory access operation (e.g., read or write).
  • In some embodiments, the memory sled 1400 may also include a controller-to-controller interconnect 1442. Similar to the resource-to-resource interconnect 624 of the sled 400 discussed above, the controller-to-controller interconnect 1442 may be embodied as any type of communication interconnect capable of facilitating controller-to-controller communications. In the illustrative embodiment, the controller-to-controller interconnect 1442 is embodied as a high-speed point-to-point interconnect (e.g., faster than the I/O subsystem 622). For example, the controller-to-controller interconnect 1442 may be embodied as a QuickPath Interconnect (QPI), an UltraPath Interconnect (UPI), or other high-speed point-to-point interconnect dedicated to processor-to-processor communications. As such, in some embodiments, a memory controller 1420 may access, through the controller-to-controller interconnect 1442, memory that is within the memory set 1432 associated with another memory controller 1420. In some embodiments, a scalable memory controller is made of multiple smaller memory controllers, referred to herein as “chiplets”, on a memory sled (e.g., the memory sled 1400). The chiplets may be interconnected (e.g., using EMIB (Embedded Multi-Die Interconnect Bridge)). The combined chiplet memory controller may scale up to a relatively large number of memory controllers and I/O ports, (e.g., up to 16 memory channels). In some embodiments, the memory controllers 1420 may implement a memory interleave (e.g., one memory address is mapped to the memory set 1430, the next memory address is mapped to the memory set 1432, and the third address is mapped to the memory set 1430, etc.). The interleaving may be managed within the memory controllers 1420, or from CPU sockets (e.g., of the compute sled 800) across network links to the memory sets 1430, 1432, and may improve the latency associated with performing memory access operations as compared to accessing contiguous memory addresses from the same memory device.
  • Further, in some embodiments, the memory sled 1400 may be connected to one or more other sleds 400 (e.g., in the same rack 240 or an adjacent rack 240) through a waveguide, using the waveguide connector 1480. In the illustrative embodiment, the waveguides are 64 millimeter waveguides that provide 16 Rx (i.e., receive) lanes and 16 Tx (i.e., transmit) lanes. Each lane, in the illustrative embodiment, is either 16 GHz or 32 GHz. In other embodiments, the frequencies may be different. Using a waveguide may provide high throughput access to the memory pool (e.g., the memory sets 1430, 1432) to another sled (e.g., a sled 400 in the same rack 240 or an adjacent rack 240 as the memory sled 1400) without adding to the load on the optical data connector 834.
  • Referring now to FIG. 15, a system for executing one or more workloads (e.g., applications) may be implemented in accordance with the data center 100. In the illustrative embodiment, the system 1510 includes an orchestrator server 1520, which may be embodied as a managed node comprising a compute device (e.g., a processor 820 on a compute sled 800) executing management software (e.g., a cloud operating environment, such as OpenStack) that is communicatively coupled to multiple sleds 400 including a large number of compute sleds 1530 (e.g., each similar to the compute sled 800), memory sleds 1540 (e.g., each similar to the memory sled 1400), accelerator sleds 1550 (e.g., each similar to the memory sled 1000), and storage sleds 1560 (e.g., each similar to the storage sled 1200). One or more of the sleds 1530, 1540, 1550, 1560 may be grouped into a managed node 1570, such as by the orchestrator server 1520, to collectively perform a workload (e.g., an application 1532 executed in a virtual machine or in a container). The managed node 1570 may be embodied as an assembly of physical resources 620, such as processors 820, memory resources 720, accelerator circuits 1020, or data storage 1250, from the same or different sleds 400. Further, the managed node may be established, defined, or “spun up” by the orchestrator server 1520 at the time a workload is to be assigned to the managed node or at any other time, and may exist regardless of whether any workloads are presently assigned to the managed node. In the illustrative embodiment, the orchestrator server 1520 may selectively allocate and/or deallocate physical resources 620 from the sleds 400 and/or add or remove one or more sleds 400 from the managed node 1570 as a function of quality of service (QoS) targets (e.g., performance targets associated with a throughput, latency, instructions per second, etc.) associated with a service level agreement for the workload (e.g., the application 1532). In doing so, the orchestrator server 1520 may receive telemetry data indicative of performance conditions (e.g., throughput, latency, instructions per second, etc.) in each sled 400 of the managed node 1570 and compare the telemetry data to the quality of service targets to determine whether the quality of service targets are being satisfied. The orchestrator server 1520 may additionally determine whether one or more physical resources may be deallocated from the managed node 1570 while still satisfying the QoS targets, thereby freeing up those physical resources for use in another managed node (e.g., to execute a different workload). Alternatively, if the QoS targets are not presently satisfied, the orchestrator server 1520 may determine to dynamically allocate additional physical resources to assist in the execution of the workload (e.g., the application 1532) while the workload is executing. Similarly, the orchestrator server 1520 may determine to dynamically deallocate physical resources from a managed node if the orchestrator server 1520 determines that deallocating the physical resource would result in QoS targets still being met.
  • Additionally, in some embodiments, the orchestrator server 1520 may identify trends in the resource utilization of the workload (e.g., the application 1532), such as by identifying phases of execution (e.g., time periods in which different operations, each having different resource utilizations characteristics, are performed) of the workload (e.g., the application 1532) and pre-emptively identifying available resources in the data center 100 and allocating them to the managed node 1570 (e.g., within a predefined time period of the associated phase beginning). In some embodiments, the orchestrator server 1520 may model performance based on various latencies and a distribution scheme to place workloads among compute sleds and other resources (e.g., accelerator sleds, memory sleds, storage sleds) in the data center 100. For example, the orchestrator server 1520 may utilize a model that accounts for the performance of resources on the sleds 400 (e.g., FPGA performance, memory access latency, etc.) and the performance (e.g., congestion, latency, bandwidth) of the path through the network to the resource (e.g., FPGA). As such, the orchestrator server 1520 may determine which resource(s) should be used with which workloads based on the total latency associated with each potential resource available in the data center 100 (e.g., the latency associated with the performance of the resource itself in addition to the latency associated with the path through the network between the compute sled executing the workload and the sled 400 on which the resource is located).
  • In some embodiments, the orchestrator server 1520 may generate a map of heat generation in the data center 100 using telemetry data (e.g., temperatures, fan speeds, etc.) reported from the sleds 400 and allocate resources to managed nodes as a function of the map of heat generation and predicted heat generation associated with different workloads, to maintain a target temperature and heat distribution in the data center 100. Additionally or alternatively, in some embodiments, the orchestrator server 1520 may organize received telemetry data into a hierarchical model that is indicative of a relationship between the managed nodes (e.g., a spatial relationship such as the physical locations of the resources of the managed nodes within the data center 100 and/or a functional relationship, such as groupings of the managed nodes by the customers the managed nodes provide services for, the types of functions typically performed by the managed nodes, managed nodes that typically share or exchange workloads among each other, etc.). Based on differences in the physical locations and resources in the managed nodes, a given workload may exhibit different resource utilizations (e.g., cause a different internal temperature, use a different percentage of processor or memory capacity) across the resources of different managed nodes. The orchestrator server 1520 may determine the differences based on the telemetry data stored in the hierarchical model and factor the differences into a prediction of future resource utilization of a workload if the workload is reassigned from one managed node to another managed node, to accurately balance resource utilization in the data center 100.
  • To reduce the computational load on the orchestrator server 1520 and the data transfer load on the network, in some embodiments, the orchestrator server 1520 may send self-test information to the sleds 400 to enable each sled 400 to locally (e.g., on the sled 400) determine whether telemetry data generated by the sled 400 satisfies one or more conditions (e.g., an available capacity that satisfies a predefined threshold, a temperature that satisfies a predefined threshold, etc.). Each sled 400 may then report back a simplified result (e.g., yes or no) to the orchestrator server 1520, which the orchestrator server 1520 may utilize in determining the allocation of resources to managed nodes.
  • Referring now to FIG. 16, a system 1610 for providing efficient sharing of encrypted data in a disaggregated architecture includes an orchestrator server 1620 similar to the orchestrator server 1520, in communication with multiple sleds 1616, including a compute sled 1630 that executes applications 1650, 1652 (e.g., each a workload), similar to the application 1532, on behalf of a client device 1614. Similarly, another compute sled 1632 executes multiple applications 1654, 1656. Each application 1650, 1652, 1654, 1656 may be executed in a virtual machine (VM) and each application may be associated with a corresponding tenant (e.g., a customer of the system 1610 for whom applications are executed). The system 1610 additionally includes memory sleds 1640, 1642, each of which includes a memory controller 1670, 1672, similar to the memory controller 1420 of FIG. 14 and corresponding memory devices 1680, 1682, which are similar to the memory resources 720 of FIG. 7. In operation, one or more of the memory sleds 1640, 1642 (e.g., the memory sled 1640) coordinates the sharing (e.g., copying or moving) of data sets between applications 1650, 1652, 1654, and 1656 by providing, to an application that is to receive access to the data set, a handle to the data set that is to be shared, rather than performing a bit-for-bit transfer of the data set to the working memory of the receiving application. The data set, in the illustrative embodiment, is present in the memory devices 1680 and/or 1682. Moreover, in the illustrative embodiment, the data set, and all other data residing in the memory devices 1680, 1682 used by the applications 1650, 1652, 1654, 1656 is encrypted with a key that is associated with the application, the VM executing the application, and/or the tenant for whom the application is executed. As such, when a data set is to be shared across applications that use different encryption keys, the memory sled 1640 coordinates with an encryption key manager 1622 to provide the corresponding key to the application that is to receive access to the data set. The encryption key manager 1622 may be embodied as software or any circuitry (e.g., a co-processor, an application specific integrated circuit (ASIC), etc.) that selectively provides keys to applications to enable those applications to utilize (e.g., decrypted and/or encrypt) a corresponding data set. As indicated in FIG. 16, the encryption key manager 1622 may be hosted by one of the compute sleds 1630, 1632 executing the corresponding applications 1650, 1652, 1654, 1656, by the orchestrator server 1620, and/or by another compute sled 1634 that is dedicated to hosting the encryption key manager 1622. In other embodiments, the encryption key manager 1622 may be hosted on another sled 1616.
  • By sharing handles to encrypted data sets among different applications and selectively providing the corresponding keys to those applications, on an as needed basis, the system 1610 avoids the latency and processing overhead that would otherwise be incurred in performing bit-for-bit transfers of data sets between different applications and performing corresponding decryption (e.g., with one key) and re-encryption (e.g., with another key) operations with keys that are confined to each corresponding tenant, application, or VM. Further, and as described in more detail herein, by a using handle to a data set, which may be the entire working memory of a particular application, the memory sled 1640 may greatly increase the speed at which an application migration may occur (e.g., from one compute sled to another compute sled). The memory sled 1640 may also perform operations to move relatively infrequently used data sets to cold storage (e.g., infrequently used data storage devices on a data storage sled) and to store access control data (e.g., data indicative of credentials usable to access the data set) with the data set in the cold storage, as described in more detail herein. While the following description uses a memory sled 1640 as an example, it should be understood that the operations may alternatively be performed by a data storage sled 1560 and the corresponding non-volatile memory in the data storage 1250.
  • The orchestrator server 1620, the sleds 1616, and the client device 1614 are illustratively in communication via a network 1612, which may be embodied as any type of wired or wireless communication network, including global networks (e.g., the Internet), local area networks (LANs) or wide area networks (WANs), cellular networks (e.g., Global System for Mobile Communications (GSM), 3G, Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), etc.), digital subscriber line (DSL) networks, cable networks (e.g., coaxial networks, fiber networks, etc.), or any combination thereof.
  • Referring now to FIG. 17, the memory sled 1640, in operation, may execute a method 1700 for providing efficient sharing of encrypted data (e.g., in the system 1610). The method 1700 begins with block 1702, in which the memory sled 1640 is powered on. In response to being powered on, the memory sled 1704 may detect any sleds 1616 that are compatible with the encrypted data sharing scheme described herein. For example, the memory sled 1640 may query other sleds (e.g., other memory sleds 1642) in the system 1610 to determine whether those sleds have memory devices 1682 that are configured to store encrypted data (e.g., in a shared pool) for one or more applications 1650, 1652, 1654, 1656. Further, as indicated in block 1706, the memory sled 1640 may map memory addresses of the available memory (e.g., memory devices 1680, 1682) of the present memory sled 1640 and other sleds 1616 (e.g., the memory sled 1642) that are compatible with the encrypted memory sharing scheme. In block 1708, the memory sled 1640 may move a cold data set (e.g., a relatively infrequently accessed file or other set of data) to cold storage (e.g., one or more data storage devices 1250 used for archiving data on a data storage sled 1560). In doing so, the memory sled 1640 may move, to cold storage, a data set that has not been accessed with at least a predefined frequency (e.g., at least once a week) over a predefined time period (e.g., one month), as indicated in block 1710. The memory sled 1640 may do so by sending the data set to the corresponding data storage sled 1560 for storage thereon. Further, in the illustrative embodiment, the memory sled 1640 causes the data storage sled 1560 to store, with the data set, access control data, which may be embodied as any data indicative of credentials (e.g., a key identifier, a list of identifiers of tenants allowed to access the data set, etc.) usable to access the data set, as indicated in block 1712.
  • In block 1714, the memory sled 1640 receives a data access request from another sled 1616 (e.g., a request initiated by the application 1650 executed by the compute sled 1630). As indicated in block 1716, the data access request may be a request to share (e.g., copy or move) a data set present in the memory 1680, 1682. For example, and as indicated in block 1718, the memory sled 1640 may receive a data access request to copy a data set between applications (e.g., copy a data set used by the application 1650 to the application 1654) or the memory sled 1640 may receive a data access request to move a data set between applications (e.g., from the application 1650 to the application 1654), as indicated in block 1720. As indicated in block 1722, the data access request may be to move the entire working data of an application that is to be migrated from one sled (e.g., the compute sled 1630) to another sled (e.g., the compute sled 1632). Alternatively, the data access request may be a request to write data, as indicated in block 1724 or may be a request to read data, as indicated in block 1726. In block 1728, the memory sled 1640 determines the subsequent course of action to take as a function of whether a data access request has been received by the memory sled 1640. If the memory sled 1640 has not received a memory access request, the method 1700 loops back to block 1704, in which the memory sled 1640 continues to detect sleds 1616 that are compatible with the efficient memory sharing scheme. Otherwise, the method 1700 advances to block 1730 of FIG. 18, in which the memory sled 1640 determines the subsequent actions to take based on whether the data access request is a data share request (e.g., a request to share a data set).
  • Referring now to FIG. 18, in response to a determination that the data access request is a data share request, the method 1700 advances to block 1732, in which the memory sled 1640 determines a key identifier (e.g., any data such as a number or alphanumeric code) that is associated with the data set to be shared and that uniquely identifies a key (e.g., a code) that is usable to perform cryptographic operations on the data set. In doing so, the memory sled 1640 may determine a key identifier associated with a memory address for the data share request, as indicated in block 1734. For example, and as indicated in block 1736, the memory sled 1640 may determine the memory address from a handle (e.g., data that uniquely identifies the data set) included in the data share request, as indicated in block 1736. In doing so, the memory sled 1640 may determine the memory address from a database that associates handles to memory addresses and the corresponding sleds on which the memory is located (e.g., an address corresponding to a section of a memory device 1682 of the memory sled 1642), as indicated in block 1738. As indicated in block 1740, in determining the key identifier, the memory sled 1640 may determine one or more memory addresses (e.g., a range of memory addresses) for the working memory of an application that is to be migrated from one compute sled (e.g., the compute sled 1630) to another compute sled (e.g., the compute sled 1632), which may have a more powerful processor or otherwise may be more suitable for the present operations of the application. In determining the key identifier, the memory sled 1640 may look up the key identifier in a database that associates memory addresses with key identifiers, as indicated in block 1742. As indicated in block 1744, the memory sled 1640 may determine the key identifier as a subset of the memory address (e.g., a subset of the highest order bits, a subset of the lowest order bits, etc.). Alternatively, the memory sled 1640 may obtain the key identifier from a predefined register or data structure associated with a compute sled of the requesting application (e.g., a model specific register of the compute sled 1630 executing the application 1650, a data structure present in a section of the memory 1680, 1682 utilized by the application 1650, etc.), as indicated in block 1746. Subsequently, the method 1700 advances to block 1748 of FIG. 19 in which the memory sled 1640 requests the corresponding key from an encryption key manager (e.g., the encryption key manager 1622).
  • Referring now to FIG. 19, in requesting the corresponding key from the encryption key manager 1622, the memory sled 1640 may send the key identifier (e.g., the key identifier determined in block 1732) in a request to the encryption key manager 1622, as indicated in block 1750. As indicated in block 1752, the memory sled 1640 may request a key that has been escrowed with the encryption key manager 1622 by a memory encryption engine (not shown) of the sled 1616 (e.g., the compute sled 1630) that sent the data share request to the memory sled 1640. In requesting the key, the memory sled 1640 may send the request to an encryption key manager 1622 hosted by the orchestrator server 1620, as indicated in block 1754. Alternatively, the encryption key manager 1622 may be hosted on a different sled. For example, and as indicated in block 1756, the memory sled 1640 may send the key request to an encryption key manager 1622 in a compute sled 1630, 1632 associated with the data share request (e.g., the data share request from block 1716). In doing so, the memory sled 1640 may send the key request to an encryption key manager 1622 hosted by a compute sled that is to share the data set, as indicated in block 1758. For example, if the application 1650, executed by the compute sled 1630, initiated the share request to share a data set with the application 1654, which is executed by the compute sled 1632, the memory sled 1640 may send the key request to the encryption key manager 1622 hosted by the compute sled 1630. Alternatively, and as indicated in block 1760, the memory sled 1640 may send the key request to an encryption key manager 1622 hosted by the compute sled that is to receive access to the data set, as indicated in block 1760. For example, in the scenario described above, the memory sled 1640 may send the key request to the compute sled 1632 executing the application 1654. In other embodiments, the encryption key manager 1622 may be hosted on a different sled than the compute sleds 1630, 1632 or the orchestrator server 1620, and instead may be hosted by a separate compute sled 1634 (e.g., a compute sled that is dedicated to hosting the encryption key manager 1622) for use in all data sharing operations in the rack, pod, or across the data center, as indicated in block 1762.
  • As indicated in block 1764, the memory sled 1640 may obtain the key from the encryption key manager 1622 and, in block 1766, may send the obtained key to the sled (e.g., the sled 1632) that is to access the data set to be shared. In doing so, the memory sled 1640 may send the obtained key to a target application (e.g., the application 1654, in the scenario described above) executed on the compute sled 1632, as indicated in block 1768. In other embodiments, the encryption key manager 1622 provides the requested key directly to the application that is to access the data set (e.g., rather than relaying the key through the memory sled 1640). Regardless, in block 1770, the memory sled 1640 sends, to the sled that is to access the data set, a handle associated with an address where the data set is physically located in the memory 1680, 1682. In the illustrative embodiment, the handle is a level of indirection away from the logical or physical address of where the data set resides in the memory 1680, 1682. As such, while the logical or physical address of the data set may change (e.g., as a result of the memory management operations carried out by one or more of the controllers 1670, 1672), the handle will still point to the data set (e.g., the handle will be remapped to the new address). Subsequently, the method 1700 loops hack to block 1704 of FIG. 17, in which the memory sled 1640 again detects any previously undetected sleds 1616 (e.g., sleds 1616 that have been added to the system 1610) that are compatible with the efficient memory sharing scheme.
  • Referring back to block 1730 of FIG. 18, if the data access request is not a data share request, the method 1700 instead advances to block 1772 of FIG. 20, in which the memory sled 1640 determines whether the request is a write request. If so, the method 1700 advances to block 1774, in which the memory sled 1640 determines whether the data set is presently shared by multiple tenants (e.g., the applications of different customers are concurrently accessing the same data set). If not, the method 1700 advances to block 1776, in which the memory sled 1776 writes data (e.g., an encrypted payload) from the write request to the data set identified in the write request (e.g., by a handle). Otherwise, if the data set is shared by multiple tenants, the method 1700 instead advances to block 1778 in which the memory sled 1640 forks the data set (e.g., makes a copy of the data set in the memory 1680, 1682), and writes the data (e.g., encrypted data) from the write request to the forked data set, as indicated in block 1780. Subsequently, in block 1782, the memory sled 1640 sends a handle associated with the forked data set to the requesting sled 1616 (e.g., the compute sled 1630) to be used by the requesting sled 1616 in place of the original handle (e.g., the handle that was included in the write request). Subsequently, the method 1700 loops back to block 1704, in which the memory sled 1640 detects any previously undetected sleds 1616 that are compatible with the efficient memory sharing scheme. Referring back to block 1772, if the data access request is not a write request (e.g., the data access request is a read request), the method 1700 advances to block 1784, in which the memory sled 1640 reads a data set at an address associated with a handle included in the read request. Subsequently, the memory sled 1640 sends the read data set (e.g., in its encrypted form) to the requesting sled (e.g., the compute sled 1630), as indicated in block 1786. Afterwards, the method 1700 loops back to block 1704, in which the memory sled 1640 again detects any previously undetected sleds 1616 that are compatible with the efficient memory sharing scheme.
  • EXAMPLES
  • Illustrative examples of the technologies disclosed herein are provided below. An embodiment of the technologies may include any one or more, and any combination of, the examples described below.
  • Example 1 includes a sled comprising a set of memory devices; and a controller connected to the set of memory devices, wherein the controller is to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 2 includes the subject matter of Example 1, and wherein the controller is further to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 3 includes the subject matter of any of Examples 1 and 2, and wherein the controller is further to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 4 includes the subject matter of any of Examples 1-3, and wherein sled is located in a data center and the controller is further map an address of memory that is present on at least one other sled in the data center.
  • Example 5 includes the subject matter of any of Examples 1-4, and wherein the controller is further to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 6 includes the subject matter of any of Examples 1-5, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 7 includes the subject matter of any of Examples 1-6, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 8 includes the subject matter of any of Examples 1-7, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 9 includes the subject matter of any of Examples 1-8, and wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
  • Example 10 includes the subject matter of any of Examples 1-9, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
  • Example 11 includes the subject matter of any of Examples 1-10, and wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
  • Example 12 includes the subject matter of any of Examples 1-11, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
  • Example 13 includes the subject matter of any of Examples 1-12, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.
  • Example 14 includes one or more non-transitory machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a sled to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 15 includes the subject matter of Example 14, and wherein, when executed, the plurality of instructions further cause the sled to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 16 includes the subject matter of any of Examples 14 and 15, and wherein, when executed, the plurality of instructions further cause the sled to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 17 includes the subject matter of any of Examples 14-16, and wherein the sled is located in a data center and wherein, when executed, the plurality of instructions further cause the sled to map an address of memory that is present on at least one other sled in the data center.
  • Example 18 includes the subject matter of any of Examples 14-17, and wherein, when executed, the plurality of instructions further cause the sled to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 19 includes the subject matter of any of Examples 14-18, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 20 includes the subject matter of any of Examples 14-19, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 21 includes the subject matter of any of Examples 14-20, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 22 includes a method comprising receiving, by a memory controller, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the memory controller; determining, by the memory controller and in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; sending, by the memory controller and to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and sending, by the memory controller and to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 23 includes the subject matter of Example 22, and further including determining, by the memory controller, whether the data set has been accessed with at least a predefined frequency over a predefined period of time; moving, by the memory controller and in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and storing, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 24 includes the subject matter of any of Examples 22 and 23, and further including receiving, by the memory controller, a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and sending, by the memory controller and to the second compute sled, a handle to the working data of the first application.
  • Example 25 includes the subject matter of any of Examples 22-24, and wherein the memory controller is in a sled that is located in a data center, the method further comprising mapping, by the memory controller, an address of memory that is present on at least one other sled in the data center.
  • Example 26 includes a sled comprising means for receiving, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled; means for determining, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; means for sending, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and means for sending, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 27 includes a controller connected to a set of memory devices, the controller comprising circuitry to receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices; determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set; send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
  • Example 28 includes the subject matter of Example 27, and wherein the circuitry is further to determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time; move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and store, with the data set, access control data indicative of credentials that are usable to access the data set.
  • Example 29 includes the subject matter of any of Examples 27 and 28, and wherein the circuitry is further to receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and send, to the second compute sled, a handle to the working data of the first application.
  • Example 30 includes the subject matter of any of Examples 27-29, and wherein the controller is located in a sled in a data center and the circuitry is further to map an address of memory that is present on at least one other sled in the data center.
  • Example 31 includes the subject matter of any of Examples 27-30, and wherein the circuitry is further to receive a write request to write data to the data set; determine, in response to the write request, whether the data set is shared by multiple applications; fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices; write the data from the write request to the forked data set; and send, in response to the write request, a handle to the forked data set.
  • Example 32 includes the subject matter of any of Examples 27-31, and wherein to determine the key identifier comprises to determine a memory address associated with a handle included in the data access request; and determine the key identifier as a function of the determined memory address.
  • Example 33 includes the subject matter of any of Examples 27-32, and wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
  • Example 34 includes the subject matter of any of Examples 27-33, and wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
  • Example 35 includes the subject matter of any of Examples 27-34, and wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
  • Example 36 includes the subject matter of any of Examples 27-35, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
  • Example 37 includes the subject matter of any of Examples 27-36, and wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
  • Example 38 includes the subject matter of any of Examples 27-37, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
  • Example 39 includes the subject matter of any of Examples 27-38, and wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.

Claims (39)

1. A sled comprising:
a set of memory devices; and
a controller connected to the set of memory devices, wherein the controller is to:
receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices;
determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set;
send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and
send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
2. The sled of claim 1, wherein the controller is further to:
determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time;
move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and
store, with the data set, access control data indicative of credentials that are usable to access the data set.
3. The sled of claim 1, wherein the controller is further to:
receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and
send, to the second compute sled, a handle to the working data of the first application.
4. The sled of claim 1, wherein sled is located in a data center and the controller is further map an address of memory that is present on at least one other sled in the data center.
5. The sled of claim 1, wherein the controller is further to:
receive a write request to write data to the data set;
determine, in response to the write request, whether the data set is shared by multiple applications;
fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices;
write the data from the write request to the forked data set; and
send, in response to the write request, a handle to the forked data set.
6. The sled of claim 1, wherein to determine the key identifier comprises to:
determine a memory address associated with a handle included in the data access request; and
determine the key identifier as a function of the determined memory address.
7. The sled of claim 6, wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
8. The sled of claim 6, wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
9. The sled of claim 1, wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
10. The sled of claim 1, wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
11. The sled of claim 10, wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
12. The sled of claim 10, wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
13. The sled of claim 10, wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.
14. One or more non-transitory machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a sled to:
receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled;
determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set;
send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and
send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
15. The one or more non-transitory machine-readable storage media of claim 14, wherein, when executed, the plurality of instructions further cause the sled to:
determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time;
move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and
store, with the data set, access control data indicative of credentials that are usable to access the data set.
16. The one or more non-transitory machine-readable storage media of claim 14, wherein, when executed, the plurality of instructions further cause the sled to:
receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and
send, to the second compute sled, a handle to the working data of the first application.
17. The one or more non-transitory machine-readable storage media of claim 14, wherein the sled is located in a data center and wherein, when executed, the plurality of instructions further cause the sled to map an address of memory that is present on at least one other sled in the data center.
18. The one or more non-transitory machine-readable storage media of claim 14, wherein, when executed, the plurality of instructions further cause the sled to:
receive a write request to write data to the data set;
determine, in response to the write request, whether the data set is shared by multiple applications;
fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices;
write the data from the write request to the forked data set; and
send, in response to the write request, a handle to the forked data set.
19. The one or more non-transitory machine-readable storage media of claim 14, wherein to determine the key identifier comprises to:
determine a memory address associated with a handle included in the data access request; and
determine the key identifier as a function of the determined memory address.
20. The one or more non-transitory machine-readable storage media of claim 19, wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
21. The one or more non-transitory machine-readable storage media of claim 19, wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
22. A method comprising:
receiving, by a memory controller, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the memory controller;
determining, by the memory controller and in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set;
sending, by the memory controller and to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and
sending, by the memory controller and to the second application, a handle associated with an address in the set of memory devices where the data set is located.
23. The method of claim 22, further comprising:
determining, by the memory controller, whether the data set has been accessed with at least a predefined frequency over a predefined period of time;
moving, by the memory controller and in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and
storing, with the data set, access control data indicative of credentials that are usable to access the data set.
24. The method of claim 22, further comprising:
receiving, by the memory controller, a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and
sending, by the memory controller and to the second compute sled, a handle to the working data of the first application.
25. The method of claim 22, wherein the memory controller is in a sled that is located in a data center, the method further comprising mapping, by the memory controller, an address of memory that is present on at least one other sled in the data center.
26. A sled comprising:
means for receiving, from a first application executed by a compute device, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more memory devices of a set of memory devices connected to the sled;
means for determining, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set;
means for sending, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and
means for sending, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
27. A controller connected to a set of memory devices, the controller comprising:
circuitry to:
receive, from a first application executed by a compute sled, a data access request to share a data set between the first application and a second application, wherein the data set is encrypted in one or more of the memory devices;
determine, in response to the data access request, a key identifier that uniquely identifies a key that is usable to perform cryptographic operations on the data set;
send, to an encryption key manager, a request to provide the key corresponding to the key identifier to be used by the second application to decrypt the data set; and
send, to the second application, a handle associated with an address in the set of memory devices where the data set is located.
28. The controller of claim 27, wherein the circuitry is further to:
determine whether the data set has been accessed with at least a predefined frequency over a predefined period of time;
move, in response to a determination that the data set has not been accessed with at least the predefined frequency over the predefined period of time, the data set to a data storage device; and
store, with the data set, access control data indicative of credentials that are usable to access the data set.
29. The controller of claim 27, wherein the circuitry is further to:
receive a request to migrate working data of the first application, wherein the first application is to be moved from a first compute sled to a second compute sled; and
send, to the second compute sled, a handle to the working data of the first application.
30. The controller of claim 27, wherein the controller is located in a sled in a data center and the circuitry is further to map an address of memory that is present on at least one other sled in the data center.
31. The controller of claim 27, wherein the circuitry is further to:
receive a write request to write data to the data set;
determine, in response to the write request, whether the data set is shared by multiple applications;
fork, in response to a determination that the data set is shared by multiple applications, the data set to another location in the set of memory devices;
write the data from the write request to the forked data set; and
send, in response to the write request, a handle to the forked data set.
32. The controller of claim 27, wherein to determine the key identifier comprises to:
determine a memory address associated with a handle included in the data access request; and
determine the key identifier as a function of the determined memory address.
33. The controller of claim 32, wherein to determine the key identifier as a function of the determined memory address comprises to determine the key identifier as a subset of the memory address.
34. The controller of claim 32, wherein to determine the key identifier as a function of the determined memory address comprises to look up the key identifier in a database that associates memory addresses with key identifiers.
35. The controller of claim 27, wherein to determine the key identifier comprises obtain the key identifier from a predefined register or a data structure associated with a compute sled on which the first application is executed.
36. The controller of claim 27, wherein to send, to an encryption key manager, a request to provide the key comprises to send the key identifier with the request.
37. The controller of claim 36, wherein to send, to an encryption key manager, a request to provide the key comprises to send a request for a key that is escrowed with the encryption key manager by a memory encryption engine of a sled that sent the data access request.
38. The controller of claim 36, wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by a compute sled from which the data access request was received.
39. The controller of claim 36, wherein to send, to an encryption key manager, a request to provide the key comprises to send the request to an encryption key manager hosted by an orchestrator server.
US15/941,114 2017-08-30 2018-03-30 Technologies for providing efficient sharing of encrypted data in a disaggregated architecture Abandoned US20190052457A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/941,114 US20190052457A1 (en) 2017-08-30 2018-03-30 Technologies for providing efficient sharing of encrypted data in a disaggregated architecture

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
IN201741030632 2017-08-30
IN201741030632 2017-08-30
US201762584401P 2017-11-10 2017-11-10
US15/941,114 US20190052457A1 (en) 2017-08-30 2018-03-30 Technologies for providing efficient sharing of encrypted data in a disaggregated architecture

Publications (1)

Publication Number Publication Date
US20190052457A1 true US20190052457A1 (en) 2019-02-14

Family

ID=65037934

Family Applications (26)

Application Number Title Priority Date Filing Date
US15/833,523 Abandoned US20190044809A1 (en) 2017-08-30 2017-12-06 Technologies for managing a flexible host interface of a network interface controller
US15/856,220 Active 2038-02-10 US10554391B2 (en) 2017-08-30 2017-12-28 Technologies for dynamically allocating data storage capacity for different data storage types
US15/856,644 Expired - Fee Related US10728024B2 (en) 2017-08-30 2017-12-28 Technologies for providing runtime code in an option ROM
US15/856,858 Abandoned US20190034490A1 (en) 2017-08-30 2017-12-28 Technologies for structured database query
US15/856,173 Active 2038-03-05 US10469252B2 (en) 2017-08-30 2017-12-28 Technologies for efficiently managing allocation of memory in a shared memory pool
US15/856,556 Expired - Fee Related US10567166B2 (en) 2017-08-30 2017-12-28 Technologies for dividing memory across socket partitions
US15/858,569 Abandoned US20190042126A1 (en) 2017-08-30 2017-12-29 Technologies for storage discovery and reallocation
US15/859,391 Active 2040-06-07 US11249816B2 (en) 2017-08-30 2017-12-30 Pivot rack
US15/859,369 Active US10476670B2 (en) 2017-08-30 2017-12-30 Technologies for providing remote access to a shared memory pool
US15/859,387 Active 2039-08-29 US11050554B2 (en) 2017-08-30 2017-12-30 Technologies for managing exact match hash table growth
US15/859,367 Active 2038-05-02 US10581596B2 (en) 2017-08-30 2017-12-30 Technologies for managing errors in a remotely accessible memory pool
US15/868,492 Abandoned US20190042408A1 (en) 2017-08-30 2018-01-11 Technologies for interleaving memory across shared memory pools
US15/868,594 Abandoned US20190042611A1 (en) 2017-08-30 2018-01-11 Technologies for structured database query for finding unique element values
US15/912,733 Active 2039-08-23 US11025411B2 (en) 2017-08-30 2018-03-06 Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture
US15/922,493 Abandoned US20190042090A1 (en) 2017-08-30 2018-03-15 Technologies for separating control plane management from data plane management for distributed storage in a disaggregated architecture
US15/922,502 Abandoned US20190042091A1 (en) 2017-08-30 2018-03-15 Technologies for providing efficient distributed data storage in a disaggregated architecture
US15/941,114 Abandoned US20190052457A1 (en) 2017-08-30 2018-03-30 Technologies for providing efficient sharing of encrypted data in a disaggregated architecture
US16/045,345 Active US10756886B2 (en) 2017-08-30 2018-07-25 Technologies for load balancing a network
US17/001,502 Active 2038-09-30 US11588624B2 (en) 2017-08-30 2020-08-24 Technologies for load balancing a network
US17/332,733 Active 2038-03-14 US11522682B2 (en) 2017-08-30 2021-05-27 Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture
US17/344,253 Active 2038-08-11 US11843691B2 (en) 2017-08-30 2021-06-10 Technologies for managing a flexible host interface of a network interface controller
US17/391,549 Abandoned US20220012105A1 (en) 2017-08-30 2021-08-02 Technologies for allocating resources across data centers
US17/871,429 Active 2038-04-02 US11888967B2 (en) 2017-08-30 2022-07-22 Technologies for dynamic accelerator selection
US18/238,096 Pending US20230421358A1 (en) 2017-08-30 2023-08-25 Technologies for allocating resources across data centers
US18/241,748 Pending US20230412365A1 (en) 2017-08-30 2023-09-01 Technologies for managing a flexible host interface of a network interface controller
US18/542,308 Pending US20240195605A1 (en) 2017-08-30 2023-12-15 Technologies for dynamic accelerator selection

Family Applications Before (16)

Application Number Title Priority Date Filing Date
US15/833,523 Abandoned US20190044809A1 (en) 2017-08-30 2017-12-06 Technologies for managing a flexible host interface of a network interface controller
US15/856,220 Active 2038-02-10 US10554391B2 (en) 2017-08-30 2017-12-28 Technologies for dynamically allocating data storage capacity for different data storage types
US15/856,644 Expired - Fee Related US10728024B2 (en) 2017-08-30 2017-12-28 Technologies for providing runtime code in an option ROM
US15/856,858 Abandoned US20190034490A1 (en) 2017-08-30 2017-12-28 Technologies for structured database query
US15/856,173 Active 2038-03-05 US10469252B2 (en) 2017-08-30 2017-12-28 Technologies for efficiently managing allocation of memory in a shared memory pool
US15/856,556 Expired - Fee Related US10567166B2 (en) 2017-08-30 2017-12-28 Technologies for dividing memory across socket partitions
US15/858,569 Abandoned US20190042126A1 (en) 2017-08-30 2017-12-29 Technologies for storage discovery and reallocation
US15/859,391 Active 2040-06-07 US11249816B2 (en) 2017-08-30 2017-12-30 Pivot rack
US15/859,369 Active US10476670B2 (en) 2017-08-30 2017-12-30 Technologies for providing remote access to a shared memory pool
US15/859,387 Active 2039-08-29 US11050554B2 (en) 2017-08-30 2017-12-30 Technologies for managing exact match hash table growth
US15/859,367 Active 2038-05-02 US10581596B2 (en) 2017-08-30 2017-12-30 Technologies for managing errors in a remotely accessible memory pool
US15/868,492 Abandoned US20190042408A1 (en) 2017-08-30 2018-01-11 Technologies for interleaving memory across shared memory pools
US15/868,594 Abandoned US20190042611A1 (en) 2017-08-30 2018-01-11 Technologies for structured database query for finding unique element values
US15/912,733 Active 2039-08-23 US11025411B2 (en) 2017-08-30 2018-03-06 Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture
US15/922,493 Abandoned US20190042090A1 (en) 2017-08-30 2018-03-15 Technologies for separating control plane management from data plane management for distributed storage in a disaggregated architecture
US15/922,502 Abandoned US20190042091A1 (en) 2017-08-30 2018-03-15 Technologies for providing efficient distributed data storage in a disaggregated architecture

Family Applications After (9)

Application Number Title Priority Date Filing Date
US16/045,345 Active US10756886B2 (en) 2017-08-30 2018-07-25 Technologies for load balancing a network
US17/001,502 Active 2038-09-30 US11588624B2 (en) 2017-08-30 2020-08-24 Technologies for load balancing a network
US17/332,733 Active 2038-03-14 US11522682B2 (en) 2017-08-30 2021-05-27 Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture
US17/344,253 Active 2038-08-11 US11843691B2 (en) 2017-08-30 2021-06-10 Technologies for managing a flexible host interface of a network interface controller
US17/391,549 Abandoned US20220012105A1 (en) 2017-08-30 2021-08-02 Technologies for allocating resources across data centers
US17/871,429 Active 2038-04-02 US11888967B2 (en) 2017-08-30 2022-07-22 Technologies for dynamic accelerator selection
US18/238,096 Pending US20230421358A1 (en) 2017-08-30 2023-08-25 Technologies for allocating resources across data centers
US18/241,748 Pending US20230412365A1 (en) 2017-08-30 2023-09-01 Technologies for managing a flexible host interface of a network interface controller
US18/542,308 Pending US20240195605A1 (en) 2017-08-30 2023-12-15 Technologies for dynamic accelerator selection

Country Status (5)

Country Link
US (26) US20190044809A1 (en)
EP (5) EP3460662A1 (en)
JP (1) JP7214394B2 (en)
CN (13) CN109426455A (en)
DE (1) DE102018212479A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110209249A (en) * 2019-06-06 2019-09-06 英业达科技有限公司 The casing of server
US10785549B2 (en) 2016-07-22 2020-09-22 Intel Corporation Technologies for switching network traffic in a data center
US11137922B2 (en) 2016-11-29 2021-10-05 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US11194715B2 (en) * 2019-01-28 2021-12-07 Ateme Method for data communication, and system for implementing the method

Families Citing this family (147)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9367562B2 (en) 2013-12-05 2016-06-14 Google Inc. Distributing data on distributed storage systems
US9448887B1 (en) * 2015-08-22 2016-09-20 Weka.IO Ltd. Distributed erasure coded virtual file system
CN109891908A (en) * 2016-11-29 2019-06-14 英特尔公司 Technology for the interconnection of millimeter wave rack
US11153164B2 (en) 2017-01-04 2021-10-19 International Business Machines Corporation Live, in-line hardware component upgrades in disaggregated systems
US10534598B2 (en) 2017-01-04 2020-01-14 International Business Machines Corporation Rolling upgrades in disaggregated systems
WO2018173164A1 (en) * 2017-03-22 2018-09-27 株式会社日立製作所 Data processing system
US11030126B2 (en) * 2017-07-14 2021-06-08 Intel Corporation Techniques for managing access to hardware accelerator memory
US20190044809A1 (en) * 2017-08-30 2019-02-07 Intel Corporation Technologies for managing a flexible host interface of a network interface controller
US10298496B1 (en) * 2017-09-26 2019-05-21 Amazon Technologies, Inc. Packet processing cache
US10726930B2 (en) 2017-10-06 2020-07-28 Western Digital Technologies, Inc. Method and system for a storage (SSD) drive-level failure and health prediction leveraging machine learning on internal parametric data
JP6757708B2 (en) * 2017-10-31 2020-09-23 株式会社日立製作所 Information processing device and component management method
US11262912B2 (en) * 2017-11-13 2022-03-01 Weka.IO Ltd. File operations in a distributed storage system
US11050574B2 (en) * 2017-11-29 2021-06-29 Taiwan Semiconductor Manufacturing Company, Ltd. Authentication based on physically unclonable functions
US11317542B2 (en) 2017-12-30 2022-04-26 Intel Corporation Technologies for improving processor thermal design power
IL275859B2 (en) * 2018-01-28 2024-05-01 Drivenets Ltd Method and device for improving bandwidth utilization in a communication network
US10635609B2 (en) 2018-03-02 2020-04-28 Samsung Electronics Co., Ltd. Method for supporting erasure code data protection with embedded PCIE switch inside FPGA+SSD
US20240095196A1 (en) * 2018-03-02 2024-03-21 Samsung Electronics Co., Ltd. Method for supporting erasure code data protection with embedded pcie switch inside fpga+ssd
US10990554B2 (en) 2018-03-02 2021-04-27 Samsung Electronics Co., Ltd. Mechanism to identify FPGA and SSD pairing in a multi-device environment
US10838647B2 (en) * 2018-03-14 2020-11-17 Intel Corporation Adaptive data migration across disaggregated memory resources
US10579548B2 (en) * 2018-03-29 2020-03-03 Western Digital Technologies, Inc. Adaptive interleaving of data transfer requests
US11108697B2 (en) * 2018-03-30 2021-08-31 Intel Corporation Technologies for controlling jitter at network packet egress
US11100246B2 (en) * 2018-04-13 2021-08-24 Mastercard International Incorporated Computer-implemented methods, systems comprising computer-readable media, and electronic devices for completing queries propagated across a plurality of datasources
US11330042B2 (en) * 2018-05-17 2022-05-10 International Business Machines Corporation Optimizing dynamic resource allocations for storage-dependent workloads in disaggregated data centers
US10552185B2 (en) * 2018-05-24 2020-02-04 International Business Machines Corporation Lightweight and precise value profiling
US10656990B2 (en) * 2018-06-13 2020-05-19 Nutanix, Inc. Dynamically adjusting reserve portion and allocation portions of disaster recovery site in a virtual computing system
US10846070B2 (en) * 2018-07-05 2020-11-24 At&T Intellectual Property I, L.P. Facilitating cloud native edge computing via behavioral intelligence
US10831411B2 (en) * 2018-07-24 2020-11-10 International Business Machines Corporation Storage controller with OCS for managing active-passive backend storage arrays
WO2020036824A2 (en) * 2018-08-13 2020-02-20 Stratus Technologies Bermuda, Ltd. High reliability fault tolerant computer architecture
CN109325494B (en) * 2018-08-27 2021-09-17 腾讯科技(深圳)有限公司 Picture processing method, task data processing method and device
US10915493B2 (en) 2018-09-25 2021-02-09 International Business Machines Corporation Component building blocks and optimized compositions thereof in disaggregated datacenters
US11163713B2 (en) * 2018-09-25 2021-11-02 International Business Machines Corporation Efficient component communication through protocol switching in disaggregated datacenters
US11182322B2 (en) 2018-09-25 2021-11-23 International Business Machines Corporation Efficient component communication through resource rewiring in disaggregated datacenters
US10802988B2 (en) 2018-09-25 2020-10-13 International Business Machines Corporation Dynamic memory-based communication in disaggregated datacenters
US11012423B2 (en) 2018-09-25 2021-05-18 International Business Machines Corporation Maximizing resource utilization through efficient component communication in disaggregated datacenters
US11650849B2 (en) 2018-09-25 2023-05-16 International Business Machines Corporation Efficient component communication through accelerator switching in disaggregated datacenters
US10831698B2 (en) 2018-09-25 2020-11-10 International Business Machines Corporation Maximizing high link bandwidth utilization through efficient component communication in disaggregated datacenters
US10901893B2 (en) * 2018-09-28 2021-01-26 International Business Machines Corporation Memory bandwidth management for performance-sensitive IaaS
US11096284B2 (en) * 2018-10-01 2021-08-17 Intel Corporation Compact semiconductor chip system and method
US11023155B2 (en) 2018-10-29 2021-06-01 International Business Machines Corporation Processing event messages for changed data objects to determine a storage pool to store the changed data objects
US10983985B2 (en) * 2018-10-29 2021-04-20 International Business Machines Corporation Determining a storage pool to store changed data objects indicated in a database
US11379488B2 (en) * 2018-11-07 2022-07-05 Sap Se Energy-efficient decay algorithm for non-volatile memories
US11429674B2 (en) 2018-11-15 2022-08-30 International Business Machines Corporation Processing event messages for data objects to determine data to redact from a database
US11409900B2 (en) 2018-11-15 2022-08-09 International Business Machines Corporation Processing event messages for data objects in a message queue to determine data to redact
US10990517B1 (en) * 2019-01-28 2021-04-27 Xilinx, Inc. Configurable overlay on wide memory channels for efficient memory access
US11023324B2 (en) * 2019-01-31 2021-06-01 EMC IP Holding Company LLC Harmonization of failure domains in a distributed system
US10983948B2 (en) * 2019-03-07 2021-04-20 Raytheon Company Reconfigurable computing appliance
JP7305990B2 (en) * 2019-03-12 2023-07-11 富士通株式会社 Transfer program, transfer method, and information processing device
US20190235773A1 (en) * 2019-04-09 2019-08-01 Mark Schmisseur Concept for accessing computer memory of a memory pool
CA3137148A1 (en) * 2019-04-25 2020-10-29 Liveperson, Inc. Smart capacity for workload routing
US11088967B2 (en) 2019-04-26 2021-08-10 Intel Corporation Shared resources for multiple communication traffics
DK180371B1 (en) 2019-05-20 2021-02-11 Mountain Top Ind Aps A lid arrangement for a canister for a rollup truck bed cover
US12034633B2 (en) 2019-05-23 2024-07-09 Hewlett Packard Enterprise Development Lp System and method for facilitating tracer packets in a data-driven intelligent network
US11397653B2 (en) 2019-05-29 2022-07-26 Intel Corporation Technologies for fast recovery of distributed storage systems on disaggregated storage
US10970309B2 (en) * 2019-06-05 2021-04-06 Advanced New Technologies Co., Ltd. Data storage method and apparatus
JP7151631B2 (en) * 2019-06-11 2022-10-12 株式会社デンソー VEHICLE CONTROL DEVICE, VEHICLE DISPLAY SYSTEM, AND VEHICLE DISPLAY CONTROL METHOD
US11074177B2 (en) * 2019-06-19 2021-07-27 Micron Technology, Inc. Garbage collection adapted to host write activity
US11049570B2 (en) * 2019-06-26 2021-06-29 International Business Machines Corporation Dynamic writes-per-day adjustment for storage drives
US11163482B2 (en) 2019-06-26 2021-11-02 International Business Machines Corporation Dynamic performance-class adjustment for storage drives
US11137915B2 (en) 2019-06-27 2021-10-05 International Business Machines Corporation Dynamic logical storage capacity adjustment for storage drives
US10949362B2 (en) 2019-06-28 2021-03-16 Intel Corporation Technologies for facilitating remote memory requests in accelerator devices
WO2021004491A1 (en) 2019-07-09 2021-01-14 Beijing Bytedance Network Technology Co., Ltd. Sample determination for adaptive loop filtering
CA3146773A1 (en) * 2019-07-11 2021-01-14 Beijing Bytedance Network Technology Co., Ltd. Sample padding in adaptive loop filtering
US11803773B2 (en) * 2019-07-30 2023-10-31 EMC IP Holding Company LLC Machine learning-based anomaly detection using time series decomposition
US10925166B1 (en) * 2019-08-07 2021-02-16 Quanta Computer Inc. Protection fixture
US11283635B2 (en) * 2019-09-28 2022-03-22 Intel Corporation Dynamic sharing in secure memory environments using edge service sidecars
US11550617B2 (en) 2019-10-16 2023-01-10 Intel Corporation Disaggregated rack mount storage side transaction support
US12086446B2 (en) * 2019-10-21 2024-09-10 Intel Corporation Memory and storage pool interfaces
US11782810B2 (en) * 2019-11-22 2023-10-10 Dell Products, L.P. Systems and methods for automated field replacement component configuration
US11861219B2 (en) 2019-12-12 2024-01-02 Intel Corporation Buffer to reduce write amplification of misaligned write operations
JP7318899B2 (en) * 2020-01-02 2023-08-01 レベル スリー コミュニケーションズ,エルエルシー Systems and methods for storing content items in secondary storage
US11561916B2 (en) * 2020-01-13 2023-01-24 Hewlett Packard Enterprise Development Lp Processing task deployment in adapter devices and accelerators
US11483246B2 (en) 2020-01-13 2022-10-25 Vmware, Inc. Tenant-specific quality of service
US11275705B2 (en) * 2020-01-28 2022-03-15 Dell Products L.P. Rack switch coupling system
US11989135B2 (en) * 2020-02-10 2024-05-21 Intel Corporation Programmable address range engine for larger region sizes
US10853548B1 (en) * 2020-02-11 2020-12-01 Capital One Services, Llc Reconfiguration of hardware components of an integrated circuit
US11599395B2 (en) * 2020-02-19 2023-03-07 Vmware, Inc. Dynamic core allocation
US11436367B2 (en) 2020-02-25 2022-09-06 Hewlett Packard Enterprise Development Lp Pre-operating system environment-based sanitization of storage devices
US11115497B2 (en) * 2020-03-25 2021-09-07 Intel Corporation Technologies for providing advanced resource management in a disaggregated environment
US11509079B2 (en) * 2020-04-06 2022-11-22 Hewlett Packard Enterprise Development Lp Blind mate connections with different sets of datums
US11360681B2 (en) * 2020-05-27 2022-06-14 Xiaoliang Zhao Systems and methods for scalable shared memory among networked devices comprising IP addressable memory blocks
US11962518B2 (en) 2020-06-02 2024-04-16 VMware LLC Hardware acceleration techniques using flow selection
US11522917B2 (en) 2020-06-10 2022-12-06 Arista Networks, Inc. Scalable network processing segmentation
US11539633B2 (en) 2020-08-31 2022-12-27 Vmware, Inc. Determining whether to rate limit traffic
US11853798B2 (en) * 2020-09-03 2023-12-26 Microsoft Technology Licensing, Llc Disaggregated memory pool assignment
JP7527910B2 (en) * 2020-09-16 2024-08-05 キオクシア株式会社 COMMUNICATION SYSTEM, DEVICE, AND COMMUNICATION METHOD
US12021759B2 (en) 2020-09-28 2024-06-25 VMware LLC Packet processing with hardware offload units
US11593278B2 (en) 2020-09-28 2023-02-28 Vmware, Inc. Using machine executing on a NIC to access a third party storage not supported by a NIC or host
US11636053B2 (en) 2020-09-28 2023-04-25 Vmware, Inc. Emulating a local storage by accessing an external storage through a shared port of a NIC
US11875172B2 (en) 2020-09-28 2024-01-16 VMware LLC Bare metal computer for booting copies of VM images on multiple computing devices using a smart NIC
US11736566B2 (en) 2020-09-28 2023-08-22 Vmware, Inc. Using a NIC as a network accelerator to allow VM access to an external storage via a PF module, bus, and VF module
US11606310B2 (en) * 2020-09-28 2023-03-14 Vmware, Inc. Flow processing offload using virtual port identifiers
US20220103290A1 (en) * 2020-09-29 2022-03-31 Qualcomm Incorporated Interleaver design for noncoherent reed muller codes
DE102020214951A1 (en) * 2020-11-27 2022-06-02 Robert Bosch Gesellschaft mit beschränkter Haftung Method for dynamically allocating memory bandwidth
US11392740B2 (en) * 2020-12-18 2022-07-19 SambaNova Systems, Inc. Dataflow function offload to reconfigurable processors
US20220231933A1 (en) * 2021-01-20 2022-07-21 Nvidia Corporation Performing network congestion control utilizing reinforcement learning
US20240106892A1 (en) * 2021-01-25 2024-03-28 Volumez Technologies Ltd. Remote Online Volume Cloning Method and System
CN114911725A (en) * 2021-02-10 2022-08-16 华为技术有限公司 Communication method, device and system
US11509590B2 (en) * 2021-02-17 2022-11-22 Juniper Networks, Inc. Determining network device statistics associated with fast counters and slow counters
US11785735B2 (en) * 2021-02-19 2023-10-10 CyberSecure IPS, LLC Intelligent cable patching of racks to facilitate cable installation
CN115080258A (en) * 2021-03-11 2022-09-20 华为技术有限公司 Data transmission system and related equipment
US11863613B1 (en) * 2021-03-22 2024-01-02 Amazon Technologies, Inc. Allocation of workloads in dynamic worker fleet
CN117203615A (en) 2021-04-09 2023-12-08 微软技术许可有限责任公司 Extending host policies via distribution
US11799785B2 (en) 2021-04-09 2023-10-24 Microsoft Technology Licensing, Llc Hardware-based packet flow processing
US11757782B2 (en) * 2021-04-09 2023-09-12 Microsoft Technology Licensing, Llc Architectures for disaggregating SDN from the host
CN113127173B (en) * 2021-04-21 2021-09-24 浙江大学 Heterogeneous sensing cluster scheduling method and device
US20220361354A1 (en) * 2021-05-10 2022-11-10 Vertiv It Systems, Inc. Supplemental component mounting platform for equipment rack
CN113347230B (en) * 2021-05-13 2022-09-06 长沙星融元数据技术有限公司 Load balancing method, device, equipment and medium based on programmable switch
US20210271517A1 (en) * 2021-05-19 2021-09-02 Intel Corporation Resource selection based in part on workload
US11799784B2 (en) 2021-06-08 2023-10-24 Vmware, Inc. Virtualized QoS support in software defined networks
US20220417138A1 (en) * 2021-06-25 2022-12-29 Oracle International Corporation Routing policies for graphical processing units
US11537457B2 (en) * 2021-06-25 2022-12-27 Intel Corporation Low latency remoting to accelerators
US11494413B1 (en) 2021-07-13 2022-11-08 Capital One Services, Llc Query alerts generation for virtual warehouse
US11669529B2 (en) * 2021-07-13 2023-06-06 Capital One Services, Llc Dynamic query allocation to virtual warehouses
US11914595B2 (en) 2021-07-13 2024-02-27 Capital One Services, Llc Virtual warehouse query monitoring and reporting
US11825354B2 (en) * 2021-08-04 2023-11-21 Dish Wireless L.L.C. Customer specific network slicing
US20230046403A1 (en) * 2021-08-11 2023-02-16 International Business Machines Corporation Multi-device processing activity allocation
US11871547B2 (en) 2021-09-02 2024-01-09 Baidu Usa Llc Two phase system for enclosure systems
US11910575B2 (en) * 2021-09-02 2024-02-20 Baidu Usa Llc Rack systems and packaging for servers
US20220014551A1 (en) * 2021-09-24 2022-01-13 Intel Corporation Method and apparatus to reduce risk of denial of service resource acquisition attacks in a data center
US20230112448A1 (en) * 2021-10-12 2023-04-13 Seagate Technology Llc Computational storage drive using fpga implemented interface
US11650745B1 (en) * 2021-10-29 2023-05-16 Oracle International Corporation Increased data processing performance of a non-volatile memory express (NVME) block store
KR20230064849A (en) * 2021-11-04 2023-05-11 에스케이하이닉스 주식회사 Storage Device and Operating Method Therefor
US11880568B2 (en) 2021-11-17 2024-01-23 Seagate Technology Llc On demand configuration of FPGA interfaces
US11954345B2 (en) * 2021-12-03 2024-04-09 Samsung Electronics Co., Ltd. Two-level indexing for key-value persistent storage device
US20220116487A1 (en) * 2021-12-20 2022-04-14 Intel Corporation Method and apparatus to perform operations on multiple segments of a data packet in a network interface controller
US11995024B2 (en) 2021-12-22 2024-05-28 VMware LLC State sharing between smart NICs
US11863376B2 (en) 2021-12-22 2024-01-02 Vmware, Inc. Smart NIC leader election
US11934255B2 (en) * 2022-01-04 2024-03-19 Bank Of America Corporation System and method for improving memory resource allocations in database blocks for executing tasks
US20230214337A1 (en) * 2022-01-06 2023-07-06 Vmware, Inc. Methods and systems for extablishing direct communications between a server computer and a smart network interface controller
US11842179B2 (en) 2022-01-07 2023-12-12 Dell Products L.P. System for automatically generating customer specific data center application program interfaces
US11924029B2 (en) 2022-01-07 2024-03-05 Dell Products L.P. System for scoring data center application program interfaces
US11922229B2 (en) 2022-01-10 2024-03-05 Dell Products L.P. System for determining data center application program interface readiness
US11593189B1 (en) * 2022-01-14 2023-02-28 Dell Products L.P. Configuring new storage systems based on write endurance
US11848835B2 (en) * 2022-01-20 2023-12-19 Dell Products L.P. System for quantifying data center infrastructure utilization units
CN114442792A (en) * 2022-02-09 2022-05-06 北京小米移动软件有限公司 Method and device for adjusting operating frequency of processor and storage medium
US20230038307A1 (en) * 2022-04-06 2023-02-09 Intel Corporation Network interface device feedback for adaptive and failover multipath routing
US11924115B2 (en) * 2022-05-20 2024-03-05 Ipco 2012 Limited Systems and methods for use in balancing network resources
US11899594B2 (en) 2022-06-21 2024-02-13 VMware LLC Maintenance of data message classification cache on smart NIC
US11928062B2 (en) 2022-06-21 2024-03-12 VMware LLC Accelerating data message classification with smart NICs
US11928367B2 (en) 2022-06-21 2024-03-12 VMware LLC Logical memory addressing for network devices
US20240020357A1 (en) * 2022-07-15 2024-01-18 Vmware, Inc. Keyless licensing in a multi-cloud computing system
US20240037029A1 (en) * 2022-07-27 2024-02-01 Hewlett Packard Enterprise Development Lp Client allocation of memory across memory servers
CN115130666B (en) * 2022-08-31 2022-11-22 之江实验室 Two-dimensional photon convolution acceleration method and system
KR20240059347A (en) * 2022-10-27 2024-05-07 삼성전자주식회사 Method, device and system for allocating memory space
US20240163171A1 (en) * 2022-11-08 2024-05-16 Dell Products L.P. Logical network resource allocation and creation
US20240171491A1 (en) * 2022-11-18 2024-05-23 Dell Products L.P. Unified Performance Metric for Identifying Data Center Utilization
CN117200422B (en) * 2023-11-08 2024-03-19 深圳市胜威南方科技有限公司 PDU power supply equipment for power supply of communication system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140068259A1 (en) * 2012-08-31 2014-03-06 Cleversafe, Inc. Secure data access in a dispersed storage network
US20140181400A1 (en) * 2011-12-31 2014-06-26 Huawei Technologies Co., Ltd. Method for A Storage Device Processing Data and Storage Device
US20170277467A1 (en) * 2016-03-22 2017-09-28 Oracle International Corporation Efficient and thread-safe objects for dynamically-typed languages
US20180027051A1 (en) * 2016-07-25 2018-01-25 Red Hat, Inc. Application management in an application deployment pipeline
US20180027018A1 (en) * 2012-08-31 2018-01-25 Jpmorgan Chase Bank, N.A. System and Method for Sharing Information in a Private Ecosystem
US20180089266A1 (en) * 2016-09-28 2018-03-29 Microsoft Technology Licensing, Llc Direct table association in in-memory databases

Family Cites Families (225)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3583625A (en) 1968-10-25 1971-06-08 Gabriel Gero Cigarette dispensing package
US4258967A (en) * 1979-11-02 1981-03-31 Digital Equipment Corporation Integral pivot and lock apparatus for slide rack mounted boxes
JPH0731402Y2 (en) * 1987-06-15 1995-07-19 パイオニア株式会社 Cartridge storage disk player
JPS6450274A (en) * 1987-08-21 1989-02-27 Pioneer Electronic Corp Auto-changer type disk player
EP0335555B1 (en) * 1988-03-31 1995-08-23 AT&T Corp. User to network interface protocol for packet communications networks
US5123045A (en) * 1989-08-18 1992-06-16 Massachusetts Institute Of Technology Comprehensive software protection system
US5226714A (en) * 1992-05-26 1993-07-13 Wright Jack V Pivoting drawer slide system
JP3215237B2 (en) * 1993-10-01 2001-10-02 富士通株式会社 Storage device and method for writing / erasing storage device
US5469335A (en) * 1994-11-14 1995-11-21 Compaq Computer Corporation Power distribution connector apparatus for back-to-back sandwiched circuit boards
US5584396A (en) * 1995-05-17 1996-12-17 Dell Usa Lp Sliding pivoting storage apparatus
US6179489B1 (en) * 1997-04-04 2001-01-30 Texas Instruments Incorporated Devices, methods, systems and software products for coordination of computer main microprocessor and second microprocessor coupled thereto
US5822582A (en) * 1996-07-19 1998-10-13 Compaq Computer Corporation Boot drive selection and hibernation file detection
US6105119A (en) * 1997-04-04 2000-08-15 Texas Instruments Incorporated Data transfer circuitry, DSP wrapper circuitry and improved processor devices, methods and systems
US6298370B1 (en) * 1997-04-04 2001-10-02 Texas Instruments Incorporated Computer operating process allocating tasks between first and second processors at run time based upon current processor load
US5974518A (en) * 1997-04-10 1999-10-26 Milgo Solutions, Inc. Smart buffer size adaptation apparatus and method
US6181549B1 (en) * 1997-06-24 2001-01-30 Dell Products, L.P. Chassis retaining system for an electronics rack
US6393483B1 (en) 1997-06-30 2002-05-21 Adaptec, Inc. Method and apparatus for network interface card load balancing and port aggregation
US7133940B2 (en) 1997-10-14 2006-11-07 Alacritech, Inc. Network interface device employing a DMA command queue
US6434620B1 (en) 1998-08-27 2002-08-13 Alacritech, Inc. TCP/IP offload network interface device
US6082845A (en) * 1998-05-29 2000-07-04 Lucent Technologies, Inc. Tiltable electronics cabinet
WO1999063438A1 (en) * 1998-06-05 1999-12-09 Mylex Corporation Apparatus, system and method for n-way raid controller
US6223271B1 (en) * 1998-07-15 2001-04-24 Compaq Computer Corp. System and method for detecting system memory size using ROM based paging tables
US7664883B2 (en) * 1998-08-28 2010-02-16 Alacritech, Inc. Network interface device that fast-path processes solicited session layer read commands
US6714549B1 (en) * 1998-12-23 2004-03-30 Worldcom, Inc. High resiliency network infrastructure
US6356951B1 (en) * 1999-03-01 2002-03-12 Sun Microsystems, Inc. System for parsing a packet for conformity with a predetermined protocol using mask and comparison values included in a parsing instruction
US6493756B1 (en) * 1999-10-28 2002-12-10 Networks Associates, Inc. System and method for dynamically sensing an asynchronous network event within a modular framework for network event processing
US6484224B1 (en) 1999-11-29 2002-11-19 Cisco Technology Inc. Multi-interface symmetric multiprocessor
US6816963B1 (en) * 2000-01-31 2004-11-09 Intel Corporation Platform level initialization using an image generated automatically by a remote server based upon description automatically generated and transmitted thereto by a processor-based system
US6459571B1 (en) * 2000-06-15 2002-10-01 Bull Hn Information Systems Inc. Packaging system for mass memory units
US6990685B1 (en) * 2000-06-15 2006-01-24 Dell Products L.P. System and method for tracking bootable devices
US20020064164A1 (en) * 2000-10-06 2002-05-30 Barany Peter A. Protocol header construction and/or removal for messages in wireless communications
US6498716B1 (en) * 2001-08-21 2002-12-24 Compaq Information Technologies Group, L.P. DC main power distribution
EP1446994A4 (en) * 2001-10-30 2006-05-17 Egenera Inc Simplified power and data connector for use with chassis system that house multiple processors
US6968414B2 (en) * 2001-12-04 2005-11-22 International Business Machines Corporation Monitoring insertion/removal of server blades in a data processing system
US6657867B2 (en) * 2001-12-14 2003-12-02 Hewlett-Packard Development Company, Lp. Hinged door for access to add-in cards
US20030172205A1 (en) * 2002-01-11 2003-09-11 Bastian Richard Henry Methods and components for mechanical computer
US7100031B1 (en) * 2002-03-27 2006-08-29 Hewlett-Packard Development Company, L.P. Detector and operational method for a firmware interface
US7257105B2 (en) * 2002-10-03 2007-08-14 Cisco Technology, Inc. L2 method for a wireless station to locate and associate with a wireless network in communication with a Mobile IP agent
WO2004092951A2 (en) * 2003-04-18 2004-10-28 Sap Ag Managing a computer system with blades
US20040249932A1 (en) * 2003-06-05 2004-12-09 Bunz Shain W. System and method for generating event notifications
US7467417B2 (en) * 2003-06-18 2008-12-16 Architecture Technology Corporation Active verification of boot firmware
US7864806B2 (en) 2004-01-06 2011-01-04 Broadcom Corp. Method and system for transmission control packet (TCP) segmentation offload
US7120778B2 (en) * 2004-02-18 2006-10-10 Intel Corporation Option ROM virtualization
US9264384B1 (en) * 2004-07-22 2016-02-16 Oracle International Corporation Resource virtualization mechanism including virtual host bus adapters
EP1630657A1 (en) * 2004-08-30 2006-03-01 STMicroelectronics S.r.l. Embedded storage device with integrated data-management functions and storage system incorporating it
US7469241B2 (en) * 2004-11-30 2008-12-23 Oracle International Corporation Efficient data aggregation operations using hash tables
US7386758B2 (en) * 2005-01-13 2008-06-10 Hitachi, Ltd. Method and apparatus for reconstructing data in object-based storage arrays
CN1809054A (en) * 2005-01-21 2006-07-26 华为技术有限公司 SIP message based text decoder
US7500573B1 (en) * 2005-01-21 2009-03-10 Flynn James T Saddle rack and harness rack lift
US7562366B2 (en) 2005-02-03 2009-07-14 Solarflare Communications, Inc. Transmit completion event batching
US7330965B2 (en) * 2005-02-09 2008-02-12 International Business Machines Corporation Multi-tiered boot list
US7577151B2 (en) * 2005-04-01 2009-08-18 International Business Machines Corporation Method and apparatus for providing a network connection table
US7574623B1 (en) * 2005-04-29 2009-08-11 Network Appliance, Inc. Method and system for rapidly recovering data from a “sick” disk in a RAID disk group
US7460758B2 (en) * 2005-06-03 2008-12-02 Telect Inc. Fiber management system
US7584347B2 (en) * 2005-06-10 2009-09-01 Dell Products L.P. System and method for identifying bootable device by generating a signature for each bootable device where the signature is independent of a location of the bootable device
US8713180B2 (en) * 2005-06-22 2014-04-29 Cisco Technology, Inc. Zero-copy network and file offload for web and application servers
US7791890B2 (en) * 2005-10-07 2010-09-07 Nec Corporation Computer system
JP2007133807A (en) * 2005-11-14 2007-05-31 Hitachi Ltd Data processing system, storage device, and management unit
US7423870B2 (en) * 2005-11-18 2008-09-09 International Business Machines Corporation Blade server assembly
US7500073B1 (en) * 2006-03-29 2009-03-03 Sun Microsystems, Inc. Relocation of virtual-to-physical mappings
US20070233928A1 (en) * 2006-03-31 2007-10-04 Robert Gough Mechanism and apparatus for dynamically providing required resources for a hot-added PCI express endpoint or hierarchy
US7747749B1 (en) * 2006-05-05 2010-06-29 Google Inc. Systems and methods of efficiently preloading documents to client devices
US20080002711A1 (en) * 2006-06-30 2008-01-03 Bugenhagen Michael K System and method for access state based service options
US7987438B2 (en) * 2006-08-10 2011-07-26 International Business Machines Corporation Structure for initializing expansion adapters installed in a computer system having similar expansion adapters
JP4949804B2 (en) * 2006-11-07 2012-06-13 株式会社日立製作所 Integrated management computer, storage device management method, and computer system
JP4723470B2 (en) * 2006-12-28 2011-07-13 株式会社日立製作所 Computer system and its chipset
US8464024B2 (en) * 2007-04-27 2013-06-11 Hewlett-Packard Development Company, L.P. Virtual address hashing
US8644151B2 (en) * 2007-05-22 2014-02-04 Cisco Technology, Inc. Processing packet flows
CN101330446B (en) * 2007-06-21 2012-05-09 中兴通讯股份有限公司 Analysis method for enhancing protocol layer frame of special transmission channel
US7724668B2 (en) * 2007-06-27 2010-05-25 Verizon Patent And Licensing Inc. Bandwidth-based admission control mechanism
US7793071B2 (en) 2007-06-28 2010-09-07 Intel Corporation Method and system for reducing cache conflicts
US8151081B2 (en) * 2007-12-20 2012-04-03 Intel Corporation Method, system and apparatus for memory address mapping for sub-socket partitioning
FI123966B (en) * 2008-02-04 2014-01-15 Tellabs Oy Data communication device
US7801046B2 (en) 2008-04-28 2010-09-21 Oracle America, Inc. Method and system for bandwidth control on a network interface card
US9015444B2 (en) * 2008-06-09 2015-04-21 Panasonic Intellectual Property Management Co., Ltd. Access apparatus and available storage space calculation method
US8086838B2 (en) * 2008-08-13 2011-12-27 Dell Products L.P. Methods and systems for providing manufacturing mode detection and functionality in a UEFI BIOS
US8230442B2 (en) * 2008-09-05 2012-07-24 International Business Machines Corporation Executing an accelerator application program in a hybrid computing environment
US7921230B2 (en) * 2008-09-08 2011-04-05 International Business Corporation USB devices pre-configuration for KVM switch
US20100061207A1 (en) * 2008-09-09 2010-03-11 Seagate Technology Llc Data storage device including self-test features
TWI378384B (en) * 2008-10-15 2012-12-01 Phison Electronics Corp Mother board system, storage device for booting up thereof and connector
US8024719B2 (en) * 2008-11-03 2011-09-20 Advanced Micro Devices, Inc. Bounded hash table sorting in a dynamic program profiling system
DE112008004203B4 (en) 2008-12-25 2015-01-08 Mitsubishi Electric Corporation Communication management device, communication device and communication method
US8112491B1 (en) 2009-01-16 2012-02-07 F5 Networks, Inc. Methods and systems for providing direct DMA
US8103809B1 (en) 2009-01-16 2012-01-24 F5 Networks, Inc. Network devices with multiple direct memory access channels and methods thereof
JP5393199B2 (en) * 2009-03-02 2014-01-22 キヤノン株式会社 Start control method and apparatus
US8266506B2 (en) * 2009-04-18 2012-09-11 Alcatel Lucent Method and apparatus for multiset membership testing using combinatorial bloom filters
JP5447514B2 (en) * 2009-06-01 2014-03-19 富士通株式会社 Electronic unit and electronic system
WO2011002437A1 (en) * 2009-06-29 2011-01-06 Hewlett-Packard Development Company, L.P. Memory agent to access memory blade as part of the cache coherency domain
US8275744B2 (en) * 2009-07-30 2012-09-25 Cleversafe, Inc. Dispersed storage network virtual address fields
US8832142B2 (en) * 2010-08-30 2014-09-09 Oracle International Corporation Query and exadata support for hybrid columnar compressed data
US9298662B2 (en) * 2009-12-08 2016-03-29 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Providing expansion card settings
US8743877B2 (en) * 2009-12-21 2014-06-03 Steven L. Pope Header processing engine
JP5292321B2 (en) * 2010-01-13 2013-09-18 アラクサラネットワークス株式会社 Communication device
US8473567B2 (en) * 2010-03-29 2013-06-25 Intel Corporation Generating a packet including multiple operation codes
US9754266B2 (en) * 2010-04-21 2017-09-05 Excalibur Ip, Llc Online serving threshold and delivery policy adjustment
US8504718B2 (en) * 2010-04-28 2013-08-06 Futurewei Technologies, Inc. System and method for a context layer switch
US9300576B2 (en) * 2010-05-03 2016-03-29 Pluribus Networks Inc. Methods, systems, and fabrics implementing a distributed network operating system
US8898324B2 (en) * 2010-06-24 2014-11-25 International Business Machines Corporation Data access management in a hybrid memory server
CN102141825B (en) * 2010-07-09 2013-01-02 华为技术有限公司 Cabinet-level server system
US8909749B2 (en) * 2010-07-26 2014-12-09 International Business Macines Corporation Predictive context-based virtual workspace placement
TWI406624B (en) * 2010-11-11 2013-08-21 Inventec Corp Server
US10033585B2 (en) * 2010-12-15 2018-07-24 Juniper Networks, Inc. Methods and apparatus related to a switch fabric system having a multi-hop distributed control plane and a single-hop data plane
US8812746B2 (en) * 2010-12-16 2014-08-19 Intel Corporation Dynamically configurable device host controller
US8582299B1 (en) * 2010-12-23 2013-11-12 Amazon Technologies, Inc. System with movable computing devices
US8832674B2 (en) * 2011-02-24 2014-09-09 Software Ag Usa, Inc. Off-heap direct-memory data stores, methods of creating and/or managing off-heap direct-memory data stores, and/or systems including off-heap direct-memory data store
JP5422777B2 (en) * 2011-03-07 2014-02-19 株式会社日立製作所 Network management apparatus, network management method, and network management system
US9405550B2 (en) * 2011-03-31 2016-08-02 International Business Machines Corporation Methods for the transmission of accelerator commands and corresponding command structure to remote hardware accelerator engines over an interconnect link
US9645628B1 (en) * 2011-05-09 2017-05-09 EMC IP Holding Company LLC Combined data storage and computing appliance that provides scalable storage in a clustered computing environment
US9042402B1 (en) * 2011-05-10 2015-05-26 Juniper Networks, Inc. Methods and apparatus for control protocol validation of a switch fabric system
GB201107860D0 (en) * 2011-05-11 2011-06-22 Manda Ion Rack module
US9369341B2 (en) * 2011-05-15 2016-06-14 Orbit Communication Systems Ltd. Static ring network for vehicle communications
EP2718828A4 (en) * 2011-06-07 2014-11-05 Lsi Corp Management of device firmware update effects as seen by a host
US8812555B2 (en) * 2011-06-18 2014-08-19 Microsoft Corporation Dynamic lock-free hash tables
CN102902581B (en) * 2011-07-29 2016-05-11 国际商业机器公司 Hardware accelerator and method, CPU, computing equipment
CN102929360A (en) * 2011-08-09 2013-02-13 鸿富锦精密工业(深圳)有限公司 Server cabinet
US8930307B2 (en) * 2011-09-30 2015-01-06 Pure Storage, Inc. Method for removing duplicate data from a storage array
US9021138B2 (en) * 2011-08-26 2015-04-28 Microsoft Technology Licensing, Llc Performance of multi-processor computer systems
CN102999139B (en) * 2011-09-08 2016-03-30 英业达股份有限公司 Electric supply installation and the server rack system applying it
US8964601B2 (en) * 2011-10-07 2015-02-24 International Business Machines Corporation Network switching domains with a virtualized control plane
CN103139106B (en) * 2011-11-28 2014-06-11 英业达科技有限公司 Server rack system
US8826277B2 (en) * 2011-11-29 2014-09-02 International Business Machines Corporation Cloud provisioning accelerator
US9342314B2 (en) * 2011-12-08 2016-05-17 Oracle International Corporation Efficient hardware instructions for single instruction multiple data processors
US8788663B1 (en) * 2011-12-20 2014-07-22 Amazon Technologies, Inc. Managing resource dependent workflows
US8708736B2 (en) * 2012-02-01 2014-04-29 Dell Products L.P. Systems and methods for coupling AC power to a rack-level power infrastructure
EP2831693B1 (en) * 2012-03-30 2018-06-13 Intel Corporation Apparatus and method for accelerating operations in a processor which uses shared virtual memory
WO2013147887A1 (en) * 2012-03-30 2013-10-03 Intel Corporation Context switching mechanism for a processing core having a general purpose cpu core and a tightly coupled accelerator
US8868868B1 (en) * 2012-05-31 2014-10-21 Netapp, Inc. Method and system for responding to client requests for information maintained by storage systems
US9613052B2 (en) * 2012-06-05 2017-04-04 International Business Machines Corporation Establishing trust within a cloud computing system
US9710762B2 (en) * 2012-06-06 2017-07-18 Juniper Networks, Inc. Dynamic logging
WO2013184141A1 (en) 2012-06-08 2013-12-12 Intel Corporation Sr-iov failover & aggregation control system to ensure within-physical-port veb loopback
US8838577B2 (en) * 2012-07-24 2014-09-16 International Business Machines Corporation Accelerated row decompression
CN103634330A (en) * 2012-08-20 2014-03-12 曙光信息产业(北京)有限公司 Automatic resource distribution method in cloud calculation environment
US9049114B2 (en) * 2012-08-31 2015-06-02 Cisco Technology, Inc. Network access device and method for automatically establishing connection to a wide area network
US8938417B2 (en) * 2013-02-22 2015-01-20 International Business Machines Corporation Integrity checking and selective deduplication based on network parameters
EP2962218B1 (en) * 2013-02-27 2021-04-07 Hitachi Vantara LLC Decoupled content and metadata in a distributed object storage ecosystem
US20140282584A1 (en) * 2013-03-14 2014-09-18 Silicon Graphics International Corp. Allocating Accelerators to Threads in a High Performance Computing System
US9558010B2 (en) * 2013-03-14 2017-01-31 International Business Machines Corporation Fast hot boot of a computer system
US9460024B2 (en) 2013-03-15 2016-10-04 Vmware, Inc. Latency reduction for direct memory access operations involving address translation
ES2719271T3 (en) * 2013-03-19 2019-07-09 Adc Czech Republic Sro Control of curvature and support of connection cables, mobile, for telecommunications panels
WO2014150352A1 (en) * 2013-03-21 2014-09-25 Insyde Software Corp. Network controller sharing between smm firmware and os drivers
US10037061B1 (en) * 2013-04-30 2018-07-31 Amazon Technologies, Inc. Multiple-stage cooling system for rack
US8898227B1 (en) * 2013-05-10 2014-11-25 Owl Computing Technologies, Inc. NFS storage via multiple one-way data links
US9424079B2 (en) * 2013-06-27 2016-08-23 Microsoft Technology Licensing, Llc Iteration support in a heterogeneous dataflow engine
US9056464B2 (en) * 2013-07-16 2015-06-16 Xerox Corporation System and method for optimized application of release agent in an inkjet printer with in-line coating
WO2015023537A2 (en) * 2013-08-16 2015-02-19 Interdigital Patent Holdings, Inc. Methods and apparatus for hash routing in software defined networking
US10684973B2 (en) 2013-08-30 2020-06-16 Intel Corporation NUMA node peripheral switch
US9444914B2 (en) * 2013-09-16 2016-09-13 Annapurna Labs Ltd. Configurable parser and a method for parsing information units
WO2015039687A1 (en) * 2013-09-19 2015-03-26 Huawei Technologies Co., Ltd. Transmission and reception devices for reducing the delay in end-to-end delivery of network packets
US9378232B2 (en) * 2013-09-21 2016-06-28 Oracle International Corporation Framework for numa affinitized parallel query on in-memory objects within the RDBMS
US9467399B2 (en) * 2013-10-17 2016-10-11 Marvell World Trade Ltd. Processing concurrency in a network device
WO2015065323A1 (en) * 2013-10-29 2015-05-07 Intel Corporation Flexible bootstrap code architecture
CN105793839B (en) * 2013-12-20 2019-08-06 英特尔公司 Execute unloading
US9628503B2 (en) * 2014-01-17 2017-04-18 F5 Networks, Inc. Systems and methods for network destination based flood attack mitigation
US9740714B2 (en) * 2014-02-06 2017-08-22 International Business Machines Corporation Multilevel filters for cache-efficient access
US20150293699A1 (en) * 2014-04-11 2015-10-15 Graham Bromley Network-attached storage enhancement appliance
EP3138243B1 (en) * 2014-04-29 2019-06-19 Hewlett Packard Enterprise Development L.P. Network service insertion
US9684575B2 (en) * 2014-06-23 2017-06-20 Liqid Inc. Failover handling in modular switched fabric for data storage systems
US9626108B2 (en) * 2014-09-16 2017-04-18 Kove Ip, Llc Dynamically provisionable and allocatable external memory
US10275171B2 (en) * 2014-09-16 2019-04-30 Kove Ip, Llc Paging of external memory
US10621138B2 (en) * 2014-09-25 2020-04-14 Intel Corporation Network communications using pooled memory in rack-scale architecture
US9971619B2 (en) * 2014-10-15 2018-05-15 Keysight Technologies Singapore (Holdings) Pte Ltd Methods and systems for forwarding network packets within virtual machine host systems
US9501420B2 (en) * 2014-10-22 2016-11-22 Netapp, Inc. Cache optimization technique for large working data sets
US9596253B2 (en) * 2014-10-30 2017-03-14 Splunk Inc. Capture triggers for capturing network data
US10116772B2 (en) * 2014-11-14 2018-10-30 Cavium, Inc. Network switching with co-resident data-plane and network interface controllers
US10230824B2 (en) * 2014-11-17 2019-03-12 Keysight Technologies Singapore (Holdings) Pte. Lte. Packet classification using memory pointer information
US10394731B2 (en) * 2014-12-19 2019-08-27 Amazon Technologies, Inc. System on a chip comprising reconfigurable resources for multiple compute sub-systems
US9838333B2 (en) * 2015-01-20 2017-12-05 Futurewei Technologies, Inc. Software-defined information centric network (ICN)
US9560078B2 (en) * 2015-02-04 2017-01-31 Intel Corporation Technologies for scalable security architecture of virtualized networks
US9767856B2 (en) * 2015-02-10 2017-09-19 Netapp, Inc. High density storage device system
US9569267B2 (en) * 2015-03-16 2017-02-14 Intel Corporation Hardware-based inter-device resource sharing
US10606651B2 (en) 2015-04-17 2020-03-31 Microsoft Technology Licensing, Llc Free form expression accelerator with thread length-based thread assignment to clustered soft processor cores that share a functional circuit
US9792154B2 (en) * 2015-04-17 2017-10-17 Microsoft Technology Licensing, Llc Data processing system having a hardware acceleration plane and a software plane
IL238690B (en) * 2015-05-07 2019-07-31 Mellanox Technologies Ltd Network-based computational accelerator
US9578008B2 (en) * 2015-05-11 2017-02-21 Intel Corporation Technologies for secure bootstrapping of virtual network functions
US9606836B2 (en) * 2015-06-09 2017-03-28 Microsoft Technology Licensing, Llc Independently networkable hardware accelerators for increased workflow optimization
US10049078B1 (en) * 2015-06-25 2018-08-14 Amazon Technologies, Inc. Accessing a memory location using a two-stage hash scheme
US10063446B2 (en) * 2015-06-26 2018-08-28 Intel Corporation Netflow collection and export offload using network silicon
US9668382B2 (en) * 2015-08-11 2017-05-30 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Coolant distribution unit for a multi-node chassis
US9891935B2 (en) * 2015-08-13 2018-02-13 Altera Corporation Application-based dynamic heterogeneous many-core systems and methods
US9749266B2 (en) * 2015-08-28 2017-08-29 International Business Machines Corporation Coalescing messages using a network interface controller
US10296232B2 (en) * 2015-09-01 2019-05-21 Western Digital Technologies, Inc. Service level based control of storage systems
CN105183561B (en) * 2015-09-02 2018-09-14 浪潮(北京)电子信息产业有限公司 A kind of resource allocation methods and system
US11068469B2 (en) * 2015-09-04 2021-07-20 Arista Networks, Inc. System and method of a dynamic shared memory hash table with notifications
US10321597B2 (en) * 2015-09-07 2019-06-11 Dell Products, L.P. User interface enhanced storage sled handle with embedded security features
US10725963B2 (en) * 2015-09-12 2020-07-28 Microsoft Technology Licensing, Llc Distributed lock-free RDMA-based memory allocation and de-allocation
US10320710B2 (en) * 2015-09-25 2019-06-11 Intel Corporation Reliable replication mechanisms based on active-passive HFI protocols built on top of non-reliable multicast fabric implementations
US20170093770A1 (en) * 2015-09-25 2017-03-30 Intel Corporation Technologies for receive side message inspection and filtering
DE112015006944B4 (en) * 2015-09-25 2023-03-23 Intel Corporation Apparatus, system and method for facilitating communication over a link with a device external to an assembly
CN111865657B (en) * 2015-09-28 2022-01-11 华为技术有限公司 Acceleration management node, acceleration node, client and method
US9996539B1 (en) * 2015-09-30 2018-06-12 EMC IP Holding Company LLC Data protection and long term retention
US9912788B2 (en) * 2015-11-10 2018-03-06 Telefonaktiebolaget L M Ericsson (Publ) Systems and methods of an enhanced state-aware proxy device
US10206297B2 (en) * 2015-11-23 2019-02-12 Liqid Inc. Meshed architecture rackmount storage assembly
US10691731B2 (en) * 2015-11-26 2020-06-23 International Business Machines Corporation Efficient lookup in multiple bloom filters
WO2017095281A1 (en) * 2015-12-02 2017-06-08 Telefonaktiebolaget Lm Ericsson (Publ) Method and memory availability managing module for managing availability of memory pages
US10218647B2 (en) * 2015-12-07 2019-02-26 Intel Corporation Mechanism to support multiple-writer/multiple-reader concurrency for software flow/packet classification on general purpose multi-core systems
KR102509988B1 (en) * 2015-12-15 2023-03-14 삼성전자주식회사 Storage system and method for connection-based load balancing
US10230633B2 (en) * 2016-01-21 2019-03-12 Red Hat, Inc. Shared memory communication in software defined networking
CN108369520B (en) * 2016-01-25 2022-03-08 惠普发展公司,有限责任合伙企业 Protecting basic input/output (BIOS) code
US10713314B2 (en) * 2016-01-29 2020-07-14 Splunk Inc. Facilitating data model acceleration in association with an external data system
KR101936950B1 (en) * 2016-02-15 2019-01-11 주식회사 맴레이 Computing device, data transfer method between coprocessor and non-volatile memory, and program including the same
US9933821B2 (en) * 2016-02-17 2018-04-03 Quanta Computer Inc. Chassis with lock mechanism
US10180992B2 (en) * 2016-03-01 2019-01-15 Microsoft Technology Licensing, Llc Atomic updating of graph database index structures
US20170257970A1 (en) * 2016-03-04 2017-09-07 Radisys Corporation Rack having uniform bays and an optical interconnect system for shelf-level, modular deployment of sleds enclosing information technology equipment
US10069688B2 (en) * 2016-03-07 2018-09-04 International Business Machines Corporation Dynamically assigning, by functional domain, separate pairs of servers to primary and backup service processor modes within a grouping of servers
US10146550B2 (en) * 2016-03-28 2018-12-04 Dell Products, L.P. System and method to remotely detect and report bootable physical disk location
US10523598B2 (en) * 2016-04-04 2019-12-31 Futurewei Technologies, Inc. Multi-path virtual switching
US20180024964A1 (en) * 2016-07-19 2018-01-25 Pure Storage, Inc. Disaggregated compute resources and storage resources in a storage system
US10091904B2 (en) * 2016-07-22 2018-10-02 Intel Corporation Storage sled for data center
US11444866B2 (en) 2016-07-22 2022-09-13 Intel Corporation Methods and apparatus for composite node creation and management through SDI partitions
US10078468B2 (en) * 2016-08-18 2018-09-18 International Business Machines Corporation Slice migration in a dispersed storage network
US10277677B2 (en) * 2016-09-12 2019-04-30 Intel Corporation Mechanism for disaggregated storage class memory over fabric
US20180089044A1 (en) * 2016-09-27 2018-03-29 Francesc Guim Bernat Technologies for providing network interface support for remote memory and storage failover protection
US10936533B2 (en) * 2016-10-18 2021-03-02 Advanced Micro Devices, Inc. GPU remote communication with triggered operations
US10171309B1 (en) * 2016-12-23 2019-01-01 EMC IP Holding Company LLC Topology service
US10824355B2 (en) * 2017-01-10 2020-11-03 International Business Machines Corporation Hierarchical management of storage capacity and data volumes in a converged system
US10198270B2 (en) * 2017-01-19 2019-02-05 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Dynamic hardware configuration via firmware interface at computing device boot
US20180212885A1 (en) 2017-01-20 2018-07-26 Google Inc. Device and method for scalable traffic shaping at a receiver with a time-indexed data structure
US10922296B2 (en) * 2017-03-01 2021-02-16 Sap Se In-memory row storage durability
US10503427B2 (en) * 2017-03-10 2019-12-10 Pure Storage, Inc. Synchronously replicating datasets and other managed objects to cloud-based storage systems
US10628057B2 (en) * 2017-03-28 2020-04-21 Hewlett Packard Enterprise Development Lp Capability based locking and access of shared persistent memory
US10346315B2 (en) * 2017-05-26 2019-07-09 Oracle International Corporation Latchless, non-blocking dynamically resizable segmented hash index
US10324859B2 (en) * 2017-06-26 2019-06-18 Western Digital Technologies, Inc. Multi-plane memory management
US20190044809A1 (en) * 2017-08-30 2019-02-07 Intel Corporation Technologies for managing a flexible host interface of a network interface controller
US10334760B1 (en) * 2018-01-12 2019-06-25 Jed A. Darland System and method for helical cooling tower for efficient cooling
US10447273B1 (en) * 2018-09-11 2019-10-15 Advanced Micro Devices, Inc. Dynamic virtualized field-programmable gate array resource control for performance and reliability

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140181400A1 (en) * 2011-12-31 2014-06-26 Huawei Technologies Co., Ltd. Method for A Storage Device Processing Data and Storage Device
US20140068259A1 (en) * 2012-08-31 2014-03-06 Cleversafe, Inc. Secure data access in a dispersed storage network
US20180027018A1 (en) * 2012-08-31 2018-01-25 Jpmorgan Chase Bank, N.A. System and Method for Sharing Information in a Private Ecosystem
US20170277467A1 (en) * 2016-03-22 2017-09-28 Oracle International Corporation Efficient and thread-safe objects for dynamically-typed languages
US20180027051A1 (en) * 2016-07-25 2018-01-25 Red Hat, Inc. Application management in an application deployment pipeline
US20180089266A1 (en) * 2016-09-28 2018-03-29 Microsoft Technology Licensing, Llc Direct table association in in-memory databases

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11595277B2 (en) 2016-07-22 2023-02-28 Intel Corporation Technologies for switching network traffic in a data center
US10785549B2 (en) 2016-07-22 2020-09-22 Intel Corporation Technologies for switching network traffic in a data center
US10791384B2 (en) 2016-07-22 2020-09-29 Intel Corporation Technologies for switching network traffic in a data center
US10802229B2 (en) 2016-07-22 2020-10-13 Intel Corporation Technologies for switching network traffic in a data center
US11128553B2 (en) 2016-07-22 2021-09-21 Intel Corporation Technologies for switching network traffic in a data center
US12081323B2 (en) 2016-07-22 2024-09-03 Intel Corporation Techniques to control system updates and configuration changes via the cloud
US12040889B2 (en) 2016-07-22 2024-07-16 Intel Corporation Technologies for switching network traffic in a data center
US11977923B2 (en) 2016-11-29 2024-05-07 Intel Corporation Cloud-based scale-up system composition
US11907557B2 (en) 2016-11-29 2024-02-20 Intel Corporation Technologies for dividing work across accelerator devices
US11995330B2 (en) 2016-11-29 2024-05-28 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US11137922B2 (en) 2016-11-29 2021-10-05 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US11194715B2 (en) * 2019-01-28 2021-12-07 Ateme Method for data communication, and system for implementing the method
CN110209249A (en) * 2019-06-06 2019-09-06 英业达科技有限公司 The casing of server

Also Published As

Publication number Publication date
US10728024B2 (en) 2020-07-28
US20200389296A1 (en) 2020-12-10
US20190044849A1 (en) 2019-02-07
US10469252B2 (en) 2019-11-05
US10567166B2 (en) 2020-02-18
JP2019047489A (en) 2019-03-22
US20210288793A1 (en) 2021-09-16
US20190042090A1 (en) 2019-02-07
US20190035483A1 (en) 2019-01-31
US11588624B2 (en) 2023-02-21
US11843691B2 (en) 2023-12-12
CN116501683A (en) 2023-07-28
CN109428770A (en) 2019-03-05
US20190042091A1 (en) 2019-02-07
US20210306142A1 (en) 2021-09-30
US20220012105A1 (en) 2022-01-13
CN112732447B (en) 2024-05-14
CN115543204A (en) 2022-12-30
EP3451635B1 (en) 2020-07-15
CN109426648A (en) 2019-03-05
CN109426647A (en) 2019-03-05
US20230412365A1 (en) 2023-12-21
US10554391B2 (en) 2020-02-04
US10756886B2 (en) 2020-08-25
CN109426649B (en) 2024-09-03
US11050554B2 (en) 2021-06-29
US20190034490A1 (en) 2019-01-31
US20190042122A1 (en) 2019-02-07
US20190042611A1 (en) 2019-02-07
US20190044859A1 (en) 2019-02-07
EP3460662A1 (en) 2019-03-27
EP3451196A1 (en) 2019-03-06
EP3454530A1 (en) 2019-03-13
CN109426649A (en) 2019-03-05
US20230050698A1 (en) 2023-02-16
CN109426456A (en) 2019-03-05
US11249816B2 (en) 2022-02-15
US20190042136A1 (en) 2019-02-07
CN113806260A (en) 2021-12-17
CN109426652A (en) 2019-03-05
US20190044809A1 (en) 2019-02-07
EP3823245A1 (en) 2021-05-19
US20190042277A1 (en) 2019-02-07
CN117725004A (en) 2024-03-19
CN112732447A (en) 2021-04-30
US20190034383A1 (en) 2019-01-31
CN109426569A (en) 2019-03-05
US20190042408A1 (en) 2019-02-07
US10581596B2 (en) 2020-03-03
US20190042126A1 (en) 2019-02-07
US20240195605A1 (en) 2024-06-13
US20230421358A1 (en) 2023-12-28
US10476670B2 (en) 2019-11-12
CN109426648B (en) 2024-09-10
CN109426455A (en) 2019-03-05
JP7214394B2 (en) 2023-01-30
US20190034102A1 (en) 2019-01-31
US11522682B2 (en) 2022-12-06
US11888967B2 (en) 2024-01-30
US20190069434A1 (en) 2019-02-28
EP3451635A1 (en) 2019-03-06
DE102018212479A1 (en) 2019-02-28
US11025411B2 (en) 2021-06-01
US20190042234A1 (en) 2019-02-07
CN109428770B (en) 2024-08-13

Similar Documents

Publication Publication Date Title
US20190052457A1 (en) Technologies for providing efficient sharing of encrypted data in a disaggregated architecture
US11416309B2 (en) Technologies for dynamic accelerator selection
US11861424B2 (en) Technologies for providing efficient reprovisioning in an accelerator device
US11228539B2 (en) Technologies for managing disaggregated accelerator networks based on remote direct memory access
EP3731091A1 (en) Technologies for providing an accelerator device discovery service
US20200228626A1 (en) Technologies for providing advanced resource management in a disaggregated environment
US10970246B2 (en) Technologies for remote networked accelerators
US10579547B2 (en) Technologies for providing I/O channel abstraction for accelerator device kernels
US20210073161A1 (en) Technologies for establishing communication channel between accelerator device kernels
EP3757785B1 (en) Technologies for facilitating remote memory requests in accelerator devices
EP3757786A1 (en) Technologies for providing inter-kernel application programming interfaces for an accelerated architecture
US11537191B2 (en) Technologies for providing advanced management of power usage limits in a disaggregated architecture
US11474700B2 (en) Technologies for compressing communication for accelerator devices
US20200341904A1 (en) Technologies for chained memory search with hardware acceleration
US20190324802A1 (en) Technologies for providing efficient message polling
EP3731095A1 (en) Technologies for providing inter-kernel communication abstraction to support scale-up and scale-out

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTEL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CONNOR, PATRICK;DUBAL, SCOTT;HERDRICH, ANDREW J.;AND OTHERS;SIGNING DATES FROM 20180330 TO 20180402;REEL/FRAME:045410/0486

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION