US20180150240A1 - Technologies for offloading i/o intensive operations to a data storage sled - Google Patents

Technologies for offloading i/o intensive operations to a data storage sled Download PDF

Info

Publication number
US20180150240A1
US20180150240A1 US15/720,236 US201715720236A US2018150240A1 US 20180150240 A1 US20180150240 A1 US 20180150240A1 US 201715720236 A US201715720236 A US 201715720236A US 2018150240 A1 US2018150240 A1 US 2018150240A1
Authority
US
United States
Prior art keywords
sled
data storage
compute
workload
data
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/720,236
Inventor
Francesc Guim Bernat
Karthik Kumar
Mark A. Schmisseur
Thomas Willhalm
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/720,236 priority Critical patent/US20180150240A1/en
Assigned to INTEL CORPORATION reassignment INTEL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WILLHALM, Thomas, KUMAR, KARTHIK, BERNAT, FRANCESC GUIM, SCHMISSEUR, MARK A.
Publication of US20180150240A1 publication Critical patent/US20180150240A1/en
Priority to EP18191343.5A priority patent/EP3460662A1/en
Priority to CN201810995046.XA priority patent/CN109426455A/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • 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
    • 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0706Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
    • G06F11/0709Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0751Error or fault detection not based on redundancy
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/079Root cause analysis, i.e. error or fault diagnosis
    • 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/3003Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/3034Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a storage system, e.g. DASD based or network based
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3055Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3065Monitoring arrangements determined by the means or processing involved in reporting the monitored data
    • G06F11/3072Monitoring arrangements determined by the means or processing involved in reporting the monitored data where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting
    • G06F11/3079Monitoring arrangements determined by the means or processing involved in reporting the monitored data where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting the data filtering being achieved by reporting only the changes of the monitored data
    • 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
    • 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/0284Multiple user address space allocation, e.g. using different base addresses
    • 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/0646Configuration or reconfiguration
    • G06F12/0692Multiconfiguration, e.g. local and global addressing
    • 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
    • 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
    • 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/4027Coupling between buses using bus bridges
    • 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
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/17Details of further file system functions
    • G06F16/174Redundancy elimination performed by the file system
    • G06F16/1744Redundancy elimination performed by the file system using compression, e.g. sparse files
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/44Program or device authentication
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/50Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
    • G06F21/57Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/71Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
    • G06F21/73Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information by creating or determining hardware identification, e.g. serial numbers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/71Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
    • G06F21/76Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information in application-specific integrated circuits [ASIC] or field-programmable devices, e.g. field-programmable gate arrays [FPGA] or programmable logic devices [PLD]
    • 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/0608Saving storage space on 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/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/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0617Improving the reliability of storage systems in relation to availability
    • 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/064Management of blocks
    • G06F3/0641De-duplication techniques
    • 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/0653Monitoring storage devices or 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/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
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/06Arrangements for sorting, selecting, merging, or comparing data on individual record carriers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • G06F8/654Updates using techniques specially adapted for alterable solid state memories, e.g. for EEPROM or flash memories
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • G06F8/656Updates while running
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • G06F8/658Incremental updates; Differential updates
    • 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/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3836Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution
    • G06F9/3851Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution from multiple instruction streams, e.g. multistreaming
    • 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/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38Concurrent instruction execution, e.g. pipeline or look ahead
    • G06F9/3885Concurrent instruction execution, e.g. pipeline or look ahead using a plurality of independent parallel functional units
    • G06F9/3889Concurrent instruction execution, e.g. pipeline or look ahead using a plurality of independent parallel functional units controlled by multiple instructions, e.g. MIMD, decoupled access or execute
    • G06F9/3891Concurrent instruction execution, e.g. pipeline or look ahead using a plurality of independent parallel functional units controlled by multiple instructions, e.g. MIMD, decoupled access or execute organised in groups of units sharing resources, e.g. clusters
    • 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/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • 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
    • 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/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • 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
    • 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/5038Allocation 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 execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
    • 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/5083Techniques for rebalancing the load in a distributed 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/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/544Buffers; Shared memory; Pipes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/20Processor architectures; Processor configuration, e.g. pipelining
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/60Memory management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00Image coding
    • G06T9/005Statistical coding, e.g. Huffman, run length coding
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01RELECTRICALLY-CONDUCTIVE CONNECTIONS; STRUCTURAL ASSOCIATIONS OF A PLURALITY OF MUTUALLY-INSULATED ELECTRICAL CONNECTING ELEMENTS; COUPLING DEVICES; CURRENT COLLECTORS
    • H01R13/00Details of coupling devices of the kinds covered by groups H01R12/70 or H01R24/00 - H01R33/00
    • H01R13/44Means for preventing access to live contacts
    • H01R13/447Shutter or cover plate
    • H01R13/453Shutter or cover plate opened by engagement of counterpart
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01RELECTRICALLY-CONDUCTIVE CONNECTIONS; STRUCTURAL ASSOCIATIONS OF A PLURALITY OF MUTUALLY-INSULATED ELECTRICAL CONNECTING ELEMENTS; COUPLING DEVICES; CURRENT COLLECTORS
    • H01R13/00Details of coupling devices of the kinds covered by groups H01R12/70 or H01R24/00 - H01R33/00
    • H01R13/44Means for preventing access to live contacts
    • H01R13/447Shutter or cover plate
    • H01R13/453Shutter or cover plate opened by engagement of counterpart
    • H01R13/4536Inwardly pivoting shutter
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01RELECTRICALLY-CONDUCTIVE CONNECTIONS; STRUCTURAL ASSOCIATIONS OF A PLURALITY OF MUTUALLY-INSULATED ELECTRICAL CONNECTING ELEMENTS; COUPLING DEVICES; CURRENT COLLECTORS
    • H01R13/00Details of coupling devices of the kinds covered by groups H01R12/70 or H01R24/00 - H01R33/00
    • H01R13/44Means for preventing access to live contacts
    • H01R13/447Shutter or cover plate
    • H01R13/453Shutter or cover plate opened by engagement of counterpart
    • H01R13/4538Covers sliding or withdrawing in the direction of engagement
    • HELECTRICITY
    • H01ELECTRIC ELEMENTS
    • H01RELECTRICALLY-CONDUCTIVE CONNECTIONS; STRUCTURAL ASSOCIATIONS OF A PLURALITY OF MUTUALLY-INSULATED ELECTRICAL CONNECTING ELEMENTS; COUPLING DEVICES; CURRENT COLLECTORS
    • H01R13/00Details of coupling devices of the kinds covered by groups H01R12/70 or H01R24/00 - H01R33/00
    • H01R13/62Means for facilitating engagement or disengagement of coupling parts or for holding them in engagement
    • H01R13/629Additional means for facilitating engagement or disengagement of coupling parts, e.g. aligning or guiding means, levers, gas pressure electrical locking indicators, manufacturing tolerances
    • H01R13/631Additional means for facilitating engagement or disengagement of coupling parts, e.g. aligning or guiding means, levers, gas pressure electrical locking indicators, manufacturing tolerances for engagement only
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03KPULSE TECHNIQUE
    • H03K19/00Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
    • H03K19/02Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components
    • H03K19/173Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits using specified components using elementary logic circuits as components
    • H03K19/1731Optimisation thereof
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60General implementation details not specific to a particular type of compression
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60General implementation details not specific to a particular type of compression
    • H03M7/6011Encoder aspects
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60General implementation details not specific to a particular type of compression
    • H03M7/6017Methods or arrangements to increase the throughput
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60General implementation details not specific to a particular type of compression
    • H03M7/6017Methods or arrangements to increase the throughput
    • H03M7/6029Pipelining
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854Wide area networks, e.g. public data networks
    • H04L12/2856Access arrangements, e.g. Internet access
    • H04L12/2869Operational details of access network equipments
    • H04L12/2878Access multiplexer, e.g. DSLAM
    • H04L12/2879Access multiplexer, e.g. DSLAM characterised by the network type on the uplink side, i.e. towards the service provider network
    • H04L12/2881IP/Ethernet DSLAM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4633Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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/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/085Retrieval of network configuration; Tracking network configuration history
    • H04L41/0853Retrieval of network configuration; Tracking network configuration history by actively collecting configuration information or by backing up configuration information
    • 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/12Discovery or management of network topologies
    • 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/04Processing captured monitoring data, e.g. for logfile generation
    • 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
    • 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
    • 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
    • H04L43/0894Packet rate
    • 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/20Traffic policing
    • 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/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • 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/10Packet switching elements characterised by the switching fabric construction
    • H04L49/104Asynchronous transfer mode [ATM] switching fabrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/50Address allocation
    • H04L61/5007Internet protocol [IP] addresses
    • 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
    • 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/1014Server selection for load balancing based on the content of a request
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/60Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63Routing a service request depending on the request content or context
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/75Indicating network or usage conditions on the user display
    • 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)
    • H04L9/0822Key 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) using key encryption key
    • 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/1438Back panels or connecting means therefor; Terminals; Coding means to avoid wrong insertion
    • H05K7/1452Mounting of connectors; Switching; Reinforcing of back panels
    • 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/1487Blade assemblies, e.g. blade cases or inner arrangements within a blade
    • 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/1491Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures having cable management arrangements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1448Management of the data involved in backup or backup restore
    • G06F11/1453Management of the data involved in backup or backup restore using de-duplication of the data
    • 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
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/80Architectures of general purpose stored program computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • 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/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • G06F16/285Clustering or classification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/40Specific encoding of data in memory or cache
    • G06F2212/401Compressed data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/40Specific encoding of data in memory or cache
    • G06F2212/402Encrypted data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2107File encryption
    • 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/046Network management architectures or arrangements comprising network management agents or mobile agents therefor
    • 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/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
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/78Architectures of resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/14Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1408Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
    • H04L63/1425Traffic logging, e.g. anomaly detection
    • 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
    • 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/1438Back panels or connecting means therefor; Terminals; Coding means to avoid wrong insertion
    • H05K7/1447External wirings; Wiring ducts; Laying cables
    • 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/1492Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures having electrical distribution arrangements, e.g. power supply or data communications

Definitions

  • the network can become congested when the amount of data requested is relatively large.
  • other compute devices may be unable to perform operations that also require the communication of relatively large amounts of data through the network in a timely manner (e.g., in accordance with a latency or throughput target specified in a service level agreement with a customer).
  • the network may become a bottleneck for the execution of workloads in the data center and the compute resources (e.g., processors) of the compute devices may be wasted as those resources sit idle waiting for requested data to arrive.
  • an operator of the data center may spend monetary resources to install a higher throughput network.
  • the capacity of the higher throughput network may go largely unused, as the times when multiple workloads are concurrently in I/O intensive phases (e.g., periods of high network utilization to access remote data storage) may occur only a small percentage of the total time that the data center is in use.
  • FIG. 1 is a diagram of a conceptual overview of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 2 is a diagram of an example embodiment of a logical configuration of a rack of the data center of FIG. 1 ;
  • FIG. 3 is a diagram of an example embodiment of another data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 4 is a diagram of another example embodiment of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 5 is a diagram of a connectivity scheme representative of link-layer connectivity that may be established among various sleds of the data centers of FIGS. 1, 3, and 4 ;
  • FIG. 6 is a diagram of a rack architecture that may be representative of an architecture of any particular one of the racks depicted in FIGS. 1-4 according to some embodiments;
  • FIG. 7 is a diagram of an example embodiment of a sled that may be used with the rack architecture of FIG. 6 ;
  • FIG. 8 is a diagram of an example embodiment of a rack architecture to provide support for sleds featuring expansion capabilities
  • FIG. 9 is a diagram of an example embodiment of a rack implemented according to the rack architecture of FIG. 8 ;
  • FIG. 10 is a diagram of an example embodiment of a sled designed for use in conjunction with the rack of FIG. 9 ;
  • FIG. 11 is a diagram of an example embodiment of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 12 is a simplified block diagram of at least one embodiment of a system for migrating an I/O intensive phase of a workload from a compute sled to a data storage sled;
  • FIG. 13 is a simplified block diagram of at least one embodiment of a compute sled of the system of FIG. 12 ;
  • FIG. 14 is a simplified block diagram of at least one embodiment of a data storage sled of the system of FIG. 13 ;
  • FIG. 15 is a simplified block diagram of at least one embodiment of an environment that may be established by the compute sled of FIGS. 12 and 13 ;
  • FIG. 16 is a simplified block diagram of at least one embodiment of an environment that may be established by the data storage sled of FIGS. 12 and 14 ;
  • FIGS. 17-18 are a simplified flow diagram of at least one embodiment of a method for migrating an I/O intensive phase of a workload to a data storage sled that may be performed by the compute sled of FIGS. 12 and 13 ;
  • FIGS. 19-20 are a simplified flow diagram of at least one embodiment of a method for accelerating an I/O intensive phase of a workload from a compute sled that may be performed by the data storage sled of FIGS. 12 and 14 ;
  • FIG. 21 is a simplified diagram of phases of execution of a workload, the sleds on which the workload is executed in each phase, and the amount of data operated on in each phase.
  • 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).
  • FIG. 1 illustrates a conceptual overview of a data center 100 that may generally be representative of a data center or other type of computing network in/for which one or more techniques described herein may be implemented according to various embodiments.
  • data center 100 may generally contain a plurality of racks, each of which may house computing equipment comprising a respective set of physical resources.
  • data center 100 contains four racks 102 A to 102 D, which house computing equipment comprising respective sets of physical resources (PCRs) 105 A to 105 D.
  • PCRs physical resources
  • a collective set of physical resources 106 of data center 100 includes the various sets of physical resources 105 A to 105 D that are distributed among racks 102 A to 102 D.
  • Physical resources 106 may include resources of multiple types, such as—for example—processors, co-processors, accelerators, field programmable gate arrays (FPGAs), memory, and storage. The embodiments are not limited to these examples.
  • the illustrative data center 100 differs from typical data centers in many ways.
  • the sleds are shallower than typical boards. In other words, the sleds are shorter from the front to the back, where cooling fans are located. This decreases the length of the path that air must to travel across the components on the board.
  • the components on the sled are spaced further apart than in typical circuit boards, and the components are arranged to reduce or eliminate shadowing (i.e., one component in the air flow path of another component).
  • processing components such as the processors are located on a top side of a sled while near memory, such as DIMMs, are located on a bottom side of the sled.
  • near memory such as DIMMs
  • the components may operate at higher frequencies and power levels than in typical systems, thereby increasing performance
  • the sleds are configured to blindly mate with power and data communication cables in each rack 102 A, 102 B, 102 C, 102 D, enhancing their ability to be quickly removed, upgraded, reinstalled, and/or replaced.
  • individual components located on the sleds such as processors, accelerators, memory, and data storage drives, are configured to be easily upgraded due to their increased spacing from each other.
  • the components additionally include hardware attestation features to prove their authenticity.
  • the data center 100 utilizes a single network architecture (“fabric”) that supports multiple other network architectures including Ethernet and Omni-Path.
  • the sleds in the illustrative embodiment, are coupled to switches via optical fibers, which provide higher bandwidth and lower latency than typical twisted pair cabling (e.g., Category 5, Category 5e, Category 6, etc.).
  • the data center 100 may, in use, pool resources, such as memory, accelerators (e.g., graphics accelerators, FPGAs, ASICs, etc.), and data storage drives that are physically disaggregated, and provide them to compute resources (e.g., processors) on an as needed basis, enabling the compute resources to access the pooled resources as if they were local.
  • the illustrative data center 100 additionally receives utilization information for the various resources, predicts resource utilization for different types of workloads based on past resource utilization, and dynamically reallocates the resources based on this information.
  • the racks 102 A, 102 B, 102 C, 102 D of the data center 100 may include physical design features that facilitate the automation of a variety of types of maintenance tasks.
  • data center 100 may be implemented using racks that are designed to be robotically-accessed, and to accept and house robotically-manipulatable resource sleds.
  • the racks 102 A, 102 B, 102 C, 102 D include integrated power sources that receive a greater voltage than is typical for power sources. The increased voltage enables the power sources to provide additional power to the components on each sled, enabling the components to operate at higher than typical frequencies.
  • FIG. 2 illustrates an exemplary logical configuration of a rack 202 of the data center 100 .
  • rack 202 may generally house a plurality of sleds, each of which may comprise a respective set of physical resources.
  • rack 202 houses sleds 204 - 1 to 204 - 4 comprising respective sets of physical resources 205 - 1 to 205 - 4 , each of which constitutes a portion of the collective set of physical resources 206 comprised in rack 202 .
  • rack 202 is representative of—for example—rack 102 A
  • physical resources 206 may correspond to the physical resources 105 A comprised in rack 102 A.
  • physical resources 105 A may thus be made up of the respective sets of physical resources, including physical storage resources 205 - 1 , physical accelerator resources 205 - 2 , physical memory resources 205 - 3 , and physical compute resources 205 - 4 comprised in the sleds 204 - 1 to 204 - 4 of rack 202 .
  • the embodiments are not limited to this example.
  • Each sled may contain a pool of each of the various types of physical resources (e.g., compute, memory, accelerator, storage).
  • robotically accessible and robotically manipulatable sleds comprising disaggregated resources, each type of resource can be upgraded independently of each other and at their own optimized refresh rate.
  • FIG. 3 illustrates an example of a data center 300 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments.
  • data center 300 comprises racks 302 - 1 to 302 - 32 .
  • the racks of data center 300 may be arranged in such fashion as to define and/or accommodate various access pathways.
  • the racks of data center 300 may be arranged in such fashion as to define and/or accommodate access pathways 311 A, 311 B, 311 C, and 311 D.
  • the presence of such access pathways may generally enable automated maintenance equipment, such as robotic maintenance equipment, to physically access the computing equipment housed in the various racks of data center 300 and perform automated maintenance tasks (e.g., replace a failed sled, upgrade a sled).
  • automated maintenance equipment such as robotic maintenance equipment
  • the dimensions of access pathways 311 A, 311 B, 311 C, and 311 D, the dimensions of racks 302 - 1 to 302 - 32 , and/or one or more other aspects of the physical layout of data center 300 may be selected to facilitate such automated operations. The embodiments are not limited in this context.
  • FIG. 4 illustrates an example of a data center 400 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments.
  • data center 400 may feature an optical fabric 412 .
  • Optical fabric 412 may generally comprise a combination of optical signaling media (such as optical cabling) and optical switching infrastructure via which any particular sled in data center 400 can send signals to (and receive signals from) each of the other sleds in data center 400 .
  • the signaling connectivity that optical fabric 412 provides to any given sled may include connectivity both to other sleds in a same rack and sleds in other racks. In the particular non-limiting example depicted in FIG.
  • data center 400 includes four racks 402 A to 402 D.
  • Racks 402 A to 402 D house respective pairs of sleds 404 A- 1 and 404 A- 2 , 404 B- 1 and 404 B- 2 , 404 C- 1 and 404 C- 2 , and 404 D- 1 and 404 D- 2 .
  • data center 400 comprises a total of eight sleds. Via optical fabric 412 , each such sled may possess signaling connectivity with each of the seven other sleds in data center 400 .
  • sled 404 A- 1 in rack 402 A may possess signaling connectivity with sled 404 A- 2 in rack 402 A, as well as the six other sleds 404 B- 1 , 404 B- 2 , 404 C- 1 , 404 C- 2 , 404 D- 1 , and 404 D- 2 that are distributed among the other racks 402 B, 402 C, and 402 D of data center 400 .
  • the embodiments are not limited to this example.
  • FIG. 5 illustrates an overview of a connectivity scheme 500 that may generally be representative of link-layer connectivity that may be established in some embodiments among the various sleds of a data center, such as any of example data centers 100 , 300 , and 400 of FIGS. 1, 3, and 4 .
  • Connectivity scheme 500 may be implemented using an optical fabric that features a dual-mode optical switching infrastructure 514 .
  • Dual-mode optical switching infrastructure 514 may generally comprise a switching infrastructure that is capable of receiving communications according to multiple link-layer protocols via a same unified set of optical signaling media, and properly switching such communications.
  • dual-mode optical switching infrastructure 514 may be implemented using one or more dual-mode optical switches 515 .
  • dual-mode optical switches 515 may generally comprise high-radix switches.
  • dual-mode optical switches 515 may comprise multi-ply switches, such as four-ply switches. In various embodiments, dual-mode optical switches 515 may feature integrated silicon photonics that enable them to switch communications with significantly reduced latency in comparison to conventional switching devices. In some embodiments, dual-mode optical switches 515 may constitute leaf switches 530 in a leaf-spine architecture additionally including one or more dual-mode optical spine switches 520 .
  • dual-mode optical switches may be capable of receiving both Ethernet protocol communications carrying Internet Protocol (IP packets) and communications according to a second, high-performance computing (HPC) link-layer protocol (e.g., Intel's Omni-Path Architecture's, InfiniBandTM) via optical signaling media of an optical fabric.
  • HPC high-performance computing
  • connectivity scheme 500 may thus provide support for link-layer connectivity via both Ethernet links and HPC links.
  • both Ethernet and HPC communications can be supported by a single high-bandwidth, low-latency switch fabric.
  • the embodiments are not limited to this example.
  • FIG. 6 illustrates a general overview of a rack architecture 600 that may be representative of an architecture of any particular one of the racks depicted in FIGS. 1 to 4 according to some embodiments.
  • rack architecture 600 may generally feature a plurality of sled spaces into which sleds may be inserted, each of which may be robotically-accessible via a rack access region 601 .
  • rack architecture 600 features five sled spaces 603 - 1 to 603 - 5 .
  • Sled spaces 603 - 1 to 603 - 5 feature respective multi-purpose connector modules (MPCMs) 616 - 1 to 616 - 5 .
  • MPCMs multi-purpose connector modules
  • FIG. 7 illustrates an example of a sled 704 that may be representative of a sled of such a type.
  • sled 704 may comprise a set of physical resources 705 , as well as an MPCM 716 designed to couple with a counterpart MPCM when sled 704 is inserted into a sled space such as any of sled spaces 603 - 1 to 603 - 5 of FIG. 6 .
  • Sled 704 may also feature an expansion connector 717 .
  • Expansion connector 717 may generally comprise a socket, slot, or other type of connection element that is capable of accepting one or more types of expansion modules, such as an expansion sled 718 .
  • expansion connector 717 may provide physical resources 705 with access to supplemental computing resources 705 B residing on expansion sled 718 .
  • the embodiments are not limited in this context.
  • FIG. 8 illustrates an example of a rack architecture 800 that may be representative of a rack architecture that may be implemented in order to provide support for sleds featuring expansion capabilities, such as sled 704 of FIG. 7 .
  • rack architecture 800 includes seven sled spaces 803 - 1 to 803 - 7 , which feature respective MPCMs 816 - 1 to 816 - 7 .
  • Sled spaces 803 - 1 to 803 - 7 include respective primary regions 803 - 1 A to 803 - 7 A and respective expansion regions 803 - 1 B to 803 - 7 B.
  • the primary region may generally constitute a region of the sled space that physically accommodates the inserted sled.
  • the expansion region may generally constitute a region of the sled space that can physically accommodate an expansion module, such as expansion sled 718 of FIG. 7 , in the event that the inserted sled is configured with such a module.
  • FIG. 9 illustrates an example of a rack 902 that may be representative of a rack implemented according to rack architecture 800 of FIG. 8 according to some embodiments.
  • rack 902 features seven sled spaces 903 - 1 to 903 - 7 , which include respective primary regions 903 - 1 A to 903 - 7 A and respective expansion regions 903 - 1 B to 903 - 7 B.
  • temperature control in rack 902 may be implemented using an air cooling system.
  • rack 902 may feature a plurality of fans 919 that are generally arranged to provide air cooling within the various sled spaces 903 - 1 to 903 - 7 .
  • the height of the sled space is greater than the conventional “ 1 U” server height.
  • fans 919 may generally comprise relatively slow, large diameter cooling fans as compared to fans used in conventional rack configurations. Running larger diameter cooling fans at lower speeds may increase fan lifetime relative to smaller diameter cooling fans running at higher speeds while still providing the same amount of cooling.
  • the sleds are physically shallower than conventional rack dimensions. Further, components are arranged on each sled to reduce thermal shadowing (i.e., not arranged serially in the direction of air flow).
  • the wider, shallower sleds allow for an increase in device performance because the devices can be operated at a higher thermal envelope (e.g., 250 W) due to improved cooling (i.e., no thermal shadowing, more space between devices, more room for larger heat sinks, etc.).
  • a higher thermal envelope e.g. 250 W
  • improved cooling i.e., no thermal shadowing, more space between devices, more room for larger heat sinks, etc.
  • MPCMs 916 - 1 to 916 - 7 may be configured to provide inserted sleds with access to power sourced by respective power modules 920 - 1 to 920 - 7 , each of which may draw power from an external power source 919 .
  • external power source 921 may deliver alternating current (AC) power to rack 902
  • power modules 920 - 1 to 920 - 7 may be configured to convert such AC power to direct current (DC) power to be sourced to inserted sleds.
  • power modules 920 - 1 to 920 - 7 may be configured to convert 277-volt AC power into 12-volt DC power for provision to inserted sleds via respective MPCMs 916 - 1 to 916 - 7 .
  • the embodiments are not limited to this example.
  • MPCMs 916 - 1 to 916 - 7 may also be arranged to provide inserted sleds with optical signaling connectivity to a dual-mode optical switching infrastructure 914 , which may be the same as—or similar to—dual-mode optical switching infrastructure 514 of FIG. 5 .
  • optical connectors contained in MPCMs 916 - 1 to 916 - 7 may be designed to couple with counterpart optical connectors contained in MPCMs of inserted sleds to provide such sleds with optical signaling connectivity to dual-mode optical switching infrastructure 914 via respective lengths of optical cabling 922 - 1 to 922 - 7 .
  • each such length of optical cabling may extend from its corresponding MPCM to an optical interconnect loom 923 that is external to the sled spaces of rack 902 .
  • optical interconnect loom 923 may be arranged to pass through a support post or other type of load-bearing element of rack 902 . The embodiments are not limited in this context. Because inserted sleds connect to an optical switching infrastructure via MPCMs, the resources typically spent in manually configuring the rack cabling to accommodate a newly inserted sled can be saved.
  • FIG. 10 illustrates an example of a sled 1004 that may be representative of a sled designed for use in conjunction with rack 902 of FIG. 9 according to some embodiments.
  • Sled 1004 may feature an MPCM 1016 that comprises an optical connector 1016 A and a power connector 1016 B, and that is designed to couple with a counterpart MPCM of a sled space in conjunction with insertion of MPCM 1016 into that sled space. Coupling MPCM 1016 with such a counterpart MPCM may cause power connector 1016 to couple with a power connector comprised in the counterpart MPCM. This may generally enable physical resources 1005 of sled 1004 to source power from an external source, via power connector 1016 and power transmission media 1024 that conductively couples power connector 1016 to physical resources 1005 .
  • Dual-mode optical network interface circuitry 1026 may generally comprise circuitry that is capable of communicating over optical signaling media according to each of multiple link-layer protocols supported by dual-mode optical switching infrastructure 914 of FIG. 9 .
  • dual-mode optical network interface circuitry 1026 may be capable both of Ethernet protocol communications and of communications according to a second, high-performance protocol.
  • dual-mode optical network interface circuitry 1026 may include one or more optical transceiver modules 1027 , each of which may be capable of transmitting and receiving optical signals over each of one or more optical channels. The embodiments are not limited in this context.
  • Coupling MPCM 1016 with a counterpart MPCM of a sled space in a given rack may cause optical connector 1016 A to couple with an optical connector comprised in the counterpart MPCM.
  • This may generally establish optical connectivity between optical cabling of the sled and dual-mode optical network interface circuitry 1026 , via each of a set of optical channels 1025 .
  • Dual-mode optical network interface circuitry 1026 may communicate with the physical resources 1005 of sled 1004 via electrical signaling media 1028 .
  • a relatively higher thermal envelope e.g. 250 W
  • a sled may include one or more additional features to facilitate air cooling, such as a heatpipe and/or heat sinks arranged to dissipate heat generated by physical resources 1005 .
  • additional features such as a heatpipe and/or heat sinks arranged to dissipate heat generated by physical resources 1005 .
  • any given sled that features the design elements of sled 1004 may also feature an expansion connector according to some embodiments. The embodiments are not limited in this context.
  • FIG. 11 illustrates an example of a data center 1100 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments.
  • a physical infrastructure management framework 1150 A may be implemented to facilitate management of a physical infrastructure 1100 A of data center 1100 .
  • one function of physical infrastructure management framework 1150 A may be to manage automated maintenance functions within data center 1100 , such as the use of robotic maintenance equipment to service computing equipment within physical infrastructure 1100 A.
  • physical infrastructure 1100 A may feature an advanced telemetry system that performs telemetry reporting that is sufficiently robust to support remote automated management of physical infrastructure 1100 A.
  • telemetry information provided by such an advanced telemetry system may support features such as failure prediction/prevention capabilities and capacity planning capabilities.
  • physical infrastructure management framework 1150 A may also be configured to manage authentication of physical infrastructure components using hardware attestation techniques. For example, robots may verify the authenticity of components before installation by analyzing information collected from a radio frequency identification (RFID) tag associated with each component to be installed.
  • RFID radio frequency identification
  • the physical infrastructure 1100 A of data center 1100 may comprise an optical fabric 1112 , which may include a dual-mode optical switching infrastructure 1114 .
  • Optical fabric 1112 and dual-mode optical switching infrastructure 1114 may be the same as—or similar to—optical fabric 412 of FIG. 4 and dual-mode optical switching infrastructure 514 of FIG. 5 , respectively, and may provide high-bandwidth, low-latency, multi-protocol connectivity among sleds of data center 1100 .
  • the availability of such connectivity may make it feasible to disaggregate and dynamically pool resources such as accelerators, memory, and storage.
  • one or more pooled accelerator sleds 1130 may be included among the physical infrastructure 1100 A of data center 1100 , each of which may comprise a pool of accelerator resources—such as co-processors and/or FPGAs, for example—that is globally accessible to other sleds via optical fabric 1112 and dual-mode optical switching infrastructure 1114 .
  • accelerator resources such as co-processors and/or FPGAs, for example
  • one or more pooled storage sleds 1132 may be included among the physical infrastructure 1100 A of data center 1100 , each of which may comprise a pool of storage resources that is globally accessible to other sleds via optical fabric 1112 and dual-mode optical switching infrastructure 1114 .
  • such pooled storage sleds 1132 may comprise pools of solid-state storage devices such as solid-state drives (SSDs).
  • SSDs solid-state drives
  • one or more high-performance processing sleds 1134 may be included among the physical infrastructure 1100 A of data center 1100 .
  • high-performance processing sleds 1134 may comprise pools of high-performance processors, as well as cooling features that enhance air cooling to yield a higher thermal envelope of up to 250 W or more.
  • any given high-performance processing sled 1134 may feature an expansion connector 1117 that can accept a far memory expansion sled, such that the far memory that is locally available to that high-performance processing sled 1134 is disaggregated from the processors and near memory comprised on that sled.
  • such a high-performance processing sled 1134 may be configured with far memory using an expansion sled that comprises low-latency SSD storage.
  • the optical infrastructure allows for compute resources on one sled to utilize remote accelerator/FPGA, memory, and/or SSD resources that are disaggregated on a sled located on the same rack or any other rack in the data center.
  • the remote resources can be located one switch jump away or two-switch jumps away in the spine-leaf network architecture described above with reference to FIG. 5 .
  • the embodiments are not limited in this context.
  • one or more layers of abstraction may be applied to the physical resources of physical infrastructure 1100 A in order to define a virtual infrastructure, such as a software-defined infrastructure 1100 B.
  • virtual computing resources 1136 of software-defined infrastructure 1100 B may be allocated to support the provision of cloud services 1140 .
  • particular sets of virtual computing resources 1136 may be grouped for provision to cloud services 1140 in the form of software defined infrastructure (SDI) services 1138 .
  • cloud services 1140 may include—without limitation—software as a service (SaaS) services 1142 , platform as a service (PaaS) services 1144 , and infrastructure as a service (IaaS) services 1146 .
  • management of software-defined infrastructure 1100 B may be conducted using a virtual infrastructure management framework 1150 B.
  • virtual infrastructure management framework 1150 B may be designed to implement workload fingerprinting techniques and/or machine-learning techniques in conjunction with managing allocation of virtual computing resources 1136 and/or SDI services 1138 to cloud services 1140 .
  • virtual infrastructure management framework 1150 B may use/consult telemetry data in conjunction with performing such resource allocation.
  • an application/service management framework 1150 C may be implemented in order to provide QoS management capabilities for cloud services 1140 . The embodiments are not limited in this context.
  • a system 1210 for migrating an I/O intensive phase of a workload from a compute sled to a data storage sled may be implemented in accordance with the data centers 100 , 300 , 400 , 1100 described above with reference to FIGS. 1, 3, 4, and 11 .
  • the system 1210 includes an orchestrator server 1216 in communication with a network switch 1220 .
  • the network switch 1220 is communicatively coupled to multiple sleds including compute sleds 1230 , 1232 , and a data storage sled 1240 .
  • One or more of the sleds 1230 , 1232 , 1240 may be grouped into a managed node, such as by the orchestrator server 1216 , to collectively perform a workload, such as an application.
  • a managed node may be embodied as an assembly of resources (e.g., physical resources 206 ), such as compute resources (e.g., physical compute resources 205 - 4 ), memory resources (e.g., physical memory resources 205 - 3 ), storage resources (e.g., physical storage resources 205 - 1 ), or other resources (e.g., physical accelerator resources 205 - 2 ), from the same or different sleds (e.g., the sleds 204 - 1 , 204 - 2 , 204 - 3 , 204 - 4 , etc.) or racks (e.g., one or more of racks 302 - 1 through 302 - 32 ).
  • resources e.g., physical resources 206
  • compute resources
  • a managed node may be established, defined, or “spun up” by the orchestrator server 1216 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 system 1210 may be located in a data center and provide storage and compute services (e.g., cloud services) to a client device 1214 that is in communication with the system 1210 through a network 1212 .
  • the orchestrator server 1216 may support a cloud operating environment, such as OpenStack, and managed nodes established by the orchestrator server 1216 may execute one or more applications or processes (i.e., workloads), such as in virtual machines or containers, on behalf of a user of the client device 1214 .
  • the compute sled 1230 executes a workload 1234 (e.g., an application), and the compute sled 1232 executes another workload 1236 (e.g., another application).
  • the data storage sled 1240 includes multiple data storage devices 1244 , 1246 (e.g., physical storage resources 205 - 1 ). While two compute sleds 1230 , 1232 and a data storage sled 1240 are shown, it should be understood that other sleds, such as memory sleds and accelerator sleds may be present in the system 1210 and may be selectively added to or removed from a managed node (e.g., as determined by the orchestrator server 1216 ).
  • the system 1210 may utilize one or more migration logic units 1250 in a compute sled 1230 , 1232 and/or an I/O accelerator unit 1260 in a data storage sled 1240 to perform migration of a workload from a compute sled 1230 , 1232 to the data storage sled 1240 when the workload enters an I/O intensive phase, indicative a period of execution of the workload in which the amount of data to be sent through the network between the compute sled 1230 and the data storage sled 1240 satisfies a predefined threshold amount (e.g., 8 GB/s per second) and the congestion level of the network path between the compute sled 1230 and the data storage sled 1240 satisfies a predefined level of congestion (e.g., a predefined latency, a predefined utilization of the total throughput of the network).
  • a predefined threshold amount e.g. 8 GB/s per second
  • a predefined level of congestion e.g., a pre
  • the predefined level of congestion is a level of congestion in which, if the I/O intensive phase of the workload was executed on the compute sled 1230 and the data used by the I/O intensive phase was sent through the network 1212 between the compute sled 1230 and the data storage sled 1240 , the speed of execution of the workload would be slowed. As a result, the workload may not produce a result in a time period specified in a service level agreement (SLA) with a customer.
  • SLA service level agreement
  • the I/O intensive phase may be executed faster, as the data utilized by the I/O intensive phase is local to the sled where the workload is executed.
  • the data storage sled 1240 may map a memory range of the main memory of the compute sled 1230 to the data storage sled 1240 , such that data (e.g., a relatively small set of output data, compared to a relatively large amount of input data read from a data storage device local to the data storage sled 1240 ) may be read from and written to the main memory of the compute sled 1230 during execution of the I/O intensive phase on the data storage sled 1240 .
  • data e.g., a relatively small set of output data, compared to a relatively large amount of input data read from a data storage device local to the data storage sled 1240
  • the compute sled 1230 may be embodied as any type of compute device capable of performing the functions described herein, including executing a workload (e.g., the workload 1234 ), determining whether the workload is likely to enter an I/O intensive phase in a predefined time period (e.g., as the next phase of the workload, within 10 milliseconds, etc.), determining whether the path through the network 1212 between the compute sled and the data sled 1240 is congested enough that the network 1212 would be a bottleneck in the execution speed of the workload (e.g., the network 1212 would be unable to transfer data from the data storage sled 1240 to the compute sled 1230 fast enough to avoid the compute sled 1230 consuming idle cycles that could otherwise be spent on executing the workload), migrating the workload to the data storage sled 1240 for execution of the I/O intensive phase, and resuming execution of the workload after the I/O intensive phase has completed.
  • a workload e.g., the workload
  • the illustrative compute sled 1230 includes a compute engine 1302 , an input/output (I/O) subsystem 1308 , communication circuitry 1310 , and one or more data storage devices 1314 .
  • the compute sled 1230 may include other or additional components, such as those commonly found in a computer (e.g., display, peripheral devices, etc.). Additionally, in some embodiments, one or more of the illustrative components may be incorporated in, or otherwise form a portion of, another component.
  • the compute engine 1302 may be embodied as any type of device or collection of devices capable of performing various compute functions described below.
  • the compute engine 1302 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable gate array (FPGA), a system-on-a-chip (SOC), or other integrated system or device.
  • the compute engine 1302 includes or is embodied as a processor 1304 and a memory 1306 .
  • the processor 1304 may be embodied as any type of processor capable of performing the functions described herein.
  • the processor 1304 may be embodied as a single or multi-core processor(s), a microcontroller, or other processor or processing/controlling circuit.
  • the processor 1304 may be embodied as, include, or be coupled to an FPGA, an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware to facilitate performance of the functions described herein.
  • the processor 1304 may include a migration logic unit 1250 briefly mentioned with reference to FIG. 12 .
  • the migration logic unit 1250 may be embodied as a specialized device, such as a co-processor, an FPGA, or an ASIC, for determining whether a workload is about to enter an I/O intensive phase (e.g., as indicated by top-down microarchitecture analysis method (TMAM) metrics), determining whether the present network congestion level indicates that the network would be a bottleneck to the execution of the workload, migrating the workload to the data storage sled 1240 , including sending memory map data usable for mapping a region of the memory 1306 to the data storage sled 1240 to enable the data storage sled to read from and/or write to the main memory of the compute sled 1230 (e.g., in a memory region used by the workload 1234 ) as the workload is executed by the data storage sled 1240 , and reformatting the data to a format usable by the data storage sled (e.g., by specialized logic in the data storage sled, such as the I/O accelerator unit 1260 ), such
  • the main memory 1306 may be embodied as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory or data storage capable of performing the functions described herein.
  • 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 (these standards are available at www.jedec.org).
  • 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 future generation nonvolatile devices, such as a three dimensional crosspoint memory device (e.g., 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.
  • the memory device may refer to the die itself and/or to a packaged memory product.
  • 3D crosspoint memory 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.
  • main memory 1306 may be integrated into the processor 1304 .
  • the main memory 1306 may store various software and data used during operation such as workload data, phase data, network congestion data, migration data, applications, programs, libraries, and drivers.
  • the compute engine 1302 is communicatively coupled to other components of the compute sled 1230 via the I/O subsystem 1308 , which may be embodied as circuitry and/or components to facilitate input/output operations with the compute engine 1302 (e.g., with the processor 1304 and/or the main memory 1306 ) and other components of the compute sled 1230 .
  • the I/O subsystem 1308 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, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations.
  • the I/O subsystem 1308 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with one or more of the processor 1304 , the main memory 1306 , and other components of the compute sled 1230 , into the compute engine 1302 .
  • SoC system-on-a-chip
  • the communication circuitry 1310 may be embodied as any communication circuit, device, or collection thereof, capable of enabling communications over the network 1212 between the compute sled 1230 and another compute device (e.g., the data storage sled 1240 , the orchestrator server 1216 , etc.).
  • the communication circuitry 1310 may be configured to use any one or more communication technology (e.g., wired or wireless communications) and associated protocols (e.g., Ethernet, Bluetooth®, Wi-Fi®, WiMAX, etc.) to effect such communication.
  • the illustrative communication circuitry 1310 includes a network interface controller (NIC) 1312 , which may also be referred to as a host fabric interface (HFI).
  • NIC network interface controller
  • HFI host fabric interface
  • the NIC 1312 may be embodied as one or more add-in-boards, daughter cards, network interface cards, controller chips, chipsets, or other devices that may be used by the compute sled 1230 to connect with another compute device (e.g., the data storage sled 1240 , the orchestrator server 1216 , etc.).
  • the NIC 1312 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.
  • SoC system-on-a-chip
  • the NIC 1312 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 1312 .
  • the local processor of the NIC 1312 may be capable of performing one or more of the functions of the compute engine 1302 described herein.
  • the local memory of the NIC 1312 may be integrated into one or more components of the compute sled 1230 at the board level, socket level, chip level, and/or other levels.
  • the migration logic unit 1250 may be included in the NIC 1312 .
  • the one or more illustrative data storage devices 1314 may be embodied as any type of devices configured for short-term or long-term storage of data such as, for example, memory devices and circuits, memory cards, hard disk drives, solid-state drives, or other data storage devices.
  • Each data storage device 1314 may include a system partition that stores data and firmware code for the data storage device 1314 .
  • Each data storage device 1314 may also include an operating system partition that stores data files and executables for an operating system.
  • the compute sled 1230 may include one or more peripheral devices 1316 .
  • peripheral devices 1316 may include any type of peripheral device commonly found in a compute device such as a display, speakers, a mouse, a keyboard, and/or other input/output devices, interface devices, and/or other peripheral devices.
  • the data storage sled 1240 may be embodied as any type of compute device capable of performing the functions described herein, including reading and writing data to one or more data storage devices of the data storage sled 1240 in response to corresponding requests from a compute sled 1230 , executing a workload that has been migrated to the data storage sled 1240 (e.g., an I/O intensive phase of a workload), sending output data to the compute sled as a result of performing the I/O intensive phase (e.g., by writing the output data to a region of the main memory 1306 of the compute sled 1230 that has been mapped for use by the workload when executed on the data storage sled 1240 ), and migrating the workload back to the compute sled 1230 after the I/O intensive phase has ended or when the congestion level of the network has decreased to a point where the network is no longer a bottleneck for the I/O intensive phase.
  • a workload that has been migrated to the data storage sled 1240 e.g
  • the illustrative data storage sled 1240 includes a compute engine 1402 , an input/output (I/O) subsystem 1408 , communication circuitry 1410 , and one or more data storage devices 1414 .
  • the data storage sled 1240 may include other or additional components, such as those commonly found in a computer (e.g., display, peripheral devices, etc.). Additionally, in some embodiments, one or more of the illustrative components may be incorporated in, or otherwise form a portion of, another component.
  • the compute engine 1402 may be embodied as any type of device or collection of devices capable of performing various compute functions described below.
  • the compute engine 1402 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable gate array (FPGA), a system-on-a-chip (SOC), or other integrated system or device.
  • the compute engine 1402 includes or is embodied as a processor 1404 and a memory 1406 .
  • the processor 1404 may be embodied as any type of processor capable of performing the functions described herein.
  • the processor 1404 may be embodied as a single or multi-core processor(s), a microcontroller, or other processor or processing/controlling circuit.
  • the processor 1404 may be embodied as, include, or be coupled to an FPGA, an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware to facilitate performance of the functions described herein.
  • the processor 1404 may include an I/O accelerator unit 1260 , which may be embodied as a specialized device, such as a co-processor, an FPGA, or an ASIC, for executing the I/O intensive phase of one or more workloads, using data in the local data storage device(s) 1414 .
  • the I/O accelerator unit 1260 may map a memory region of the compute sled 1230 as local memory for the corresponding workload.
  • the I/O accelerator unit 1260 may cause data to be read from and/or written to the main memory 1306 of the compute sled 1406 (e.g., by interfacing with the migration logic unit 1250 of the compute sled 1230 ) as if the memory 1306 was local and without modifying the executable code of the workload. Additionally, the I/O accelerator unit 1260 may reformat data from the compute sled 1230 to a format usable by the I/O accelerator unit 1260 (e.g., converting a file to a block or vice versa, changing a byte ordering of data, etc.) to execute the I/O intensive phase of the workload.
  • a format usable by the I/O accelerator unit 1260 e.g., converting a file to a block or vice versa, changing a byte ordering of data, etc.
  • the main memory 1406 may be embodied as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory or data storage capable of performing the functions described herein.
  • the main memory 1406 may store various software and data used during operation such as workload data, phase data, network congestion data, migration data, applications, programs, libraries, and drivers.
  • the compute engine 1402 is communicatively coupled to other components of the data storage sled 1240 via the I/O subsystem 1408 , which may be embodied as circuitry and/or components to facilitate input/output operations with the compute engine 1402 (e.g., with the processor 1404 and/or the main memory 1406 ) and other components of the data storage sled 1240 .
  • the I/O subsystem 1408 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, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations.
  • the I/O subsystem 1408 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with one or more of the processor 1404 , the main memory 1406 , and other components of the data storage sled 1240 , into the compute engine 1402 .
  • SoC system-on-a-chip
  • the communication circuitry 1410 may be embodied as any communication circuit, device, or collection thereof, capable of enabling communications over the network 1212 between the data storage sled 1240 and another compute device (e.g., the compute sleds 1230 , 1232 , the orchestrator server 1216 , etc.).
  • the communication circuitry 1310 may be configured to use any one or more communication technology (e.g., wired or wireless communications) and associated protocols (e.g., Ethernet, Bluetooth®, Wi-Fi®, WiMAX, etc.) to effect such communication.
  • the illustrative communication circuitry 1410 includes a network interface controller (NIC) 1412 , which may also be referred to as a host fabric interface (HFI).
  • the NIC 1412 may be embodied as one or more add-in-boards, daughter cards, network interface cards, controller chips, chipsets, or other devices that may be used by the data storage sled 1240 to connect with another compute device (e.g., the compute sleds 1240 , 1242 the orchestrator server 1216 , etc.).
  • the NIC 1412 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.
  • SoC system-on-a-chip
  • the NIC 1412 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 1412 .
  • the local processor of the NIC 1412 may be capable of performing one or more of the functions of the compute engine 1402 described herein.
  • the local memory of the NIC 1412 may be integrated into one or more components of the compute sled 1240 at the board level, socket level, chip level, and/or other levels.
  • the I/O accelerator unit 1260 may be included in the NIC 1412 .
  • the one or more illustrative data storage devices 1414 may be embodied as any type of devices configured for short-term or long-term storage of data such as, for example, memory devices and circuits, memory cards, hard disk drives, solid-state drives, or other data storage devices.
  • Each data storage device 1414 may include a system partition that stores data and firmware code for the data storage device 1414 .
  • Each data storage device 1414 may also include an operating system partition that stores data files and executables for an operating system.
  • the data storage sled 1240 may include one or more peripheral devices 1416 .
  • peripheral devices 1416 may include any type of peripheral device commonly found in a compute device such as a display, speakers, a mouse, a keyboard, and/or other input/output devices, interface devices, and/or other peripheral devices.
  • the client device 1214 , the orchestrator server 1216 , and the compute sled 1232 may have components similar to those described in FIGS. 13 and 14 .
  • the description of those components of the compute sled 1230 and the data storage sled 1240 is equally applicable to the description of components of those devices and is not repeated herein for clarity of the description.
  • any of the client device 1214 , the orchestrator server 1216 , and the sleds 1230 , 1232 , 1240 may include other components, sub-components, and devices commonly found in a computing device, which are not discussed above in reference to the compute sled 1230 and the data storage sled 1240 and not discussed herein for clarity of the description.
  • the network switch 1220 , the orchestrator server 1216 , and the sleds 1230 , 1232 , 1240 are illustratively in communication via the network 1212 , 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
  • 3G Third Generation
  • LTE Long Term Evolution
  • WiMAX Worldwide Interoperability for Microwave Access
  • DSL digital subscriber line
  • cable networks e.g., coaxial networks, fiber networks, etc.
  • the compute sled 1230 may establish an environment 1500 during operation.
  • the illustrative environment 1500 includes a network communicator 1520 and a migration manager 1530 .
  • Each of the components of the environment 1500 may be embodied as hardware, firmware, software, or a combination thereof.
  • one or more of the components of the environment 1500 may be embodied as circuitry or a collection of electrical devices (e.g., network communicator circuitry 1520 , migration manager circuitry 1530 , etc.).
  • one or more of the network communicator circuitry 1520 or migration manager circuitry 1530 may form a portion of one or more of the compute engine 1302 , the migration logic unit 1250 , the communication circuitry 1310 , the I/O subsystem 1308 , and/or other components of the compute sled 1230 .
  • the environment 1500 includes workload data 1502 , which may be embodied as any data indicative of workloads assigned to the compute sled 1230 to execute, including an identifier of each workload and executable code associated with each workload, and a memory region (e.g., a set of memory addresses) used by each workload to access (e.g., read and/or write) data in the main memory 1306 , and an identifier of a data storage sled (e.g., the data storage sled 1240 ) used by each workload for accessing data storage.
  • workload data 1502 may be embodied as any data indicative of workloads assigned to the compute sled 1230 to execute, including an identifier of each workload and executable code associated with each workload, and a memory region (e.g., a set of memory addresses) used by each workload to access (e.g., read and/or write) data in the main memory 1306 , and an identifier of a data storage sled (e.g., the data storage sled 12
  • phase data 1504 which may be embodied as any data indicative of resource utilization characteristics of each phase of each workload (e.g., phase A exhibits relatively high processor utilization and low data storage utilization, phase B exhibits relatively low processor utilization and high data storage utilization, etc.), detected patterns of phases (e.g., phase A is typically followed by phase B, then phase A, then phase C, etc.), and/or metadata indicative of locations in the executable code of the workloads that mark the beginning and end of each phase.
  • phase data 1504 may be embodied as any data indicative of resource utilization characteristics of each phase of each workload (e.g., phase A exhibits relatively high processor utilization and low data storage utilization, phase B exhibits relatively low processor utilization and high data storage utilization, etc.), detected patterns of phases (e.g., phase A is typically followed by phase B, then phase A, then phase C, etc.), and/or metadata indicative of locations in the executable code of the workloads that mark the beginning and end of each phase.
  • the environment 1500 includes network congestion data 1506 , which may be embodied as any data indicative of the present data transfer capacity of the network 1212 (e.g., a latency, a bandwidth, a throughput, a fullness of a transmit buffer of the compute sled 1230 , etc.).
  • the illustrative environment 1500 includes migration data 1508 , which may be embodied as any data indicative of a determination of whether to migrate a workload to the data storage sled 1240 (e.g., as a function of whether an I/O intensive phase is predicted to occur within a predefined time window and whether the network 1212 is sufficiently congested to be a bottleneck to the execution of the I/O intensive phase on the compute sled 1230 ).
  • the network communicator 1520 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the compute sled 1230 , respectively.
  • the network communicator 1520 is configured to receive and process data packets from one system or computing device (e.g., the orchestrator server 1216 ) and to prepare and send data packets to another computing device or system (e.g., the data storage sled 1240 ).
  • the network communicator 1520 may be performed by the communication circuitry 1310 , and, in the illustrative embodiment, by the NIC 1312 .
  • the migration manager 1530 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof, is configured to manage the migration of a workload to the data storage sled 1240 for execution if the workload is entering an I/O intensive phase and the network 1212 would be a bottleneck (e.g., transferring the data though the network between the data storage sled 1240 and the compute sled 1230 would slow the execution of the workload).
  • the migration manager 1530 includes a workload executor 1532 , an I/O intensity determiner 1534 , a network congestion determiner 1536 , and a workload phase migrator 1538 .
  • the workload executor 1532 in the illustrative embodiment, is configured to execute the workload using data stored in the data storage device(s) 1414 of the data storage sled 1240 . As the compute sled 1230 executes the workload, the workload may transition through multiple phases of resource utilization, as described above.
  • the I/O intensity determiner 1534 in the illustrative embodiment, is configured to determine whether the amount of data to be accessed from the data storage device(s) 1414 of the data storage sled 1240 to execute a phase satisfies a threshold amount (e.g., a predefined number of gigabytes per second, etc.).
  • a threshold amount e.g., a predefined number of gigabytes per second, etc.
  • the I/O intensity determiner 1534 may monitor the resource utilization of the workload over time to identify the different phases, identify patterns in the phases, and/or metadata associated with sections of the executable code of the workload that demarcate different phases, to predict whether the workload will transition into an I/O intensive phase within a predefined time period.
  • the network congestion determiner 1536 in the illustrative embodiment, is configured to determine the level of network congestion, such as by sending a test message to the data storage sled 1240 to determine a latency in receiving a response from the data storage sled 1240 , identifying a fullness of a transmit buffer of the NIC 1312 of the compute sled 1230 (e.g., a fuller buffer may indicate more congestion), and/or by querying the orchestrator server 1216 for the network congestion data 1506 .
  • the workload phase migrator 1538 in the illustrative embodiment, is configured to determine whether to migrate the workload to the data storage sled 1240 as a function of whether the workload is predicted to enter an I/O intensive phase within a predefined time period (e.g., 10 milliseconds) and further as a function of the network congestion data 1506 (e.g., whether the network 1212 is congested to the point that the network 1212 would be a bottleneck to the execution of the workload in the I/O intensive phase).
  • a predefined time period e.g. 10 milliseconds
  • the workload phase migrator 1538 may facilitate migration of the workload to the data storage sled 1240 by providing memory map data that is usable by the data storage sled 1240 to map a region of the main memory 1306 of the compute sled 1230 as local memory to be used by the workload when the workload is executed on the data storage sled 1240 . Additionally, the workload phase migrator 1538 may reformat data in the main memory 1306 to a different format that is usable by the data storage sled 1240 (e.g., by the I/O accelerator unit 1260 of the data storage sled 1240 ), as described herein.
  • each of the workload executor 1532 , the I/O intensity determiner 1534 , the network congestion determiner 1536 , and the workload phase migrator 1538 may be separately embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • the workload executor 1532 may be embodied as a hardware component
  • the I/O intensity determiner 1534 , the network congestion determiner 1536 , and the workload phase migrator 1538 are embodied as virtualized hardware components or as some other combination of hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • the data storage sled 1240 may establish an environment 1600 during operation.
  • the illustrative environment 1600 includes a network communicator 1620 and a migration manager 1630 .
  • Each of the components of the environment 1600 may be embodied as hardware, firmware, software, or a combination thereof.
  • one or more of the components of the environment 1600 may be embodied as circuitry or a collection of electrical devices (e.g., network communicator circuitry 1620 , migration manager circuitry 1630 , etc.).
  • one or more of the network communicator circuitry 1620 or migration manager circuitry 1630 may form a portion of one or more of the compute engine 1402 , the I/O accelerator unit 1260 , the communication circuitry 1410 , the I/O subsystem 1408 , and/or other components of the data storage sled 1240 .
  • the environment 1600 includes workload data 1602 , which may be embodied as any data indicative of workloads assigned to the data storage sled 1240 to be executed (e.g., in the I/O intensive phase), memory map data indicative of a memory region of the corresponding compute sled 1230 that may be mapped as local memory as the workload is executed on the data storage sled 1240 , and executable code to execute (e.g., executable code defining the I/O intensive phase of the workload).
  • the illustrative environment 1600 includes phase data 1604 which, in the illustrative embodiment, is similar to the phase data 1504 described above.
  • the environment 1600 includes network congestion data 1606 which, in the illustrative embodiment, is similar to the network congestion data 1506 , described above.
  • the illustrative environment 1600 includes migration data 1608 , which is similar to the migration data 1508 described above with reference to FIG. 15 , except the migration data 1608 is indicative of whether the workload should be migrated back to the corresponding compute sled 1230 (e.g., the network 1212 is not a bottleneck and/or the I/O intensive phase has ended).
  • the network communicator 1620 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the data storage sled 1240 , respectively.
  • the network communicator 1620 is configured to receive and process data packets from one system or computing device (e.g., the orchestrator server 1216 ) and to prepare and send data packets to another computing device or system (e.g., the compute sled 1230 ).
  • the network communicator 1620 may be performed by the communication circuitry 1410 , and, in the illustrative embodiment, by the NIC 1412 .
  • the migration manager 1630 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof, is configured to facilitate the migration of a workload to the data storage sled 1240 and for migrating a workload back to the corresponding compute sled 1230 , 1232 after the I/O intensive phase of the workload has completed or if the network congestion satisfies a predefined threshold (e.g., the network would no longer be a bottleneck to the execution of the I/O intensive phase of the workload).
  • a predefined threshold e.g., the network would no longer be a bottleneck to the execution of the I/O intensive phase of the workload.
  • the migration manager 1630 includes a phase accelerator 1632 , a quality of service (QoS) manager 1634 , a network congestion determiner 1636 , and a workload phase migrator 1638 .
  • the phase accelerator 1632 in the illustrative embodiment, is configured to execute a workload that is in an I/O intensive phase (e.g., with the I/O accelerator unit 1260 ).
  • the QoS manager 1634 in the illustrative embodiment, is configured to apply a quality of service (QoS) policy to throttle the usage of resources by the workloads executed on the data storage sled 1240 so that no workload dominates the usage of data storage sled resources to the detriment of other workloads (e.g., causing a workload to no longer satisfy a QoS target specified in a service level agreement (SLA)).
  • QoS quality of service
  • the network congestion determiner 1636 is similar to the network congestion determiner 1536 described with reference to the environment 1500 .
  • the workload phase migrator 1638 is configured to facilitate the migration of the workload to the data storage sled 1240 , such as by establishing a memory map that enables the workload to access the main memory 1306 of the compute sled 1230 as local memory.
  • the workload phase migrator 1638 is also configured to determine when to migrate the workload back to the compute sled 1230 , 1232 .
  • the workload phase migrator 1638 is configured to migrate the workload back to the compute sled 1230 , 1232 when the I/O intensive phase has been completed (e.g., the executable code of the I/O intensive phase has been completely executed, the amount of memory bandwidth utilized by the workload has fallen below a predefined amount, etc.) and/or when the network congestion has decreased to a level that the network 1212 would no longer be a bottleneck to the execution of the workload on the compute sled 1230 , 1232 .
  • the I/O intensive phase has been completed (e.g., the executable code of the I/O intensive phase has been completely executed, the amount of memory bandwidth utilized by the workload has fallen below a predefined amount, etc.) and/or when the network congestion has decreased to a level that the network 1212 would no longer be a bottleneck to the execution of the workload on the compute sled 1230 , 1232 .
  • each of the phase accelerator 1632 , the QoS manager 1634 , the network congestion determiner 1636 , and the workload phase migrator 1638 may be separately embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • the phase accelerator 1632 may be embodied as a hardware component
  • the QoS manager 1634 , the network congestion determiner 1636 , and the workload phase migrator 1638 are embodied as virtualized hardware components or as some other combination of hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • the compute sled 1230 may execute a method 1700 to enable offloading of I/O intensive phases of a workload to the data storage sled 1240 .
  • the method 1700 begins with block 1702 in which the compute sled 1230 determines whether to execute a workload.
  • the compute sled 1230 may determine to enable offloading if the compute sled 1230 has been assigned to a managed node, is powered on and communicatively coupled to the data storage sled 1240 , and/or based on other factors.
  • the method 1700 advances to block 1704 in which the compute sled 1230 receives a workload to be executed (e.g., the compute sled 1230 receives the workload data 1502 identifying the workload and the executable code of the workload). In doing so, the compute sled 1230 may receive the workload from the orchestrator server 1216 , as indicated in block 1706 . In later iterations of the block 1704 , the compute sled 1230 may receive a workload from the data storage sled 1240 (e.g., after the workload has been migrated to the data storage sled 1240 and the data storage sled 1240 has completed the I/O intensive phase), as indicated in block 1708 .
  • the compute sled 1230 receives a workload to be executed (e.g., the compute sled 1230 receives the workload data 1502 identifying the workload and the executable code of the workload). In doing so, the compute sled 1230 may receive the workload from the orchestrator server 1216 , as indicated in block 1706
  • the compute sled 1230 executes the workload, including accessing (e.g., reading from and/or writing to) the data storage sled 1240 and a region of the main memory 1306 of the compute sled 1230 . Additionally, in block 1712 , the compute sled 1230 identifies I/O intensive phases of the workload. In doing so, the compute sled 1230 may identify phases in which the amount of data sent through the network (e.g., between the data storage sled 1240 and the compute sled 1230 ) satisfies a predefined threshold, such as a predefined number of gigabytes per second, as indicated in block 1714 .
  • a predefined threshold such as a predefined number of gigabytes per second
  • the compute sled 1230 identifies I/O intensive phases as a function of workload metadata indicative of the I/O intensive phases.
  • the metadata may be included with the executable code of the workload and may identify the sections of the executable code that mark the beginning and end of each phase. Further, the metadata may indicate the types and amounts of resources utilized by each phase.
  • the compute sled 1230 identifies I/O intensive phases using pattern recognition. In doing so, and as indicated in block 1720 , the compute sled 1230 may determine historical I/O usage associated with different periods of execution of the workload and identify changes in the I/O usage as changes in the phases of the workload. Further, as indicated in block 1722 , the compute sled 1230 may identify patterns of phases (e.g., phase A, followed by phase B, then phase A, then phase C, then phase A, etc.).
  • the compute sled 1230 determines whether an I/O intensive phase is likely to occur within a predefined time period. In doing so, the compute sled 1230 , in the illustrative embodiment, determines a likelihood of an I/O intensive phase occurring within the predefined time period as a function of the identified pattern of phases and the present time, as indicated in block 1726 .
  • phase B is I/O intensive
  • phase A typically (e.g., 80% of the time) follows phase A
  • phase A has been executing for 90% of its typical phase residency (i.e., time period of execution) of 100 milliseconds
  • the compute sled 1230 may determine that the I/O intensive phase (e.g., phase B) is likely to occur within the next 10 milliseconds.
  • the compute sled 1230 determines the subsequent course of action as a function of whether there is an upcoming I/O intensive phase in the workload (e.g., whether the likelihood of an I/O intensive phase occurring within the next 10 milliseconds is greater than a predefined threshold, such as 50%).
  • the method 1700 loops back to block 1702 in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases. Otherwise, the method 1700 advances to block 1730 of FIG. 18 , in which the compute sled 1230 determines whether the network path to the data storage sled 1240 satisfies a predefined level of congestion (e.g., 50% of total capacity, a predefined latency, bandwidth, or throughput, etc.).
  • a predefined level of congestion e.g. 50% of total capacity, a predefined latency, bandwidth, or throughput, etc.
  • the compute sled 1230 may locally determine the congestion of the network path between the present compute sled 1230 and the data storage sled 1240 , such as by sending a test message to the data storage sled 1240 and determining the latency to receive a response, determining an amount of time to transfer a test payload, measuring the throughput and/or latency for data actually used by the workload as it is being executed on the compute sled 1230 , measuring a fullness of a transmission buffer of the NIC 1312 , and/or based on other factors.
  • the compute sled 1230 may additionally or alternatively query the orchestrator server 1216 for the network congestion data 1506 .
  • the compute sled 1230 determines whether the congestion of the network 1212 would reduce the execution speed of the I/O intensive phase (e.g., the available data transmission capacity of the network 1212 is less than the predefined threshold amount from block 1714 of FIG. 17 ).
  • the compute sled 1230 determines the subsequent course of action as a function of whether the network 1212 has been determined to be congested.
  • the method 1700 loops back to block 1702 of FIG. 17 , in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases. Otherwise, the method 1700 advances to block 1740 , in which the compute sled 1230 migrates the workload to the data storage sled 1240 . In doing so, and as indicated in block 1742 , the compute sled 1230 may send a request for the I/O intensive phase to be executed by the data storage sled 1240 . The compute sled 1230 may send the request to the data storage sled 1240 , as indicated in block 1744 .
  • the compute sled 1230 may send executable code associated with the I/O intensive phase of the workload to the data storage sled 1240 , as indicated in block 1746 .
  • the compute sled 1230 may send an identifier of the I/O intensive phase to the data storage sled 1240 .
  • the compute sled 1230 may send memory map data usable by the data storage sled 1240 to access a portion of the main memory 1306 of the compute sled 1230 as local memory of the data storage sled 1240 (e.g., transparently to the workload).
  • the compute sled 1230 may format input data associated with the I/O intensive phase to a format usable by the I/O accelerator unit 1260 of the data storage sled 1240 .
  • the compute sled 1230 may convert a file to a block or vice versa, change a byte ordering of data, and/or perform other reformatting of data.
  • the compute sled 1230 may also send input data from the main memory 1306 of the compute sled 1230 for use in execution of the I/O intensive phase (e.g., the reformatted data from block 1752 ), as indicated in block 1754 .
  • the amount of input data from the main memory 1306 is smaller (e.g., an order of magnitude smaller) than the amount of data in the data storage device(s) 1414 to be used by the workload during the I/O intensive phase.
  • the compute sled 1230 may send the request to the orchestrator server 1216 to then be sent to the data storage sled 1240 . Subsequently, the method 1700 loops back to block 1702 of FIG. 17 in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases.
  • the data storage sled 1240 may execute a method 1900 to accelerate I/O intensive phases of workloads offloaded from compute sleds 1230 , 1232 .
  • the method 1900 begins with block 1902 in which the data storage sled 1240 determines whether to accelerate one or more I/O intensive phases of workload(s).
  • the data storage sled 1240 may determine to accelerate an I/O intensive phase if the data storage sled 1240 has received a request to migrate a workload (e.g., the request of block 1740 described with reference to FIG. 18 ).
  • the data storage sled 1240 may make the determination based on other factors.
  • the method 1900 advances to block 1904 , in which the data storage sled 1240 executes the I/O intensive phase.
  • the data storage sled 1240 may access a relatively large amount of data in a data storage device 1414 of the data storage sled 1240 (e.g., tens of gigabytes), as indicated in block 1906 .
  • the data storage sled 1240 may receive a relatively small set of input data from the compute sled 1230 (e.g., 100 megabytes).
  • the compute sled 1230 may send a relatively small set of output data to the compute sled 1230 (e.g., a 10 megabyte result of a computation).
  • the data storage sled 1240 may map one or more local memory addresses to the main memory 1306 of the compute sled 1230 (e.g., using the memory map data from block 1750 of FIG. 18 ).
  • the data storage sled 1240 may access the main memory 1306 of the compute sled 1230 .
  • the data storage sled 1240 may read input data for the I/O intensive phase from the mapped memory, as indicated in block 1916 .
  • the data storage sled 1240 may reformat the input data to a format usable by the I/O accelerator unit (e.g., if the input is unusable in its present form and the compute sled 1230 did not reformat the data in block 1752 of FIG. 18 ), as indicated in block 1918 .
  • the data storage sled 1240 may read executable code of the I/O intensive phase with the mapped memory.
  • the data storage sled 1240 may write output data to the main memory of the compute sled 1230 (e.g., the output data from block 1910 ), as indicated in block 1922 .
  • the data storage sled 1240 may apply a quality of service (QoS) policy to throttle the usage of resources by the workloads executed on the data storage sled 1240 so that no workload dominates the usage of data storage sled resources to the detriment of other workloads (e.g., causing a workload to no longer satisfy a QoS target specified in a service level agreement (SLA)).
  • QoS quality of service
  • the data storage sled 1240 determines whether the I/O intensive phase has ended. For example, and as indicated in block 1928 , the data storage sled determines whether executable code associated with the I/O intensive phase has been completely executed (e.g., the executable code sent by the compute sled 1230 in block 1746 of FIG. 18 has been completely executed). Subsequently, in block 1930 , the data storage sled 1240 determines the next course of action as a function of whether the I/O intensive phase has ended.
  • the method 1900 continues to block 1932 , in which the data storage sled 1240 determines whether the network path to the compute sled 1230 satisfies a predefined level of congestion (e.g., the congestion in the network would cause the workload to execute more slowly if it were performed on the compute sled 1230 ).
  • the data storage sled 1240 determines the subsequent course of action as a function of whether the network satisfies the predefined level of congestion. If so, the method 1900 loops back to block 1904 to continue executing the I/O intensive phase on the data storage sled 1240 . Otherwise, or if the data storage sled 1240 determines that the phase ended in block 1930 , the method 1900 advances to block 1936 of FIG.
  • the data storage sled 1240 migrates execution of the workload to the compute sled 1230 .
  • the data storage sled 1240 may send a message to the compute sled 1230 that the I/O intensive phase has ended, as indicated in block 1938 (e.g., thereby migrating execution of the workload back to the compute sled 1230 ).
  • the data storage sled 1240 may send a message to the orchestrator server 1216 that the I/O phase has ended, as indicated in block 1940 .
  • the method 1900 loops back to block 1902 of FIG. 19 , in which the data storage sled 1240 determines whether to continue accelerating one or more I/O intensive phases.
  • a diagram 2100 illustrates that over time, a workload 1234 may be executed on the data storage sled 1240 in one phase (e.g., phase 0) in which the amount of data operated on is relatively large (e.g., 10 gigabytes).
  • phase 0 the amount of data operated on is relatively large (e.g., 10 gigabytes).
  • phases 1 and 2 which are not I/O intensive, the workload is executed on the compute sled 1230 during which time the data operated on and produced is relatively small (e.g., 100 megabytes in phase 1 and 10 megabytes in phase 2).
  • 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 compute sled comprising a compute engine to execute a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; identify an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and migrate the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 2 includes the subject matter of Example 1, and wherein the compute engine is further to send memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 3 includes the subject matter of any of Examples 1 and 2, and wherein the compute engine is further to determine whether the I/O intensive phase will occur within a predefined time period; and wherein to migrate comprises to migrate, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 4 includes the subject matter of any of Examples 1-3, and wherein the compute engine is further to identify a pattern of phases over time as the workload is executed; and wherein to determine whether the I/O intensive phase will occur within a predefined time period comprises to determine a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; determine whether the likelihood satisfies a predefined threshold likelihood; and determine, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 5 includes the subject matter of any of Examples 1-4, and wherein the compute engine is further to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein to migrate further comprises to migrate, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 6 includes the subject matter of any of Examples 1-5, and wherein to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises to determine whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 7 includes the subject matter of any of Examples 1-6, and wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 8 includes the subject matter of any of Examples 1-7, and wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase with pattern recognition.
  • Example 9 includes the subject matter of any of Examples 1-8, and wherein to identify the I/O intensive phase with pattern recognition comprises to determine historical I/O usage associated with different periods of execution of the workload.
  • Example 10 includes the subject matter of any of Examples 1-9, and wherein to migrate the workload to the data storage sled comprises to send a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 11 includes the subject matter of any of Examples 1-10, and wherein to send the request comprises to send executable code associated with the I/O intensive phase to the data storage sled.
  • Example 12 includes the subject matter of any of Examples 1-11, and wherein to send the request comprises to send input data from a main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 13 includes the subject matter of any of Examples 1-12, and wherein the compute sled is further to reformat the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 14 includes a method comprising executing, by a compute sled, a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; identifying, by the compute sled, an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and migrating, by the compute sled, the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 15 includes the subject matter of Example 14, and further including sending, by the compute sled, memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 16 includes the subject matter of any of Examples 14 and 15, and further including determining, by the compute sled, whether the I/O intensive phase will occur within a predefined time period; and wherein migrating comprises migrating, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 17 includes the subject matter of any of Examples 14-16, and further including identifying, by the compute sled, a pattern of phases over time as the workload is executed; and wherein determining whether the I/O intensive phase will occur within a predefined time period comprises determining a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; determining whether the likelihood satisfies a predefined threshold likelihood; and determining, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 18 includes the subject matter of any of Examples 14-17, and further including determining, by the compute sled, whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein migrating further comprises migrating, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 19 includes the subject matter of any of Examples 14-18, and wherein determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises determining whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 20 includes the subject matter of any of Examples 14-19, and wherein identifying the I/O intensive phase comprises identifying the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 21 includes the subject matter of any of Examples 14-20, and wherein identifying the I/O intensive phase comprises identifying the I/O intensive phase with pattern recognition.
  • Example 22 includes the subject matter of any of Examples 14-21, and wherein identifying the I/O intensive phase with pattern recognition comprises determining historical I/O usage associated with different periods of execution of the workload.
  • Example 23 includes the subject matter of any of Examples 14-22, and wherein migrating the workload to the data storage sled comprises sending a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 24 includes the subject matter of any of Examples 14-23, and wherein sending the request comprises sending executable code associated with the I/O intensive phase to the data storage sled.
  • Example 25 includes the subject matter of any of Examples 14-24, and wherein sending the request comprises sending input data from main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 26 includes the subject matter of any of Examples 14-25, and further including reformatting, by the compute sled, the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 27 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a compute sled to perform the method of any of Examples 14-26.
  • Example 28 includes a network device comprising one or more processors; one or more memory devices having stored therein a plurality of instructions that, when executed by the one or more processors, cause the network device to perform the method of any of Examples 14-26.
  • Example 29 includes a compute sled comprising means for performing the method of any of Examples 14-26.
  • Example 30 includes a compute sled comprising means for executing a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; means for identifying an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and means for migrating the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 31 includes the subject matter of Example 30, and further including means for sending memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 32 includes the subject matter of any of Examples 30 and 31, and further including means for determining whether the I/O intensive phase will occur within a predefined time period; and wherein the means for migrating comprises means for migrating, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 33 includes the subject matter of any of Examples 30-32, and further including means for identifying a pattern of phases over time as the workload is executed; and wherein the means for determining whether the I/O intensive phase will occur within a predefined time period comprises means for determining a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; means for determining whether the likelihood satisfies a predefined threshold likelihood; and means for determining, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 34 includes the subject matter of any of Examples 30-33, and further including means for determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein the means for migrating further comprises means for migrating, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 35 includes the subject matter of any of Examples 30-34, and wherein the means for determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises means for determining whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 36 includes the subject matter of any of Examples 30-35, and wherein the means for identifying the I/O intensive phase comprises means for identifying the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 37 includes the subject matter of any of Examples 30-36, and wherein the means for identifying the I/O intensive phase comprises means for identifying the I/O intensive phase with pattern recognition.
  • Example 38 includes the subject matter of any of Examples 30-37, and wherein the means for identifying the I/O intensive phase with pattern recognition comprises means for determining historical I/O usage associated with different periods of execution of the workload.
  • Example 39 includes the subject matter of any of Examples 30-38, and wherein the means for migrating the workload to the data storage sled comprises means for sending a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 40 includes the subject matter of any of Examples 30-39, and wherein the means for sending the request comprises means for sending executable code associated with the I/O intensive phase to the data storage sled.
  • Example 41 includes the subject matter of any of Examples 30-40, and wherein the means for sending the request comprises means for sending input data from main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 42 includes the subject matter of any of Examples 30-41, and further including means for reformatting the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 43 includes a data storage sled comprising a compute engine to execute an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; determine whether the I/O intensive phase has ended; and migrate, in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 44 includes the subject matter of Example 43, and wherein the compute engine is further to determine whether a network path to the compute sled satisfies a predefined level of congestion; and migrate, in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 45 includes the subject matter of any of Examples 43 and 44, and wherein the compute engine is further to map a memory region to a main memory of the compute sled; and access data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 46 includes the subject matter of any of Examples 43-45, and wherein the compute engine is further to receive executable code associated with the I/O intensive phase from the compute sled; and wherein to execute the I/O intensive phase comprises to execute the received executable code.
  • Example 47 includes the subject matter of any of Examples 43-46, and wherein the compute engine is further to receive an input set of data from the compute sled; and reformat the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 48 includes the subject matter of any of Examples 43-47, and wherein the compute engine is further to execute multiple I/O intensive phases of different workloads concurrently; and apply a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 49 includes the subject matter of any of Examples 43-48, and wherein the compute engine is further to send output data from execution of the I/O intensive phase to the compute sled.
  • Example 50 includes the subject matter of any of Examples 43-49, and wherein the compute engine is to receive a first set of input data from the compute sled and access a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 51 includes the subject matter of any of Examples 43-50, and wherein to determine whether the I/O intensive phase has ended comprises to determine whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 52 includes the subject matter of any of Examples 43-51, and wherein to execute the I/O intensive phase comprises to execute the I/O intensive phase with an I/O accelerator unit of the data storage sled.
  • Example 53 includes a method comprising executing, by a data storage sled, an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; determining, by the data storage sled, whether the I/O intensive phase has ended; and migrating, by the data storage sled and in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 54 includes the subject matter of Example 53, and further including determining, by the data storage sled, whether a network path to the compute sled satisfies a predefined level of congestion; and migrating, by the data storage sled and in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 55 includes the subject matter of any of Examples 53 and 54, and further including mapping, by the data storage sled, a memory region to a main memory of the compute sled; and accessing data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 56 includes the subject matter of any of Examples 53-55, and further including receiving, by the data storage sled, executable code associated with the I/O intensive phase from the compute sled; and wherein executing the I/O intensive phase comprises executing the received executable code.
  • Example 57 includes the subject matter of any of Examples 53-56, and further including receiving, by the data storage sled, an input set of data from the compute sled; and reformatting, by the data storage sled, the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 58 includes the subject matter of any of Examples 53-57, and further including executing, by the data storage sled, multiple I/O intensive phases of different workloads concurrently; and applying, by the data storage sled, a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 59 includes the subject matter of any of Examples 53-58, and further including sending, by the data storage sled, output data from execution of the I/O intensive phase to the compute sled.
  • Example 60 includes the subject matter of any of Examples 53-59, and further including receiving, by the data storage sled, a first set of input data from the compute sled; and accessing, by the data storage sled, a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 61 includes the subject matter of any of Examples 53-60, and wherein determining whether the I/O intensive phase has ended comprises determining whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 62 includes the subject matter of any of Examples 53-61, and wherein executing the I/O intensive phase comprises executing the I/O intensive phase with an I/O accelerator unit of the data storage sled.
  • Example 63 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a data storage sled to perform the method of any of Examples 53-62.
  • Example 64 includes a data storage sled comprising means for performing the method of any of Examples 53-62.
  • Example 65 includes a data storage sled comprising means for executing an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; means for determining whether the I/O intensive phase has ended; and means for migrating, in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 66 includes the subject matter of Example 65, and further including means for determining whether a network path to the compute sled satisfies a predefined level of congestion; and means for migrating, in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 67 includes the subject matter of any of Examples 65 and 66, and further including means for mapping a memory region to a main memory of the compute sled; and means for accessing data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 68 includes the subject matter of any of Examples 65-67, and further including means for receiving executable code associated with the I/O intensive phase from the compute sled; and wherein the means for executing the I/O intensive phase comprises means for executing the received executable code.
  • Example 69 includes the subject matter of any of Examples 65-68, and further including means for receiving an input set of data from the compute sled; and means for reformatting the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 70 includes the subject matter of any of Examples 65-69, and further including means for executing multiple I/O intensive phases of different workloads concurrently; and means for applying a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 71 includes the subject matter of any of Examples 65-70, and further including means for sending output data from execution of the I/O intensive phase to the compute sled.
  • Example 72 includes the subject matter of any of Examples 65-71, and further including means for receiving a first set of input data from the compute sled; and means for accessing a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 73 includes the subject matter of any of Examples 65-72, and wherein the means for determining whether the I/O intensive phase has ended comprises means for determining whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 74 includes the subject matter of any of Examples 65-73, and wherein the means for executing the I/O intensive phase comprises means for executing the I/O intensive phase with an I/O accelerator unit of the data storage sled.

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)
  • Computer Security & Cryptography (AREA)
  • Quality & Reliability (AREA)
  • Human Computer Interaction (AREA)
  • Mathematical Physics (AREA)
  • Computing Systems (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Health & Medical Sciences (AREA)
  • Multimedia (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Biomedical Technology (AREA)
  • General Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Multi Processors (AREA)
  • Cooling Or The Like Of Electrical Apparatus (AREA)
  • Small-Scale Networks (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Optical Communication System (AREA)
  • Computer And Data Communications (AREA)
  • Debugging And Monitoring (AREA)
  • Hardware Redundancy (AREA)
  • Stored Programmes (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Power Sources (AREA)
  • Optics & Photonics (AREA)
  • Memory System (AREA)
  • Memory System Of A Hierarchy Structure (AREA)

Abstract

Technologies for offloading I/O intensive workload phases to a data storage sled include a compute sled. The compute sled is to execute a workload that includes multiple phases. Each phase is indicative of a different resource utilization over a time period. Additionally, the compute sled is to identify an I/O intensive phase of the workload, wherein the amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold. The compute sled is also to migrate the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled. Other embodiments as also described and claimed.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • The present application claims the benefit of U.S. Provisional Patent Application No. 62/427,268, filed Nov. 29, 2016 and Indian Provisional Patent Application No. 201741030632, filed Aug. 30, 2017.
  • BACKGROUND
  • Typically, in systems in which data is accessed by a compute device from remote data storage (e.g., data stored at a location remote from the compute device within a data center), the network can become congested when the amount of data requested is relatively large. As such, other compute devices may be unable to perform operations that also require the communication of relatively large amounts of data through the network in a timely manner (e.g., in accordance with a latency or throughput target specified in a service level agreement with a customer). In other words, the network may become a bottleneck for the execution of workloads in the data center and the compute resources (e.g., processors) of the compute devices may be wasted as those resources sit idle waiting for requested data to arrive. To remedy such situations, an operator of the data center may spend monetary resources to install a higher throughput network. However, in many instances, the capacity of the higher throughput network may go largely unused, as the times when multiple workloads are concurrently in I/O intensive phases (e.g., periods of high network utilization to access remote data storage) may occur only a small percentage of the total time that the data center is in use.
  • 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 diagram of a conceptual overview of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 2 is a diagram of an example embodiment of a logical configuration of a rack of the data center of FIG. 1;
  • FIG. 3 is a diagram of an example embodiment of another data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 4 is a diagram of another example embodiment of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 5 is a diagram of a connectivity scheme representative of link-layer connectivity that may be established among various sleds of the data centers of FIGS. 1, 3, and 4;
  • FIG. 6 is a diagram of a rack architecture that may be representative of an architecture of any particular one of the racks depicted in FIGS. 1-4 according to some embodiments;
  • FIG. 7 is a diagram of an example embodiment of a sled that may be used with the rack architecture of FIG. 6;
  • FIG. 8 is a diagram of an example embodiment of a rack architecture to provide support for sleds featuring expansion capabilities;
  • FIG. 9 is a diagram of an example embodiment of a rack implemented according to the rack architecture of FIG. 8;
  • FIG. 10 is a diagram of an example embodiment of a sled designed for use in conjunction with the rack of FIG. 9;
  • FIG. 11 is a diagram of an example embodiment of a data center in which one or more techniques described herein may be implemented according to various embodiments;
  • FIG. 12 is a simplified block diagram of at least one embodiment of a system for migrating an I/O intensive phase of a workload from a compute sled to a data storage sled;
  • FIG. 13 is a simplified block diagram of at least one embodiment of a compute sled of the system of FIG. 12;
  • FIG. 14 is a simplified block diagram of at least one embodiment of a data storage sled of the system of FIG. 13;
  • FIG. 15 is a simplified block diagram of at least one embodiment of an environment that may be established by the compute sled of FIGS. 12 and 13;
  • FIG. 16 is a simplified block diagram of at least one embodiment of an environment that may be established by the data storage sled of FIGS. 12 and 14;
  • FIGS. 17-18 are a simplified flow diagram of at least one embodiment of a method for migrating an I/O intensive phase of a workload to a data storage sled that may be performed by the compute sled of FIGS. 12 and 13;
  • FIGS. 19-20 are a simplified flow diagram of at least one embodiment of a method for accelerating an I/O intensive phase of a workload from a compute sled that may be performed by the data storage sled of FIGS. 12 and 14; and
  • FIG. 21 is a simplified diagram of phases of execution of a workload, the sleds on which the workload is executed in each phase, and the amount of data operated on in each phase.
  • 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.
  • FIG. 1 illustrates a conceptual overview of a data center 100 that may generally be representative of a data center or other type of computing network in/for which one or more techniques described herein may be implemented according to various embodiments. As shown in FIG. 1, data center 100 may generally contain a plurality of racks, each of which may house computing equipment comprising a respective set of physical resources. In the particular non-limiting example depicted in FIG. 1, data center 100 contains four racks 102A to 102D, which house computing equipment comprising respective sets of physical resources (PCRs) 105A to 105D. According to this example, a collective set of physical resources 106 of data center 100 includes the various sets of physical resources 105A to 105D that are distributed among racks 102A to 102D. Physical resources 106 may include resources of multiple types, such as—for example—processors, co-processors, accelerators, field programmable gate arrays (FPGAs), memory, and storage. The embodiments are not limited to these examples.
  • The illustrative data center 100 differs from typical data centers in many ways. For example, in the illustrative embodiment, the circuit boards (“sleds”) on which components such as CPUs, memory, and other components are placed for increased thermal performance In particular, in the illustrative embodiment, the sleds are shallower than typical boards. In other words, the sleds are shorter from the front to the back, where cooling fans are located. This decreases the length of the path that air must to travel across the components on the board. Further, the components on the sled are spaced further apart than in typical circuit boards, and the components are arranged to reduce or eliminate shadowing (i.e., one component in the air flow path of another component). In the illustrative embodiment, processing components such as the processors are located on a top side of a sled while near memory, such as DIMMs, are located on a bottom side of the sled. As a result of the enhanced airflow provided by this design, the components may operate at higher frequencies and power levels than in typical systems, thereby increasing performance Furthermore, the sleds are configured to blindly mate with power and data communication cables in each rack 102A, 102B, 102C, 102D, enhancing their ability to be quickly removed, upgraded, reinstalled, and/or replaced. Similarly, individual components located on the sleds, such as processors, accelerators, memory, and data storage drives, are configured to be easily upgraded due to their increased spacing from each other. In the illustrative embodiment, the components additionally include hardware attestation features to prove their authenticity.
  • Furthermore, in the illustrative embodiment, the data center 100 utilizes a single network architecture (“fabric”) that supports multiple other network architectures including Ethernet and Omni-Path. The sleds, in the illustrative embodiment, are coupled to switches via optical fibers, which provide higher bandwidth and lower latency than typical twisted pair cabling (e.g., Category 5, Category 5e, Category 6, etc.). Due to the high bandwidth, low latency interconnections and network architecture, the data center 100 may, in use, pool resources, such as memory, accelerators (e.g., graphics accelerators, FPGAs, ASICs, etc.), and data storage drives that are physically disaggregated, and provide them to compute resources (e.g., processors) on an as needed basis, enabling the compute resources to access the pooled resources as if they were local. The illustrative data center 100 additionally receives utilization information for the various resources, predicts resource utilization for different types of workloads based on past resource utilization, and dynamically reallocates the resources based on this information.
  • The racks 102A, 102B, 102C, 102D of the data center 100 may include physical design features that facilitate the automation of a variety of types of maintenance tasks. For example, data center 100 may be implemented using racks that are designed to be robotically-accessed, and to accept and house robotically-manipulatable resource sleds. Furthermore, in the illustrative embodiment, the racks 102A, 102B, 102C, 102D include integrated power sources that receive a greater voltage than is typical for power sources. The increased voltage enables the power sources to provide additional power to the components on each sled, enabling the components to operate at higher than typical frequencies.
  • FIG. 2 illustrates an exemplary logical configuration of a rack 202 of the data center 100. As shown in FIG. 2, rack 202 may generally house a plurality of sleds, each of which may comprise a respective set of physical resources. In the particular non-limiting example depicted in FIG. 2, rack 202 houses sleds 204-1 to 204-4 comprising respective sets of physical resources 205-1 to 205-4, each of which constitutes a portion of the collective set of physical resources 206 comprised in rack 202. With respect to FIG. 1, if rack 202 is representative of—for example—rack 102A, then physical resources 206 may correspond to the physical resources 105A comprised in rack 102A. In the context of this example, physical resources 105A may thus be made up of the respective sets of physical resources, including physical storage resources 205-1, physical accelerator resources 205-2, physical memory resources 205-3, and physical compute resources 205-4 comprised in the sleds 204-1 to 204-4 of rack 202. The embodiments are not limited to this example. Each sled may contain a pool of each of the various types of physical resources (e.g., compute, memory, accelerator, storage). By having robotically accessible and robotically manipulatable sleds comprising disaggregated resources, each type of resource can be upgraded independently of each other and at their own optimized refresh rate.
  • FIG. 3 illustrates an example of a data center 300 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments. In the particular non-limiting example depicted in FIG. 3, data center 300 comprises racks 302-1 to 302-32. In various embodiments, the racks of data center 300 may be arranged in such fashion as to define and/or accommodate various access pathways. For example, as shown in FIG. 3, the racks of data center 300 may be arranged in such fashion as to define and/or accommodate access pathways 311A, 311B, 311C, and 311D. In some embodiments, the presence of such access pathways may generally enable automated maintenance equipment, such as robotic maintenance equipment, to physically access the computing equipment housed in the various racks of data center 300 and perform automated maintenance tasks (e.g., replace a failed sled, upgrade a sled). In various embodiments, the dimensions of access pathways 311A, 311B, 311C, and 311D, the dimensions of racks 302-1 to 302-32, and/or one or more other aspects of the physical layout of data center 300 may be selected to facilitate such automated operations. The embodiments are not limited in this context.
  • FIG. 4 illustrates an example of a data center 400 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments. As shown in FIG. 4, data center 400 may feature an optical fabric 412. Optical fabric 412 may generally comprise a combination of optical signaling media (such as optical cabling) and optical switching infrastructure via which any particular sled in data center 400 can send signals to (and receive signals from) each of the other sleds in data center 400. The signaling connectivity that optical fabric 412 provides to any given sled may include connectivity both to other sleds in a same rack and sleds in other racks. In the particular non-limiting example depicted in FIG. 4, data center 400 includes four racks 402A to 402D. Racks 402A to 402D house respective pairs of sleds 404A-1 and 404A-2, 404B-1 and 404B-2, 404C-1 and 404C-2, and 404D-1 and 404D-2. Thus, in this example, data center 400 comprises a total of eight sleds. Via optical fabric 412, each such sled may possess signaling connectivity with each of the seven other sleds in data center 400. For example, via optical fabric 412, sled 404A-1 in rack 402A may possess signaling connectivity with sled 404A-2 in rack 402A, as well as the six other sleds 404B-1, 404B-2, 404C-1, 404C-2, 404D-1, and 404D-2 that are distributed among the other racks 402B, 402C, and 402D of data center 400. The embodiments are not limited to this example.
  • FIG. 5 illustrates an overview of a connectivity scheme 500 that may generally be representative of link-layer connectivity that may be established in some embodiments among the various sleds of a data center, such as any of example data centers 100, 300, and 400 of FIGS. 1, 3, and 4. Connectivity scheme 500 may be implemented using an optical fabric that features a dual-mode optical switching infrastructure 514. Dual-mode optical switching infrastructure 514 may generally comprise a switching infrastructure that is capable of receiving communications according to multiple link-layer protocols via a same unified set of optical signaling media, and properly switching such communications. In various embodiments, dual-mode optical switching infrastructure 514 may be implemented using one or more dual-mode optical switches 515. In various embodiments, dual-mode optical switches 515 may generally comprise high-radix switches. In some embodiments, dual-mode optical switches 515 may comprise multi-ply switches, such as four-ply switches. In various embodiments, dual-mode optical switches 515 may feature integrated silicon photonics that enable them to switch communications with significantly reduced latency in comparison to conventional switching devices. In some embodiments, dual-mode optical switches 515 may constitute leaf switches 530 in a leaf-spine architecture additionally including one or more dual-mode optical spine switches 520.
  • In various embodiments, dual-mode optical switches may be capable of receiving both Ethernet protocol communications carrying Internet Protocol (IP packets) and communications according to a second, high-performance computing (HPC) link-layer protocol (e.g., Intel's Omni-Path Architecture's, InfiniBand™) via optical signaling media of an optical fabric. As reflected in FIG. 5, with respect to any particular pair of sleds 504A and 504B possessing optical signaling connectivity to the optical fabric, connectivity scheme 500 may thus provide support for link-layer connectivity via both Ethernet links and HPC links. Thus, both Ethernet and HPC communications can be supported by a single high-bandwidth, low-latency switch fabric. The embodiments are not limited to this example.
  • FIG. 6 illustrates a general overview of a rack architecture 600 that may be representative of an architecture of any particular one of the racks depicted in FIGS. 1 to 4 according to some embodiments. As reflected in FIG. 6, rack architecture 600 may generally feature a plurality of sled spaces into which sleds may be inserted, each of which may be robotically-accessible via a rack access region 601. In the particular non-limiting example depicted in FIG. 6, rack architecture 600 features five sled spaces 603-1 to 603-5. Sled spaces 603-1 to 603-5 feature respective multi-purpose connector modules (MPCMs) 616-1 to 616-5.
  • FIG. 7 illustrates an example of a sled 704 that may be representative of a sled of such a type. As shown in FIG. 7, sled 704 may comprise a set of physical resources 705, as well as an MPCM 716 designed to couple with a counterpart MPCM when sled 704 is inserted into a sled space such as any of sled spaces 603-1 to 603-5 of FIG. 6. Sled 704 may also feature an expansion connector 717. Expansion connector 717 may generally comprise a socket, slot, or other type of connection element that is capable of accepting one or more types of expansion modules, such as an expansion sled 718. By coupling with a counterpart connector on expansion sled 718, expansion connector 717 may provide physical resources 705 with access to supplemental computing resources 705B residing on expansion sled 718. The embodiments are not limited in this context.
  • FIG. 8 illustrates an example of a rack architecture 800 that may be representative of a rack architecture that may be implemented in order to provide support for sleds featuring expansion capabilities, such as sled 704 of FIG. 7. In the particular non-limiting example depicted in FIG. 8, rack architecture 800 includes seven sled spaces 803-1 to 803-7, which feature respective MPCMs 816-1 to 816-7. Sled spaces 803-1 to 803-7 include respective primary regions 803-1A to 803-7A and respective expansion regions 803-1B to 803-7B. With respect to each such sled space, when the corresponding MPCM is coupled with a counterpart MPCM of an inserted sled, the primary region may generally constitute a region of the sled space that physically accommodates the inserted sled. The expansion region may generally constitute a region of the sled space that can physically accommodate an expansion module, such as expansion sled 718 of FIG. 7, in the event that the inserted sled is configured with such a module.
  • FIG. 9 illustrates an example of a rack 902 that may be representative of a rack implemented according to rack architecture 800 of FIG. 8 according to some embodiments. In the particular non-limiting example depicted in FIG. 9, rack 902 features seven sled spaces 903-1 to 903-7, which include respective primary regions 903-1A to 903-7A and respective expansion regions 903-1B to 903-7B. In various embodiments, temperature control in rack 902 may be implemented using an air cooling system. For example, as reflected in FIG. 9, rack 902 may feature a plurality of fans 919 that are generally arranged to provide air cooling within the various sled spaces 903-1 to 903-7. In some embodiments, the height of the sled space is greater than the conventional “1U” server height. In such embodiments, fans 919 may generally comprise relatively slow, large diameter cooling fans as compared to fans used in conventional rack configurations. Running larger diameter cooling fans at lower speeds may increase fan lifetime relative to smaller diameter cooling fans running at higher speeds while still providing the same amount of cooling. The sleds are physically shallower than conventional rack dimensions. Further, components are arranged on each sled to reduce thermal shadowing (i.e., not arranged serially in the direction of air flow). As a result, the wider, shallower sleds allow for an increase in device performance because the devices can be operated at a higher thermal envelope (e.g., 250 W) due to improved cooling (i.e., no thermal shadowing, more space between devices, more room for larger heat sinks, etc.).
  • MPCMs 916-1 to 916-7 may be configured to provide inserted sleds with access to power sourced by respective power modules 920-1 to 920-7, each of which may draw power from an external power source 919. In various embodiments, external power source 921 may deliver alternating current (AC) power to rack 902, and power modules 920-1 to 920-7 may be configured to convert such AC power to direct current (DC) power to be sourced to inserted sleds. In some embodiments, for example, power modules 920-1 to 920-7 may be configured to convert 277-volt AC power into 12-volt DC power for provision to inserted sleds via respective MPCMs 916-1 to 916-7. The embodiments are not limited to this example.
  • MPCMs 916-1 to 916-7 may also be arranged to provide inserted sleds with optical signaling connectivity to a dual-mode optical switching infrastructure 914, which may be the same as—or similar to—dual-mode optical switching infrastructure 514 of FIG. 5. In various embodiments, optical connectors contained in MPCMs 916-1 to 916-7 may be designed to couple with counterpart optical connectors contained in MPCMs of inserted sleds to provide such sleds with optical signaling connectivity to dual-mode optical switching infrastructure 914 via respective lengths of optical cabling 922-1 to 922-7. In some embodiments, each such length of optical cabling may extend from its corresponding MPCM to an optical interconnect loom 923 that is external to the sled spaces of rack 902. In various embodiments, optical interconnect loom 923 may be arranged to pass through a support post or other type of load-bearing element of rack 902. The embodiments are not limited in this context. Because inserted sleds connect to an optical switching infrastructure via MPCMs, the resources typically spent in manually configuring the rack cabling to accommodate a newly inserted sled can be saved.
  • FIG. 10 illustrates an example of a sled 1004 that may be representative of a sled designed for use in conjunction with rack 902 of FIG. 9 according to some embodiments. Sled 1004 may feature an MPCM 1016 that comprises an optical connector 1016A and a power connector 1016B, and that is designed to couple with a counterpart MPCM of a sled space in conjunction with insertion of MPCM 1016 into that sled space. Coupling MPCM 1016 with such a counterpart MPCM may cause power connector 1016 to couple with a power connector comprised in the counterpart MPCM. This may generally enable physical resources 1005 of sled 1004 to source power from an external source, via power connector 1016 and power transmission media 1024 that conductively couples power connector 1016 to physical resources 1005.
  • Sled 1004 may also include dual-mode optical network interface circuitry 1026. Dual-mode optical network interface circuitry 1026 may generally comprise circuitry that is capable of communicating over optical signaling media according to each of multiple link-layer protocols supported by dual-mode optical switching infrastructure 914 of FIG. 9. In some embodiments, dual-mode optical network interface circuitry 1026 may be capable both of Ethernet protocol communications and of communications according to a second, high-performance protocol. In various embodiments, dual-mode optical network interface circuitry 1026 may include one or more optical transceiver modules 1027, each of which may be capable of transmitting and receiving optical signals over each of one or more optical channels. The embodiments are not limited in this context.
  • Coupling MPCM 1016 with a counterpart MPCM of a sled space in a given rack may cause optical connector 1016A to couple with an optical connector comprised in the counterpart MPCM. This may generally establish optical connectivity between optical cabling of the sled and dual-mode optical network interface circuitry 1026, via each of a set of optical channels 1025. Dual-mode optical network interface circuitry 1026 may communicate with the physical resources 1005 of sled 1004 via electrical signaling media 1028. In addition to the dimensions of the sleds and arrangement of components on the sleds to provide improved cooling and enable operation at a relatively higher thermal envelope (e.g., 250 W), as described above with reference to FIG. 9, in some embodiments, a sled may include one or more additional features to facilitate air cooling, such as a heatpipe and/or heat sinks arranged to dissipate heat generated by physical resources 1005. It is worthy of note that although the example sled 1004 depicted in FIG. 10 does not feature an expansion connector, any given sled that features the design elements of sled 1004 may also feature an expansion connector according to some embodiments. The embodiments are not limited in this context.
  • FIG. 11 illustrates an example of a data center 1100 that may generally be representative of one in/for which one or more techniques described herein may be implemented according to various embodiments. As reflected in FIG. 11, a physical infrastructure management framework 1150A may be implemented to facilitate management of a physical infrastructure 1100A of data center 1100. In various embodiments, one function of physical infrastructure management framework 1150A may be to manage automated maintenance functions within data center 1100, such as the use of robotic maintenance equipment to service computing equipment within physical infrastructure 1100A. In some embodiments, physical infrastructure 1100A may feature an advanced telemetry system that performs telemetry reporting that is sufficiently robust to support remote automated management of physical infrastructure 1100A. In various embodiments, telemetry information provided by such an advanced telemetry system may support features such as failure prediction/prevention capabilities and capacity planning capabilities. In some embodiments, physical infrastructure management framework 1150A may also be configured to manage authentication of physical infrastructure components using hardware attestation techniques. For example, robots may verify the authenticity of components before installation by analyzing information collected from a radio frequency identification (RFID) tag associated with each component to be installed. The embodiments are not limited in this context.
  • As shown in FIG. 11, the physical infrastructure 1100A of data center 1100 may comprise an optical fabric 1112, which may include a dual-mode optical switching infrastructure 1114. Optical fabric 1112 and dual-mode optical switching infrastructure 1114 may be the same as—or similar to—optical fabric 412 of FIG. 4 and dual-mode optical switching infrastructure 514 of FIG. 5, respectively, and may provide high-bandwidth, low-latency, multi-protocol connectivity among sleds of data center 1100. As discussed above, with reference to FIG. 1, in various embodiments, the availability of such connectivity may make it feasible to disaggregate and dynamically pool resources such as accelerators, memory, and storage. In some embodiments, for example, one or more pooled accelerator sleds 1130 may be included among the physical infrastructure 1100A of data center 1100, each of which may comprise a pool of accelerator resources—such as co-processors and/or FPGAs, for example—that is globally accessible to other sleds via optical fabric 1112 and dual-mode optical switching infrastructure 1114.
  • In another example, in various embodiments, one or more pooled storage sleds 1132 may be included among the physical infrastructure 1100A of data center 1100, each of which may comprise a pool of storage resources that is globally accessible to other sleds via optical fabric 1112 and dual-mode optical switching infrastructure 1114. In some embodiments, such pooled storage sleds 1132 may comprise pools of solid-state storage devices such as solid-state drives (SSDs). In various embodiments, one or more high-performance processing sleds 1134 may be included among the physical infrastructure 1100A of data center 1100. In some embodiments, high-performance processing sleds 1134 may comprise pools of high-performance processors, as well as cooling features that enhance air cooling to yield a higher thermal envelope of up to 250 W or more. In various embodiments, any given high-performance processing sled 1134 may feature an expansion connector 1117 that can accept a far memory expansion sled, such that the far memory that is locally available to that high-performance processing sled 1134 is disaggregated from the processors and near memory comprised on that sled. In some embodiments, such a high-performance processing sled 1134 may be configured with far memory using an expansion sled that comprises low-latency SSD storage. The optical infrastructure allows for compute resources on one sled to utilize remote accelerator/FPGA, memory, and/or SSD resources that are disaggregated on a sled located on the same rack or any other rack in the data center. The remote resources can be located one switch jump away or two-switch jumps away in the spine-leaf network architecture described above with reference to FIG. 5. The embodiments are not limited in this context.
  • In various embodiments, one or more layers of abstraction may be applied to the physical resources of physical infrastructure 1100A in order to define a virtual infrastructure, such as a software-defined infrastructure 1100B. In some embodiments, virtual computing resources 1136 of software-defined infrastructure 1100B may be allocated to support the provision of cloud services 1140. In various embodiments, particular sets of virtual computing resources 1136 may be grouped for provision to cloud services 1140 in the form of software defined infrastructure (SDI) services 1138. Examples of cloud services 1140 may include—without limitation—software as a service (SaaS) services 1142, platform as a service (PaaS) services 1144, and infrastructure as a service (IaaS) services 1146.
  • In some embodiments, management of software-defined infrastructure 1100B may be conducted using a virtual infrastructure management framework 1150B. In various embodiments, virtual infrastructure management framework 1150B may be designed to implement workload fingerprinting techniques and/or machine-learning techniques in conjunction with managing allocation of virtual computing resources 1136 and/or SDI services 1138 to cloud services 1140. In some embodiments, virtual infrastructure management framework 1150B may use/consult telemetry data in conjunction with performing such resource allocation. In various embodiments, an application/service management framework 1150C may be implemented in order to provide QoS management capabilities for cloud services 1140. The embodiments are not limited in this context.
  • Referring now to FIG. 12, a system 1210 for migrating an I/O intensive phase of a workload from a compute sled to a data storage sled may be implemented in accordance with the data centers 100, 300, 400, 1100 described above with reference to FIGS. 1, 3, 4, and 11. In the illustrative embodiment, the system 1210 includes an orchestrator server 1216 in communication with a network switch 1220. The network switch 1220 is communicatively coupled to multiple sleds including compute sleds 1230, 1232, and a data storage sled 1240. One or more of the sleds 1230, 1232, 1240, may be grouped into a managed node, such as by the orchestrator server 1216, to collectively perform a workload, such as an application. A managed node may be embodied as an assembly of resources (e.g., physical resources 206), such as compute resources (e.g., physical compute resources 205-4), memory resources (e.g., physical memory resources 205-3), storage resources (e.g., physical storage resources 205-1), or other resources (e.g., physical accelerator resources 205-2), from the same or different sleds (e.g., the sleds 204-1, 204-2, 204-3, 204-4, etc.) or racks (e.g., one or more of racks 302-1 through 302-32). Further, a managed node may be established, defined, or “spun up” by the orchestrator server 1216 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 system 1210 may be located in a data center and provide storage and compute services (e.g., cloud services) to a client device 1214 that is in communication with the system 1210 through a network 1212. The orchestrator server 1216 may support a cloud operating environment, such as OpenStack, and managed nodes established by the orchestrator server 1216 may execute one or more applications or processes (i.e., workloads), such as in virtual machines or containers, on behalf of a user of the client device 1214. In the illustrative embodiment, the compute sled 1230 executes a workload 1234 (e.g., an application), and the compute sled 1232 executes another workload 1236 (e.g., another application). Further, the data storage sled 1240 includes multiple data storage devices 1244, 1246 (e.g., physical storage resources 205-1). While two compute sleds 1230, 1232 and a data storage sled 1240 are shown, it should be understood that other sleds, such as memory sleds and accelerator sleds may be present in the system 1210 and may be selectively added to or removed from a managed node (e.g., as determined by the orchestrator server 1216).
  • In operation, the system 1210 may utilize one or more migration logic units 1250 in a compute sled 1230, 1232 and/or an I/O accelerator unit 1260 in a data storage sled 1240 to perform migration of a workload from a compute sled 1230, 1232 to the data storage sled 1240 when the workload enters an I/O intensive phase, indicative a period of execution of the workload in which the amount of data to be sent through the network between the compute sled 1230 and the data storage sled 1240 satisfies a predefined threshold amount (e.g., 8 GB/s per second) and the congestion level of the network path between the compute sled 1230 and the data storage sled 1240 satisfies a predefined level of congestion (e.g., a predefined latency, a predefined utilization of the total throughput of the network). In the illustrative embodiment, the predefined level of congestion is a level of congestion in which, if the I/O intensive phase of the workload was executed on the compute sled 1230 and the data used by the I/O intensive phase was sent through the network 1212 between the compute sled 1230 and the data storage sled 1240, the speed of execution of the workload would be slowed. As a result, the workload may not produce a result in a time period specified in a service level agreement (SLA) with a customer. By migrating the workload to the data storage sled 1240 for execution, the I/O intensive phase may be executed faster, as the data utilized by the I/O intensive phase is local to the sled where the workload is executed. In the illustrative embodiment, the data storage sled 1240 may map a memory range of the main memory of the compute sled 1230 to the data storage sled 1240, such that data (e.g., a relatively small set of output data, compared to a relatively large amount of input data read from a data storage device local to the data storage sled 1240) may be read from and written to the main memory of the compute sled 1230 during execution of the I/O intensive phase on the data storage sled 1240.
  • Referring now to FIG. 13, the compute sled 1230 may be embodied as any type of compute device capable of performing the functions described herein, including executing a workload (e.g., the workload 1234), determining whether the workload is likely to enter an I/O intensive phase in a predefined time period (e.g., as the next phase of the workload, within 10 milliseconds, etc.), determining whether the path through the network 1212 between the compute sled and the data sled 1240 is congested enough that the network 1212 would be a bottleneck in the execution speed of the workload (e.g., the network 1212 would be unable to transfer data from the data storage sled 1240 to the compute sled 1230 fast enough to avoid the compute sled 1230 consuming idle cycles that could otherwise be spent on executing the workload), migrating the workload to the data storage sled 1240 for execution of the I/O intensive phase, and resuming execution of the workload after the I/O intensive phase has completed.
  • As shown in FIG. 13, the illustrative compute sled 1230 includes a compute engine 1302, an input/output (I/O) subsystem 1308, communication circuitry 1310, and one or more data storage devices 1314. Of course, in other embodiments, the compute sled 1230 may include other or additional components, such as those commonly found in a computer (e.g., display, peripheral devices, etc.). Additionally, in some embodiments, one or more of the illustrative components may be incorporated in, or otherwise form a portion of, another component.
  • The compute engine 1302 may be embodied as any type of device or collection of devices capable of performing various compute functions described below. In some embodiments, the compute engine 1302 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable gate array (FPGA), a system-on-a-chip (SOC), or other integrated system or device. Additionally, in some embodiments, the compute engine 1302 includes or is embodied as a processor 1304 and a memory 1306. The processor 1304 may be embodied as any type of processor capable of performing the functions described herein. For example, the processor 1304 may be embodied as a single or multi-core processor(s), a microcontroller, or other processor or processing/controlling circuit. In some embodiments, the processor 1304 may be embodied as, include, or be coupled to an FPGA, an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware to facilitate performance of the functions described herein. The processor 1304 may include a migration logic unit 1250 briefly mentioned with reference to FIG. 12. The migration logic unit 1250 may be embodied as a specialized device, such as a co-processor, an FPGA, or an ASIC, for determining whether a workload is about to enter an I/O intensive phase (e.g., as indicated by top-down microarchitecture analysis method (TMAM) metrics), determining whether the present network congestion level indicates that the network would be a bottleneck to the execution of the workload, migrating the workload to the data storage sled 1240, including sending memory map data usable for mapping a region of the memory 1306 to the data storage sled 1240 to enable the data storage sled to read from and/or write to the main memory of the compute sled 1230 (e.g., in a memory region used by the workload 1234) as the workload is executed by the data storage sled 1240, and reformatting the data to a format usable by the data storage sled (e.g., by specialized logic in the data storage sled, such as the I/O accelerator unit 1260), such as by converting a file to a block or vice versa, changing a byte ordering of data, etc.
  • The main memory 1306 may be embodied as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory or data storage capable of performing the functions described herein. 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 (these standards are available at www.jedec.org). 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 future generation nonvolatile devices, such as a three dimensional crosspoint memory device (e.g., 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, 3D crosspoint memory (e.g., Intel 3D XPoint™ memory) 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. In some embodiments, all or a portion of the main memory 1306 may be integrated into the processor 1304. In operation, the main memory 1306 may store various software and data used during operation such as workload data, phase data, network congestion data, migration data, applications, programs, libraries, and drivers.
  • The compute engine 1302 is communicatively coupled to other components of the compute sled 1230 via the I/O subsystem 1308, which may be embodied as circuitry and/or components to facilitate input/output operations with the compute engine 1302 (e.g., with the processor 1304 and/or the main memory 1306) and other components of the compute sled 1230. For example, the I/O subsystem 1308 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, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations. In some embodiments, the I/O subsystem 1308 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with one or more of the processor 1304, the main memory 1306, and other components of the compute sled 1230, into the compute engine 1302.
  • The communication circuitry 1310 may be embodied as any communication circuit, device, or collection thereof, capable of enabling communications over the network 1212 between the compute sled 1230 and another compute device (e.g., the data storage sled 1240, the orchestrator server 1216, etc.). The communication circuitry 1310 may be configured to use any one or more communication technology (e.g., wired or wireless communications) and associated protocols (e.g., Ethernet, Bluetooth®, Wi-Fi®, WiMAX, etc.) to effect such communication.
  • The illustrative communication circuitry 1310 includes a network interface controller (NIC) 1312, which may also be referred to as a host fabric interface (HFI). The NIC 1312 may be embodied as one or more add-in-boards, daughter cards, network interface cards, controller chips, chipsets, or other devices that may be used by the compute sled 1230 to connect with another compute device (e.g., the data storage sled 1240, the orchestrator server 1216, etc.). In some embodiments, the NIC 1312 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 1312 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 1312. In such embodiments, the local processor of the NIC 1312 may be capable of performing one or more of the functions of the compute engine 1302 described herein. Additionally or alternatively, in such embodiments, the local memory of the NIC 1312 may be integrated into one or more components of the compute sled 1230 at the board level, socket level, chip level, and/or other levels. In some embodiments, the migration logic unit 1250 may be included in the NIC 1312.
  • The one or more illustrative data storage devices 1314, may be embodied as any type of devices configured for short-term or long-term storage of data such as, for example, memory devices and circuits, memory cards, hard disk drives, solid-state drives, or other data storage devices. Each data storage device 1314 may include a system partition that stores data and firmware code for the data storage device 1314. Each data storage device 1314 may also include an operating system partition that stores data files and executables for an operating system.
  • Additionally or alternatively, the compute sled 1230 may include one or more peripheral devices 1316. Such peripheral devices 1316 may include any type of peripheral device commonly found in a compute device such as a display, speakers, a mouse, a keyboard, and/or other input/output devices, interface devices, and/or other peripheral devices.
  • Referring now to FIG. 14, the data storage sled 1240 may be embodied as any type of compute device capable of performing the functions described herein, including reading and writing data to one or more data storage devices of the data storage sled 1240 in response to corresponding requests from a compute sled 1230, executing a workload that has been migrated to the data storage sled 1240 (e.g., an I/O intensive phase of a workload), sending output data to the compute sled as a result of performing the I/O intensive phase (e.g., by writing the output data to a region of the main memory 1306 of the compute sled 1230 that has been mapped for use by the workload when executed on the data storage sled 1240), and migrating the workload back to the compute sled 1230 after the I/O intensive phase has ended or when the congestion level of the network has decreased to a point where the network is no longer a bottleneck for the I/O intensive phase.
  • As shown in FIG. 14, the illustrative data storage sled 1240 includes a compute engine 1402, an input/output (I/O) subsystem 1408, communication circuitry 1410, and one or more data storage devices 1414. Of course, in other embodiments, the data storage sled 1240 may include other or additional components, such as those commonly found in a computer (e.g., display, peripheral devices, etc.). Additionally, in some embodiments, one or more of the illustrative components may be incorporated in, or otherwise form a portion of, another component.
  • The compute engine 1402 may be embodied as any type of device or collection of devices capable of performing various compute functions described below. In some embodiments, the compute engine 1402 may be embodied as a single device such as an integrated circuit, an embedded system, a field-programmable gate array (FPGA), a system-on-a-chip (SOC), or other integrated system or device. Additionally, in some embodiments, the compute engine 1402 includes or is embodied as a processor 1404 and a memory 1406. The processor 1404 may be embodied as any type of processor capable of performing the functions described herein. For example, the processor 1404 may be embodied as a single or multi-core processor(s), a microcontroller, or other processor or processing/controlling circuit. In some embodiments, the processor 1404 may be embodied as, include, or be coupled to an FPGA, an application specific integrated circuit (ASIC), reconfigurable hardware or hardware circuitry, or other specialized hardware to facilitate performance of the functions described herein. The processor 1404 may include an I/O accelerator unit 1260, which may be embodied as a specialized device, such as a co-processor, an FPGA, or an ASIC, for executing the I/O intensive phase of one or more workloads, using data in the local data storage device(s) 1414. In some embodiments, the I/O accelerator unit 1260 may map a memory region of the compute sled 1230 as local memory for the corresponding workload. As such, during execution of the workload, the I/O accelerator unit 1260 may cause data to be read from and/or written to the main memory 1306 of the compute sled 1406 (e.g., by interfacing with the migration logic unit 1250 of the compute sled 1230) as if the memory 1306 was local and without modifying the executable code of the workload. Additionally, the I/O accelerator unit 1260 may reformat data from the compute sled 1230 to a format usable by the I/O accelerator unit 1260 (e.g., converting a file to a block or vice versa, changing a byte ordering of data, etc.) to execute the I/O intensive phase of the workload.
  • The main memory 1406 may be embodied as any type of volatile (e.g., dynamic random access memory (DRAM), etc.) or non-volatile memory or data storage capable of performing the functions described herein. In operation, the main memory 1406 may store various software and data used during operation such as workload data, phase data, network congestion data, migration data, applications, programs, libraries, and drivers.
  • The compute engine 1402 is communicatively coupled to other components of the data storage sled 1240 via the I/O subsystem 1408, which may be embodied as circuitry and/or components to facilitate input/output operations with the compute engine 1402 (e.g., with the processor 1404 and/or the main memory 1406) and other components of the data storage sled 1240. For example, the I/O subsystem 1408 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, light guides, printed circuit board traces, etc.), and/or other components and subsystems to facilitate the input/output operations. In some embodiments, the I/O subsystem 1408 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with one or more of the processor 1404, the main memory 1406, and other components of the data storage sled 1240, into the compute engine 1402.
  • The communication circuitry 1410 may be embodied as any communication circuit, device, or collection thereof, capable of enabling communications over the network 1212 between the data storage sled 1240 and another compute device (e.g., the compute sleds 1230, 1232, the orchestrator server 1216, etc.). The communication circuitry 1310 may be configured to use any one or more communication technology (e.g., wired or wireless communications) and associated protocols (e.g., Ethernet, Bluetooth®, Wi-Fi®, WiMAX, etc.) to effect such communication.
  • The illustrative communication circuitry 1410 includes a network interface controller (NIC) 1412, which may also be referred to as a host fabric interface (HFI). The NIC 1412 may be embodied as one or more add-in-boards, daughter cards, network interface cards, controller chips, chipsets, or other devices that may be used by the data storage sled 1240 to connect with another compute device (e.g., the compute sleds 1240, 1242 the orchestrator server 1216, etc.). In some embodiments, the NIC 1412 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 1412 may include a local processor (not shown) and/or a local memory (not shown) that are both local to the NIC 1412. In such embodiments, the local processor of the NIC 1412 may be capable of performing one or more of the functions of the compute engine 1402 described herein. Additionally or alternatively, in such embodiments, the local memory of the NIC 1412 may be integrated into one or more components of the compute sled 1240 at the board level, socket level, chip level, and/or other levels. In some embodiments, the I/O accelerator unit 1260 may be included in the NIC 1412.
  • The one or more illustrative data storage devices 1414, may be embodied as any type of devices configured for short-term or long-term storage of data such as, for example, memory devices and circuits, memory cards, hard disk drives, solid-state drives, or other data storage devices. Each data storage device 1414 may include a system partition that stores data and firmware code for the data storage device 1414. Each data storage device 1414 may also include an operating system partition that stores data files and executables for an operating system.
  • Additionally or alternatively, the data storage sled 1240 may include one or more peripheral devices 1416. Such peripheral devices 1416 may include any type of peripheral device commonly found in a compute device such as a display, speakers, a mouse, a keyboard, and/or other input/output devices, interface devices, and/or other peripheral devices.
  • The client device 1214, the orchestrator server 1216, and the compute sled 1232 may have components similar to those described in FIGS. 13 and 14. The description of those components of the compute sled 1230 and the data storage sled 1240 is equally applicable to the description of components of those devices and is not repeated herein for clarity of the description. Further, it should be appreciated that any of the client device 1214, the orchestrator server 1216, and the sleds 1230, 1232, 1240 may include other components, sub-components, and devices commonly found in a computing device, which are not discussed above in reference to the compute sled 1230 and the data storage sled 1240 and not discussed herein for clarity of the description.
  • As described above, the network switch 1220, the orchestrator server 1216, and the sleds 1230, 1232, 1240 are illustratively in communication via the network 1212, 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. 15, the compute sled 1230 may establish an environment 1500 during operation. The illustrative environment 1500 includes a network communicator 1520 and a migration manager 1530. Each of the components of the environment 1500 may be embodied as hardware, firmware, software, or a combination thereof. As such, in some embodiments, one or more of the components of the environment 1500 may be embodied as circuitry or a collection of electrical devices (e.g., network communicator circuitry 1520, migration manager circuitry 1530, etc.). It should be appreciated that, in such embodiments, one or more of the network communicator circuitry 1520 or migration manager circuitry 1530 may form a portion of one or more of the compute engine 1302, the migration logic unit 1250, the communication circuitry 1310, the I/O subsystem 1308, and/or other components of the compute sled 1230. In the illustrative embodiment, the environment 1500 includes workload data 1502, which may be embodied as any data indicative of workloads assigned to the compute sled 1230 to execute, including an identifier of each workload and executable code associated with each workload, and a memory region (e.g., a set of memory addresses) used by each workload to access (e.g., read and/or write) data in the main memory 1306, and an identifier of a data storage sled (e.g., the data storage sled 1240) used by each workload for accessing data storage. Additionally, the illustrative environment 1500 includes phase data 1504 which may be embodied as any data indicative of resource utilization characteristics of each phase of each workload (e.g., phase A exhibits relatively high processor utilization and low data storage utilization, phase B exhibits relatively low processor utilization and high data storage utilization, etc.), detected patterns of phases (e.g., phase A is typically followed by phase B, then phase A, then phase C, etc.), and/or metadata indicative of locations in the executable code of the workloads that mark the beginning and end of each phase. In addition, the environment 1500 includes network congestion data 1506, which may be embodied as any data indicative of the present data transfer capacity of the network 1212 (e.g., a latency, a bandwidth, a throughput, a fullness of a transmit buffer of the compute sled 1230, etc.). Additionally, the illustrative environment 1500 includes migration data 1508, which may be embodied as any data indicative of a determination of whether to migrate a workload to the data storage sled 1240 (e.g., as a function of whether an I/O intensive phase is predicted to occur within a predefined time window and whether the network 1212 is sufficiently congested to be a bottleneck to the execution of the I/O intensive phase on the compute sled 1230).
  • In the illustrative environment 1500, the network communicator 1520, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the compute sled 1230, respectively. To do so, the network communicator 1520 is configured to receive and process data packets from one system or computing device (e.g., the orchestrator server 1216) and to prepare and send data packets to another computing device or system (e.g., the data storage sled 1240). Accordingly, in some embodiments, at least a portion of the functionality of the network communicator 1520 may be performed by the communication circuitry 1310, and, in the illustrative embodiment, by the NIC 1312.
  • The migration manager 1530, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof, is configured to manage the migration of a workload to the data storage sled 1240 for execution if the workload is entering an I/O intensive phase and the network 1212 would be a bottleneck (e.g., transferring the data though the network between the data storage sled 1240 and the compute sled 1230 would slow the execution of the workload). To do so, in the illustrative embodiment, the migration manager 1530 includes a workload executor 1532, an I/O intensity determiner 1534, a network congestion determiner 1536, and a workload phase migrator 1538. The workload executor 1532, in the illustrative embodiment, is configured to execute the workload using data stored in the data storage device(s) 1414 of the data storage sled 1240. As the compute sled 1230 executes the workload, the workload may transition through multiple phases of resource utilization, as described above. The I/O intensity determiner 1534, in the illustrative embodiment, is configured to determine whether the amount of data to be accessed from the data storage device(s) 1414 of the data storage sled 1240 to execute a phase satisfies a threshold amount (e.g., a predefined number of gigabytes per second, etc.). In the illustrative embodiment, the I/O intensity determiner 1534 may monitor the resource utilization of the workload over time to identify the different phases, identify patterns in the phases, and/or metadata associated with sections of the executable code of the workload that demarcate different phases, to predict whether the workload will transition into an I/O intensive phase within a predefined time period. The network congestion determiner 1536, in the illustrative embodiment, is configured to determine the level of network congestion, such as by sending a test message to the data storage sled 1240 to determine a latency in receiving a response from the data storage sled 1240, identifying a fullness of a transmit buffer of the NIC 1312 of the compute sled 1230 (e.g., a fuller buffer may indicate more congestion), and/or by querying the orchestrator server 1216 for the network congestion data 1506. The workload phase migrator 1538, in the illustrative embodiment, is configured to determine whether to migrate the workload to the data storage sled 1240 as a function of whether the workload is predicted to enter an I/O intensive phase within a predefined time period (e.g., 10 milliseconds) and further as a function of the network congestion data 1506 (e.g., whether the network 1212 is congested to the point that the network 1212 would be a bottleneck to the execution of the workload in the I/O intensive phase). Further, in the illustrative embodiment, the workload phase migrator 1538 may facilitate migration of the workload to the data storage sled 1240 by providing memory map data that is usable by the data storage sled 1240 to map a region of the main memory 1306 of the compute sled 1230 as local memory to be used by the workload when the workload is executed on the data storage sled 1240. Additionally, the workload phase migrator 1538 may reformat data in the main memory 1306 to a different format that is usable by the data storage sled 1240 (e.g., by the I/O accelerator unit 1260 of the data storage sled 1240), as described herein.
  • It should be appreciated that each of the workload executor 1532, the I/O intensity determiner 1534, the network congestion determiner 1536, and the workload phase migrator 1538 may be separately embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof. For example, the workload executor 1532 may be embodied as a hardware component, while the I/O intensity determiner 1534, the network congestion determiner 1536, and the workload phase migrator 1538 are embodied as virtualized hardware components or as some other combination of hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • Referring now to FIG. 16, the data storage sled 1240 may establish an environment 1600 during operation. The illustrative environment 1600 includes a network communicator 1620 and a migration manager 1630. Each of the components of the environment 1600 may be embodied as hardware, firmware, software, or a combination thereof. As such, in some embodiments, one or more of the components of the environment 1600 may be embodied as circuitry or a collection of electrical devices (e.g., network communicator circuitry 1620, migration manager circuitry 1630, etc.). It should be appreciated that, in such embodiments, one or more of the network communicator circuitry 1620 or migration manager circuitry 1630 may form a portion of one or more of the compute engine 1402, the I/O accelerator unit 1260, the communication circuitry 1410, the I/O subsystem 1408, and/or other components of the data storage sled 1240. In the illustrative embodiment, the environment 1600 includes workload data 1602, which may be embodied as any data indicative of workloads assigned to the data storage sled 1240 to be executed (e.g., in the I/O intensive phase), memory map data indicative of a memory region of the corresponding compute sled 1230 that may be mapped as local memory as the workload is executed on the data storage sled 1240, and executable code to execute (e.g., executable code defining the I/O intensive phase of the workload). Additionally, the illustrative environment 1600 includes phase data 1604 which, in the illustrative embodiment, is similar to the phase data 1504 described above. In addition, the environment 1600 includes network congestion data 1606 which, in the illustrative embodiment, is similar to the network congestion data 1506, described above. Additionally, the illustrative environment 1600 includes migration data 1608, which is similar to the migration data 1508 described above with reference to FIG. 15, except the migration data 1608 is indicative of whether the workload should be migrated back to the corresponding compute sled 1230 (e.g., the network 1212 is not a bottleneck and/or the I/O intensive phase has ended).
  • In the illustrative environment 1600, the network communicator 1620, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the data storage sled 1240, respectively. To do so, the network communicator 1620 is configured to receive and process data packets from one system or computing device (e.g., the orchestrator server 1216) and to prepare and send data packets to another computing device or system (e.g., the compute sled 1230). Accordingly, in some embodiments, at least a portion of the functionality of the network communicator 1620 may be performed by the communication circuitry 1410, and, in the illustrative embodiment, by the NIC 1412.
  • The migration manager 1630, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof, is configured to facilitate the migration of a workload to the data storage sled 1240 and for migrating a workload back to the corresponding compute sled 1230, 1232 after the I/O intensive phase of the workload has completed or if the network congestion satisfies a predefined threshold (e.g., the network would no longer be a bottleneck to the execution of the I/O intensive phase of the workload). To do so, in the illustrative embodiment, the migration manager 1630 includes a phase accelerator 1632, a quality of service (QoS) manager 1634, a network congestion determiner 1636, and a workload phase migrator 1638. The phase accelerator 1632, in the illustrative embodiment, is configured to execute a workload that is in an I/O intensive phase (e.g., with the I/O accelerator unit 1260). The QoS manager 1634, in the illustrative embodiment, is configured to apply a quality of service (QoS) policy to throttle the usage of resources by the workloads executed on the data storage sled 1240 so that no workload dominates the usage of data storage sled resources to the detriment of other workloads (e.g., causing a workload to no longer satisfy a QoS target specified in a service level agreement (SLA)). The network congestion determiner 1636 is similar to the network congestion determiner 1536 described with reference to the environment 1500. Additionally, in the illustrative embodiment, the workload phase migrator 1638 is configured to facilitate the migration of the workload to the data storage sled 1240, such as by establishing a memory map that enables the workload to access the main memory 1306 of the compute sled 1230 as local memory. The workload phase migrator 1638 is also configured to determine when to migrate the workload back to the compute sled 1230, 1232. In the illustrative embodiment, the workload phase migrator 1638 is configured to migrate the workload back to the compute sled 1230, 1232 when the I/O intensive phase has been completed (e.g., the executable code of the I/O intensive phase has been completely executed, the amount of memory bandwidth utilized by the workload has fallen below a predefined amount, etc.) and/or when the network congestion has decreased to a level that the network 1212 would no longer be a bottleneck to the execution of the workload on the compute sled 1230, 1232.
  • It should be appreciated that each of the phase accelerator 1632, the QoS manager 1634, the network congestion determiner 1636, and the workload phase migrator 1638 may be separately embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof. For example, the phase accelerator 1632 may be embodied as a hardware component, while the QoS manager 1634, the network congestion determiner 1636, and the workload phase migrator 1638 are embodied as virtualized hardware components or as some other combination of hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof.
  • Referring now to FIG. 17, the compute sled 1230, in operation, may execute a method 1700 to enable offloading of I/O intensive phases of a workload to the data storage sled 1240. The method 1700 begins with block 1702 in which the compute sled 1230 determines whether to execute a workload. The compute sled 1230 may determine to enable offloading if the compute sled 1230 has been assigned to a managed node, is powered on and communicatively coupled to the data storage sled 1240, and/or based on other factors. Regardless, in response to a determination to execute a workload, the method 1700 advances to block 1704 in which the compute sled 1230 receives a workload to be executed (e.g., the compute sled 1230 receives the workload data 1502 identifying the workload and the executable code of the workload). In doing so, the compute sled 1230 may receive the workload from the orchestrator server 1216, as indicated in block 1706. In later iterations of the block 1704, the compute sled 1230 may receive a workload from the data storage sled 1240 (e.g., after the workload has been migrated to the data storage sled 1240 and the data storage sled 1240 has completed the I/O intensive phase), as indicated in block 1708.
  • In block 1710, the compute sled 1230 executes the workload, including accessing (e.g., reading from and/or writing to) the data storage sled 1240 and a region of the main memory 1306 of the compute sled 1230. Additionally, in block 1712, the compute sled 1230 identifies I/O intensive phases of the workload. In doing so, the compute sled 1230 may identify phases in which the amount of data sent through the network (e.g., between the data storage sled 1240 and the compute sled 1230) satisfies a predefined threshold, such as a predefined number of gigabytes per second, as indicated in block 1714. As indicated in block 1716, in identifying the I/O intensive phases, the compute sled 1230 identifies I/O intensive phases as a function of workload metadata indicative of the I/O intensive phases. For example, the metadata may be included with the executable code of the workload and may identify the sections of the executable code that mark the beginning and end of each phase. Further, the metadata may indicate the types and amounts of resources utilized by each phase. As indicated in block 1718, the compute sled 1230 identifies I/O intensive phases using pattern recognition. In doing so, and as indicated in block 1720, the compute sled 1230 may determine historical I/O usage associated with different periods of execution of the workload and identify changes in the I/O usage as changes in the phases of the workload. Further, as indicated in block 1722, the compute sled 1230 may identify patterns of phases (e.g., phase A, followed by phase B, then phase A, then phase C, then phase A, etc.).
  • In block 1724, the compute sled 1230 determines whether an I/O intensive phase is likely to occur within a predefined time period. In doing so, the compute sled 1230, in the illustrative embodiment, determines a likelihood of an I/O intensive phase occurring within the predefined time period as a function of the identified pattern of phases and the present time, as indicated in block 1726. For example, if the compute sled 1230 has determined that phase B is I/O intensive, that phase B typically (e.g., 80% of the time) follows phase A, and that phase A has been executing for 90% of its typical phase residency (i.e., time period of execution) of 100 milliseconds, then the compute sled 1230 may determine that the I/O intensive phase (e.g., phase B) is likely to occur within the next 10 milliseconds. In block 1728, the compute sled 1230 determines the subsequent course of action as a function of whether there is an upcoming I/O intensive phase in the workload (e.g., whether the likelihood of an I/O intensive phase occurring within the next 10 milliseconds is greater than a predefined threshold, such as 50%). If the compute sled 1230 determines that there is not an upcoming I/O intensive phase, the method 1700 loops back to block 1702 in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases. Otherwise, the method 1700 advances to block 1730 of FIG. 18, in which the compute sled 1230 determines whether the network path to the data storage sled 1240 satisfies a predefined level of congestion (e.g., 50% of total capacity, a predefined latency, bandwidth, or throughput, etc.). In doing so, and as indicated in block 1732, in the illustrative embodiment, the compute sled 1230 may locally determine the congestion of the network path between the present compute sled 1230 and the data storage sled 1240, such as by sending a test message to the data storage sled 1240 and determining the latency to receive a response, determining an amount of time to transfer a test payload, measuring the throughput and/or latency for data actually used by the workload as it is being executed on the compute sled 1230, measuring a fullness of a transmission buffer of the NIC 1312, and/or based on other factors. As indicated in block 1734, the compute sled 1230 may additionally or alternatively query the orchestrator server 1216 for the network congestion data 1506. As indicated in block 1736, the compute sled 1230, in the illustrative embodiment, determines whether the congestion of the network 1212 would reduce the execution speed of the I/O intensive phase (e.g., the available data transmission capacity of the network 1212 is less than the predefined threshold amount from block 1714 of FIG. 17). In block 1738, the compute sled 1230 determines the subsequent course of action as a function of whether the network 1212 has been determined to be congested.
  • In response to a determination that the network is not congested, the method 1700 loops back to block 1702 of FIG. 17, in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases. Otherwise, the method 1700 advances to block 1740, in which the compute sled 1230 migrates the workload to the data storage sled 1240. In doing so, and as indicated in block 1742, the compute sled 1230 may send a request for the I/O intensive phase to be executed by the data storage sled 1240. The compute sled 1230 may send the request to the data storage sled 1240, as indicated in block 1744. In doing so, the compute sled 1230 may send executable code associated with the I/O intensive phase of the workload to the data storage sled 1240, as indicated in block 1746. As indicated in block 1748, the compute sled 1230 may send an identifier of the I/O intensive phase to the data storage sled 1240. Further, as indicated in block 1750, the compute sled 1230 may send memory map data usable by the data storage sled 1240 to access a portion of the main memory 1306 of the compute sled 1230 as local memory of the data storage sled 1240 (e.g., transparently to the workload). As indicated in block 1752, the compute sled 1230 may format input data associated with the I/O intensive phase to a format usable by the I/O accelerator unit 1260 of the data storage sled 1240. For example, the compute sled 1230 may convert a file to a block or vice versa, change a byte ordering of data, and/or perform other reformatting of data. The compute sled 1230 may also send input data from the main memory 1306 of the compute sled 1230 for use in execution of the I/O intensive phase (e.g., the reformatted data from block 1752), as indicated in block 1754. In general, the amount of input data from the main memory 1306 is smaller (e.g., an order of magnitude smaller) than the amount of data in the data storage device(s) 1414 to be used by the workload during the I/O intensive phase. As indicated in block 1756, rather than, or in addition to sending the migration request to the data storage sled 1240, the compute sled 1230 may send the request to the orchestrator server 1216 to then be sent to the data storage sled 1240. Subsequently, the method 1700 loops back to block 1702 of FIG. 17 in which the compute sled 1230 determines whether to continue to enable offloading of I/O intensive phases.
  • Referring now to FIG. 19, the data storage sled 1240, in operation, may execute a method 1900 to accelerate I/O intensive phases of workloads offloaded from compute sleds 1230, 1232. The method 1900 begins with block 1902 in which the data storage sled 1240 determines whether to accelerate one or more I/O intensive phases of workload(s). In the illustrative embodiment, the data storage sled 1240 may determine to accelerate an I/O intensive phase if the data storage sled 1240 has received a request to migrate a workload (e.g., the request of block 1740 described with reference to FIG. 18). In other embodiments, the data storage sled 1240 may make the determination based on other factors. Regardless, in response to a determination to accelerate an I/O intensive phase of a workload, the method 1900 advances to block 1904, in which the data storage sled 1240 executes the I/O intensive phase. In doing so, the data storage sled 1240 may access a relatively large amount of data in a data storage device 1414 of the data storage sled 1240 (e.g., tens of gigabytes), as indicated in block 1906. In addition, as indicated in block 1908, the data storage sled 1240 may receive a relatively small set of input data from the compute sled 1230 (e.g., 100 megabytes). As indicated in block 1910, the compute sled 1230 may send a relatively small set of output data to the compute sled 1230 (e.g., a 10 megabyte result of a computation). In the illustrative embodiment, and as indicated in block 1912, the data storage sled 1240 may map one or more local memory addresses to the main memory 1306 of the compute sled 1230 (e.g., using the memory map data from block 1750 of FIG. 18). In block 1914, in executing the I/O intensive phase, the data storage sled 1240 may access the main memory 1306 of the compute sled 1230. In accessing the main memory 1306 of the compute sled 1230, the data storage sled 1240 may read input data for the I/O intensive phase from the mapped memory, as indicated in block 1916. The data storage sled 1240 may reformat the input data to a format usable by the I/O accelerator unit (e.g., if the input is unusable in its present form and the compute sled 1230 did not reformat the data in block 1752 of FIG. 18), as indicated in block 1918. As indicated in block 1920, the data storage sled 1240 may read executable code of the I/O intensive phase with the mapped memory. In addition, the data storage sled 1240 may write output data to the main memory of the compute sled 1230 (e.g., the output data from block 1910), as indicated in block 1922. As indicated in block 1924, the data storage sled 1240 may apply a quality of service (QoS) policy to throttle the usage of resources by the workloads executed on the data storage sled 1240 so that no workload dominates the usage of data storage sled resources to the detriment of other workloads (e.g., causing a workload to no longer satisfy a QoS target specified in a service level agreement (SLA)).
  • In block 1926, the data storage sled 1240 determines whether the I/O intensive phase has ended. For example, and as indicated in block 1928, the data storage sled determines whether executable code associated with the I/O intensive phase has been completely executed (e.g., the executable code sent by the compute sled 1230 in block 1746 of FIG. 18 has been completely executed). Subsequently, in block 1930, the data storage sled 1240 determines the next course of action as a function of whether the I/O intensive phase has ended. If not, the method 1900 continues to block 1932, in which the data storage sled 1240 determines whether the network path to the compute sled 1230 satisfies a predefined level of congestion (e.g., the congestion in the network would cause the workload to execute more slowly if it were performed on the compute sled 1230). In block 1934, the data storage sled 1240 determines the subsequent course of action as a function of whether the network satisfies the predefined level of congestion. If so, the method 1900 loops back to block 1904 to continue executing the I/O intensive phase on the data storage sled 1240. Otherwise, or if the data storage sled 1240 determines that the phase ended in block 1930, the method 1900 advances to block 1936 of FIG. 20, in which the data storage sled 1240 migrates execution of the workload to the compute sled 1230. In doing so, the data storage sled 1240 may send a message to the compute sled 1230 that the I/O intensive phase has ended, as indicated in block 1938 (e.g., thereby migrating execution of the workload back to the compute sled 1230). Additionally or alternatively, the data storage sled 1240 may send a message to the orchestrator server 1216 that the I/O phase has ended, as indicated in block 1940. Subsequently, the method 1900 loops back to block 1902 of FIG. 19, in which the data storage sled 1240 determines whether to continue accelerating one or more I/O intensive phases.
  • Referring now to FIG. 21, a diagram 2100 illustrates that over time, a workload 1234 may be executed on the data storage sled 1240 in one phase (e.g., phase 0) in which the amount of data operated on is relatively large (e.g., 10 gigabytes). In subsequent phases (e.g., phases 1 and 2) which are not I/O intensive, the workload is executed on the compute sled 1230 during which time the data operated on and produced is relatively small (e.g., 100 megabytes in phase 1 and 10 megabytes in phase 2).
  • 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 compute sled comprising a compute engine to execute a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; identify an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and migrate the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 2 includes the subject matter of Example 1, and wherein the compute engine is further to send memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 3 includes the subject matter of any of Examples 1 and 2, and wherein the compute engine is further to determine whether the I/O intensive phase will occur within a predefined time period; and wherein to migrate comprises to migrate, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 4 includes the subject matter of any of Examples 1-3, and wherein the compute engine is further to identify a pattern of phases over time as the workload is executed; and wherein to determine whether the I/O intensive phase will occur within a predefined time period comprises to determine a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; determine whether the likelihood satisfies a predefined threshold likelihood; and determine, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 5 includes the subject matter of any of Examples 1-4, and wherein the compute engine is further to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein to migrate further comprises to migrate, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 6 includes the subject matter of any of Examples 1-5, and wherein to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises to determine whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 7 includes the subject matter of any of Examples 1-6, and wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 8 includes the subject matter of any of Examples 1-7, and wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase with pattern recognition.
  • Example 9 includes the subject matter of any of Examples 1-8, and wherein to identify the I/O intensive phase with pattern recognition comprises to determine historical I/O usage associated with different periods of execution of the workload.
  • Example 10 includes the subject matter of any of Examples 1-9, and wherein to migrate the workload to the data storage sled comprises to send a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 11 includes the subject matter of any of Examples 1-10, and wherein to send the request comprises to send executable code associated with the I/O intensive phase to the data storage sled.
  • Example 12 includes the subject matter of any of Examples 1-11, and wherein to send the request comprises to send input data from a main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 13 includes the subject matter of any of Examples 1-12, and wherein the compute sled is further to reformat the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 14 includes a method comprising executing, by a compute sled, a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; identifying, by the compute sled, an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and migrating, by the compute sled, the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 15 includes the subject matter of Example 14, and further including sending, by the compute sled, memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 16 includes the subject matter of any of Examples 14 and 15, and further including determining, by the compute sled, whether the I/O intensive phase will occur within a predefined time period; and wherein migrating comprises migrating, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 17 includes the subject matter of any of Examples 14-16, and further including identifying, by the compute sled, a pattern of phases over time as the workload is executed; and wherein determining whether the I/O intensive phase will occur within a predefined time period comprises determining a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; determining whether the likelihood satisfies a predefined threshold likelihood; and determining, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 18 includes the subject matter of any of Examples 14-17, and further including determining, by the compute sled, whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein migrating further comprises migrating, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 19 includes the subject matter of any of Examples 14-18, and wherein determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises determining whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 20 includes the subject matter of any of Examples 14-19, and wherein identifying the I/O intensive phase comprises identifying the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 21 includes the subject matter of any of Examples 14-20, and wherein identifying the I/O intensive phase comprises identifying the I/O intensive phase with pattern recognition.
  • Example 22 includes the subject matter of any of Examples 14-21, and wherein identifying the I/O intensive phase with pattern recognition comprises determining historical I/O usage associated with different periods of execution of the workload.
  • Example 23 includes the subject matter of any of Examples 14-22, and wherein migrating the workload to the data storage sled comprises sending a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 24 includes the subject matter of any of Examples 14-23, and wherein sending the request comprises sending executable code associated with the I/O intensive phase to the data storage sled.
  • Example 25 includes the subject matter of any of Examples 14-24, and wherein sending the request comprises sending input data from main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 26 includes the subject matter of any of Examples 14-25, and further including reformatting, by the compute sled, the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 27 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a compute sled to perform the method of any of Examples 14-26.
  • Example 28 includes a network device comprising one or more processors; one or more memory devices having stored therein a plurality of instructions that, when executed by the one or more processors, cause the network device to perform the method of any of Examples 14-26.
  • Example 29 includes a compute sled comprising means for performing the method of any of Examples 14-26.
  • Example 30 includes a compute sled comprising means for executing a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period; means for identifying an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and means for migrating the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
  • Example 31 includes the subject matter of Example 30, and further including means for sending memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
  • Example 32 includes the subject matter of any of Examples 30 and 31, and further including means for determining whether the I/O intensive phase will occur within a predefined time period; and wherein the means for migrating comprises means for migrating, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
  • Example 33 includes the subject matter of any of Examples 30-32, and further including means for identifying a pattern of phases over time as the workload is executed; and wherein the means for determining whether the I/O intensive phase will occur within a predefined time period comprises means for determining a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period; means for determining whether the likelihood satisfies a predefined threshold likelihood; and means for determining, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
  • Example 34 includes the subject matter of any of Examples 30-33, and further including means for determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and wherein the means for migrating further comprises means for migrating, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
  • Example 35 includes the subject matter of any of Examples 30-34, and wherein the means for determining whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises means for determining whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
  • Example 36 includes the subject matter of any of Examples 30-35, and wherein the means for identifying the I/O intensive phase comprises means for identifying the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
  • Example 37 includes the subject matter of any of Examples 30-36, and wherein the means for identifying the I/O intensive phase comprises means for identifying the I/O intensive phase with pattern recognition.
  • Example 38 includes the subject matter of any of Examples 30-37, and wherein the means for identifying the I/O intensive phase with pattern recognition comprises means for determining historical I/O usage associated with different periods of execution of the workload.
  • Example 39 includes the subject matter of any of Examples 30-38, and wherein the means for migrating the workload to the data storage sled comprises means for sending a request to the data storage sled to execute the I/O intensive phase of the workload.
  • Example 40 includes the subject matter of any of Examples 30-39, and wherein the means for sending the request comprises means for sending executable code associated with the I/O intensive phase to the data storage sled.
  • Example 41 includes the subject matter of any of Examples 30-40, and wherein the means for sending the request comprises means for sending input data from main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
  • Example 42 includes the subject matter of any of Examples 30-41, and further including means for reformatting the input data to a format usable by an I/O accelerator unit of the data storage sled.
  • Example 43 includes a data storage sled comprising a compute engine to execute an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; determine whether the I/O intensive phase has ended; and migrate, in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 44 includes the subject matter of Example 43, and wherein the compute engine is further to determine whether a network path to the compute sled satisfies a predefined level of congestion; and migrate, in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 45 includes the subject matter of any of Examples 43 and 44, and wherein the compute engine is further to map a memory region to a main memory of the compute sled; and access data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 46 includes the subject matter of any of Examples 43-45, and wherein the compute engine is further to receive executable code associated with the I/O intensive phase from the compute sled; and wherein to execute the I/O intensive phase comprises to execute the received executable code.
  • Example 47 includes the subject matter of any of Examples 43-46, and wherein the compute engine is further to receive an input set of data from the compute sled; and reformat the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 48 includes the subject matter of any of Examples 43-47, and wherein the compute engine is further to execute multiple I/O intensive phases of different workloads concurrently; and apply a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 49 includes the subject matter of any of Examples 43-48, and wherein the compute engine is further to send output data from execution of the I/O intensive phase to the compute sled.
  • Example 50 includes the subject matter of any of Examples 43-49, and wherein the compute engine is to receive a first set of input data from the compute sled and access a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 51 includes the subject matter of any of Examples 43-50, and wherein to determine whether the I/O intensive phase has ended comprises to determine whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 52 includes the subject matter of any of Examples 43-51, and wherein to execute the I/O intensive phase comprises to execute the I/O intensive phase with an I/O accelerator unit of the data storage sled.
  • Example 53 includes a method comprising executing, by a data storage sled, an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; determining, by the data storage sled, whether the I/O intensive phase has ended; and migrating, by the data storage sled and in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 54 includes the subject matter of Example 53, and further including determining, by the data storage sled, whether a network path to the compute sled satisfies a predefined level of congestion; and migrating, by the data storage sled and in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 55 includes the subject matter of any of Examples 53 and 54, and further including mapping, by the data storage sled, a memory region to a main memory of the compute sled; and accessing data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 56 includes the subject matter of any of Examples 53-55, and further including receiving, by the data storage sled, executable code associated with the I/O intensive phase from the compute sled; and wherein executing the I/O intensive phase comprises executing the received executable code.
  • Example 57 includes the subject matter of any of Examples 53-56, and further including receiving, by the data storage sled, an input set of data from the compute sled; and reformatting, by the data storage sled, the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 58 includes the subject matter of any of Examples 53-57, and further including executing, by the data storage sled, multiple I/O intensive phases of different workloads concurrently; and applying, by the data storage sled, a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 59 includes the subject matter of any of Examples 53-58, and further including sending, by the data storage sled, output data from execution of the I/O intensive phase to the compute sled.
  • Example 60 includes the subject matter of any of Examples 53-59, and further including receiving, by the data storage sled, a first set of input data from the compute sled; and accessing, by the data storage sled, a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 61 includes the subject matter of any of Examples 53-60, and wherein determining whether the I/O intensive phase has ended comprises determining whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 62 includes the subject matter of any of Examples 53-61, and wherein executing the I/O intensive phase comprises executing the I/O intensive phase with an I/O accelerator unit of the data storage sled.
  • Example 63 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a data storage sled to perform the method of any of Examples 53-62.
  • Example 64 includes a data storage sled comprising means for performing the method of any of Examples 53-62.
  • Example 65 includes a data storage sled comprising means for executing an I/O intensive phase of a workload, wherein the I/O intensive phase is indicative of a period of execution in which an amount of data to be accessed from a data storage device of the data storage sled satisfies a predefined threshold; means for determining whether the I/O intensive phase has ended; and means for migrating, in response to a determination that the I/O intensive phase has ended, the execution of the workload to a compute sled.
  • Example 66 includes the subject matter of Example 65, and further including means for determining whether a network path to the compute sled satisfies a predefined level of congestion; and means for migrating, in response to a determination that the network path does not satisfy the predefined level of congestion, execution of the workload to the compute sled.
  • Example 67 includes the subject matter of any of Examples 65 and 66, and further including means for mapping a memory region to a main memory of the compute sled; and means for accessing data in the main memory of the compute sled as the I/O intensive phase is executed on the data storage sled.
  • Example 68 includes the subject matter of any of Examples 65-67, and further including means for receiving executable code associated with the I/O intensive phase from the compute sled; and wherein the means for executing the I/O intensive phase comprises means for executing the received executable code.
  • Example 69 includes the subject matter of any of Examples 65-68, and further including means for receiving an input set of data from the compute sled; and means for reformatting the input set of data to a format that is usable by an I/O accelerator unit of the data storage sled.
  • Example 70 includes the subject matter of any of Examples 65-69, and further including means for executing multiple I/O intensive phases of different workloads concurrently; and means for applying a quality of service management policy to the execution of the workloads to maintain a target quality of service as the I/O intensive phases are executed.
  • Example 71 includes the subject matter of any of Examples 65-70, and further including means for sending output data from execution of the I/O intensive phase to the compute sled.
  • Example 72 includes the subject matter of any of Examples 65-71, and further including means for receiving a first set of input data from the compute sled; and means for accessing a second set of input data from a data storage device of the data storage sled, wherein the first and second sets of input data are usable to execute the I/O intensive phase and the second data set is larger than the first data set.
  • Example 73 includes the subject matter of any of Examples 65-72, and wherein the means for determining whether the I/O intensive phase has ended comprises means for determining whether executable code associated with the I/O intensive phase has been completely executed.
  • Example 74 includes the subject matter of any of Examples 65-73, and wherein the means for executing the I/O intensive phase comprises means for executing the I/O intensive phase with an I/O accelerator unit of the data storage sled.

Claims (20)

1. A compute sled comprising:
a compute engine to:
execute a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period;
identify an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and
migrate the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
2. The compute sled of claim 1, wherein the compute engine is further to:
send memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
3. The compute sled of claim 1, wherein the compute engine is further to determine whether the I/O intensive phase will occur within a predefined time period; and
wherein to migrate comprises to migrate, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
4. The compute sled of claim 3, wherein the compute engine is further to identify a pattern of phases over time as the workload is executed; and
wherein to determine whether the I/O intensive phase will occur within a predefined time period comprises to:
determine a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period;
determine whether the likelihood satisfies a predefined threshold likelihood; and
determine, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
5. The compute sled of claim 3, wherein the compute engine is further to:
determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and
wherein to migrate further comprises to migrate, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
6. The compute sled of claim 5, wherein to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises to determine whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
7. The compute sled of claim 1, wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase as a function of workload metadata that identifies executable code associated with the I/O intensive phase.
8. The compute sled of claim 1, wherein to identify the I/O intensive phase comprises to identify the I/O intensive phase with pattern recognition.
9. The compute sled of claim 8, wherein to identify the I/O intensive phase with pattern recognition comprises to determine historical I/O usage associated with different periods of execution of the workload.
10. The compute sled of claim 1, wherein to migrate the workload to the data storage sled comprises to send a request to the data storage sled to execute the I/O intensive phase of the workload.
11. The compute sled of claim 10, wherein to send the request comprises to send executable code associated with the I/O intensive phase to the data storage sled.
12. The compute sled of claim 11, wherein to send the request comprises to send input data from a main memory of the compute sled to the data storage sled for use in execution of the I/O intensive phase.
13. One or more machine-readable storage media comprising a plurality of instructions stored thereon that, when executed by a compute sled cause the compute sled to:
execute a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period;
identify an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and
migrate the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
14. The one or more machine-readable storage media of claim 13, wherein the plurality of instructions, when executed, further cause the compute sled to:
send memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
15. The one or more machine-readable storage media of claim 13, wherein the plurality of instructions, when executed, further cause the compute sled to determine whether the I/O intensive phase will occur within a predefined time period; and
wherein to migrate comprises to migrate, in response to a determination that the I/O intensive phase will occur within the predefined time period, the workload to the data storage sled.
16. The one or more machine-readable storage media of claim 15, wherein the plurality of instructions, when executed, further cause the compute sled to identify a pattern of phases over time as the workload is executed; and
wherein to determine whether the I/O intensive phase will occur within a predefined time period comprises to:
determine a likelihood, as a function of a present time and the identified pattern of phases, that the I/O intensive phase will occur within the predefined time period;
determine whether the likelihood satisfies a predefined threshold likelihood; and
determine, in response to a determination that the likelihood satisfies the predefined threshold likelihood, that the I/O intensive phase will occur within the predefined time period.
17. The one or more machine-readable storage media of claim 15, wherein the plurality of instructions, when executed, further cause the compute sled to:
determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion; and
wherein to migrate further comprises to migrate, in response to a determination that the network path satisfies the predefined level of congestion, the workload to the data storage sled.
18. The one or more machine-readable storage media of claim 17, wherein to determine whether the network path between the compute sled and the data storage sled satisfies a predefined level of congestion comprises to determine whether access of data on the data storage sled through the network path would reduce the execution speed of the I/O intensive phase.
19. A method comprising:
executing, by a compute sled, a workload that includes multiple phases, wherein each phase is indicative of a different resource utilization over a time period;
identifying, by the compute sled, an I/O intensive phase of the workload wherein an amount of data to be communicated through a network path between the compute sled and the data storage sled to execute the I/O intensive phase satisfies a predefined threshold; and
migrating, by the compute sled, the workload to the data storage sled to execute the I/O intensive phase locally on the data storage sled.
20. The method of claim 19, further comprising:
sending, by the compute sled, memory map data to the data storage sled, wherein the memory map data is usable by the data storage sled to access main memory of the compute sled as local memory as the I/O intensive phase is executed on the data storage sled.
US15/720,236 2016-11-29 2017-09-29 Technologies for offloading i/o intensive operations to a data storage sled Abandoned US20180150240A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US15/720,236 US20180150240A1 (en) 2016-11-29 2017-09-29 Technologies for offloading i/o intensive operations to a data storage sled
EP18191343.5A EP3460662A1 (en) 2017-08-30 2018-08-28 Technologies for offloading i/o intensive operations to a data storage sled
CN201810995046.XA CN109426455A (en) 2017-08-30 2018-08-29 For I/O intensive action to be offloaded to the technology of data storage slide plate

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201662427268P 2016-11-29 2016-11-29
IN201741030632 2017-08-30
IN201741030632 2017-08-30
US15/720,236 US20180150240A1 (en) 2016-11-29 2017-09-29 Technologies for offloading i/o intensive operations to a data storage sled

Publications (1)

Publication Number Publication Date
US20180150240A1 true US20180150240A1 (en) 2018-05-31

Family

ID=62190163

Family Applications (33)

Application Number Title Priority Date Filing Date
US15/716,790 Abandoned US20180150256A1 (en) 2016-11-29 2017-09-27 Technologies for data deduplication in disaggregated architectures
US15/720,236 Abandoned US20180150240A1 (en) 2016-11-29 2017-09-29 Technologies for offloading i/o intensive operations to a data storage sled
US15/719,770 Active 2038-12-20 US11137922B2 (en) 2016-11-29 2017-09-29 Technologies for providing accelerated functions as a service in a disaggregated architecture
US15/720,653 Active 2038-06-05 US10824358B2 (en) 2016-11-29 2017-09-29 Technologies for dynamically managing the reliability of disaggregated resources in a managed node
US15/720,920 Active US10268412B2 (en) 2016-11-29 2017-09-29 Technologies for deterministic constant-time data compression
US15/721,053 Active 2038-08-18 US11687264B2 (en) 2016-11-29 2017-09-29 Technologies for accelerator interface
US15/720,390 Active 2038-04-25 US10747457B2 (en) 2016-11-29 2017-09-29 Technologies for processing network packets in agent-mesh architectures
US15/719,735 Active US10191684B2 (en) 2016-11-29 2017-09-29 Technologies for flexibly compressing and decompressing data
US15/719,774 Active 2038-06-14 US10628068B2 (en) 2016-11-29 2017-09-29 Technologies for big data analytics accelerator
US15/720,162 Active 2038-07-11 US10635338B2 (en) 2016-11-29 2017-09-29 Technologies for a high-ratio compression accelerator with heterogeneous history buffers
US15/721,814 Active 2038-07-08 US10712963B2 (en) 2016-11-29 2017-09-30 Technologies for secure encrypted external memory for field-programmable gate arrays (FPGAS)
US15/721,815 Active 2038-04-27 US10732879B2 (en) 2016-11-29 2017-09-30 Technologies for processing network packets by an intelligent network interface controller
US15/721,829 Active 2038-06-20 US11029870B2 (en) 2016-11-29 2017-09-30 Technologies for dividing work across accelerator devices
US15/721,825 Active 2038-04-25 US10768842B2 (en) 2016-11-29 2017-09-30 Technologies for providing shared memory for accelerator sleds
US15/721,817 Active 2038-08-27 US10768841B2 (en) 2016-11-29 2017-09-30 Technologies for managing network statistic counters
US15/721,821 Active 2038-06-22 US10963176B2 (en) 2016-11-29 2017-09-30 Technologies for offloading acceleration task scheduling operations to accelerator sleds
US15/721,833 Active 2038-07-21 US10990309B2 (en) 2016-11-29 2017-09-30 Technologies for coordinating disaggregated accelerator device resources
US15/824,604 Active 2038-05-26 US10795595B2 (en) 2016-11-29 2017-11-28 Technologies for lifecycle management with remote firmware
US15/826,051 Active 2038-11-20 US11307787B2 (en) 2016-11-29 2017-11-29 Technologies for providing manifest-based asset representation
US15/826,523 Active 2038-07-02 US10824360B2 (en) 2016-11-29 2017-11-29 Data connector with movable cover
US16/346,341 Active US11200104B2 (en) 2016-11-29 2017-11-29 Technolgies for millimeter wave rack interconnects
US16/943,221 Active 2038-03-10 US11579788B2 (en) 2016-11-29 2020-07-30 Technologies for providing shared memory for accelerator sleds
US17/005,879 Active 2037-12-03 US11354053B2 (en) 2016-11-29 2020-08-28 Technologies for lifecycle management with remote firmware
US17/125,420 Active 2038-11-25 US11995330B2 (en) 2016-11-29 2020-12-17 Technologies for providing accelerated functions as a service in a disaggregated architecture
US17/214,605 Pending US20210318823A1 (en) 2016-11-29 2021-03-26 Technologies for offloading acceleration task scheduling operations to accelerator sleds
US17/221,541 Pending US20210365199A1 (en) 2016-11-29 2021-04-02 Technologies for coordinating disaggregated accelerator device resources
US17/321,186 Active US11429297B2 (en) 2016-11-29 2021-05-14 Technologies for dividing work across accelerator devices
US17/549,713 Abandoned US20220107741A1 (en) 2016-11-29 2021-12-13 Technolgies for millimeter wave rack interconnects
US17/681,025 Active US11907557B2 (en) 2016-11-29 2022-02-25 Technologies for dividing work across accelerator devices
US17/724,379 Abandoned US20220317906A1 (en) 2016-11-29 2022-04-19 Technologies for providing manifest-based asset representation
US18/103,739 Active US11977923B2 (en) 2016-11-29 2023-01-31 Cloud-based scale-up system composition
US18/109,774 Pending US20230195346A1 (en) 2016-11-29 2023-02-14 Technologies for coordinating disaggregated accelerator device resources
US18/405,679 Pending US20240143410A1 (en) 2016-11-29 2024-01-05 Technologies for dividing work across accelerator devices

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US15/716,790 Abandoned US20180150256A1 (en) 2016-11-29 2017-09-27 Technologies for data deduplication in disaggregated architectures

Family Applications After (31)

Application Number Title Priority Date Filing Date
US15/719,770 Active 2038-12-20 US11137922B2 (en) 2016-11-29 2017-09-29 Technologies for providing accelerated functions as a service in a disaggregated architecture
US15/720,653 Active 2038-06-05 US10824358B2 (en) 2016-11-29 2017-09-29 Technologies for dynamically managing the reliability of disaggregated resources in a managed node
US15/720,920 Active US10268412B2 (en) 2016-11-29 2017-09-29 Technologies for deterministic constant-time data compression
US15/721,053 Active 2038-08-18 US11687264B2 (en) 2016-11-29 2017-09-29 Technologies for accelerator interface
US15/720,390 Active 2038-04-25 US10747457B2 (en) 2016-11-29 2017-09-29 Technologies for processing network packets in agent-mesh architectures
US15/719,735 Active US10191684B2 (en) 2016-11-29 2017-09-29 Technologies for flexibly compressing and decompressing data
US15/719,774 Active 2038-06-14 US10628068B2 (en) 2016-11-29 2017-09-29 Technologies for big data analytics accelerator
US15/720,162 Active 2038-07-11 US10635338B2 (en) 2016-11-29 2017-09-29 Technologies for a high-ratio compression accelerator with heterogeneous history buffers
US15/721,814 Active 2038-07-08 US10712963B2 (en) 2016-11-29 2017-09-30 Technologies for secure encrypted external memory for field-programmable gate arrays (FPGAS)
US15/721,815 Active 2038-04-27 US10732879B2 (en) 2016-11-29 2017-09-30 Technologies for processing network packets by an intelligent network interface controller
US15/721,829 Active 2038-06-20 US11029870B2 (en) 2016-11-29 2017-09-30 Technologies for dividing work across accelerator devices
US15/721,825 Active 2038-04-25 US10768842B2 (en) 2016-11-29 2017-09-30 Technologies for providing shared memory for accelerator sleds
US15/721,817 Active 2038-08-27 US10768841B2 (en) 2016-11-29 2017-09-30 Technologies for managing network statistic counters
US15/721,821 Active 2038-06-22 US10963176B2 (en) 2016-11-29 2017-09-30 Technologies for offloading acceleration task scheduling operations to accelerator sleds
US15/721,833 Active 2038-07-21 US10990309B2 (en) 2016-11-29 2017-09-30 Technologies for coordinating disaggregated accelerator device resources
US15/824,604 Active 2038-05-26 US10795595B2 (en) 2016-11-29 2017-11-28 Technologies for lifecycle management with remote firmware
US15/826,051 Active 2038-11-20 US11307787B2 (en) 2016-11-29 2017-11-29 Technologies for providing manifest-based asset representation
US15/826,523 Active 2038-07-02 US10824360B2 (en) 2016-11-29 2017-11-29 Data connector with movable cover
US16/346,341 Active US11200104B2 (en) 2016-11-29 2017-11-29 Technolgies for millimeter wave rack interconnects
US16/943,221 Active 2038-03-10 US11579788B2 (en) 2016-11-29 2020-07-30 Technologies for providing shared memory for accelerator sleds
US17/005,879 Active 2037-12-03 US11354053B2 (en) 2016-11-29 2020-08-28 Technologies for lifecycle management with remote firmware
US17/125,420 Active 2038-11-25 US11995330B2 (en) 2016-11-29 2020-12-17 Technologies for providing accelerated functions as a service in a disaggregated architecture
US17/214,605 Pending US20210318823A1 (en) 2016-11-29 2021-03-26 Technologies for offloading acceleration task scheduling operations to accelerator sleds
US17/221,541 Pending US20210365199A1 (en) 2016-11-29 2021-04-02 Technologies for coordinating disaggregated accelerator device resources
US17/321,186 Active US11429297B2 (en) 2016-11-29 2021-05-14 Technologies for dividing work across accelerator devices
US17/549,713 Abandoned US20220107741A1 (en) 2016-11-29 2021-12-13 Technolgies for millimeter wave rack interconnects
US17/681,025 Active US11907557B2 (en) 2016-11-29 2022-02-25 Technologies for dividing work across accelerator devices
US17/724,379 Abandoned US20220317906A1 (en) 2016-11-29 2022-04-19 Technologies for providing manifest-based asset representation
US18/103,739 Active US11977923B2 (en) 2016-11-29 2023-01-31 Cloud-based scale-up system composition
US18/109,774 Pending US20230195346A1 (en) 2016-11-29 2023-02-14 Technologies for coordinating disaggregated accelerator device resources
US18/405,679 Pending US20240143410A1 (en) 2016-11-29 2024-01-05 Technologies for dividing work across accelerator devices

Country Status (3)

Country Link
US (33) US20180150256A1 (en)
DE (6) DE102018214774A1 (en)
WO (5) WO2018102456A1 (en)

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10402119B2 (en) * 2015-04-23 2019-09-03 Huawei Technologies Co., Ltd. Data format conversion apparatus and method and buffer chip
CN111263554A (en) * 2018-11-30 2020-06-09 Ovh公司 Rack adapted to receive a component and system comprising the rack and the component
US10785549B2 (en) 2016-07-22 2020-09-22 Intel Corporation Technologies for switching network traffic in a data center
US20210255915A1 (en) * 2016-11-29 2021-08-19 Intel Corporation Cloud-based scale-up system composition
US11137922B2 (en) 2016-11-29 2021-10-05 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US11146283B2 (en) 2019-04-17 2021-10-12 Samsung Electronics Co., Ltd. Zero-collapsing compression with random access
US11151011B2 (en) 2019-10-01 2021-10-19 International Business Machines Corporation Uncore input/output latency analysis
US11151682B2 (en) * 2019-07-22 2021-10-19 Verizon Patent And Licensing Inc. System and methods for distributed GPU using multi-access edge compute services
US11211944B2 (en) 2019-04-17 2021-12-28 Samsung Electronics Co., Ltd. Mixed-precision compression with random access
US11216314B2 (en) * 2018-11-02 2022-01-04 EMC IP Holding Company LLC Dynamic reallocation of resources in accelerator-as-a-service computing environment
US11228539B2 (en) * 2019-08-14 2022-01-18 Intel Corporation Technologies for managing disaggregated accelerator networks based on remote direct memory access
US11381526B2 (en) * 2019-05-08 2022-07-05 Cisco Technology, Inc. Multi-tenant optimized serverless placement using smart network interface cards and commodity storage
US11461123B1 (en) 2019-11-21 2022-10-04 Amazon Technologies, Inc. Dynamic pre-copy and post-copy determination for live migration between cloud regions and edge locations
US11487592B2 (en) * 2020-01-22 2022-11-01 EMC IP Holding Company LLC Dynamic application migration across storage platforms
US11567873B1 (en) * 2021-09-27 2023-01-31 Sap Se Extended cache for efficient object store access by a database
US11573839B1 (en) * 2019-11-21 2023-02-07 Amazon Technologies, Inc. Dynamic scheduling for live migration between cloud regions and edge locations
US11617281B2 (en) 2019-02-13 2023-03-28 Ovh Rack adapted for receiving a component, system including the rack and the component and method of delivering power to a component mounted in a rack
US11620491B2 (en) 2018-06-22 2023-04-04 Samsung Electronics Co., Ltd. Neural processor
US11656980B2 (en) * 2019-10-09 2023-05-23 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Extensible memory dual inline memory module
US11734038B1 (en) 2019-11-21 2023-08-22 Amazon Technologies, Inc Multiple simultaneous volume attachments for live migration between cloud regions and edge locations
US11792078B2 (en) * 2019-07-26 2023-10-17 Verizon Patent And Licensing Inc. Multi-access Edge Computing cloud discovery and communications
US11856724B2 (en) 2018-11-30 2023-12-26 Ovh System comprising a rack, with support members and components insertable in the rack and connectable via liquid connectors

Families Citing this family (222)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9922099B2 (en) 2014-09-30 2018-03-20 Splunk Inc. Event limited field picker
US9990423B2 (en) 2014-09-30 2018-06-05 Splunk Inc. Hybrid cluster-based data intake and query
US10235460B2 (en) 2014-09-30 2019-03-19 Splunk Inc. Sharing configuration information for searches in data intake and query systems
JP6701863B2 (en) * 2016-03-24 2020-05-27 日本電気株式会社 Firmware distribution system, distribution device, firmware distribution method, and firmware distribution program
US11444866B2 (en) * 2016-07-22 2022-09-13 Intel Corporation Methods and apparatus for composite node creation and management through SDI partitions
US11301144B2 (en) 2016-12-28 2022-04-12 Amazon Technologies, Inc. Data storage system
US10484015B2 (en) 2016-12-28 2019-11-19 Amazon Technologies, Inc. Data storage system with enforced fencing
US10771550B2 (en) * 2016-12-28 2020-09-08 Amazon Technologies, Inc. Data storage system with redundant internal networks
US10514847B2 (en) 2016-12-28 2019-12-24 Amazon Technologies, Inc. Data storage system with multiple durability levels
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
WO2018152166A1 (en) * 2017-02-14 2018-08-23 Molex, Llc Break out module system
WO2018176238A1 (en) * 2017-03-28 2018-10-04 Intel Corporation Technologies for hybrid field-programmable gate array-application-specific integrated circuit code acceleration
CN110710172A (en) 2017-03-29 2020-01-17 芬基波尔有限责任公司 Multiplexing non-blocking arbitrary to arbitrary data center networks of packet injection within a group of access nodes
CN110710139A (en) 2017-03-29 2020-01-17 芬基波尔有限责任公司 Non-blocking full mesh data center network with optical displacers
WO2018183542A1 (en) 2017-03-29 2018-10-04 Fungible, Inc. Non-blocking any-to-any data center network with packet spraying over multiple alternate data paths
CN110741356B (en) 2017-04-10 2024-03-15 微软技术许可有限责任公司 Relay coherent memory management in multiprocessor systems
US10656987B1 (en) * 2017-04-26 2020-05-19 EMC IP Holding Company LLC Analysis system and method
US10853159B1 (en) * 2017-04-26 2020-12-01 EMC IP Holding Company, LLC Analysis system and method
NO343359B1 (en) * 2017-05-02 2019-02-11 Numascale As Interconnect switch in multiprocessor systems
US10958990B2 (en) * 2017-05-03 2021-03-23 Intel Corporation Trusted platform telemetry mechanisms inaccessible to software
US10656964B2 (en) * 2017-05-16 2020-05-19 Oracle International Corporation Dynamic parallelization of a calculation process
EP3625679A1 (en) 2017-07-10 2020-03-25 Fungible, Inc. Data processing unit for stream processing
US10659254B2 (en) 2017-07-10 2020-05-19 Fungible, Inc. Access node integrated circuit for data centers which includes a networking unit, a plurality of host units, processing clusters, a data network fabric, and a control network fabric
WO2019012627A1 (en) * 2017-07-12 2019-01-17 日本電気株式会社 Network control system, method and program
US11030126B2 (en) * 2017-07-14 2021-06-08 Intel Corporation Techniques for managing access to hardware accelerator memory
US10318461B2 (en) * 2017-08-04 2019-06-11 Dell Products L.P. Systems and methods for interconnecting GPU accelerated compute nodes of an information handling system
US20190068466A1 (en) * 2017-08-30 2019-02-28 Intel Corporation Technologies for auto-discovery of fault domains
US11119835B2 (en) 2017-08-30 2021-09-14 Intel Corporation Technologies for providing efficient reprovisioning in an accelerator device
US10841246B2 (en) 2017-08-30 2020-11-17 Arista Networks, Inc. Distributed core switching with orthogonal fabric card and line cards
US10963295B2 (en) * 2017-09-08 2021-03-30 Oracle International Corporation Hardware accelerated data processing operations for storage data
US10819649B2 (en) * 2017-09-14 2020-10-27 American Megatrends International, Llc Pooled system management engine on service processor of computing blade
CN107872545B (en) * 2017-09-26 2022-12-06 中兴通讯股份有限公司 Message transmission method and device and computer readable storage medium
CN111164938A (en) 2017-09-29 2020-05-15 芬基波尔有限责任公司 Resilient network communication using selective multipath packet stream injection
US10904367B2 (en) 2017-09-29 2021-01-26 Fungible, Inc. Network access node virtual fabrics configured dynamically over an underlay network
US10659390B2 (en) * 2017-09-29 2020-05-19 Xilinx, Inc. Network interface device
CN111164573A (en) * 2017-10-06 2020-05-15 康维达无线有限责任公司 Fog service layer starting and application to intelligent transportation system
US10659531B2 (en) * 2017-10-06 2020-05-19 International Business Machines Corporation Initiator aware data migration
KR102602696B1 (en) * 2017-10-13 2023-11-16 삼성전자주식회사 Encryption device and decryption device, and method of operation thereof
CN109725835B (en) * 2017-10-27 2022-04-29 伊姆西Ip控股有限责任公司 Method, apparatus and computer program product for managing disk array
US10841245B2 (en) 2017-11-21 2020-11-17 Fungible, Inc. Work unit stack data structures in multiple core processor system for stream data processing
WO2019117767A1 (en) * 2017-12-13 2019-06-20 Telefonaktiebolaget Lm Ericsson (Publ) Method, function manager and arrangement for handling function calls
US11416299B2 (en) * 2017-12-20 2022-08-16 Telefonaktiebolaget Lm Ericsson (Publ) Method and resource scheduler for enabling a computing unit to map remote memory resources based on optical wavelength
US10776160B2 (en) * 2017-12-28 2020-09-15 Mcgraw Hill Llc Management of sequenced execution of service tasks in a multi-service system
CN110109915B (en) * 2018-01-18 2024-01-05 伊姆西Ip控股有限责任公司 Method, apparatus and computer program product for managing hash tables
US10942783B2 (en) * 2018-01-19 2021-03-09 Hypernet Labs, Inc. Distributed computing using distributed average consensus
US10878482B2 (en) 2018-01-19 2020-12-29 Hypernet Labs, Inc. Decentralized recommendations using distributed average consensus
US10909150B2 (en) 2018-01-19 2021-02-02 Hypernet Labs, Inc. Decentralized latent semantic index using distributed average consensus
US11244243B2 (en) 2018-01-19 2022-02-08 Hypernet Labs, Inc. Coordinated learning using distributed average consensus
WO2019152063A1 (en) 2018-02-02 2019-08-08 Fungible, Inc. Efficient work unit processing in a multicore system
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
US10990554B2 (en) 2018-03-02 2021-04-27 Samsung Electronics Co., Ltd. Mechanism to identify FPGA and SSD pairing in a multi-device environment
TWI647615B (en) * 2018-03-29 2019-01-11 緯創資通股份有限公司 Boot method for firmware system using multiple embedded controller firmware
US11429413B2 (en) * 2018-03-30 2022-08-30 Intel Corporation Method and apparatus to manage counter sets in a network interface controller
US11068876B2 (en) * 2018-03-30 2021-07-20 Norton LifeLock Securing of internet of things devices based on monitoring of information concerning device purchases
US11194800B2 (en) * 2018-04-26 2021-12-07 Microsoft Technology Licensing, Llc Parallel search in program synthesis
US10990373B2 (en) * 2018-05-18 2021-04-27 Nutanix, Inc. Service managers and firmware version selections in distributed computing systems
US11144357B2 (en) * 2018-05-25 2021-10-12 International Business Machines Corporation Selecting hardware accelerators based on score
US10691529B2 (en) * 2018-06-20 2020-06-23 Intel Corporation Supporting random access of compressed data
US11036651B2 (en) * 2018-06-29 2021-06-15 Micron Technology, Inc. Host side caching security for flash memory
CN109101347B (en) * 2018-07-16 2021-07-20 北京理工大学 Pulse compression processing method of FPGA heterogeneous computing platform based on OpenCL
CN109086383A (en) * 2018-07-26 2018-12-25 佛山市甜慕链客科技有限公司 A kind of method and apparatus accelerated for database
WO2020024065A1 (en) * 2018-08-02 2020-02-06 Imagine Communications Corp. System and process for generalized real-time transport protocol stream segmentation and reconstruction
CN109325494B (en) * 2018-08-27 2021-09-17 腾讯科技(深圳)有限公司 Picture processing method, task data processing method and device
US11797684B2 (en) * 2018-08-28 2023-10-24 Eclypsium, Inc. Methods and systems for hardware and firmware security monitoring
US11133076B2 (en) * 2018-09-06 2021-09-28 Pure Storage, Inc. Efficient relocation of data between storage devices of a storage system
KR20210096077A (en) * 2018-09-28 2021-08-04 엘레먼트 에이아이 인크. Systems and methods for managing robotic agents
US10936370B2 (en) * 2018-10-31 2021-03-02 International Business Machines Corporation Apparatus that generates optimal launch configurations
US11013139B2 (en) * 2018-11-05 2021-05-18 Cisco Technology, Inc. Power supply for a networking device with orthogonal switch bars
CN111147927A (en) * 2018-11-06 2020-05-12 中国电信股份有限公司 Video response system and method and intelligent network card
US10929175B2 (en) 2018-11-21 2021-02-23 Fungible, Inc. Service chaining hardware accelerators within a data stream processing integrated circuit
US10892944B2 (en) 2018-11-29 2021-01-12 International Business Machines Corporation Selecting and using a cloud-based hardware accelerator
WO2020117681A1 (en) * 2018-12-03 2020-06-11 Salesforce.Com, Inc. Automated operations management for computer systems
US10908895B2 (en) 2018-12-21 2021-02-02 Pensando Systems Inc. State-preserving upgrade of an intelligent server adapter
US11044099B2 (en) * 2018-12-28 2021-06-22 Intel Corporation Technologies for providing certified telemetry data indicative of resources utilizations
US10579547B2 (en) * 2018-12-28 2020-03-03 Intel Corporation Technologies for providing I/O channel abstraction for accelerator device kernels
US11750531B2 (en) * 2019-01-17 2023-09-05 Ciena Corporation FPGA-based virtual fabric for data center computing
US11625806B2 (en) * 2019-01-23 2023-04-11 Qualcomm Incorporated Methods and apparatus for standardized APIs for split rendering
US10831497B2 (en) * 2019-01-31 2020-11-10 International Business Machines Corporation Compression/decompression instruction specifying a history buffer to be used in the compression/decompression of data
US10795718B2 (en) * 2019-02-08 2020-10-06 Microsoft Technology Licensing, Llc Updating hardware with reduced virtual machine downtime
US20190188111A1 (en) * 2019-02-26 2019-06-20 Intel Corporation Methods and apparatus to improve performance data collection of a high performance computing application
US20200274931A1 (en) * 2019-02-27 2020-08-27 Asahi Kasei Kabushiki Kaisha Device management apparatus and system for remotely managing internet of things device
CN110007855B (en) * 2019-02-28 2020-04-28 华中科技大学 Hardware-supported 3D stacked NVM (non-volatile memory) memory data compression method and system
CA3126089C (en) * 2019-03-01 2023-06-20 Cyborg Inc. System and method for statistics-based pattern searching of compressed data and encrypted data
CN109934729A (en) * 2019-03-25 2019-06-25 重庆大学 Unstable state real time data acquisition data depth compression method
US10963269B2 (en) * 2019-03-28 2021-03-30 Lenovo (Singapore) Pte. Ltd. Apparatus, method, and program product for storing a hardware manifest
US10534747B2 (en) * 2019-03-29 2020-01-14 Intel Corporation Technologies for providing a scalable architecture for performing compute operations in memory
FR3094865B1 (en) * 2019-04-04 2021-10-29 Bull Sas COMPUTER CABINET INCLUDING INTERCONNECTION DEVICES OF INTERCONNECTION SWITCHES AND BUILT-MOUNT ELEMENTS
US10986423B2 (en) 2019-04-11 2021-04-20 Arista Networks, Inc. Network device with compact chassis
US11269395B2 (en) 2019-04-25 2022-03-08 Intel Corporation Technologies for providing adaptive power management in an accelerator sled
US20200341824A1 (en) * 2019-04-26 2020-10-29 Intel Corporation Technologies for providing inter-kernel communication abstraction to support scale-up and scale-out
US10909054B2 (en) * 2019-04-26 2021-02-02 Samsung Electronics Co., Ltd. Method for status monitoring of acceleration kernels in a storage device and storage device employing the same
US20190253518A1 (en) * 2019-04-26 2019-08-15 Intel Corporation Technologies for providing resource health based node composition and management
CN111858016A (en) * 2019-04-29 2020-10-30 阿里巴巴集团控股有限公司 Computing job processing method and system, mobile device and acceleration device
US11003479B2 (en) * 2019-04-29 2021-05-11 Intel Corporation Device, system and method to communicate a kernel binary via a network
US11474700B2 (en) * 2019-04-30 2022-10-18 Intel Corporation Technologies for compressing communication for accelerator devices
CN109995508B (en) * 2019-04-30 2021-02-02 上海安路信息科技有限公司 Encryption and decryption device and method for FPGA code stream
US11893266B2 (en) 2019-05-03 2024-02-06 University of Pittsburgh—of the Commonwealth System of Higher Education Method and apparatus for adaptive page migration and pinning for oversubscribed irregular applications
CN110311948B (en) * 2019-05-17 2022-07-15 深圳致星科技有限公司 Communication method between container groups and container cloud network system based on same
US11792114B2 (en) 2019-05-23 2023-10-17 Hewlett Packard Enterprise Development Lp System and method for facilitating efficient management of non-idempotent operations in a network interface controller (NIC)
US11615052B1 (en) * 2019-05-23 2023-03-28 Xilinx, Inc. Packet identification (ID) assignment for routing network
CN110138556A (en) * 2019-05-28 2019-08-16 上海兆芯集成电路有限公司 Data processing equipment and data processing method
US11398899B2 (en) 2019-05-28 2022-07-26 Shanghai Zhaoxin Semiconductor Co., Ltd. Data processing device and data processing method
US11012315B2 (en) * 2019-05-29 2021-05-18 Cisco Technology, Inc. Retroactively detecting state change in a network fabric across times
KR20200140560A (en) 2019-06-07 2020-12-16 삼성전자주식회사 Electronic device and system for the same
CN110166240B (en) * 2019-06-25 2024-05-03 南方电网科学研究院有限责任公司 Network isolation password board card
US10949362B2 (en) 2019-06-28 2021-03-16 Intel Corporation Technologies for facilitating remote memory requests in accelerator devices
US11169723B2 (en) 2019-06-28 2021-11-09 Amazon Technologies, Inc. Data storage system with metadata check-pointing
JP7238643B2 (en) * 2019-06-28 2023-03-14 株式会社リコー ELECTRONIC DEVICE, INFORMATION PROCESSING SYSTEM AND INFORMATION PROCESSING METHOD
US11556382B1 (en) * 2019-07-10 2023-01-17 Meta Platforms, Inc. Hardware accelerated compute kernels for heterogeneous compute environments
US11146663B2 (en) * 2019-07-18 2021-10-12 EMC IP Holding Company LLC Facilitating improved overall performance of remote data facility replication systems
US11775816B2 (en) 2019-08-12 2023-10-03 Micron Technology, Inc. Storage and access of neural network outputs in automotive predictive maintenance
US11635893B2 (en) 2019-08-12 2023-04-25 Micron Technology, Inc. Communications between processors and storage devices in automotive predictive maintenance implemented via artificial neural networks
US11748626B2 (en) 2019-08-12 2023-09-05 Micron Technology, Inc. Storage devices with neural network accelerators for automotive predictive maintenance
US11586194B2 (en) 2019-08-12 2023-02-21 Micron Technology, Inc. Storage and access of neural network models of automotive predictive maintenance
US11853863B2 (en) 2019-08-12 2023-12-26 Micron Technology, Inc. Predictive maintenance of automotive tires
US11586943B2 (en) 2019-08-12 2023-02-21 Micron Technology, Inc. Storage and access of neural network inputs in automotive predictive maintenance
US11126236B2 (en) * 2019-08-14 2021-09-21 Dell Products L.P. System and method for the redirection of trapped power in a shared infrastructure environment
US11498388B2 (en) 2019-08-21 2022-11-15 Micron Technology, Inc. Intelligent climate control in vehicles
US11702086B2 (en) 2019-08-21 2023-07-18 Micron Technology, Inc. Intelligent recording of errant vehicle behaviors
LU101361B1 (en) * 2019-08-26 2021-03-11 Microsoft Technology Licensing Llc Computer device including nested network interface controller switches
US11477163B2 (en) * 2019-08-26 2022-10-18 At&T Intellectual Property I, L.P. Scrubbed internet protocol domain for enhanced cloud security
EP3884375B1 (en) * 2019-09-03 2023-11-01 Google LLC Accelerating application and sub-package installations
US11693562B2 (en) 2019-09-05 2023-07-04 Micron Technology, Inc. Bandwidth optimization for different types of operations scheduled in a data storage device
US11650746B2 (en) 2019-09-05 2023-05-16 Micron Technology, Inc. Intelligent write-amplification reduction for data storage devices configured on autonomous vehicles
US11436076B2 (en) 2019-09-05 2022-09-06 Micron Technology, Inc. Predictive management of failing portions in a data storage device
US11409654B2 (en) 2019-09-05 2022-08-09 Micron Technology, Inc. Intelligent optimization of caching operations in a data storage device
US11184191B1 (en) * 2019-09-12 2021-11-23 Trend Micro Incorporated Inspection of network traffic on accelerated platforms
US11144290B2 (en) * 2019-09-13 2021-10-12 Huawei Technologies Co., Ltd. Method and apparatus for enabling autonomous acceleration of dataflow AI applications
US11266007B2 (en) 2019-09-18 2022-03-01 Arista Networks, Inc. Linecard system using riser printed circuit boards (PCBS)
US20200142735A1 (en) * 2019-09-28 2020-05-07 Intel Corporation Methods and apparatus to offload and onload workloads in an edge environment
US11436193B2 (en) * 2019-09-30 2022-09-06 Dell Products L.P. System and method for managing data using an enumerator
US11748174B2 (en) * 2019-10-02 2023-09-05 Intel Corporation Method for arbitration and access to hardware request ring structures in a concurrent environment
US11651209B1 (en) * 2019-10-02 2023-05-16 Google Llc Accelerated embedding layer computations
US11210162B2 (en) * 2019-10-11 2021-12-28 EMC IP Holding Company LLC Approach to improve decompression performance by scatter gather compression units and also updating checksum mechanism
US11093283B2 (en) * 2019-10-15 2021-08-17 EMC IP Holding Company LLC System and method of dynamically allocating compression jobs
US11429573B2 (en) * 2019-10-16 2022-08-30 Dell Products L.P. Data deduplication system
US20210117441A1 (en) * 2019-10-17 2021-04-22 Dell Products L.P. Data replication system
EP3816781A1 (en) * 2019-10-30 2021-05-05 Sunlight.io Limited Storage area network controller
US11580233B1 (en) * 2019-11-13 2023-02-14 Meta Platforms, Inc. Baseboard-management-controller storage module
US11782810B2 (en) * 2019-11-22 2023-10-10 Dell Products, L.P. Systems and methods for automated field replacement component configuration
US11610102B1 (en) * 2019-11-27 2023-03-21 Amazon Technologies, Inc. Time-based memory allocation for neural network inference
US11250648B2 (en) 2019-12-18 2022-02-15 Micron Technology, Inc. Predictive maintenance of automotive transmission
US20200133649A1 (en) * 2019-12-23 2020-04-30 Intel Corporation Processor controlled programmable logic device modification
US11182150B2 (en) 2020-01-14 2021-11-23 Pensando Systems Inc. Zero packet loss upgrade of an IO device
US11243890B2 (en) * 2020-01-14 2022-02-08 EMC IP Holding Company LLC Compressed data verification
US11372180B2 (en) * 2020-01-31 2022-06-28 Ciena Corporation Modular networking hardware platform
US11709625B2 (en) 2020-02-14 2023-07-25 Micron Technology, Inc. Optimization of power usage of data storage devices
US11531339B2 (en) 2020-02-14 2022-12-20 Micron Technology, Inc. Monitoring of drive by wire sensors in vehicles
US11856736B1 (en) * 2020-03-02 2023-12-26 Core Scientific Operating Company Computing device system and method with racks connected together to form a sled
US11650965B2 (en) * 2020-03-05 2023-05-16 Zscaler, Inc. Systems and methods for efficiently maintaining records in a cloud-based system
US11775405B2 (en) * 2020-03-20 2023-10-03 UncommonX Inc. Generation of an issue response evaluation regarding a system aspect of a system
US11115497B2 (en) * 2020-03-25 2021-09-07 Intel Corporation Technologies for providing advanced resource management in a disaggregated environment
US11616859B2 (en) * 2020-03-31 2023-03-28 Microsoft Technology Licensing, Llc Unified counting platform
EP4120077A4 (en) * 2020-03-31 2023-04-05 Huawei Technologies Co., Ltd. Method for scheduling hardware accelerator, and task scheduler
US11570808B2 (en) * 2020-04-08 2023-01-31 Qualcomm Incorporated Two-step random access procedure in wireless communication
US11741319B2 (en) * 2020-04-27 2023-08-29 Carrier Corporation Configuration of building automation system controllers using near field communication
US11483943B2 (en) * 2020-04-30 2022-10-25 Hewlett Packard Enterprise Development Lp Computing device
US11182096B1 (en) 2020-05-18 2021-11-23 Amazon Technologies, Inc. Data storage system with configurable durability
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
CN113742028A (en) * 2020-05-28 2021-12-03 伊姆西Ip控股有限责任公司 Resource using method, electronic device and computer program product
US11962518B2 (en) 2020-06-02 2024-04-16 VMware LLC Hardware acceleration techniques using flow selection
US11687629B2 (en) * 2020-06-12 2023-06-27 Baidu Usa Llc Method for data protection in a data processing cluster with authentication
US11847501B2 (en) 2020-06-12 2023-12-19 Baidu Usa Llc Method for data protection in a data processing cluster with partition
US11563745B2 (en) 2020-06-12 2023-01-24 Baidu Usa Llc Method for data protection in a data processing cluster with policy-based partition
US11687376B2 (en) 2020-06-12 2023-06-27 Baidu Usa Llc Method for data protection in a data processing cluster with dynamic partition
US11800554B2 (en) * 2020-06-17 2023-10-24 Lg Electronics Inc. Method and apparatus for handling tasks in parallel
US11212219B1 (en) * 2020-06-26 2021-12-28 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. In-band telemetry packet size optimization
CN112019589B (en) * 2020-06-30 2023-09-05 浙江远望信息股份有限公司 Multi-level load balancing data packet processing method
CN114090274A (en) 2020-07-31 2022-02-25 华为技术有限公司 Network interface card, storage device, message receiving method and message sending method
US11681443B1 (en) 2020-08-28 2023-06-20 Amazon Technologies, Inc. Durable data storage with snapshot storage space optimization
EP4214081A1 (en) * 2020-09-18 2023-07-26 Nubis Communications, Inc. Data processing systems including optical communication modules
US10997106B1 (en) 2020-09-22 2021-05-04 Pensando Sytems Inc. Inter-smartNIC virtual-link for control and datapath connectivity
US20210011787A1 (en) * 2020-09-25 2021-01-14 Francesc Guim Bernat Technologies for scaling inter-kernel technologies for accelerator device kernels
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
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
US20220100432A1 (en) 2020-09-28 2022-03-31 Vmware, Inc. Distributed storage services supported by a nic
US11704151B2 (en) * 2020-09-28 2023-07-18 International Business Machines Corporation Estimate and control execution time of a utility command
US11606310B2 (en) * 2020-09-28 2023-03-14 Vmware, Inc. Flow processing offload using virtual port identifiers
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
US20210117249A1 (en) * 2020-10-03 2021-04-22 Intel Corporation Infrastructure processing unit
KR20220045758A (en) * 2020-10-06 2022-04-13 에스케이하이닉스 주식회사 Storage device and operating method thereof
US11988874B2 (en) 2020-10-07 2024-05-21 Nubis Communications, Inc. Data processing systems including optical communication modules
US11914903B2 (en) * 2020-10-12 2024-02-27 Samsung Electronics Co., Ltd. Systems, methods, and devices for accelerators with virtualization and tiered memory
US11829798B2 (en) * 2020-10-21 2023-11-28 Dell Products L.P. System and method to improve data compression ratios for fixed block sizes in a smart data accelerator interface device
KR20220056986A (en) * 2020-10-29 2022-05-09 삼성전자주식회사 Memory expander, heterogeneous computing device, and operation method of heterogeneous computing device
US11477267B2 (en) * 2020-11-09 2022-10-18 Microsoft Technology Licensing, Llc Operating cloud-managed remote edge sites at reduced disk capacity
US11516087B2 (en) * 2020-11-30 2022-11-29 Google Llc Connecting processors using twisted torus configurations
US11544116B2 (en) * 2020-11-30 2023-01-03 Hewlett Packard Enterprise Development Lp Method and system for facilitating dynamic hardware resource allocation in an active switch
US11182221B1 (en) * 2020-12-18 2021-11-23 SambaNova Systems, Inc. Inter-node buffer-based streaming for reconfigurable processor-as-a-service (RPaaS)
US20220197793A1 (en) * 2020-12-22 2022-06-23 Intel Corporation Compressed cache memory with decompress on fault
US20220004330A1 (en) * 2020-12-26 2022-01-06 Intel Corporation Memory pool data placement technologies
TWI760036B (en) * 2020-12-30 2022-04-01 技嘉科技股份有限公司 Data transmission method of server firmware via http/https and server
US11281453B1 (en) 2021-01-06 2022-03-22 Pensando Systems, Inc. Methods and systems for a hitless rollback mechanism during software upgrade of a network appliance
US20220236870A1 (en) * 2021-01-26 2022-07-28 EMC IP Holding Company LLC Method and system for compression in block-based storage systems
US11726827B2 (en) * 2021-02-19 2023-08-15 Vast Data Ltd. Hierarchical workload allocation in a storage system
US11641681B2 (en) * 2021-03-02 2023-05-02 Micron Technology, Inc. Data transmission and remote activity monitoring
US20220286914A1 (en) * 2021-03-05 2022-09-08 Vmware, Inc. Ric sdk
US11507285B1 (en) * 2021-05-12 2022-11-22 TORmem Inc. Systems and methods for providing high-performance access to shared computer memory via different interconnect fabrics
EP4095705A1 (en) * 2021-05-28 2022-11-30 Cetitec GmbH Communication node for data networks and busses
EP4356175A1 (en) * 2021-06-17 2024-04-24 Nubis Communications, Inc. Communication systems having pluggable modules
JP2023007800A (en) * 2021-07-02 2023-01-19 富士通株式会社 Computer system and control method
US20230004414A1 (en) * 2021-07-05 2023-01-05 VNware, Inc. Automated instantiation and management of mobile networks
US11755489B2 (en) * 2021-08-31 2023-09-12 Apple Inc. Configurable interface circuit
US11588750B1 (en) * 2021-09-16 2023-02-21 International Business Machines Corporation Dynamic orchestration of disaggregated resources
US11750581B1 (en) * 2021-09-17 2023-09-05 Graphiant, Inc. Secure communication network
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
CN113595807B (en) * 2021-09-28 2022-03-01 阿里云计算有限公司 Computer system, RDMA network card and data communication method
US11553038B1 (en) * 2021-10-22 2023-01-10 Kyndryl, Inc. Optimizing device-to-device communication protocol selection in an edge computing environment
US20230145253A1 (en) * 2021-11-11 2023-05-11 Advanced Micro Devices, Inc. Reducing latency in highly scalable hpc applications via accelerator-resident runtime management
US11863376B2 (en) 2021-12-22 2024-01-02 Vmware, Inc. Smart NIC leader election
US11995024B2 (en) 2021-12-22 2024-05-28 VMware LLC State sharing between smart NICs
US20230222045A1 (en) * 2022-01-13 2023-07-13 Dell Products L.P. System and method for enhanced container deployment
US11971990B2 (en) 2022-01-13 2024-04-30 Dell Products L.P. System and method for container validation
US20230236889A1 (en) * 2022-01-27 2023-07-27 Microsoft Technology Licensing, Llc Distributed accelerator
US20230244664A1 (en) * 2022-02-02 2023-08-03 Samsung Electronics Co., Ltd. Hybrid database scan acceleration system
US11906800B2 (en) * 2022-03-25 2024-02-20 Arista Networks, Inc. High speed network device with orthogonal pluggable optics modules
US11747980B1 (en) 2022-05-19 2023-09-05 International Business Machines Corporation Decompression of a file
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
US11899594B2 (en) 2022-06-21 2024-02-13 VMware LLC Maintenance of data message classification cache on smart NIC
US11977505B2 (en) * 2022-07-29 2024-05-07 Dell Products L.P. Data center asset client bridging via a passthrough device

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080016269A1 (en) * 2004-03-17 2008-01-17 Super Talent Electronics Inc. Flash / Phase-Change Memory in Multi-Ring Topology Using Serial-Link Packet Interface
US7395358B2 (en) * 2004-12-29 2008-07-01 Nvidia Corporation Intelligent storage engine for disk drive operations with reduced local bus traffic
US7870316B1 (en) * 2006-12-29 2011-01-11 Unisys Corporation System and method for providing an inline data conversion for multiplexed data streams
US20120023233A1 (en) * 2010-01-05 2012-01-26 Hitachi, Ltd. Method for executing migration between virtual servers and server system used for the same
US8825964B1 (en) * 2011-09-26 2014-09-02 Emc Corporation Adaptive integration of cloud data services with a data storage system
US20150006594A1 (en) * 2013-07-01 2015-01-01 Cleversafe, Inc. Storing data in a dispersed storage network
US20150205542A1 (en) * 2014-01-22 2015-07-23 Vmware, Inc. Virtual machine migration in shared storage environment
US20160292009A1 (en) * 2013-12-20 2016-10-06 David Kaplan Execution offloading through syscall trap interface
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
US20170262638A1 (en) * 2015-09-25 2017-09-14 Eliot Horowitz Distributed database systems and methods with encrypted storage engines
US20170289237A1 (en) * 2016-04-05 2017-10-05 International Business Machines Corporation Network file transfer including file obfuscation
US20180089324A1 (en) * 2016-09-26 2018-03-29 Splunk Inc. Dynamic resource allocation for real-time search
US10120582B1 (en) * 2016-03-30 2018-11-06 Amazon Technologies, Inc. Dynamic cache management in storage devices

Family Cites Families (305)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2458153A (en) * 1946-06-07 1949-01-04 Festge Charles Safety device for electric plugs
US3651444A (en) * 1970-06-23 1972-03-21 Amp Inc Printed circuit board connector
US4176897A (en) * 1976-11-19 1979-12-04 Bunker Ramo Corporation EMI protected connector assembly
JPH0418226Y2 (en) * 1987-01-26 1992-04-23
US4890894A (en) * 1988-06-16 1990-01-02 Northern Telecom Limited Optical connector
US4863232A (en) * 1988-06-16 1989-09-05 Northern Telecom Limited Optical connector
JPH02222087A (en) * 1989-02-23 1990-09-04 Toshiba Corp Recording medium connecting device
US5467087A (en) * 1992-12-18 1995-11-14 Apple Computer, Inc. High speed lossless data compression system
US5372515A (en) * 1993-06-10 1994-12-13 Martin Marietta Corporation Mechanical ESD protector
JPH08138785A (en) * 1994-11-10 1996-05-31 Yazaki Corp Connector equipped with shutter mechanism
US6785888B1 (en) 1997-08-29 2004-08-31 International Business Machines Corporation Memory allocator for a multiprocessor computer system
US6085295A (en) 1997-10-20 2000-07-04 International Business Machines Corporation Method of maintaining data coherency in a computer system having a plurality of interconnected nodes
US6115372A (en) 1998-02-04 2000-09-05 Newcom Technologies, Inc. Synchronous packet switching
US6367018B1 (en) 1998-02-05 2002-04-02 3Com Corporation Method for detecting dedicated link between an end station and a network device
US6058356A (en) * 1998-04-30 2000-05-02 Cooper Instrument Corporation Hand-held electronic instrument
AU4848799A (en) 1998-07-08 2000-02-01 Broadcom Corporation High performance self balancing low cost network switching architecture based ondistributed hierarchical shared memory
US6714549B1 (en) 1998-12-23 2004-03-30 Worldcom, Inc. High resiliency network infrastructure
US6353885B1 (en) 1999-01-26 2002-03-05 Dell Usa, L.P. System and method for providing bios-level user configuration of a computer system
US6650620B1 (en) * 1999-05-04 2003-11-18 Tut Systems, Inc. Resource constrained routing in active networks
FR2801432B1 (en) * 1999-11-19 2001-12-21 Marechal Sepm SOCKET BASE PROVIDED WITH A BELLOWS SEAL
US6368129B1 (en) * 1999-12-24 2002-04-09 Delta Electronics, Inc. Electrical connector with outer and inner sleeves
US6678746B1 (en) 2000-08-01 2004-01-13 Hewlett-Packard Development Company, L.P. Processing network packets
JP3431015B2 (en) 2000-11-17 2003-07-28 日本電気株式会社 System and method for changing link layer protocol of line termination device
US7055148B2 (en) * 2000-12-07 2006-05-30 Hewlett-Packard Development Company, L.P. System and method for updating firmware
US6731832B2 (en) 2001-02-28 2004-05-04 Lambda Opticalsystems Corporation Detection of module insertion/removal in a modular optical network, and methods and apparatus therefor
US20030028594A1 (en) 2001-07-31 2003-02-06 International Business Machines Corporation Managing intended group membership using domains
US6454580B1 (en) * 2001-08-22 2002-09-24 Hon Hai Precision Ind. Co., Ltd. Guide rail for receiving a GBIC module
JP2003296022A (en) * 2002-04-01 2003-10-17 Pioneer Electronic Corp Touch panel integrated display device
US8284844B2 (en) * 2002-04-01 2012-10-09 Broadcom Corporation Video decoding system supporting multiple standards
US7007103B2 (en) * 2002-04-30 2006-02-28 Microsoft Corporation Method to offload a network stack
US7181531B2 (en) * 2002-04-30 2007-02-20 Microsoft Corporation Method to synchronize and upload an offloaded network stack connection with a network stack
EP1361671B1 (en) 2002-05-07 2007-11-21 Abb Research Ltd. Microwave waveguide bus for digital devices
US7627693B2 (en) * 2002-06-11 2009-12-01 Pandya Ashish A IP storage processor and engine therefor using RDMA
CN1266887C (en) 2002-07-10 2006-07-26 华为技术有限公司 Virtual switch for supplying virtual LAN service and method
US8850223B1 (en) * 2002-07-19 2014-09-30 F5 Networks, Inc. Method and system for hard disk emulation and cryptographic acceleration on a blade server
US7818449B2 (en) 2002-09-03 2010-10-19 Thomson Licensing Mechanism for providing quality of service in a network utilizing priority and reserved bandwidth protocols
JP2006508605A (en) 2002-12-02 2006-03-09 オペラックス エービー Hierarchical resource management configuration and method in a hierarchical network architecture
US7231512B2 (en) * 2002-12-18 2007-06-12 Intel Corporation Technique for reconstituting a pre-boot firmware environment after launch of an operating system
US7987449B1 (en) * 2003-05-22 2011-07-26 Hewlett-Packard Development Company, L.P. Network for lifecycle management of firmware and software in electronic devices
WO2005013137A1 (en) * 2003-08-04 2005-02-10 Fujitsu Limited Data transfer method
US7136958B2 (en) 2003-08-28 2006-11-14 Micron Technology, Inc. Multiple processor system and method including multiple memory hub modules
US8838772B2 (en) 2003-08-29 2014-09-16 Ineoquest Technologies, Inc. System and method for analyzing the performance of multiple transportation streams of streaming media in packet-based networks
US7689738B1 (en) * 2003-10-01 2010-03-30 Advanced Micro Devices, Inc. Peripheral devices and methods for transferring incoming data status entries from a peripheral to a host
US7826614B1 (en) * 2003-11-05 2010-11-02 Globalfoundries Inc. Methods and apparatus for passing initialization vector information from software to hardware to perform IPsec encryption operation
US7236588B2 (en) * 2003-12-12 2007-06-26 Nokia Corporation Interlocking cover for mobile terminals
US7756008B2 (en) 2003-12-19 2010-07-13 At&T Intellectual Property Ii, L.P. Routing protocols with predicted outrage notification
US6952530B2 (en) * 2003-12-19 2005-10-04 The Aerospace Corporation Integrated glass ceramic systems
KR100693663B1 (en) * 2003-12-30 2007-03-14 엘지엔시스(주) System and Method for detecting obstacle of node
CA2551678A1 (en) * 2004-01-07 2005-07-28 Dow Global Technologies Inc. Impact-resistant case with sealable opening
US7724532B2 (en) * 2004-07-02 2010-05-25 Apple Inc. Handheld computing device
US7712100B2 (en) 2004-09-14 2010-05-04 International Business Machines Corporation Determining a capacity of a grid environment to handle a required workload for a virtual grid job request
EP1643710A1 (en) * 2004-09-30 2006-04-05 Nagravision S.A. Method of updating a lookup table of addresses and identification numbers
CN1816003A (en) 2005-02-06 2006-08-09 华为技术有限公司 Telecommunication method and apparatus of dissimilar chain protocol
US20060176524A1 (en) * 2005-02-08 2006-08-10 Willrich Scott Consulting Group, Inc. Compact portable document digitizer and organizer with integral display
US8526881B2 (en) * 2005-04-18 2013-09-03 The Boeing Company Mechanically isolated wireless communications system and method
US8059660B2 (en) 2005-04-22 2011-11-15 Nextel Communications Inc. Communications routing systems and methods
US7739677B1 (en) 2005-05-27 2010-06-15 Symantec Operating Corporation System and method to prevent data corruption due to split brain in shared data clusters
US7368307B2 (en) * 2005-06-07 2008-05-06 Eastman Kodak Company Method of manufacturing an OLED device with a curved light emitting surface
US9813283B2 (en) * 2005-08-09 2017-11-07 Oracle International Corporation Efficient data transfer between servers and remote peripherals
US7884315B2 (en) * 2006-07-11 2011-02-08 Apple Inc. Invisible, light-transmissive display system
US8407424B2 (en) 2005-11-07 2013-03-26 Silicon Graphics International Corp. Data coherence method and apparatus for multi-node computer system
JP4770446B2 (en) * 2005-12-20 2011-09-14 サンケン電気株式会社 Overheat protection circuit for power supply and DC power supply
US7694160B2 (en) * 2006-08-31 2010-04-06 Ati Technologies Ulc Method and apparatus for optimizing power consumption in a multiprocessor environment
JP4172807B2 (en) * 2006-09-08 2008-10-29 インターナショナル・ビジネス・マシーンズ・コーポレーション Technology that supports the discovery of the cause of failure
CN101518168B (en) * 2006-09-22 2011-12-07 日本写真印刷株式会社 Housing case, method for manufacturing the housing case and glass insert forming die used in the method
US8428071B2 (en) 2006-09-25 2013-04-23 Rockstar Consortium Us Lp Scalable optical-core network
US7962736B1 (en) 2006-10-03 2011-06-14 American Megatrends, Inc. Interactive pre-OS firmware update with repeated disabling of interrupts
KR100930576B1 (en) * 2006-12-04 2009-12-09 한국전자통신연구원 How to Manage Failures in Virtualization-Based High Availability Cluster Systems and High Availability Cluster Systems
CN101681282A (en) * 2006-12-06 2010-03-24 弗森多系统公司(dba弗森-艾奥) Be used to share, front end, the device of distributed raid, system and method
US7987469B2 (en) * 2006-12-14 2011-07-26 Intel Corporation RDMA (remote direct memory access) data transfer in a virtual environment
US7668984B2 (en) 2007-01-10 2010-02-23 International Business Machines Corporation Low latency send queues in I/O adapter hardware
US8205205B2 (en) 2007-03-16 2012-06-19 Sap Ag Multi-objective allocation of computational jobs in client-server or hosting environments
US8341611B2 (en) * 2007-04-11 2012-12-25 Apple Inc. Application interface on multiple processors
WO2009002464A2 (en) * 2007-06-22 2008-12-31 Vubiq Incorporated System and method for wireless communication in a backplane fabric architecture
US8897184B2 (en) * 2007-06-22 2014-11-25 Vubiq Networks, Inc. System and method for wireless communication in a backplane fabric architecture
US7921264B2 (en) * 2007-06-27 2011-04-05 International Business Machines Corporation Dual-mode memory chip for high capacity memory subsystem
US7996641B2 (en) * 2007-06-27 2011-08-09 International Business Machines Corporation Structure for hub for supporting high capacity memory subsystem
US8037272B2 (en) * 2007-06-27 2011-10-11 International Business Machines Corporation Structure for memory chip for high capacity memory subsystem supporting multiple speed bus
US8248928B1 (en) 2007-10-09 2012-08-21 Foundry Networks, Llc Monitoring server load balancing
US9143406B2 (en) 2007-10-17 2015-09-22 Verizon Patent And Licensing Inc. Apparatus, method and computer-readable storage medium for calculating throughput requirements of a network
US9003054B2 (en) * 2007-10-25 2015-04-07 Microsoft Technology Licensing, Llc Compressing null columns in rows of the tabular data stream protocol
KR100956638B1 (en) * 2007-12-11 2010-05-11 한국전자통신연구원 Large Scale Cluster Monitoring System, And Automatic Building And Restoration Method Thereof
US7603428B2 (en) 2008-02-05 2009-10-13 Raptor Networks Technology, Inc. Software application striping
US8082418B2 (en) * 2007-12-17 2011-12-20 Intel Corporation Method and apparatus for coherent device initialization and access
US7953912B2 (en) * 2008-02-22 2011-05-31 International Business Machines Corporation Guided attachment of accelerators to computer systems
US8306652B2 (en) * 2008-03-14 2012-11-06 International Business Machines Corporation Dual-band communication of management traffic in a blade server system
US9391921B1 (en) * 2008-03-18 2016-07-12 Packeteer, Inc. Virtual bandwidth management deployment architectures
US8238087B2 (en) * 2010-01-06 2012-08-07 Apple Inc. Display module
JP5044510B2 (en) * 2008-06-03 2012-10-10 株式会社東芝 Housing, electronic device, and manufacturing method of housing
US7697281B2 (en) * 2008-09-05 2010-04-13 Apple Inc. Handheld computing device
JP2010103982A (en) 2008-09-25 2010-05-06 Sony Corp Millimeter wave transmission device, millimeter wave transmission method, and millimeter wave transmission system
US8687359B2 (en) * 2008-10-13 2014-04-01 Apple Inc. Portable computer unified top case
US8713312B2 (en) * 2008-12-07 2014-04-29 Trend Micrio Incorporated Method and system for detecting data modification within computing device
US9170864B2 (en) 2009-01-29 2015-10-27 International Business Machines Corporation Data processing in a hybrid computing environment
JP5616907B2 (en) * 2009-03-02 2014-10-29 アップル インコーポレイテッド Technology to strengthen the glass cover of portable electronic devices
US8493364B2 (en) * 2009-04-30 2013-07-23 Motorola Mobility Llc Dual sided transparent display module and portable electronic device incorporating the same
US8479220B2 (en) * 2009-06-04 2013-07-02 International Business Machines Corporation Automatically correlating transaction events
US20100312962A1 (en) * 2009-06-09 2010-12-09 Dekoning Rodney A N-way directly connected any to any controller architecture
US8554892B2 (en) * 2009-06-22 2013-10-08 Citrix Systems, Inc. Systems and methods for n-core statistics aggregation
US20110103391A1 (en) * 2009-10-30 2011-05-05 Smooth-Stone, Inc. C/O Barry Evans System and method for high-performance, low-power data center interconnect fabric
US8832142B2 (en) 2010-08-30 2014-09-09 Oracle International Corporation Query and exadata support for hybrid columnar compressed data
US8776066B2 (en) * 2009-11-30 2014-07-08 International Business Machines Corporation Managing task execution on accelerators
US9455937B2 (en) * 2010-01-07 2016-09-27 Force10 Networks, Inc. Distributed packet switch having a wireless control plane
US20130051552A1 (en) * 2010-01-20 2013-02-28 Héléna Handschuh Device and method for obtaining a cryptographic key
US8195883B2 (en) * 2010-01-27 2012-06-05 Oracle America, Inc. Resource sharing to reduce implementation costs in a multicore processor
US8463865B2 (en) * 2010-03-09 2013-06-11 Texas Instruments Incorporated Video synchronization with distributed modules
US8869138B2 (en) * 2011-11-11 2014-10-21 Wyse Technology L.L.C. Robust firmware update with recovery logic
US8442064B2 (en) 2010-03-19 2013-05-14 Juniper Networks, Inc. Virtual link aggregation of network traffic in an aggregation switch
US8264837B2 (en) * 2010-04-19 2012-09-11 Apple Inc. Systems and methods for cover assembly retention of a portable electronic device
US9300576B2 (en) 2010-05-03 2016-03-29 Pluribus Networks Inc. Methods, systems, and fabrics implementing a distributed network operating system
US8386855B2 (en) 2010-05-25 2013-02-26 Red Hat, Inc. Distributed healthchecking mechanism
US8898324B2 (en) * 2010-06-24 2014-11-25 International Business Machines Corporation Data access management in a hybrid memory server
US8739171B2 (en) 2010-08-31 2014-05-27 International Business Machines Corporation High-throughput-computing in a hybrid computing environment
US8914805B2 (en) * 2010-08-31 2014-12-16 International Business Machines Corporation Rescheduling workload in a hybrid computing environment
FR2964501B1 (en) * 2010-09-07 2013-05-17 Schneider Electric Ind Sas ASSEMBLY OF ELECTRICAL OUTLET
US8824140B2 (en) * 2010-09-17 2014-09-02 Apple Inc. Glass enclosure
US8782339B2 (en) * 2010-10-11 2014-07-15 Open Invention Network, Llc Storage system having cross node data redundancy and method and computer readable medium for same
US8503879B2 (en) 2010-10-25 2013-08-06 Nec Laboratories America, Inc. Hybrid optical/electrical switching system for data center networks
US20120099591A1 (en) * 2010-10-26 2012-04-26 Dell Products, Lp System and Method for Scalable Flow Aware Network Architecture for Openflow Based Network Virtualization
US20120137289A1 (en) * 2010-11-30 2012-05-31 International Business Machines Corporation Protecting high priority workloads in a virtualized datacenter
US8996644B2 (en) * 2010-12-09 2015-03-31 Solarflare Communications, Inc. Encapsulated accelerator
US9600429B2 (en) * 2010-12-09 2017-03-21 Solarflare Communications, Inc. Encapsulated accelerator
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
US8638767B2 (en) 2011-02-14 2014-01-28 Qualcomm Incorporated Multi-communication mode packet routing mechanism for wireless communications systems
US8892788B2 (en) * 2011-02-22 2014-11-18 Red Hat Israel, Ltd. Exposing a DMA engine to guests in a virtual machine system
US8861369B2 (en) * 2011-03-07 2014-10-14 Oracle International Corporation Virtual network interface with packet filtering hooks
US9025603B2 (en) 2011-03-08 2015-05-05 Qualcomm Incorporated Addressing scheme for hybrid communication networks
US20120240125A1 (en) * 2011-03-18 2012-09-20 Qnx Software Systems Co System Resource Management In An Electronic Device
US8462780B2 (en) * 2011-03-30 2013-06-11 Amazon Technologies, Inc. Offload device-based stateless packet processing
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
US8825900B1 (en) * 2011-04-05 2014-09-02 Nicira, Inc. Method and apparatus for stateless transport layer tunneling
US9042402B1 (en) 2011-05-10 2015-05-26 Juniper Networks, Inc. Methods and apparatus for control protocol validation of a switch fabric system
US8745614B2 (en) * 2011-05-13 2014-06-03 Lsi Corporation Method and system for firmware upgrade of a storage subsystem hosted in a storage virtualization environment
US20120311127A1 (en) * 2011-05-31 2012-12-06 Microsoft Corporation Flyway Generation in Data Centers
US8400335B2 (en) * 2011-07-21 2013-03-19 International Business Machines Corporation Using variable length code tables to compress an input data stream to a compressed output data stream
US9537794B2 (en) 2011-07-29 2017-01-03 Vubiq Networks, Inc. System and method for wireless communication in a backplane fabric architecture
US9240900B2 (en) 2011-09-06 2016-01-19 Texas Instruments Incorporated Wireless router system
US8943227B2 (en) * 2011-09-21 2015-01-27 Kevin Mark Klughart Data storage architecture extension system and method
WO2012167533A1 (en) * 2011-10-31 2012-12-13 华为技术有限公司 Method and device for building memory access model
US20130151725A1 (en) * 2011-12-13 2013-06-13 B Method and System for Handling a Domain Name Service Request
JP5573829B2 (en) 2011-12-20 2014-08-20 富士通株式会社 Information processing apparatus and memory access method
US8788663B1 (en) 2011-12-20 2014-07-22 Amazon Technologies, Inc. Managing resource dependent workflows
JP6083687B2 (en) 2012-01-06 2017-02-22 インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Machines Corporation Distributed calculation method, program, host computer, and distributed calculation system (distributed parallel calculation using accelerator device)
WO2013126058A1 (en) * 2012-02-23 2013-08-29 Hewlett-Packard Development Company, L.P. Firmware package to modify active firmware
US9996394B2 (en) 2012-03-01 2018-06-12 Microsoft Technology Licensing, Llc Scheduling accelerator tasks on accelerators using graphs
ITRM20120094A1 (en) * 2012-03-14 2013-09-14 Istituto Naz Di Fisica Nuclea Re NETWORK INTERFACE CARD FOR PARALLEL CALCULATION NETWORK KNOT ON GPU, AND RELATIVE INTERNODAL COMMUNICATION METHOD
JP5884578B2 (en) * 2012-03-16 2016-03-15 富士通株式会社 Accelerator management device, accelerator management method, and input / output device
CN104221005B (en) * 2012-03-30 2018-04-27 英特尔公司 For sending a request to the mechanism of accelerator from multithreading
US9158686B2 (en) * 2012-03-30 2015-10-13 Altera Corporation Processing system and method including data compression API
EP2836979A4 (en) * 2012-04-06 2018-08-08 Live Nation Entertainment Inc. Methods and systems of inhibiting automated scripts from accessing a ticket site
US8995381B2 (en) 2012-04-16 2015-03-31 Ofinno Technologies, Llc Power control in a wireless device
US8983293B2 (en) 2012-04-25 2015-03-17 Ciena Corporation Electro-optical switching fabric systems and methods
US9223634B2 (en) 2012-05-02 2015-12-29 Cisco Technology, Inc. System and method for simulating virtual machine migration in a network environment
US9122810B2 (en) 2012-05-18 2015-09-01 Dell Products, Lp System and method for providing input/output functionality to a processing node
US9110761B2 (en) * 2012-06-27 2015-08-18 Microsoft Technology Licensing, Llc Resource data structures for firmware updates
US9391841B2 (en) 2012-07-03 2016-07-12 Solarflare Communications, Inc. Fast linkup arbitration
US8838577B2 (en) * 2012-07-24 2014-09-16 International Business Machines Corporation Accelerated row decompression
CN103577266B (en) * 2012-07-31 2017-06-23 国际商业机器公司 For the method and system being allocated to field programmable gate array resource
US9152532B2 (en) * 2012-08-07 2015-10-06 Advanced Micro Devices, Inc. System and method for configuring a cloud computing system with a synthetic test workload
US8887056B2 (en) 2012-08-07 2014-11-11 Advanced Micro Devices, Inc. System and method for configuring cloud computing systems
CN103634330A (en) 2012-08-20 2014-03-12 曙光信息产业(北京)有限公司 Automatic resource distribution method in cloud calculation environment
US8872677B2 (en) * 2013-03-15 2014-10-28 Dialogic Networks (Israel) Ltd. Method and apparatus for compressing data-carrying signals
CN102882811B (en) 2012-09-10 2016-04-13 西安电子科技大学 Based on data center light interconnection network system and the communication means of array waveguide grating
US9026765B1 (en) 2012-09-11 2015-05-05 Emc Corporation Performing write operations in a multi-tiered storage environment
US9213649B2 (en) * 2012-09-24 2015-12-15 Oracle International Corporation Distributed page-table lookups in a shared-memory system
US9253053B2 (en) 2012-10-11 2016-02-02 International Business Machines Corporation Transparently enforcing policies in hadoop-style processing infrastructures
US10505747B2 (en) * 2012-10-16 2019-12-10 Solarflare Communications, Inc. Feed processing
US9609782B2 (en) 2013-01-15 2017-03-28 Intel Corporation Rack assembly structure
US9250954B2 (en) 2013-01-17 2016-02-02 Xockets, Inc. Offload processor modules for connection to system memory, and corresponding methods and systems
US9203699B2 (en) 2014-02-11 2015-12-01 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Constructing and verifying switch fabric cabling schemes
US9817699B2 (en) * 2013-03-13 2017-11-14 Elasticbox Inc. Adaptive autoscaling for virtualized applications
US9335950B2 (en) * 2013-03-15 2016-05-10 Western Digital Technologies, Inc. Multiple stream compression and formatting of data for data storage systems
US9373878B2 (en) * 2013-03-19 2016-06-21 Texas Instruments Incorporated Dielectric waveguide with RJ45 connector
US9384204B2 (en) * 2013-05-22 2016-07-05 Amazon Technologies, Inc. Efficient data compression and analysis as a service
US9424079B2 (en) 2013-06-27 2016-08-23 Microsoft Technology Licensing, Llc Iteration support in a heterogeneous dataflow engine
CN104297871B (en) 2013-07-19 2017-11-10 泰科电子(上海)有限公司 Optical interconnection system and method
US9613394B2 (en) * 2013-08-28 2017-04-04 Intel Corporation Lossy color compression using adaptive quantization
US9444914B2 (en) * 2013-09-16 2016-09-13 Annapurna Labs Ltd. Configurable parser and a method for parsing information units
US9977685B2 (en) 2013-10-13 2018-05-22 Nicira, Inc. Configuration of logical router
CN106537863B (en) 2013-10-17 2019-11-26 马维尔国际贸易有限公司 Method and apparatus for concomitantly handling network packet
US9619381B2 (en) * 2013-12-24 2017-04-11 International Business Machines Corporation Collaborative health management in a storage system
US9336056B2 (en) * 2013-12-31 2016-05-10 International Business Machines Corporation Extendible input/output data mechanism for accelerators
GB2522650A (en) 2014-01-31 2015-08-05 Ibm Computer system with groups of processor boards
US9549196B2 (en) * 2014-02-04 2017-01-17 Microsoft Technology Licensing, Llc Data unit identification for compressed video streams
US9671857B2 (en) * 2014-03-25 2017-06-06 Qualcomm Incorporated Apparatus, system and method for dynamic power management across heterogeneous processors in a shared power domain
US9496592B2 (en) * 2014-03-27 2016-11-15 Intel Corporation Rack level pre-installed interconnect for enabling cableless server/storage/networking deployment
US9893988B2 (en) 2014-03-27 2018-02-13 Nicira, Inc. Address resolution using multiple designated instances of a logical router
US9294304B2 (en) * 2014-03-31 2016-03-22 Juniper Networks, Inc. Host network accelerator for data center overlay network
US9813258B2 (en) 2014-03-31 2017-11-07 Tigera, Inc. Data center networks
US10218645B2 (en) * 2014-04-08 2019-02-26 Mellanox Technologies, Ltd. Low-latency processing in a network node
CN104009941A (en) 2014-05-16 2014-08-27 江苏鼎云信息科技有限公司 Data center rack internal network structure based on arrayed waveguide grating
US9509434B2 (en) 2014-05-19 2016-11-29 Ciena Corporation Margin-based optimization systems and methods in optical networks by intentionally reducing margin
WO2015192003A1 (en) * 2014-06-13 2015-12-17 Lord Corporation System and method for monitoring component service life
US10382279B2 (en) * 2014-06-30 2019-08-13 Emc Corporation Dynamically composed compute nodes comprising disaggregated components
US10146945B2 (en) 2014-07-03 2018-12-04 Abb Schweiz Ag Apparatus and a method for processing data
US20160196131A1 (en) * 2014-07-07 2016-07-07 Symphony Teleca Corporation Remote Embedded Device Update Platform Apparatuses, Methods and Systems
US20160050194A1 (en) 2014-08-18 2016-02-18 Tawkur LLC Web-based governance of messaging services
US9367343B2 (en) * 2014-08-29 2016-06-14 Red Hat Israel, Ltd. Dynamic batch management of shared buffers for virtual machines
US9686143B2 (en) 2014-09-24 2017-06-20 Intel Corporation Mechanism for management controllers to learn the control plane hierarchy in a data center environment
USD810031S1 (en) * 2014-09-26 2018-02-13 Intel Corporation Protective cover for an electronic connector
US9425543B2 (en) * 2014-09-26 2016-08-23 Intel Corporation Protective cover for a connector
US9378461B1 (en) * 2014-09-26 2016-06-28 Oracle International Corporation Rule based continuous drift and consistency management for complex systems
US9721660B2 (en) 2014-10-24 2017-08-01 Microsoft Technology Licensing, Llc Configurable volatile memory without a dedicated power source for detecting a data save trigger condition
US9612651B2 (en) * 2014-10-27 2017-04-04 Futurewei Technologies, Inc. Access based resources driven low power control and management for multi-core system on a chip
US10289423B2 (en) 2014-10-31 2019-05-14 Hewlett Packard Enterprise Development Lp Management controller
US9774503B2 (en) 2014-11-03 2017-09-26 Intel Corporation Method, apparatus and system for automatically discovering nodes and resources in a multi-node system
WO2016076880A1 (en) 2014-11-14 2016-05-19 Hewlett Packard Enterprise Development Lp Secure update of firmware and software
US9612765B2 (en) 2014-11-19 2017-04-04 International Business Machines Corporation Context aware dynamic composition of migration plans to cloud
EP3024175B1 (en) * 2014-11-19 2019-07-31 Tanaza S.p.A. Method and system for remote management of network devices
US9749448B2 (en) 2014-11-25 2017-08-29 Intel Corporation Header parity error handling
US9733980B1 (en) 2014-12-05 2017-08-15 Amazon Technologies, Inc. Virtual machine management using I/O device logging
JP6147240B2 (en) 2014-12-05 2017-06-14 キヤノン株式会社 Information processing apparatus, method of controlling the apparatus, and program
US10355935B2 (en) 2014-12-09 2019-07-16 Ciena Corporation Reduced link bandwidth update systems and methods for improved scalability, efficiency, and performance
KR20160070512A (en) * 2014-12-10 2016-06-20 삼성전자주식회사 Semiconductor device and operating method thereof
US9846576B2 (en) * 2014-12-27 2017-12-19 Intel Corporation Technologies for reprogramming network interface cards over a network
US9507581B2 (en) * 2015-01-14 2016-11-29 Dell Products Lp Systems and methods of device firmware delivery for pre-boot updates
US10198183B2 (en) 2015-02-06 2019-02-05 Liqid Inc. Tunneling of storage operations between storage nodes
US9648402B2 (en) 2015-02-10 2017-05-09 Ciena Corporation In-band communication channel in optical networks
JP6476018B2 (en) 2015-03-10 2019-02-27 日本光電工業株式会社 probe
US9734311B1 (en) * 2015-03-17 2017-08-15 American Megatrends, Inc. Secure authentication of firmware configuration updates
US20160306677A1 (en) * 2015-04-14 2016-10-20 Globalfoundries Inc. Automatic Analytical Cloud Scaling of Hardware Using Resource Sub-Cloud
US9753653B2 (en) * 2015-04-14 2017-09-05 Sandisk Technologies Llc High-priority NAND operations management
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
US10244032B2 (en) * 2015-06-04 2019-03-26 Juniper Networks, Inc. Reducing application detection notification traffic
US10587935B2 (en) * 2015-06-05 2020-03-10 Quanta Computer Inc. System and method for automatically determining server rack weight
US9606836B2 (en) * 2015-06-09 2017-03-28 Microsoft Technology Licensing, Llc Independently networkable hardware accelerators for increased workflow optimization
US10733164B2 (en) * 2015-06-23 2020-08-04 Microsoft Technology Licensing, Llc Updating a bit vector search index
US10372914B2 (en) * 2015-06-24 2019-08-06 Lenovo (Singapore) Pte. Ltd. Validating firmware on a computing device
US9674090B2 (en) * 2015-06-26 2017-06-06 Microsoft Technology Licensing, Llc In-line network accelerator
US10061596B2 (en) * 2015-07-10 2018-08-28 Dell Products L.P. Systems and methods for loading firmware modules
US9715475B2 (en) * 2015-07-21 2017-07-25 BigStream Solutions, Inc. Systems and methods for in-line stream processing of distributed dataflow based computations
US9891935B2 (en) 2015-08-13 2018-02-13 Altera Corporation Application-based dynamic heterogeneous many-core systems and methods
CN105183561B (en) 2015-09-02 2018-09-14 浪潮(北京)电子信息产业有限公司 A kind of resource allocation methods and system
US10530692B2 (en) 2015-09-04 2020-01-07 Arista Networks, Inc. Software FIB ARP FEC encoding
US9484954B1 (en) * 2015-09-10 2016-11-01 Intel Corporation Methods and apparatus to parallelize data decompression
US20170076195A1 (en) * 2015-09-10 2017-03-16 Intel Corporation Distributed neural networks for scalable real-time analytics
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
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
US9690488B2 (en) * 2015-10-19 2017-06-27 Intel Corporation Data compression using accelerator with multiple search engines
US20170116003A1 (en) 2015-10-27 2017-04-27 International Business Machines Corporation Dynamic determination of the applicability of a hardware accelerator to a request
US10127032B2 (en) * 2015-11-05 2018-11-13 Quanta Computer Inc. System and method for unified firmware management
US9946642B2 (en) * 2015-11-13 2018-04-17 Samsung Electronics Co., Ltd Distributed multimode storage management
US9996473B2 (en) * 2015-11-13 2018-06-12 Samsung Electronics., Ltd Selective underlying exposure storage mapping
US10206297B2 (en) 2015-11-23 2019-02-12 Liqid Inc. Meshed architecture rackmount storage assembly
US10169073B2 (en) * 2015-12-20 2019-01-01 Intel Corporation Hardware accelerators and methods for stateful compression and decompression operations
WO2017111935A1 (en) 2015-12-22 2017-06-29 Halliburton Energy Services, Inc. Selective nmr pulse for downhole measurements
US10445271B2 (en) * 2016-01-04 2019-10-15 Intel Corporation Multi-core communication acceleration using hardware queue device
CN108702195B (en) 2016-01-08 2021-11-09 蓝色多瑙河系统有限公司 Antenna mapping and diversity
US9832548B2 (en) 2016-01-29 2017-11-28 Ciena Corporation Flexible behavior modification during restoration in optical networks
JP6897574B2 (en) * 2016-01-29 2021-06-30 日本電気株式会社 Accelerator controller, accelerator control method and program
US10162682B2 (en) * 2016-02-16 2018-12-25 Red Hat, Inc. Automatically scaling up physical resources in a computing infrastructure
US10778809B2 (en) 2016-02-26 2020-09-15 Arista Networks, Inc. Per-input port, per-control plane network data traffic class control plane policing
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
US9852040B1 (en) * 2016-03-09 2017-12-26 Altera Corporation Methods for updating memory maps of a system-on-chip
US10187290B2 (en) 2016-03-24 2019-01-22 Juniper Networks, Inc. Method, system, and apparatus for preventing tromboning in inter-subnet traffic within data center architectures
JP2017187889A (en) * 2016-04-04 2017-10-12 京セラドキュメントソリューションズ株式会社 Setting execution system and setting execution program
US10305815B2 (en) 2016-04-29 2019-05-28 Huawei Technologies Co., Ltd. System and method for distributed resource management
US11681770B2 (en) 2016-05-16 2023-06-20 International Business Machines Corporation Determining whether to process identified uniform resource locators
US20180004835A1 (en) * 2016-06-30 2018-01-04 Facebook, Inc. Data classification workflows implemented with dynamically modifiable directed graphs
CN105979007B (en) 2016-07-04 2020-06-02 华为技术有限公司 Method and device for accelerating resource processing and network function virtualization system
US10404800B2 (en) * 2016-07-15 2019-09-03 Hewlett Packard Enterprise Development Lp Caching network fabric for high performance computing
US20180024964A1 (en) * 2016-07-19 2018-01-25 Pure Storage, Inc. Disaggregated compute resources and storage resources in a storage system
US11444866B2 (en) 2016-07-22 2022-09-13 Intel Corporation Methods and apparatus for composite node creation and management through SDI partitions
US10390114B2 (en) 2016-07-22 2019-08-20 Intel Corporation Memory sharing for physical accelerator resources in a data center
US10234833B2 (en) 2016-07-22 2019-03-19 Intel Corporation Technologies for predicting power usage of a data center
US10387303B2 (en) * 2016-08-16 2019-08-20 Western Digital Technologies, Inc. Non-volatile storage system with compute engine to accelerate big data applications
US10467195B2 (en) 2016-09-06 2019-11-05 Samsung Electronics Co., Ltd. Adaptive caching replacement manager with dynamic updating granulates and partitions for shared flash-based storage system
US10277677B2 (en) * 2016-09-12 2019-04-30 Intel Corporation Mechanism for disaggregated storage class memory over fabric
US10740468B2 (en) * 2016-09-30 2020-08-11 Hewlett Packard Enterprise Development Lp Multiple roots of trust to verify integrity
US11036552B2 (en) * 2016-10-25 2021-06-15 International Business Machines Corporation Cognitive scheduler
US10404614B2 (en) * 2016-11-21 2019-09-03 Vmware, Inc. Multi-cloud resource allocation
US20180150256A1 (en) 2016-11-29 2018-05-31 Intel Corporation Technologies for data deduplication in disaggregated architectures
US11016832B2 (en) 2016-11-29 2021-05-25 Intel Corporation Cloud-based scale-up system composition
US10599590B2 (en) 2016-11-30 2020-03-24 International Business Machines Corporation Uniform memory access architecture
US10114633B2 (en) * 2016-12-08 2018-10-30 International Business Machines Corporation Concurrent I/O enclosure firmware/field-programmable gate array (FPGA) update in a multi-node environment
US10282296B2 (en) * 2016-12-12 2019-05-07 Intel Corporation Zeroing a cache line
DE112016007516T5 (en) 2016-12-12 2019-10-02 Intel Corporation DEVICES AND METHOD FOR A PROCESSOR ARCHITECTURE
US10404836B2 (en) * 2016-12-26 2019-09-03 Intel Corporation Managing state data in a compression accelerator
US20180191629A1 (en) * 2016-12-30 2018-07-05 Intel Corporation Time-based flexible packet scheduling
KR20180106202A (en) 2017-03-17 2018-10-01 주식회사 만도 Shock absober for vehicle
US10630654B2 (en) * 2017-03-22 2020-04-21 Microsoft Technology Licensing, Llc Hardware-accelerated secure communication management
US11094029B2 (en) * 2017-04-10 2021-08-17 Intel Corporation Abstraction layers for scalable distributed machine learning
US10324706B1 (en) * 2017-05-09 2019-06-18 Amazon Technologies, Inc. Automated software deployment for electromechanical systems
US10311002B2 (en) * 2017-05-15 2019-06-04 International Business Machines Corporation Selectable peripheral logic in programmable apparatus
US11119835B2 (en) 2017-08-30 2021-09-14 Intel Corporation Technologies for providing efficient reprovisioning in an accelerator device
US20190044809A1 (en) 2017-08-30 2019-02-07 Intel Corporation Technologies for managing a flexible host interface of a network interface controller
US20190068466A1 (en) 2017-08-30 2019-02-28 Intel Corporation Technologies for auto-discovery of fault domains
US20190065253A1 (en) 2017-08-30 2019-02-28 Intel Corporation Technologies for pre-configuring accelerators by predicting bit-streams
US10841243B2 (en) * 2017-11-08 2020-11-17 Mellanox Technologies, Ltd. NIC with programmable pipeline
US11394666B2 (en) * 2017-12-18 2022-07-19 Intel Corporation Scalable communication with a packet processing unit
US11263162B2 (en) * 2017-12-20 2022-03-01 Intel Corporation System decoder for training accelerators
US11270201B2 (en) * 2017-12-29 2022-03-08 Intel Corporation Communication optimizations for distributed machine learning
US10613847B2 (en) * 2018-02-13 2020-04-07 Dell Products, L.P. Information handling system to treat demoted firmware with replacement firmware
US11630693B2 (en) * 2018-04-12 2023-04-18 Intel Corporation Technologies for power-aware scheduling for network packet processing
US11223606B2 (en) 2018-06-29 2022-01-11 Intel Corporation Technologies for attesting a deployed workload using blockchain
US11507430B2 (en) * 2018-09-27 2022-11-22 Intel Corporation Accelerated resource allocation techniques
US11301407B2 (en) * 2019-01-08 2022-04-12 Intel Corporation Technologies for accelerator fabric protocol multipathing
US11003539B2 (en) 2019-01-15 2021-05-11 EMC IP Holding Company LLC Offload processing using a storage slot
US20200241926A1 (en) 2019-01-24 2020-07-30 Intel Corporation Selection and management of disaggregated computing resources
US20190207868A1 (en) * 2019-02-15 2019-07-04 Intel Corporation Processor related communications
PL3938894T3 (en) 2019-03-15 2024-02-19 Intel Corporation Multi-tile memory management for detecting cross tile access, providing multi-tile inference scaling, and providing optimal page migration
US20200341810A1 (en) 2019-04-24 2020-10-29 Intel Corporation Technologies for providing an accelerator device discovery service
US10949362B2 (en) * 2019-06-28 2021-03-16 Intel Corporation Technologies for facilitating remote memory requests in accelerator devices
US20210209035A1 (en) 2020-12-26 2021-07-08 Intel Corporation Memory accesses using a memory hub

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080016269A1 (en) * 2004-03-17 2008-01-17 Super Talent Electronics Inc. Flash / Phase-Change Memory in Multi-Ring Topology Using Serial-Link Packet Interface
US7395358B2 (en) * 2004-12-29 2008-07-01 Nvidia Corporation Intelligent storage engine for disk drive operations with reduced local bus traffic
US7870316B1 (en) * 2006-12-29 2011-01-11 Unisys Corporation System and method for providing an inline data conversion for multiplexed data streams
US20120023233A1 (en) * 2010-01-05 2012-01-26 Hitachi, Ltd. Method for executing migration between virtual servers and server system used for the same
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
US8825964B1 (en) * 2011-09-26 2014-09-02 Emc Corporation Adaptive integration of cloud data services with a data storage system
US20150006594A1 (en) * 2013-07-01 2015-01-01 Cleversafe, Inc. Storing data in a dispersed storage network
US20160292009A1 (en) * 2013-12-20 2016-10-06 David Kaplan Execution offloading through syscall trap interface
US20150205542A1 (en) * 2014-01-22 2015-07-23 Vmware, Inc. Virtual machine migration in shared storage environment
US20170262638A1 (en) * 2015-09-25 2017-09-14 Eliot Horowitz Distributed database systems and methods with encrypted storage engines
US10120582B1 (en) * 2016-03-30 2018-11-06 Amazon Technologies, Inc. Dynamic cache management in storage devices
US20170289237A1 (en) * 2016-04-05 2017-10-05 International Business Machines Corporation Network file transfer including file obfuscation
US20180089324A1 (en) * 2016-09-26 2018-03-29 Splunk Inc. Dynamic resource allocation for real-time search

Cited By (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10402119B2 (en) * 2015-04-23 2019-09-03 Huawei Technologies Co., Ltd. Data format conversion apparatus and method and buffer chip
US11128553B2 (en) 2016-07-22 2021-09-21 Intel Corporation Technologies for switching network traffic in a data center
US11595277B2 (en) 2016-07-22 2023-02-28 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
US10785549B2 (en) 2016-07-22 2020-09-22 Intel Corporation Technologies for switching network traffic in a data center
US11995330B2 (en) 2016-11-29 2024-05-28 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US11977923B2 (en) 2016-11-29 2024-05-07 Intel Corporation Cloud-based scale-up system composition
US11630702B2 (en) * 2016-11-29 2023-04-18 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
US11137922B2 (en) 2016-11-29 2021-10-05 Intel Corporation Technologies for providing accelerated functions as a service in a disaggregated architecture
US20210255915A1 (en) * 2016-11-29 2021-08-19 Intel Corporation Cloud-based scale-up system composition
US11620491B2 (en) 2018-06-22 2023-04-04 Samsung Electronics Co., Ltd. Neural processor
US11216314B2 (en) * 2018-11-02 2022-01-04 EMC IP Holding Company LLC Dynamic reallocation of resources in accelerator-as-a-service computing environment
US11856724B2 (en) 2018-11-30 2023-12-26 Ovh System comprising a rack, with support members and components insertable in the rack and connectable via liquid connectors
US11439035B2 (en) 2018-11-30 2022-09-06 Ovh Rack adapted for receiving a component and system including the rack and the component
CN111263554A (en) * 2018-11-30 2020-06-09 Ovh公司 Rack adapted to receive a component and system comprising the rack and the component
US11617281B2 (en) 2019-02-13 2023-03-28 Ovh Rack adapted for receiving a component, system including the rack and the component and method of delivering power to a component mounted in a rack
US11211944B2 (en) 2019-04-17 2021-12-28 Samsung Electronics Co., Ltd. Mixed-precision compression with random access
US11671111B2 (en) 2019-04-17 2023-06-06 Samsung Electronics Co., Ltd. Hardware channel-parallel data compression/decompression
US11716095B2 (en) 2019-04-17 2023-08-01 Samsung Electronics Co., Ltd. Channel-parallel compression with random memory access
US11271588B2 (en) 2019-04-17 2022-03-08 Samsung Electronics Co., Ltd. Mixed-precision compression with random access
US11152952B2 (en) 2019-04-17 2021-10-19 Samsung Electronics Co., Ltd. Channel-parallel compression with random memory access
US11146283B2 (en) 2019-04-17 2021-10-12 Samsung Electronics Co., Ltd. Zero-collapsing compression with random access
US11664819B2 (en) 2019-04-17 2023-05-30 Samsung Electronics Co., Ltd. Homogenizing data sparsity using a butterfly multiplexer
US11381526B2 (en) * 2019-05-08 2022-07-05 Cisco Technology, Inc. Multi-tenant optimized serverless placement using smart network interface cards and commodity storage
US11776086B2 (en) * 2019-07-22 2023-10-03 Verizon Patent And Licensing Inc. System and methods for distributed GPU using Multi-access Edge Compute services
US20220005147A1 (en) * 2019-07-22 2022-01-06 Verizon Patent And Licensing Inc. System and methods for distributed gpu using multi-access edge compute services
US11151682B2 (en) * 2019-07-22 2021-10-19 Verizon Patent And Licensing Inc. System and methods for distributed GPU using multi-access edge compute services
US11792078B2 (en) * 2019-07-26 2023-10-17 Verizon Patent And Licensing Inc. Multi-access Edge Computing cloud discovery and communications
US11228539B2 (en) * 2019-08-14 2022-01-18 Intel Corporation Technologies for managing disaggregated accelerator networks based on remote direct memory access
US11151011B2 (en) 2019-10-01 2021-10-19 International Business Machines Corporation Uncore input/output latency analysis
US11656980B2 (en) * 2019-10-09 2023-05-23 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Extensible memory dual inline memory module
US11573839B1 (en) * 2019-11-21 2023-02-07 Amazon Technologies, Inc. Dynamic scheduling for live migration between cloud regions and edge locations
US11734038B1 (en) 2019-11-21 2023-08-22 Amazon Technologies, Inc Multiple simultaneous volume attachments for live migration between cloud regions and edge locations
US11461123B1 (en) 2019-11-21 2022-10-04 Amazon Technologies, Inc. Dynamic pre-copy and post-copy determination for live migration between cloud regions and edge locations
US11487592B2 (en) * 2020-01-22 2022-11-01 EMC IP Holding Company LLC Dynamic application migration across storage platforms
US11847057B2 (en) * 2021-09-27 2023-12-19 Sap Se Extended cache for efficient object store access by a database
US20230176974A1 (en) * 2021-09-27 2023-06-08 Sap Se Extended cache for efficient object store access by a database
US11567873B1 (en) * 2021-09-27 2023-01-31 Sap Se Extended cache for efficient object store access by a database

Also Published As

Publication number Publication date
US10768842B2 (en) 2020-09-08
US20180152201A1 (en) 2018-05-31
US20220317906A1 (en) 2022-10-06
US20180150293A1 (en) 2018-05-31
US20220107741A1 (en) 2022-04-07
DE102018006893A1 (en) 2018-12-06
US20180150299A1 (en) 2018-05-31
DE102018006890B4 (en) 2023-09-21
US20180150372A1 (en) 2018-05-31
WO2018102443A1 (en) 2018-06-07
US20180150256A1 (en) 2018-05-31
US20180150644A1 (en) 2018-05-31
US20220179575A1 (en) 2022-06-09
US20210365199A1 (en) 2021-11-25
DE102018214774A1 (en) 2019-01-24
DE102018214776A1 (en) 2018-12-06
US20180150391A1 (en) 2018-05-31
US10990309B2 (en) 2021-04-27
US20190307014A1 (en) 2019-10-03
US20230195346A1 (en) 2023-06-22
US10732879B2 (en) 2020-08-04
US11977923B2 (en) 2024-05-07
US20210318823A1 (en) 2021-10-14
US10795595B2 (en) 2020-10-06
US20180150343A1 (en) 2018-05-31
US20180152540A1 (en) 2018-05-31
US20180150334A1 (en) 2018-05-31
US10268412B2 (en) 2019-04-23
US11995330B2 (en) 2024-05-28
US20180152366A1 (en) 2018-05-31
US20180150298A1 (en) 2018-05-31
US10768841B2 (en) 2020-09-08
DE102018006894A1 (en) 2018-12-06
WO2018102441A1 (en) 2018-06-07
US20240143410A1 (en) 2024-05-02
WO2018102456A1 (en) 2018-06-07
US10824358B2 (en) 2020-11-03
WO2018102414A1 (en) 2018-06-07
US20200393986A1 (en) 2020-12-17
US20180152200A1 (en) 2018-05-31
US20230176919A1 (en) 2023-06-08
US11029870B2 (en) 2021-06-08
US10635338B2 (en) 2020-04-28
US11429297B2 (en) 2022-08-30
US20180150471A1 (en) 2018-05-31
US20200356294A1 (en) 2020-11-12
US20210141552A1 (en) 2021-05-13
US20210271403A1 (en) 2021-09-02
US10963176B2 (en) 2021-03-30
US10747457B2 (en) 2020-08-18
US20180151975A1 (en) 2018-05-31
US11687264B2 (en) 2023-06-27
US11307787B2 (en) 2022-04-19
US20180152317A1 (en) 2018-05-31
US10712963B2 (en) 2020-07-14
US20180152383A1 (en) 2018-05-31
US20180150330A1 (en) 2018-05-31
US11137922B2 (en) 2021-10-05
US11907557B2 (en) 2024-02-20
US10628068B2 (en) 2020-04-21
US11579788B2 (en) 2023-02-14
US10191684B2 (en) 2019-01-29
DE102018006890A1 (en) 2018-12-06
US10824360B2 (en) 2020-11-03
WO2018102416A1 (en) 2018-06-07
DE102018214775A1 (en) 2018-12-06
US11200104B2 (en) 2021-12-14
US11354053B2 (en) 2022-06-07
US20180152202A1 (en) 2018-05-31

Similar Documents

Publication Publication Date Title
US20180150240A1 (en) Technologies for offloading i/o intensive operations to a data storage sled
EP3460662A1 (en) Technologies for offloading i/o intensive operations to a data storage sled
US10313769B2 (en) Technologies for performing partially synchronized writes
US11630702B2 (en) Cloud-based scale-up system composition

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTEL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BERNAT, FRANCESC GUIM;KUMAR, KARTHIK;SCHMISSEUR, MARK A.;AND OTHERS;SIGNING DATES FROM 20171002 TO 20171006;REEL/FRAME:043818/0840

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: ADVISORY ACTION MAILED

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: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

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