US20190042611A1 - Technologies for structured database query for finding unique element values - Google Patents
Technologies for structured database query for finding unique element values Download PDFInfo
- Publication number
- US20190042611A1 US20190042611A1 US15/868,594 US201815868594A US2019042611A1 US 20190042611 A1 US20190042611 A1 US 20190042611A1 US 201815868594 A US201815868594 A US 201815868594A US 2019042611 A1 US2019042611 A1 US 2019042611A1
- Authority
- US
- United States
- Prior art keywords
- bit
- map output
- input data
- width
- accelerator
- 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
Links
- 238000005516 engineering process Methods 0.000 title abstract description 6
- 230000004044 response Effects 0.000 claims abstract description 74
- 238000000034 method Methods 0.000 claims description 48
- 230000008569 process Effects 0.000 claims description 16
- 238000007781 pre-processing Methods 0.000 claims description 14
- 230000006837 decompression Effects 0.000 claims description 3
- 230000003287 optical effect Effects 0.000 description 63
- 230000006870 function Effects 0.000 description 24
- 238000012545 processing Methods 0.000 description 17
- 239000004744 fabric Substances 0.000 description 15
- 238000010586 diagram Methods 0.000 description 14
- 238000004891 communication Methods 0.000 description 13
- 238000001816 cooling Methods 0.000 description 12
- 238000007726 management method Methods 0.000 description 11
- 230000011664 signaling Effects 0.000 description 11
- 238000012423 maintenance Methods 0.000 description 6
- 238000013500 data storage Methods 0.000 description 5
- 230000001965 increasing effect Effects 0.000 description 4
- 230000037361 pathway Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 101100498818 Arabidopsis thaliana DDR4 gene Proteins 0.000 description 1
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- QVGXLLKOCUKJST-UHFFFAOYSA-N atomic oxygen Chemical compound [O] QVGXLLKOCUKJST-UHFFFAOYSA-N 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000005387 chalcogenide glass Substances 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 229910044991 metal oxide Inorganic materials 0.000 description 1
- 150000004706 metal oxides Chemical class 0.000 description 1
- 239000002070 nanowire Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 229910052760 oxygen Inorganic materials 0.000 description 1
- 239000001301 oxygen Substances 0.000 description 1
- 238000013439 planning Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000000153 supplemental effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000005641 tunneling Effects 0.000 description 1
- 238000010624 twisted pair cabling Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key 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)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/18—Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
-
- G06F17/30324—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations 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/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J15/00—Gripping heads and other end effectors
- B25J15/0014—Gripping heads and other end effectors having fork, comb or plate shaped means for engaging the lower surface on a object to be transported
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/16—Constructional details or arrangements
- G06F1/18—Packaging or power distribution
- G06F1/183—Internal mounting support structures, e.g. for printed circuit boards, internal connecting means
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/16—Constructional details or arrangements
- G06F1/20—Cooling means
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3006—Monitoring 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording 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/3409—Recording 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording 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/3442—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for planning or managing the needed capacity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording 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/3466—Performance evaluation by tracing or monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0607—Interleaved addressing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/14—Protection against unauthorised use of memory or access to memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/16—Handling requests for interconnection or transfer for access to memory bus
- G06F13/1605—Handling requests for interconnection or transfer for access to memory bus based on arbitration
- G06F13/1652—Handling requests for interconnection or transfer for access to memory bus based on arbitration in a multiprocessor architecture
- G06F13/1663—Access to shared memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/16—Handling requests for interconnection or transfer for access to memory bus
- G06F13/1668—Details of memory controller
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/40—Bus structure
- G06F13/4063—Device-to-bus coupling
- G06F13/4068—Electrical coupling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/42—Bus transfer protocol, e.g. handshake; Synchronisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations 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/161—Computing infrastructure, e.g. computer clusters, blade chassis or hardware partitioning
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations 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/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17306—Intercommunication techniques
- G06F15/17331—Distributed shared memory [DSM], e.g. remote direct memory access [RDMA]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored program computers
- G06F15/78—Architectures of general purpose stored program computers comprising a single central processing unit
- G06F15/7807—System on chip, i.e. computer system on a single chip; System in package, i.e. computer system on one or more chips in a single package
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored program computers
- G06F15/78—Architectures of general purpose stored program computers comprising a single central processing unit
- G06F15/7867—Architectures of general purpose stored program computers comprising a single central processing unit with reconfigurable architecture
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/11—File system administration, e.g. details of archiving or snapshots
- G06F16/119—Details of migration of file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/221—Column-oriented storage; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2237—Vectors, bitmaps or matrices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2365—Ensuring data consistency and integrity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
-
- G06F17/30371—
-
- G06F17/30477—
-
- G06F17/30554—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
- G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0613—Improving I/O performance in relation to throughput
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0632—Configuration or reconfiguration of storage systems by initialisation or re-initialisation of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0647—Migration mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/065—Replication mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0662—Virtualisation aspects
- G06F3/0665—Virtualisation aspects at area level, e.g. provisioning of virtual or logical volumes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input 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/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0685—Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/34—Circuit design for reconfigurable circuits, e.g. field programmable gate arrays [FPGA] or programmable logic devices [PLD]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/22—Microcontrol or microprogram arrangements
- G06F9/28—Enhancement of operational speed, e.g. by using several microcontrol devices operating in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/4401—Bootstrapping
- G06F9/4406—Loading of operating system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/4401—Bootstrapping
- G06F9/4411—Configuring for operating with peripheral devices; Loading of device drivers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
- G06F9/4494—Execution paradigms, e.g. implementations of programming paradigms data driven
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation 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/505—Allocation 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
- G06F9/5088—Techniques for rebalancing the load in a distributed system involving task migration
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/02—Detection or location of defective auxiliary circuits, e.g. defective refresh counters
- G11C29/028—Detection or location of defective auxiliary circuits, e.g. defective refresh counters with adaption or trimming of parameters
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/36—Data generation devices, e.g. data inverters
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/38—Response verification devices
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/44—Indication or identification of errors, e.g. for repair
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C8/00—Arrangements for selecting an address in a digital store
- G11C8/12—Group selection circuits, e.g. for memory block selection, chip selection, array selection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/02—Standardisation; Integration
- H04L41/0213—Standardised network management protocols, e.g. simple network management protocol [SNMP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
- H04L41/0816—Configuration setting characterised by the conditions triggering a change of settings the condition being an adaptation, e.g. in response to network events
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
- H04L41/5025—Ensuring fulfilment of SLA by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/06—Generation of reports
- H04L43/065—Generation of reports related to network devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/781—Centralised allocation of resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/83—Admission control; Resource allocation based on usage prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/35—Switches specially adapted for specific applications
- H04L49/351—Switches specially adapted for specific applications for local area network [LAN], e.g. Ethernet switches
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9005—Buffering arrangements using dynamic buffer space allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/12—Protocol engines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/321—Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K7/00—Constructional details common to different types of electric apparatus
- H05K7/14—Mounting supporting structure in casing or on frame or rack
- H05K7/1485—Servers; Data center rooms, e.g. 19-inch computer racks
- H05K7/1488—Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures
- H05K7/1489—Cabinets therefor, e.g. chassis or racks or mechanical interfaces between blades and support structures characterized by the mounting of blades therein, e.g. brackets, rails, trays
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K7/00—Constructional details common to different types of electric apparatus
- H05K7/14—Mounting supporting structure in casing or on frame or rack
- H05K7/1485—Servers; Data center rooms, e.g. 19-inch computer racks
- H05K7/1498—Resource management, Optimisation arrangements, e.g. configuration, identification, tracking, physical location
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K7/00—Constructional details common to different types of electric apparatus
- H05K7/18—Construction of rack or frame
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K7/00—Constructional details common to different types of electric apparatus
- H05K7/20—Modifications to facilitate cooling, ventilating, or heating
- H05K7/20009—Modifications to facilitate cooling, ventilating, or heating using a gaseous coolant in electronic enclosures
- H05K7/20209—Thermal management, e.g. fan control
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K7/00—Constructional details common to different types of electric apparatus
- H05K7/20—Modifications to facilitate cooling, ventilating, or heating
- H05K7/20709—Modifications to facilitate cooling, ventilating, or heating for server racks or cabinets; for data centers, e.g. 19-inch computer racks
- H05K7/20718—Forced ventilation of a gaseous coolant
- H05K7/20736—Forced ventilation of a gaseous coolant within cabinets for removing heat from server blades
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1027—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
- G06F12/1045—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
- G06F12/1054—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache the data cache being concurrently physically addressed
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1027—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
- G06F12/1045—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache
- G06F12/1063—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] associated with a data cache the data cache being concurrently virtually addressed
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/38—Information transfer, e.g. on bus
- G06F13/40—Bus structure
- G06F13/4004—Coupling between buses
- G06F13/4022—Coupling between buses using switching circuits, e.g. switching matrix, connection or expansion network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations 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/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/1735—Network adapters, e.g. SCI, Myrinet
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/105—Arrangements for software license management or administration, e.g. for managing licenses at corporate level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2200/00—Indexing scheme relating to G06F1/04 - G06F1/32
- G06F2200/20—Indexing scheme relating to G06F1/20
- G06F2200/201—Cooling arrangements using cooling fluid
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/85—Active fault masking without idle spares
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/86—Event-based monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/885—Monitoring specific for caches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5019—Workload prediction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/509—Offload
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1041—Resource optimization
- G06F2212/1044—Space efficiency improvement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1052—Security improvement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/60—Details of cache memory
- G06F2212/601—Reconfiguration of cache memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2213/00—Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F2213/0026—PCI express
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2213/00—Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F2213/0064—Latency reduction in handling transfers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2213/00—Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F2213/38—Universal adapter
- G06F2213/3808—Network interface controller
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/4401—Bootstrapping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/485—Task life-cycle, e.g. stopping, restarting, resuming execution
- G06F9/4856—Task life-cycle, e.g. stopping, restarting, resuming execution resumption being on a different machine, e.g. task migration, virtual machine migration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation 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/5044—Allocation 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation 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/5055—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering software capabilities, i.e. software resources associated or available to the machine
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/06—Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons
- G06N3/063—Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons using electronic means
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/04—Network management architectures or arrangements
- H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/149—Network analysis or design for prediction of maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/16—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/34—Signalling channels for network management communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/40—Arrangements 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/20—Arrangements for monitoring or testing data switching networks the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/40—Constructional details, e.g. power supply, mechanical construction or backplane
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Definitions
- Unique values queries are typically performed by processors of a computing device to determine a presence of distinct or unique values in database.
- the unique values queries are often used to filter large database columns to obtain unique element values that are present in the database.
- processor-based implementations may require consumption of large amounts of power and other resources due to the amount of data that is required to be read into the processors.
- Modern computing devices may include general-purpose processor cores as well as a variety of hardware accelerators for performing specialized tasks.
- Certain computing devices may include one or more accelerators embodied as field-programmable gate arrays (FPGAs), which may include programmable digital logic resources that may be configured by the end user or system integrator.
- FPGAs field-programmable gate arrays
- 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 computing device for determining unique values
- FIG. 13 is a simplified block diagram of at least one embodiment of an environment that may be established by an accelerator of the computing device of FIG. 12 ;
- FIGS. 14 and 15 are a simplified flow diagram of at least one embodiment of a method for determining unique values that may be executed by the accelerator of FIGS. 12 and 13 .
- 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 921 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 921 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 919 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.
- the illustrative system 1200 includes a compute device 1202 that includes an accelerator 1204 , a memory 1206 , one or more processors 1208 , and one or more storage devices 1210 .
- the accelerator 1204 may filter a database to determine unique values.
- the accelerator 1204 may receive input data, which is a packed array of unsigned integers of column data from the database, to determine unique element values of the input data.
- the accelerator 1204 may construct a bit-map output table configured to store bit-map output bits based on query configuration data received from a processor 1208 , which includes a number of elements and an element width (N) of the input data and a hash width (K). It should be appreciated that the hash width (K) is less than or equal to the element width (N). Accordingly, the bit-map output table is sized to store 2 K number of bit-map output bits, each bit-map output bit corresponds to a unique element value of the input data or a unique hash value that may be generated from the input data. In the illustrative embodiment, the accelerator 1240 may construct a different type of bit-map output tables on the accelerator 1240 based on the hash width (K).
- the accelerator 1240 may construct a small bit-map output table with multiple write ports (e.g., muxes) to provide multiple writes per cycle.
- the accelerator 1240 may construct a large bit-map output table.
- the accelerator 1204 may configure the large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses, including parallel writes during input data processing into the large bit-map output table and parallel reads during read out processing of the large bit-map output table.
- the accelerator 1204 may generate a write request for each element to access the corresponding bit-map output table to set a bit-map output bit that corresponds to the element value of the corresponding element. To do so, the accelerator 1204 may adjust the element width (N) of the input data by pre-processing the packed bit vector of column data. The pre-processing of the input data may support unique values queries on any bit-width of elements of the database based on a data path width of the accelerator 1240 and may also ensure that a largest number of elements are processed in each cycle.
- the accelerator 1204 may use a corresponding element value of each element as a write request address to issue the write request to the corresponding bit-map output bit.
- the accelerator 1204 may perform the hash function on each element value to generate a hash value that is to be used as a write request address to access the bit-map output table to set the corresponding bit-map output bit.
- the accelerator 1204 may output the bit-map output table that includes 2 K bit-map output bits, where each set bit-map output bit indicates a presence of a corresponding unique element value or hash value.
- the accelerator 1204 may then transfer the bit-map output table to the memory 1206 of the compute device 1202 for further analysis or processing by one or more processors 1208 .
- the system 1200 may increase performance and power efficiency by avoiding moving a large amount of data to the processor(s) 1208 for the set membership queries.
- the database stored in the memory 1206 of the compute device 1202 includes a table with a list of names of people, their residency information, and their income.
- the processor 1208 requests the accelerator 1204 to find how many unique state(s) there are in the database.
- the accelerator 1204 generates a bit-map output table, which is configured to store bit-map output bits for every possible state of the input data.
- the bit-map output table includes 50 bit-map output bits to represent 50 states.
- the accelerator 1204 receives the residency information column data from the memory 1206 , determines the state that each element or people live in, and sets a bit-map output bit that corresponds to each state.
- the accelerator 1204 sets a bit-map output bit of the bit-map output table that corresponds to Indiana to 1. Accordingly, if there are 10 unique states in the database, meaning that all people live in one of those 10 states, the accelerator 1204 outputs the bit-map output table that includes 10 bit-map output bits that have value of 1.
- the accelerator 1204 may be embodied as any coprocessor, application-specific integrated circuit (ASIC), field-programmable gate array (FPGA), a system-on-a-chip (SOC), an application specific integrated circuit (ASIC), functional block, IP core, or other hardware accelerator of the compute device 1202 capable of performing the functions described herein.
- the accelerator 1204 is configured to determine unique element values from the database. To do so, as shown in FIG. 12 , the accelerator 1204 includes a decompressor 1212 , an input pre-processing unit 1214 , a write request generator unit 1216 , and an output processing unit 1218 .
- the accelerator 1204 also includes a definition table 1220 that may be stored in external memory 1222 of the accelerator 1204 and local memory 1224 of the accelerator 1204 .
- the decompressor 1212 may be embodied as any hardware component(s) or circuitry capable of decompressing the input data.
- the input data is compressed column data stored in the memory 1206 .
- the decompressor 1212 may determine whether the input data is compressed data and decompress the compressed input data in response to determining that the input data is compressed.
- the input pre-processing unit 1214 may be embodied as any hardware component(s) or circuitry capable of pre-processing the input data to support unique values queries on any bit-width of elements of the database. To do so, the input pre-processing unit 1214 may determine a largest power of 2 elements (i.e., 2 m elements) that is to be processed in each cycle as a function of an element width of the input data and a data path width of the accelerator 1204 . The input pre-processing unit 1214 may align the elements of the uncompressed input data (e.g., the packed bit vector of column data) and prepend zero to each element of the input data based on the data path width in order to process the largest power of 2 elements per cycle.
- the uncompressed input data e.g., the packed bit vector of column data
- the input pre-processing unit 1214 may process 32 elements for an element width of 1 bit, 16 elements for an element width of 2 bits, 8 elements for element widths 3 or 4 bits, 4 elements for element widths from 5 to 8 bits, and so on.
- the write request generator unit 1216 may be embodied as any hardware component(s) or circuitry capable of generating a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element. To do so, the write request generator unit 1216 may generate a write request address for the corresponding element to access a corresponding bit-map output bit of the bit-map output table. Since the input data is pre-processed, the write request generator unit 1216 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table.
- the write request generator unit 1216 may compute a K-bit hash value that corresponds to the element value of the corresponding element and use the hash value as a write request address for the corresponding element to access the bit-map output table.
- the hash function may be programmed based on the element width (N) of the input data and the hash width (K) indicated in the query configuration data. For example, the write request generator unit 1216 may extract K bits of the N-bit element by truncating a number of upper and/or lower bits of the N-bit element. In some embodiments, the hash function may be performed prior to pre-processing the input data.
- the output processing unit 1218 may be embodied as any hardware component(s) or circuitry capable of outputting the bit-map output table, where each set bit-map output bit of the bit-map output table (e.g., a bit-map output bit that has a value of 1) indicates a presence of a unique element value corresponds to the bit-map output bit.
- the output processing unit 1218 may be further configured to accumulate the bit-map output bits until a width of the bit-map output bits reaches the data path width to transmit the bit-map output bits to the memory 1206 for further analysis by one or more processors 1208 .
- the output processing unit 1218 may directly communicate with one or more processors 1208 to transmit the bit-map output table.
- the processor 1208 may be embodied as any type of processor capable of performing the functions described herein.
- the processor 1208 may be embodied as a single or multi-core processor(s), digital signal processor, microcontroller, or other processor or processing/controlling circuit.
- the memory 1206 may be embodied as any type of volatile or non-volatile memory or data storage capable of performing the functions described herein. In operation, the memory 1206 may store various data and software used during operation of the compute device 1202 such operating systems, applications, programs, libraries, and drivers.
- the memory 1206 is communicatively coupled to the processor 1208 via the input/output (I/O) subsystem (not shown), which may be embodied as circuitry and/or components to facilitate input/output operations with the processor 1208 , the accelerator 1204 , the memory 1206 , the one or more storage devices 1210 , and other components of the compute device 1202 .
- the I/O subsystem may be embodied as, or otherwise include, memory controller hubs, input/output control hubs, sensor hubs, firmware devices, communication links (i.e., 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 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with the processor 1208 , the memory 1206 , and other components of the compute device 1202 , on a single integrated circuit chip.
- SoC system-on-a-chip
- the memory 1206 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.
- all or a portion of the memory 1206 may be integrated into the processor 1208 .
- the memory 1206 may store various software and data used during operation such as resource utilization data, resource availability data, application programming interface (API) data, applications, programs, and libraries.
- API application programming interface
- the illustrative storage devices 1210 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 storage device 1210 may include a system partition that stores data and firmware code for the storage device 1210 .
- Each storage device 1210 may also include one or more operating system partitions that store data files and executables for operating systems.
- the functions of the compute device 1202 may be performed by one or more sleds in a data center.
- the accelerator 1204 may be embodied as one or more accelerator sled 204 - 2 (e.g., physical accelerator resources 205 - 2 )
- the memory 1206 may be embodied as one or more memory sled 204 - 3 (e.g., physical memory resources 205 - 3 )
- one or more processors 1208 may be embodied as one or more compute sled 204 - 4 (e.g., physical compute resources 205 - 4 )
- one or more storage devices 1210 may be embodied as one or more storage sleds 204 - 1 (e.g., physical storage resources 205 - 1 ).
- the accelerator 1204 of the compute device 1202 may establish an environment 1300 during operation.
- the environment 1300 includes a large bit-map output table 1340 and a small bit-map output table 1350 .
- the large bit-map output table 1340 may be embodied as any data indicative of bit-map output bits for elements that have a bit-width greater than a predefined number of bit-width.
- the small bit-map output table 1350 may be embodied as any data indicative of bit-map output bits for elements that have a bit-width smaller than the predefined number of bit-width.
- each bit-map output bit that is set indicates a presence of unique element value. It should be appreciated that, in the embodiment where the hash width (K) is less than the element width (N), each bit-map output bit that is set indicates a presence of a hash value, which corresponds to a unique element value.
- the illustrative environment 1300 includes an input/output (I/O) communicator 1310 , a decompressor 1320 , and complex filter 1330 .
- the complex filter 1330 further includes a bit-map table generator 1332 , an input data pre-processor 1334 , a write request generator 1336 , and a bit-map output generator 1338 .
- Each of the components of the environment 1300 may be embodied as hardware, firmware, software, or a combination thereof.
- one or more of the components of the environment 1300 may be embodied as circuitry or a collection of electrical devices (e.g., I/O communicator circuitry 1310 , decompressor circuitry 1320 , complex filter circuitry 1330 , bit-map table generator circuitry 1332 , input data pre-processor circuitry 1334 , write request generator circuitry 1336 , bit-map output generator circuitry 1338 , etc.).
- the I/O communicator 1310 is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from the accelerator 1204 , respectively.
- the I/O communicator 1310 is configured to receive and process data from the memory 1206 based on unique values queries received from a processor 1208 of the compute device 1202 .
- the I/O communicator 1310 is further configured to transmit a bit-map output data to the memory 1206 .
- the accelerator 1204 may receive from or transmit to one or more storage devices 1210 . Accordingly, in some embodiments, at least a portion of the functionality of the I/O communicator 1310 may be performed by communication circuitry of the compute device 1202 .
- the decompressor 1320 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to decompress the input data.
- the decompressor 1212 is configured to determine whether the input data is compressed data and decompress the compressed input data in response to determining that the input data is compressed.
- the complex filter 1330 which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to filter the input data to determine unique element values of the input data. To do so, the complex filter 1330 includes the bit-map table generator 1332 , the input data pre-processor 1334 , the write request generator 1336 , and the bit-map output generator 1338 .
- the bit-map table generator 1332 is configured to generate a bit-map output table.
- the bit-map output table is configured to store bit-map output bits, where each bit-map output bit corresponds to a unique element value or hash value of the input data.
- the bit-map output table has 2 K number of bit-map output bits to represent 2 K unique element values.
- the bit-map table generator 1332 is configured to construct a different type of definition table (e.g., a small or large bit-map output table) on the accelerator 1240 based on the hash width (K).
- the bit-map table generator 1332 determines that the hash width (K) is less than a predefined width, the bit-map table generator 1332 constructs a small bit-map output table that has many write ports as necessary to satisfy a target throughput based on the width of the data path of the accelerator 1204 . For example, if the hash width (K) is less than 8 bits, the bit-map output bits are stored in a small bit-map output table with multiple write ports to provide multiple writes per cycle. To generate a bit-map output table that supports elements up to 8 bits, the bit-map table generator 1332 implements 256 flip flops to construct a small bit-map output table.
- the bit-map table generator 1332 constructs the small bit-map output table with 2 flip flops for 32 write ports of a 1 bit element (e.g., 2:1 multiplexers), 4 flip flops for 16 write ports of a 2 bit element (e.g., 4:1 multiplexers), 16 flip flops for 8 write ports of a 3 or 4 bit element (e.g., 16:1 multiplexers), and remaining flip flops for 4 write ports.
- the hash width (K) is greater than 8 bits, the bit-map output bits are stored in a large bit-map output table.
- the accelerator 1204 may configure the large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses. It should be appreciated that, in some embodiments, the accelerator 1204 may also configure the small bit-map output table to store multiple copies of the bit-map output bits to support multiple accesses.
- the input data pre-processor 1334 is configured to pre-process the input data to support unique element values queries on any bit-width of elements of the database. To do so, the input data pre-processor 1334 is configured to determine a largest power of 2 elements (i.e., 2 m elements) that is to be processed in each cycle as a function of an element width of the input data and a data path width of the accelerator 1204 . The input data pre-processor 1334 is further configured to align the elements of the uncompressed input data (i.e., the packed bit vector of column data) and prepend zero to each element of the input data based on the data path width in order to process the largest power of 2 elements per cycle.
- the uncompressed input data i.e., the packed bit vector of column data
- the input data pre-processor 1334 may process 32 elements for element with 1 bit, 16 elements for element width of 2 bits, 8 elements for element widths 3 or 4 bits, or 4 elements for element widths from 5 to 8 bits, and so on.
- the write request generator 1336 is configured to generate a write request for each element of the input data to access the corresponding bit-map output table to set a corresponding bit-map output bit of the bit-map output table. To do so, the accelerator 1204 may generate a write request address for the corresponding element to access the bit-map output table. Since the input data is pre-processed and aligned with the bit-map output table, if the element width (N) and the hash width (K) are the same, the accelerator 1204 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table.
- the accelerator 1204 may extract each element and use a corresponding hash value as a write request address to issue a write request to the corresponding bit-map output table. To do so, the accelerator 1204 is configured to generate a hash value that corresponds to each element value for every element of the input data using a hash function that is configured based the element width (N) and the hash width (N).
- the bit-map output generator 1338 is configured to output the bit-map output table that indicates unique element values that are present in the input data.
- the bit-map output table may include duplicate copies of the bit-map output to support parallel accesses by mimicking multiple write ported memory.
- the bit-map output generator 1338 may combine the corresponding bits from each copy of the bit-map output by using a logical OR operation to generate the true bit-map output bit of the bit-map output table. It should be appreciated that each bit-map output bit of the bit-map output table that has been set indicates a presence of a unique element value that corresponds to the bit-map output bit.
- the bit-map output generator 1338 may be configured to determine a total number of unique element values that are present in the input data by adding a number of bit-map output bits that have been set.
- the bit-map output generator 1338 may be further configured to accumulate the bit-map output bit data until a width of the bit-map output reaches the data path width and transmit the bit-map output bit data to the memory 1206 for further analysis or processing by one or more processors 1208 .
- the bit-map output generator 1338 may directly communicate with one or more processors 1208 to transmit the bit-map output bit table.
- the accelerator 1204 of the compute device 1202 may execute a method 1400 for determining unique element values.
- the method 1400 begins with block 1402 , in which the accelerator 1204 imports input data from the memory 1206 of the compute device 1202 .
- the input data is compressed data stored in the memory 1206 .
- the accelerator 1204 decompresses the compressed input data as indicated in block 1404 .
- the accelerator 1204 receives query configuration data from a requesting processor 1208 of the compute device 1202 .
- the accelerator 1204 may receive from the processor 1208 a pointer to query configuration data in the memory 1206 .
- the query configuration data may be received from other components of the compute device 1202 .
- the query configuration data may include a number of elements and an element width (N) of the input data and a hash width (K). Accordingly, in block 1408 , the accelerator 1204 determines a number elements and an element width (N) of the input data.
- the accelerator 1204 may determine a hash width (K) if the element width (N) of the input data is different from the hash width (K). Additionally, in block 1412 , the accelerator 1204 determines a number of elements to be processed per cycle based on the element width (N) and a data path width of the accelerator 1204 .
- the accelerator 1204 constructs a bit-map output table that is configured to store bit-map output bits.
- the bit-map output bits represent all possible element values of the input data, such that each bit-map output bit represents a unique element value of the input data.
- the bit-map output table includes two to the hash width (K) power number of bit-map output bits.
- K hash width
- the bit-map output bits for a 8-bit hash width includes 2 8 or 256 bits
- the bit-map output bits for a 32-bit hash width includes 2 32 bits or 512 MB, and so on. It should be appreciated that, in the illustrative embodiment, all bit-map output bits stored in the bit-map output table are initially cleared (e.g., a default value of 0).
- the accelerator 1240 configures a different bit-map output table on the accelerator 1240 based on the hash width (K).
- the accelerator 1204 determines whether the hash width (K) is greater than a predefined width. If the accelerator 1204 determines that the hash width (K) is smaller than the predefined threshold of element width, the method 1400 advances to block 1416 .
- the accelerator 1204 constructs a small bit-map output table to store the bit-map output bits.
- the small bit-map output table is to support multiple write ports to provide multiple writes per cycle as indicated in block 1418 . For example, if the element width is less than 8 bits, the bit-map output bits are stored in a small bit-map output table with multiple write ports to provide multiple writes per cycle.
- the method 1400 advances to block 1420 .
- the accelerator 1204 constructs a large bit-map output table to store the bit-map output bits.
- multiple write ports may be implemented to construct a small bit-map output table for processing data having a small element width, implementing multiple write ports for a large data having a large element width may be impractical and costly.
- the accelerator 1204 may store duplicate copies of the bit-map output bits to support parallel accesses per cycle as indicated in block 1422 .
- bit-map output bits are stored in different banks such that each membership bit vector in each bank is accessed simultaneously, thereby supporting parallel accesses. For example, if the width of each element is greater than 8 bits, the accelerator 1204 may configure a large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses.
- the accelerator 1204 determines whether the element width (N) equals to the hash width (K). If the accelerator 1204 determines that the element width (N) and the hash width (K) are the same, the method 1400 skips ahead to block 1428 shown in FIG. 15 . If, however, the accelerator 1204 determines that the element width (N) is different than the hash width (K), the method 1400 advances to block 1426 , in which the accelerator 1204 programs a hash function that is configured to generate a K-bit hash value from a N-bit element value for every elements of the input data.
- the accelerator 1204 pre-processes the input data to prepare the elements of the input data for the unique element value function. To do so, the accelerator 1204 may align the elements of the input data (i.e., the packed array of unsigned integers of column data) based on the number of elements that is to be processed in each cycle as indicated in block 1430 . As described above, the number of elements that is to be processed in each cycle is determined based on the element width (N) of the input data and a data path width of the accelerator 1204 .
- N element width
- the accelerator 1204 may prepend zeros to each element of the input data based on the data path width in order to process a largest power of 2 elements per cycle (i.e., largest 2 m elements/cycle). For example, if the accelerator 1204 has a 32 bit wide data path, the accelerator 1204 may process 32 elements for element with 1 bit, 16 elements for element width of 2 bits, 8 elements for element widths 3 or 4 bits, or 4 elements for element widths from 5 to 8 bits, and so on.
- the accelerator 1204 generates a write request for each element of the input data to access the corresponding bit-map output table to set a corresponding bit-map output bit of the bit-map output table. To do so, the accelerator 1204 may generate a write request address for the corresponding element to access the bit-map output table. Since the input data is pre-processed and aligned with the bit-map output table, if the element width (N) and the hash width (K) are the same, the accelerator 1204 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table as indicated in block 1436 .
- the accelerator 1204 may use a corresponding hash value as a write request address to issue a write request to the corresponding bit-map output table as indicated in block 1438 . To do so, in block 1440 , the accelerator 1204 generates a hash value that corresponds to each element value for every element of the input data. In block 1442 , the write request is transmitted to the corresponding bit-map output table. In response to generating the write requests for each element of the input data, in block 1444 , the accelerator 1204 accesses the corresponding bit-map output table to set the corresponding bit-map output bits based on the write requests.
- the accelerator 1204 output the bit-map output table that includes the bit-map output bits indicating unique element values that are present in the input data.
- each output bit of the bit-map output table that has been set corresponds to a presence of a unique element value.
- a total number of unique elements present in the input data may be determined by generating a population count by adding a number of bit-map output bits that have been set as indicated in block 1448 .
- the accelerator 1204 may accumulate the bit-map output table data until a width of the bit-map output table data reaches the data path width of the accelerator and transmit the bit-map output table to the memory 1206 for further processing by one or more processors 1208 .
- the bit-map output table may be directly transmitted to the processor 1208 .
- 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 device for determining unique values, the compute device comprising one or more accelerator devices, each accelerator device is to receive input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; generate, in response to receiving the query configuration data, a bit-map output table based on the query configuration data; generate a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; set the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generation of the write request; and output the bit-map output table indicative of unique elements that are present in the input data in response to setting of the corresponding bit-map output bit.
- Example 2 includes the subject matter of Example 1, and wherein the each accelerator is further to decompress, in response to importation of the input data, the input data; and pre-process, in response to decompression of the input data, the decompressed input data.
- Example 3 includes the subject matter of any of Examples 1 and 2, and wherein to pre-process the decompressed input data comprises to align elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and prepend zeroes to match a data path width.
- Example 5 includes the subject matter of any of Examples 1-4, and wherein the each accelerator is further to determine whether the element width is greater than the hash width; program, in response to a determination that the element width is greater than the hash width, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and generate, in response to programming of the hash function, a hash value for each element value by performing the hash function on the input data.
- Example 6 includes the subject matter of any of Examples 1-5, and wherein to generate the write request comprises to generate a write request address based on a hash value of the corresponding element.
- Example 7 includes the subject matter of any of Examples 1-6, and wherein to generate the write request comprises to determine a write request address based on an element value of the corresponding element.
- Example 8 includes the subject matter of any of Examples 1-7, and wherein to generate the bit-map output table based on the query configuration data comprises to determine whether the element width of the input data exceeds a threshold; construct, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and construct, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 9 includes the subject matter of any of Examples 1-8, and wherein the large bit-map output table supports parallel accesses by duplication of the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplication of the bit-map output table.
- Example 10 includes the subject matter of any of Examples 1-9, and wherein to set the corresponding bit-map output bit comprises to determine whether the element width exceeds a threshold; access, in response to a determination that the element width exceeds the threshold, the large bit-map output table to set the corresponding bit-map output bit; and access, in response to a determination that the element width does not exceed the threshold, the small bit-map output table to set the corresponding bit-map output bit.
- Example 11 includes the subject matter of any of Examples 1-10, and wherein to output the bit-map output table comprises to generate a population count indicating a number of unique elements based on the bit-map output table.
- Example 12 includes the subject matter of any of Examples 1-11, and wherein the each accelerator is further to accumulate the bit-map output table until a width of the bit-map output table matches a data path width.
- Example 13 includes a method for determining unique values by a compute device, the method comprising receiving, by an accelerator of the compute device, input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; generating, in response to receiving the query configuration data and by the accelerator, a bit-map output table based on the query configuration data; generating, by the accelerator, a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; setting, by the accelerator, the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generating the write request; and outputting, by the accelerator, the bit-map output table indicative of unique elements that are present in the input data in response to setting the corresponding bit-map output bit.
- Example 14 includes the subject matter of Example 13, and further including decompressing, in response to importing the input data and by the accelerator, the input data; and pre-processing, in response to decompressing the input data and by the accelerator, the decompressed input data.
- Example 15 includes the subject matter of any of Examples 13 and 14, and wherein pre-processing the decompressed input data comprises aligning, by the accelerator, elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and prepending, by the accelerator, zeroes to match a data path width.
- Example 16 includes the subject matter of any of Examples 13-15, and wherein the query configuration data further includes a hash width.
- Example 17 includes the subject matter of any of Examples 13-16, and further including determining, by the accelerator, whether the element width is greater than the hash width; programming, in response to a determination that the element width is greater than the hash width and by the accelerator, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and generating, in response to programming the hash function and by the accelerator, a hash value for each element value by performing the hash function on the input data.
- Example 18 includes the subject matter of any of Examples 13-17, and wherein generating the write comprises determining, by the accelerator, a write request address based on a hash value of the corresponding element.
- Example 19 includes the subject matter of any of Examples 13-18, and wherein generating the write comprises determining, by the accelerator, a write request address based on an element value of the corresponding element.
- Example 20 includes the subject matter of any of Examples 13-19, and wherein generating the bit-map output table based on the query configuration data comprises determining, by the accelerator, whether the element width of the input data exceeds a threshold; constructing, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and constructing, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 21 includes the subject matter of any of Examples 13-20, and wherein the large bit-map output table supports parallel accesses by duplicating the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplicating the bit-map output table.
- Example 22 includes the subject matter of any of Examples 13-21, and wherein setting the corresponding bit-map output bit comprises determining, by the accelerator, whether the element width exceeds a threshold; accessing, in response to a determination that the element width exceeds the threshold and by the accelerator, the large bit-map output table to set the corresponding bit-map output bit; and accessing, in response to a determination that the element width does not exceed the threshold and by the accelerator, the small bit-map output table to set the corresponding bit-map output bit.
- Example 23 includes the subject matter of any of Examples 13-22, and wherein outputting the bit-map output table comprises generating, by the accelerator, a population count indicating a number of unique elements based on the bit-map output table.
- Example 24 includes the subject matter of any of Examples 13-23, and further including accumulating, by the accelerator, the bit-map output table until a width of the bit-map output table matches a data path width.
- Example 25 includes a compute device comprising means for performing the method of any of Examples 13-24.
- Example 26 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a compute device to perform the method of any of Examples 13-24.
- Example 27 includes a compute device comprising a compute engine to perform the method of any of Examples 13-24.
- Example 28 includes a compute device for determining unique values, the compute device comprising one or more accelerator devices, each accelerator device comprising means for receiving input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; means for generating, in response to receiving the query configuration data, a bit-map output table based on the query configuration data; means for generating a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; means for setting the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generating the write request; and means for outputting the bit-map output table indicative of unique elements that are present in the input data in response to setting the corresponding bit-map output bit.
- Example 29 includes the subject matter of Example 28, and wherein the each accelerator device further comprises means for decompressing, in response to importing the input data, the input data; and means for pre-processing, in response to decompressing the input data, the decompressed input data.
- Example 30 includes the subject matter of any of Examples 28 and 29, and wherein the means for pre-processing the decompressed input data comprises means for aligning elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and means for prepending zeroes to match a data path width.
- Example 31 includes the subject matter of any of Examples 28-30, and wherein the query configuration data further includes a hash width.
- Example 32 includes the subject matter of any of Examples 28-31, and wherein the each accelerator further comprises means for determining whether the element width is greater than the hash width; means for programming, in response to a determination that the element width is greater than the hash width, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and means for generating, in response to programming the hash function, a hash value for each element value by performing the hash function on the input data.
- Example 33 includes the subject matter of any of Examples 28-32, and wherein the means for generating the write comprises means for determining a write request address based on a hash value of the corresponding element.
- Example 34 includes the subject matter of any of Examples 28-33, and wherein the means for generating the write comprises means for determining a write request address based on an element value of the corresponding element.
- Example 35 includes the subject matter of any of Examples 28-34, and wherein the means for generating the bit-map output table based on the query configuration data comprises means for determining whether the element width of the input data exceeds a threshold; means for constructing, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and means for constructing, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 36 includes the subject matter of any of Examples 28-35, and wherein the large bit-map output table supports parallel accesses by duplicating the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplicating the bit-map output table.
- Example 37 includes the subject matter of any of Examples 28-36, and wherein the means for setting the corresponding bit-map output bit comprises means for determining whether the element width exceeds a threshold; means for accessing, in response to a determination that the element width exceeds the threshold, the large bit-map output table to set the corresponding bit-map output bit; and means for accessing, in response to a determination that the element width does not exceed the threshold, the small bit-map output table to set the corresponding bit-map output bit.
- Example 38 includes the subject matter of any of Examples 28-37, and wherein the means for outputting the bit-map output table comprises means for generating a population count indicating a number of unique elements based on the bit-map output table.
- Example 39 includes the subject matter of any of Examples 28-38, and wherein the each accelerator further comprises means for accumulating the bit-map output table until a width of the bit-map output table matches a data path width.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Human Computer Interaction (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer Security & Cryptography (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Quality & Reliability (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Computing Systems (AREA)
- Thermal Sciences (AREA)
- Geometry (AREA)
- Evolutionary Computation (AREA)
- Robotics (AREA)
- Mechanical Engineering (AREA)
- Power Engineering (AREA)
- Environmental & Geological Engineering (AREA)
- Cooling Or The Like Of Electrical Apparatus (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Multi Processors (AREA)
- Debugging And Monitoring (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Small-Scale Networks (AREA)
- Optical Communication System (AREA)
- Storage Device Security (AREA)
Abstract
Description
- The present application claims the benefit of Indian Provisional Patent Application No. 201741030632, filed Aug. 30, 2017, and U.S. Provisional Patent Application No. 62/584,401, filed Nov. 10, 2017.
- Unique values queries are typically performed by processors of a computing device to determine a presence of distinct or unique values in database. The unique values queries are often used to filter large database columns to obtain unique element values that are present in the database. However, processor-based implementations may require consumption of large amounts of power and other resources due to the amount of data that is required to be read into the processors.
- Modern computing devices may include general-purpose processor cores as well as a variety of hardware accelerators for performing specialized tasks. Certain computing devices may include one or more accelerators embodied as field-programmable gate arrays (FPGAs), which may include programmable digital logic resources that may be configured by the end user or system integrator.
- 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 ofFIG. 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 ofFIGS. 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 inFIGS. 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 ofFIG. 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 ofFIG. 8 ; -
FIG. 10 is a diagram of an example embodiment of a sled designed for use in conjunction with the rack ofFIG. 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 computing device for determining unique values; -
FIG. 13 is a simplified block diagram of at least one embodiment of an environment that may be established by an accelerator of the computing device ofFIG. 12 ; and -
FIGS. 14 and 15 are a simplified flow diagram of at least one embodiment of a method for determining unique values that may be executed by the accelerator ofFIGS. 12 and 13 . - 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 adata 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 inFIG. 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 inFIG. 1 ,data center 100 contains fourracks 102A to 102D, which house computing equipment comprising respective sets of physical resources (PCRs) 105A to 105D. According to this example, a collective set ofphysical resources 106 ofdata center 100 includes the various sets ofphysical resources 105A to 105D that are distributed amongracks 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 eachrack - 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, thedata 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. Theillustrative 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 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, theracks -
FIG. 2 illustrates an exemplary logical configuration of arack 202 of thedata center 100. As shown inFIG. 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 inFIG. 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 ofphysical resources 206 comprised inrack 202. With respect toFIG. 1 , ifrack 202 is representative of—for example—rack 102A, thenphysical resources 206 may correspond to thephysical resources 105A comprised inrack 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 ofrack 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 adata 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 inFIG. 3 ,data center 300 comprises racks 302-1 to 302-32. In various embodiments, the racks ofdata center 300 may be arranged in such fashion as to define and/or accommodate various access pathways. For example, as shown inFIG. 3 , the racks ofdata center 300 may be arranged in such fashion as to define and/or accommodateaccess pathways data center 300 and perform automated maintenance tasks (e.g., replace a failed sled, upgrade a sled). In various embodiments, the dimensions ofaccess pathways 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 adata 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 inFIG. 4 ,data center 400 may feature anoptical 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 indata center 400 can send signals to (and receive signals from) each of the other sleds indata center 400. The signaling connectivity thatoptical 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 inFIG. 4 ,data center 400 includes fourracks 402A to 402D.Racks 402A to 402D house respective pairs ofsleds 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. Viaoptical fabric 412, each such sled may possess signaling connectivity with each of the seven other sleds indata center 400. For example, viaoptical fabric 412,sled 404A-1 inrack 402A may possess signaling connectivity withsled 404A-2 inrack 402A, as well as the sixother sleds 404B-1, 404B-2, 404C-1, 404C-2, 404D-1, and 404D-2 that are distributed among theother racks data center 400. The embodiments are not limited to this example. -
FIG. 5 illustrates an overview of aconnectivity 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 ofexample data centers FIGS. 1, 3, and 4 .Connectivity scheme 500 may be implemented using an optical fabric that features a dual-modeoptical switching infrastructure 514. Dual-modeoptical 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-modeoptical switching infrastructure 514 may be implemented using one or more dual-modeoptical switches 515. In various embodiments, dual-modeoptical switches 515 may generally comprise high-radix switches. In some embodiments, dual-modeoptical switches 515 may comprise multi-ply switches, such as four-ply switches. In various embodiments, dual-modeoptical 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-modeoptical switches 515 may constituteleaf 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 ofsleds 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 arack architecture 600 that may be representative of an architecture of any particular one of the racks depicted inFIGS. 1 to 4 according to some embodiments. As reflected inFIG. 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 arack access region 601. In the particular non-limiting example depicted inFIG. 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 asled 704 that may be representative of a sled of such a type. As shown inFIG. 7 ,sled 704 may comprise a set ofphysical resources 705, as well as anMPCM 716 designed to couple with a counterpart MPCM whensled 704 is inserted into a sled space such as any of sled spaces 603-1 to 603-5 ofFIG. 6 .Sled 704 may also feature anexpansion 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 anexpansion sled 718. By coupling with a counterpart connector onexpansion sled 718,expansion connector 717 may providephysical resources 705 with access tosupplemental computing resources 705B residing onexpansion sled 718. The embodiments are not limited in this context. -
FIG. 8 illustrates an example of arack 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 assled 704 ofFIG. 7 . In the particular non-limiting example depicted inFIG. 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 asexpansion sled 718 ofFIG. 7 , in the event that the inserted sled is configured with such a module. -
FIG. 9 illustrates an example of arack 902 that may be representative of a rack implemented according torack architecture 800 ofFIG. 8 according to some embodiments. In the particular non-limiting example depicted inFIG. 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 inrack 902 may be implemented using an air cooling system. For example, as reflected inFIG. 9 ,rack 902 may feature a plurality offans 921 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 “1 U” server height. In such embodiments,fans 921 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 919 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-modeoptical switching infrastructure 514 ofFIG. 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-modeoptical 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 ofrack 902. In various embodiments, optical interconnect loom 923 may be arranged to pass through a support post or other type of load-bearing element ofrack 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 asled 1004 that may be representative of a sled designed for use in conjunction withrack 902 ofFIG. 9 according to some embodiments.Sled 1004 may feature anMPCM 1016 that comprises anoptical connector 1016A and apower connector 1016B, and that is designed to couple with a counterpart MPCM of a sled space in conjunction with insertion ofMPCM 1016 into that sled space.Coupling MPCM 1016 with such a counterpart MPCM may causepower connector 1016 to couple with a power connector comprised in the counterpart MPCM. This may generally enablephysical resources 1005 ofsled 1004 to source power from an external source, viapower connector 1016 andpower transmission media 1024 that conductively couplespower connector 1016 tophysical 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-modeoptical switching infrastructure 914 ofFIG. 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 moreoptical 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 causeoptical 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 ofoptical channels 1025. Dual-mode optical network interface circuitry 1026 may communicate with thephysical resources 1005 ofsled 1004 viaelectrical 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 toFIG. 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 byphysical resources 1005. It is worthy of note that although theexample sled 1004 depicted inFIG. 10 does not feature an expansion connector, any given sled that features the design elements ofsled 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 adata 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 inFIG. 11 , a physicalinfrastructure management framework 1150A may be implemented to facilitate management of aphysical infrastructure 1100A ofdata center 1100. In various embodiments, one function of physicalinfrastructure management framework 1150A may be to manage automated maintenance functions withindata center 1100, such as the use of robotic maintenance equipment to service computing equipment withinphysical 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 ofphysical 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, physicalinfrastructure 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 , thephysical infrastructure 1100A ofdata center 1100 may comprise anoptical 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 ofFIG. 4 and dual-modeoptical switching infrastructure 514 ofFIG. 5 , respectively, and may provide high-bandwidth, low-latency, multi-protocol connectivity among sleds ofdata center 1100. As discussed above, with reference toFIG. 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 pooledaccelerator sleds 1130 may be included among thephysical infrastructure 1100A ofdata 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 viaoptical 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 thephysical infrastructure 1100A ofdata center 1100, each of which may comprise a pool of storage resources that is globally accessible to other sleds viaoptical fabric 1112 and dual-mode optical switching infrastructure 1114. In some embodiments, such pooledstorage 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 thephysical infrastructure 1100A ofdata 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 anexpansion 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 toFIG. 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-definedinfrastructure 1100B. In some embodiments, virtual computing resources 1136 of software-definedinfrastructure 1100B may be allocated to support the provision ofcloud services 1140. In various embodiments, particular sets of virtual computing resources 1136 may be grouped for provision to cloudservices 1140 in the form of software-defined infrastructure (SDI) services 1138. Examples ofcloud 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 virtualinfrastructure management framework 1150B. In various embodiments, virtualinfrastructure 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/orSDI services 1138 tocloud services 1140. In some embodiments, virtualinfrastructure 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 forcloud services 1140. The embodiments are not limited in this context. - Referring now to
FIG. 12 , anillustrative system 1200 for determining unique values, which may be implemented in accordance with thedata centers FIGS. 1, 3, 4, and 11 , is shown. Theillustrative system 1200 includes acompute device 1202 that includes anaccelerator 1204, amemory 1206, one ormore processors 1208, and one ormore storage devices 1210. In use, as described further below, theaccelerator 1204 may filter a database to determine unique values. In the illustrative embodiment, theaccelerator 1204 may receive input data, which is a packed array of unsigned integers of column data from the database, to determine unique element values of the input data. To do so, theaccelerator 1204 may construct a bit-map output table configured to store bit-map output bits based on query configuration data received from aprocessor 1208, which includes a number of elements and an element width (N) of the input data and a hash width (K). It should be appreciated that the hash width (K) is less than or equal to the element width (N). Accordingly, the bit-map output table is sized to store 2K number of bit-map output bits, each bit-map output bit corresponds to a unique element value of the input data or a unique hash value that may be generated from the input data. In the illustrative embodiment, the accelerator 1240 may construct a different type of bit-map output tables on the accelerator 1240 based on the hash width (K). For example, if the hash width (K) is less than 8 bits, the accelerator 1240 may construct a small bit-map output table with multiple write ports (e.g., muxes) to provide multiple writes per cycle. Alternatively, if the hash width (K) is greater than 8 bits, the accelerator 1240 may construct a large bit-map output table. Theaccelerator 1204 may configure the large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses, including parallel writes during input data processing into the large bit-map output table and parallel reads during read out processing of the large bit-map output table. - Subsequently, the
accelerator 1204 may generate a write request for each element to access the corresponding bit-map output table to set a bit-map output bit that corresponds to the element value of the corresponding element. To do so, theaccelerator 1204 may adjust the element width (N) of the input data by pre-processing the packed bit vector of column data. The pre-processing of the input data may support unique values queries on any bit-width of elements of the database based on a data path width of the accelerator 1240 and may also ensure that a largest number of elements are processed in each cycle. Since the input data is pre-processed and aligned with the bit-map output table, theaccelerator 1204 may use a corresponding element value of each element as a write request address to issue the write request to the corresponding bit-map output bit. Alternatively, if the element width (N) is different than the hash width (K), theaccelerator 1204 may perform the hash function on each element value to generate a hash value that is to be used as a write request address to access the bit-map output table to set the corresponding bit-map output bit. After multiple passes to process all elements of the input data, theaccelerator 1204 may output the bit-map output table that includes 2K bit-map output bits, where each set bit-map output bit indicates a presence of a corresponding unique element value or hash value. Theaccelerator 1204 may then transfer the bit-map output table to thememory 1206 of thecompute device 1202 for further analysis or processing by one ormore processors 1208. By performing the unique values queries on thehardware accelerator 1204 instead of theprocessor 1208, thesystem 1200 may increase performance and power efficiency by avoiding moving a large amount of data to the processor(s) 1208 for the set membership queries. - For example, the database stored in the
memory 1206 of thecompute device 1202 includes a table with a list of names of people, their residency information, and their income. Theprocessor 1208 requests theaccelerator 1204 to find how many unique state(s) there are in the database. In response, theaccelerator 1204 generates a bit-map output table, which is configured to store bit-map output bits for every possible state of the input data. In other words, the bit-map output table includes 50 bit-map output bits to represent 50 states. Subsequently, theaccelerator 1204 receives the residency information column data from thememory 1206, determines the state that each element or people live in, and sets a bit-map output bit that corresponds to each state. For example, if a person lives in Indiana, theaccelerator 1204 sets a bit-map output bit of the bit-map output table that corresponds to Indiana to 1. Accordingly, if there are 10 unique states in the database, meaning that all people live in one of those 10 states, theaccelerator 1204 outputs the bit-map output table that includes 10 bit-map output bits that have value of 1. - The
accelerator 1204 may be embodied as any coprocessor, application-specific integrated circuit (ASIC), field-programmable gate array (FPGA), a system-on-a-chip (SOC), an application specific integrated circuit (ASIC), functional block, IP core, or other hardware accelerator of thecompute device 1202 capable of performing the functions described herein. As discussed above, theaccelerator 1204 is configured to determine unique element values from the database. To do so, as shown inFIG. 12 , theaccelerator 1204 includes adecompressor 1212, aninput pre-processing unit 1214, a writerequest generator unit 1216, and anoutput processing unit 1218. As discussed above, theaccelerator 1204 also includes a definition table 1220 that may be stored inexternal memory 1222 of theaccelerator 1204 andlocal memory 1224 of theaccelerator 1204. - The
decompressor 1212 may be embodied as any hardware component(s) or circuitry capable of decompressing the input data. Typically, the input data is compressed column data stored in thememory 1206. As such, thedecompressor 1212 may determine whether the input data is compressed data and decompress the compressed input data in response to determining that the input data is compressed. - The
input pre-processing unit 1214 may be embodied as any hardware component(s) or circuitry capable of pre-processing the input data to support unique values queries on any bit-width of elements of the database. To do so, theinput pre-processing unit 1214 may determine a largest power of 2 elements (i.e., 2m elements) that is to be processed in each cycle as a function of an element width of the input data and a data path width of theaccelerator 1204. Theinput pre-processing unit 1214 may align the elements of the uncompressed input data (e.g., the packed bit vector of column data) and prepend zero to each element of the input data based on the data path width in order to process the largest power of 2 elements per cycle. For example, if theaccelerator 1204 has a 32 bit wide data path, theinput pre-processing unit 1214 may process 32 elements for an element width of 1 bit, 16 elements for an element width of 2 bits, 8 elements for element widths 3 or 4 bits, 4 elements for element widths from 5 to 8 bits, and so on. - The write
request generator unit 1216 may be embodied as any hardware component(s) or circuitry capable of generating a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element. To do so, the writerequest generator unit 1216 may generate a write request address for the corresponding element to access a corresponding bit-map output bit of the bit-map output table. Since the input data is pre-processed, the writerequest generator unit 1216 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table. Alternatively, if the hash width (K) is less than the element width (N), the writerequest generator unit 1216 may compute a K-bit hash value that corresponds to the element value of the corresponding element and use the hash value as a write request address for the corresponding element to access the bit-map output table. It should be appreciated that the hash function may be programmed based on the element width (N) of the input data and the hash width (K) indicated in the query configuration data. For example, the writerequest generator unit 1216 may extract K bits of the N-bit element by truncating a number of upper and/or lower bits of the N-bit element. In some embodiments, the hash function may be performed prior to pre-processing the input data. - The
output processing unit 1218 may be embodied as any hardware component(s) or circuitry capable of outputting the bit-map output table, where each set bit-map output bit of the bit-map output table (e.g., a bit-map output bit that has a value of 1) indicates a presence of a unique element value corresponds to the bit-map output bit. Theoutput processing unit 1218 may be further configured to accumulate the bit-map output bits until a width of the bit-map output bits reaches the data path width to transmit the bit-map output bits to thememory 1206 for further analysis by one ormore processors 1208. In some embodiments, theoutput processing unit 1218 may directly communicate with one ormore processors 1208 to transmit the bit-map output table. - The
processor 1208 may be embodied as any type of processor capable of performing the functions described herein. For example, theprocessor 1208 may be embodied as a single or multi-core processor(s), digital signal processor, microcontroller, or other processor or processing/controlling circuit. Similarly, thememory 1206 may be embodied as any type of volatile or non-volatile memory or data storage capable of performing the functions described herein. In operation, thememory 1206 may store various data and software used during operation of thecompute device 1202 such operating systems, applications, programs, libraries, and drivers. Thememory 1206 is communicatively coupled to theprocessor 1208 via the input/output (I/O) subsystem (not shown), which may be embodied as circuitry and/or components to facilitate input/output operations with theprocessor 1208, theaccelerator 1204, thememory 1206, the one ormore storage devices 1210, and other components of thecompute device 1202. For example, the I/O subsystem may be embodied as, or otherwise include, memory controller hubs, input/output control hubs, sensor hubs, firmware devices, communication links (i.e., 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 may form a portion of a system-on-a-chip (SoC) and be incorporated, along with theprocessor 1208, thememory 1206, and other components of thecompute device 1202, on a single integrated circuit chip. - The
memory 1206 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
memory 1206 may be integrated into theprocessor 1208. In operation, thememory 1206 may store various software and data used during operation such as resource utilization data, resource availability data, application programming interface (API) data, applications, programs, and libraries. - The
illustrative storage devices 1210 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. Eachstorage device 1210 may include a system partition that stores data and firmware code for thestorage device 1210. Eachstorage device 1210 may also include one or more operating system partitions that store data files and executables for operating systems. - Although illustrated in
FIG. 12 as asingle compute device 1202, it should be understood that in some embodiments the functions of thecompute device 1202 may be performed by one or more sleds in a data center. In such embodiments, theaccelerator 1204 may be embodied as one or more accelerator sled 204-2 (e.g., physical accelerator resources 205-2), thememory 1206 may be embodied as one or more memory sled 204-3 (e.g., physical memory resources 205-3), one ormore processors 1208 may be embodied as one or more compute sled 204-4 (e.g., physical compute resources 205-4), one ormore storage devices 1210 may be embodied as one or more storage sleds 204-1 (e.g., physical storage resources 205-1). - Referring now to
FIG. 13 , in the illustrative embodiment, theaccelerator 1204 of thecompute device 1202 may establish anenvironment 1300 during operation. In the illustrative embodiment, theenvironment 1300 includes a large bit-map output table 1340 and a small bit-map output table 1350. The large bit-map output table 1340 may be embodied as any data indicative of bit-map output bits for elements that have a bit-width greater than a predefined number of bit-width. Whereas, the small bit-map output table 1350 may be embodied as any data indicative of bit-map output bits for elements that have a bit-width smaller than the predefined number of bit-width. As discussed above, each bit-map output bit that is set indicates a presence of unique element value. It should be appreciated that, in the embodiment where the hash width (K) is less than the element width (N), each bit-map output bit that is set indicates a presence of a hash value, which corresponds to a unique element value. Additionally, theillustrative environment 1300 includes an input/output (I/O)communicator 1310, adecompressor 1320, andcomplex filter 1330. Thecomplex filter 1330 further includes a bit-map table generator 1332, aninput data pre-processor 1334, awrite request generator 1336, and a bit-map output generator 1338. Each of the components of theenvironment 1300 may be embodied as hardware, firmware, software, or a combination thereof. As such, in some embodiments, one or more of the components of theenvironment 1300 may be embodied as circuitry or a collection of electrical devices (e.g., I/O communicator circuitry 1310,decompressor circuitry 1320,complex filter circuitry 1330, bit-maptable generator circuitry 1332, inputdata pre-processor circuitry 1334, writerequest generator circuitry 1336, bit-mapoutput generator circuitry 1338, etc.). - In the
illustrative environment 1300, the I/O communicator 1310 is configured to facilitate inbound and outbound network communications (e.g., network traffic, network packets, network flows, etc.) to and from theaccelerator 1204, respectively. To do so, the I/O communicator 1310 is configured to receive and process data from thememory 1206 based on unique values queries received from aprocessor 1208 of thecompute device 1202. The I/O communicator 1310 is further configured to transmit a bit-map output data to thememory 1206. In some embodiments, theaccelerator 1204 may receive from or transmit to one ormore storage devices 1210. Accordingly, in some embodiments, at least a portion of the functionality of the I/O communicator 1310 may be performed by communication circuitry of thecompute device 1202. - The
decompressor 1320, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to decompress the input data. Thedecompressor 1212 is configured to determine whether the input data is compressed data and decompress the compressed input data in response to determining that the input data is compressed. - The
complex filter 1330, which may be embodied as hardware, firmware, software, virtualized hardware, emulated architecture, and/or a combination thereof as discussed above, is configured to filter the input data to determine unique element values of the input data. To do so, thecomplex filter 1330 includes the bit-map table generator 1332, theinput data pre-processor 1334, thewrite request generator 1336, and the bit-map output generator 1338. - The bit-
map table generator 1332 is configured to generate a bit-map output table. As described above, the bit-map output table is configured to store bit-map output bits, where each bit-map output bit corresponds to a unique element value or hash value of the input data. As such, the bit-map output table has 2K number of bit-map output bits to represent 2K unique element values. In the illustrative embodiment, the bit-map table generator 1332 is configured to construct a different type of definition table (e.g., a small or large bit-map output table) on the accelerator 1240 based on the hash width (K). If the bit-map table generator 1332 determines that the hash width (K) is less than a predefined width, the bit-map table generator 1332 constructs a small bit-map output table that has many write ports as necessary to satisfy a target throughput based on the width of the data path of theaccelerator 1204. For example, if the hash width (K) is less than 8 bits, the bit-map output bits are stored in a small bit-map output table with multiple write ports to provide multiple writes per cycle. To generate a bit-map output table that supports elements up to 8 bits, the bit-map table generator 1332 implements 256 flip flops to construct a small bit-map output table. In this example, if the width of the data path of theaccelerator 1204 is 32 bit, the bit-map table generator 1332 constructs the small bit-map output table with 2 flip flops for 32 write ports of a 1 bit element (e.g., 2:1 multiplexers), 4 flip flops for 16 write ports of a 2 bit element (e.g., 4:1 multiplexers), 16 flip flops for 8 write ports of a 3 or 4 bit element (e.g., 16:1 multiplexers), and remaining flip flops for 4 write ports. Alternatively, if the hash width (K) is greater than 8 bits, the bit-map output bits are stored in a large bit-map output table. Theaccelerator 1204 may configure the large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses. It should be appreciated that, in some embodiments, theaccelerator 1204 may also configure the small bit-map output table to store multiple copies of the bit-map output bits to support multiple accesses. - The
input data pre-processor 1334 is configured to pre-process the input data to support unique element values queries on any bit-width of elements of the database. To do so, theinput data pre-processor 1334 is configured to determine a largest power of 2 elements (i.e., 2m elements) that is to be processed in each cycle as a function of an element width of the input data and a data path width of theaccelerator 1204. Theinput data pre-processor 1334 is further configured to align the elements of the uncompressed input data (i.e., the packed bit vector of column data) and prepend zero to each element of the input data based on the data path width in order to process the largest power of 2 elements per cycle. For example, if theaccelerator 1204 has a 32 bit wide data path, theinput data pre-processor 1334 may process 32 elements for element with 1 bit, 16 elements for element width of 2 bits, 8 elements for element widths 3 or 4 bits, or 4 elements for element widths from 5 to 8 bits, and so on. - The
write request generator 1336 is configured to generate a write request for each element of the input data to access the corresponding bit-map output table to set a corresponding bit-map output bit of the bit-map output table. To do so, theaccelerator 1204 may generate a write request address for the corresponding element to access the bit-map output table. Since the input data is pre-processed and aligned with the bit-map output table, if the element width (N) and the hash width (K) are the same, theaccelerator 1204 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table. However, if the element width (N) is different than the hash width (K), theaccelerator 1204 may extract each element and use a corresponding hash value as a write request address to issue a write request to the corresponding bit-map output table. To do so, theaccelerator 1204 is configured to generate a hash value that corresponds to each element value for every element of the input data using a hash function that is configured based the element width (N) and the hash width (N). - The bit-
map output generator 1338 is configured to output the bit-map output table that indicates unique element values that are present in the input data. As described above, in some embodiments, the bit-map output table may include duplicate copies of the bit-map output to support parallel accesses by mimicking multiple write ported memory. In such embodiments, the bit-map output generator 1338 may combine the corresponding bits from each copy of the bit-map output by using a logical OR operation to generate the true bit-map output bit of the bit-map output table. It should be appreciated that each bit-map output bit of the bit-map output table that has been set indicates a presence of a unique element value that corresponds to the bit-map output bit. As such, the bit-map output generator 1338 may be configured to determine a total number of unique element values that are present in the input data by adding a number of bit-map output bits that have been set. The bit-map output generator 1338 may be further configured to accumulate the bit-map output bit data until a width of the bit-map output reaches the data path width and transmit the bit-map output bit data to thememory 1206 for further analysis or processing by one ormore processors 1208. In some embodiments, the bit-map output generator 1338 may directly communicate with one ormore processors 1208 to transmit the bit-map output bit table. - Referring now to
FIGS. 14 and 15 , in use, theaccelerator 1204 of thecompute device 1202 may execute amethod 1400 for determining unique element values. Themethod 1400 begins withblock 1402, in which theaccelerator 1204 imports input data from thememory 1206 of thecompute device 1202. Typically, the input data is compressed data stored in thememory 1206. As such, theaccelerator 1204 decompresses the compressed input data as indicated inblock 1404. - In
block 1406, theaccelerator 1204 receives query configuration data from a requestingprocessor 1208 of thecompute device 1202. For example, theaccelerator 1204 may receive from the processor 1208 a pointer to query configuration data in thememory 1206. However, it should be appreciated that, in some embodiments, the query configuration data may be received from other components of thecompute device 1202. As described above, the query configuration data may include a number of elements and an element width (N) of the input data and a hash width (K). Accordingly, inblock 1408, theaccelerator 1204 determines a number elements and an element width (N) of the input data. In some embodiments, inblock 1410 theaccelerator 1204 may determine a hash width (K) if the element width (N) of the input data is different from the hash width (K). Additionally, in block 1412, theaccelerator 1204 determines a number of elements to be processed per cycle based on the element width (N) and a data path width of theaccelerator 1204. - Subsequently, the
accelerator 1204 constructs a bit-map output table that is configured to store bit-map output bits. The bit-map output bits represent all possible element values of the input data, such that each bit-map output bit represents a unique element value of the input data. Accordingly, the bit-map output table includes two to the hash width (K) power number of bit-map output bits. For example, the bit-map output bits for a 8-bit hash width includes 28 or 256 bits, the bit-map output bits for a 32-bit hash width includes 232 bits or 512 MB, and so on. It should be appreciated that, in the illustrative embodiment, all bit-map output bits stored in the bit-map output table are initially cleared (e.g., a default value of 0). - As described above, the accelerator 1240 configures a different bit-map output table on the accelerator 1240 based on the hash width (K). To do so, in
block 1414, theaccelerator 1204 determines whether the hash width (K) is greater than a predefined width. If theaccelerator 1204 determines that the hash width (K) is smaller than the predefined threshold of element width, themethod 1400 advances to block 1416. Inblock 1416, theaccelerator 1204 constructs a small bit-map output table to store the bit-map output bits. The small bit-map output table is to support multiple write ports to provide multiple writes per cycle as indicated inblock 1418. For example, if the element width is less than 8 bits, the bit-map output bits are stored in a small bit-map output table with multiple write ports to provide multiple writes per cycle. - Alternatively, if the
accelerator 1204 determines that the hash width (K) is greater than the predefined threshold width inblock 1414, themethod 1400 advances to block 1420. Inblock 1420, theaccelerator 1204 constructs a large bit-map output table to store the bit-map output bits. Although multiple write ports may be implemented to construct a small bit-map output table for processing data having a small element width, implementing multiple write ports for a large data having a large element width may be impractical and costly. As such, theaccelerator 1204 may store duplicate copies of the bit-map output bits to support parallel accesses per cycle as indicated inblock 1422. To do so, the bit-map output bits are stored in different banks such that each membership bit vector in each bank is accessed simultaneously, thereby supporting parallel accesses. For example, if the width of each element is greater than 8 bits, theaccelerator 1204 may configure a large bit-map output table to store duplicate copies of the bit-map output bits to support parallel accesses. - Subsequent to constructing the bit-map output table, in
block 1424, theaccelerator 1204 determines whether the element width (N) equals to the hash width (K). If theaccelerator 1204 determines that the element width (N) and the hash width (K) are the same, themethod 1400 skips ahead to block 1428 shown inFIG. 15 . If, however, theaccelerator 1204 determines that the element width (N) is different than the hash width (K), themethod 1400 advances to block 1426, in which theaccelerator 1204 programs a hash function that is configured to generate a K-bit hash value from a N-bit element value for every elements of the input data. - Subsequently, in
block 1428 shown inFIG. 15 , theaccelerator 1204 pre-processes the input data to prepare the elements of the input data for the unique element value function. To do so, theaccelerator 1204 may align the elements of the input data (i.e., the packed array of unsigned integers of column data) based on the number of elements that is to be processed in each cycle as indicated inblock 1430. As described above, the number of elements that is to be processed in each cycle is determined based on the element width (N) of the input data and a data path width of theaccelerator 1204. Additionally, inblock 1432 theaccelerator 1204 may prepend zeros to each element of the input data based on the data path width in order to process a largest power of 2 elements per cycle (i.e., largest 2m elements/cycle). For example, if theaccelerator 1204 has a 32 bit wide data path, theaccelerator 1204 may process 32 elements for element with 1 bit, 16 elements for element width of 2 bits, 8 elements for element widths 3 or 4 bits, or 4 elements for element widths from 5 to 8 bits, and so on. - In block 1434, the
accelerator 1204 generates a write request for each element of the input data to access the corresponding bit-map output table to set a corresponding bit-map output bit of the bit-map output table. To do so, theaccelerator 1204 may generate a write request address for the corresponding element to access the bit-map output table. Since the input data is pre-processed and aligned with the bit-map output table, if the element width (N) and the hash width (K) are the same, theaccelerator 1204 may extract each element and use the corresponding element value as a write request address to issue a write request to the corresponding bit-map output table as indicated inblock 1436. However, if the element width (N) is different than the hash width (K), theaccelerator 1204 may use a corresponding hash value as a write request address to issue a write request to the corresponding bit-map output table as indicated in block 1438. To do so, inblock 1440, theaccelerator 1204 generates a hash value that corresponds to each element value for every element of the input data. In block 1442, the write request is transmitted to the corresponding bit-map output table. In response to generating the write requests for each element of the input data, inblock 1444, theaccelerator 1204 accesses the corresponding bit-map output table to set the corresponding bit-map output bits based on the write requests. - Subsequently, in
block 1446, theaccelerator 1204 output the bit-map output table that includes the bit-map output bits indicating unique element values that are present in the input data. As discussed above, each output bit of the bit-map output table that has been set corresponds to a presence of a unique element value. As such, in some embodiments, a total number of unique elements present in the input data may be determined by generating a population count by adding a number of bit-map output bits that have been set as indicated inblock 1448. In some embodiments, inblock 1450, theaccelerator 1204 may accumulate the bit-map output table data until a width of the bit-map output table data reaches the data path width of the accelerator and transmit the bit-map output table to thememory 1206 for further processing by one ormore processors 1208. In some embodiments, the bit-map output table may be directly transmitted to theprocessor 1208. - 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 device for determining unique values, the compute device comprising one or more accelerator devices, each accelerator device is to receive input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; generate, in response to receiving the query configuration data, a bit-map output table based on the query configuration data; generate a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; set the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generation of the write request; and output the bit-map output table indicative of unique elements that are present in the input data in response to setting of the corresponding bit-map output bit.
- Example 2 includes the subject matter of Example 1, and wherein the each accelerator is further to decompress, in response to importation of the input data, the input data; and pre-process, in response to decompression of the input data, the decompressed input data.
- Example 3 includes the subject matter of any of Examples 1 and 2, and wherein to pre-process the decompressed input data comprises to align elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and prepend zeroes to match a data path width.
- Example 4 includes the subject matter of any of Examples 1-3, and wherein the query configuration data further includes a hash width.
- Example 5 includes the subject matter of any of Examples 1-4, and wherein the each accelerator is further to determine whether the element width is greater than the hash width; program, in response to a determination that the element width is greater than the hash width, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and generate, in response to programming of the hash function, a hash value for each element value by performing the hash function on the input data.
- Example 6 includes the subject matter of any of Examples 1-5, and wherein to generate the write request comprises to generate a write request address based on a hash value of the corresponding element.
- Example 7 includes the subject matter of any of Examples 1-6, and wherein to generate the write request comprises to determine a write request address based on an element value of the corresponding element.
- Example 8 includes the subject matter of any of Examples 1-7, and wherein to generate the bit-map output table based on the query configuration data comprises to determine whether the element width of the input data exceeds a threshold; construct, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and construct, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 9 includes the subject matter of any of Examples 1-8, and wherein the large bit-map output table supports parallel accesses by duplication of the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplication of the bit-map output table.
- Example 10 includes the subject matter of any of Examples 1-9, and wherein to set the corresponding bit-map output bit comprises to determine whether the element width exceeds a threshold; access, in response to a determination that the element width exceeds the threshold, the large bit-map output table to set the corresponding bit-map output bit; and access, in response to a determination that the element width does not exceed the threshold, the small bit-map output table to set the corresponding bit-map output bit.
- Example 11 includes the subject matter of any of Examples 1-10, and wherein to output the bit-map output table comprises to generate a population count indicating a number of unique elements based on the bit-map output table.
- Example 12 includes the subject matter of any of Examples 1-11, and wherein the each accelerator is further to accumulate the bit-map output table until a width of the bit-map output table matches a data path width.
- Example 13 includes a method for determining unique values by a compute device, the method comprising receiving, by an accelerator of the compute device, input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; generating, in response to receiving the query configuration data and by the accelerator, a bit-map output table based on the query configuration data; generating, by the accelerator, a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; setting, by the accelerator, the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generating the write request; and outputting, by the accelerator, the bit-map output table indicative of unique elements that are present in the input data in response to setting the corresponding bit-map output bit.
- Example 14 includes the subject matter of Example 13, and further including decompressing, in response to importing the input data and by the accelerator, the input data; and pre-processing, in response to decompressing the input data and by the accelerator, the decompressed input data.
- Example 15 includes the subject matter of any of Examples 13 and 14, and wherein pre-processing the decompressed input data comprises aligning, by the accelerator, elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and prepending, by the accelerator, zeroes to match a data path width.
- Example 16 includes the subject matter of any of Examples 13-15, and wherein the query configuration data further includes a hash width.
- Example 17 includes the subject matter of any of Examples 13-16, and further including determining, by the accelerator, whether the element width is greater than the hash width; programming, in response to a determination that the element width is greater than the hash width and by the accelerator, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and generating, in response to programming the hash function and by the accelerator, a hash value for each element value by performing the hash function on the input data.
- Example 18 includes the subject matter of any of Examples 13-17, and wherein generating the write comprises determining, by the accelerator, a write request address based on a hash value of the corresponding element.
- Example 19 includes the subject matter of any of Examples 13-18, and wherein generating the write comprises determining, by the accelerator, a write request address based on an element value of the corresponding element.
- Example 20 includes the subject matter of any of Examples 13-19, and wherein generating the bit-map output table based on the query configuration data comprises determining, by the accelerator, whether the element width of the input data exceeds a threshold; constructing, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and constructing, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 21 includes the subject matter of any of Examples 13-20, and wherein the large bit-map output table supports parallel accesses by duplicating the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplicating the bit-map output table.
- Example 22 includes the subject matter of any of Examples 13-21, and wherein setting the corresponding bit-map output bit comprises determining, by the accelerator, whether the element width exceeds a threshold; accessing, in response to a determination that the element width exceeds the threshold and by the accelerator, the large bit-map output table to set the corresponding bit-map output bit; and accessing, in response to a determination that the element width does not exceed the threshold and by the accelerator, the small bit-map output table to set the corresponding bit-map output bit.
- Example 23 includes the subject matter of any of Examples 13-22, and wherein outputting the bit-map output table comprises generating, by the accelerator, a population count indicating a number of unique elements based on the bit-map output table.
- Example 24 includes the subject matter of any of Examples 13-23, and further including accumulating, by the accelerator, the bit-map output table until a width of the bit-map output table matches a data path width.
- Example 25 includes a compute device comprising means for performing the method of any of Examples 13-24.
- Example 26 includes one or more machine-readable storage media comprising a plurality of instructions stored thereon that, in response to being executed, cause a compute device to perform the method of any of Examples 13-24.
- Example 27 includes a compute device comprising a compute engine to perform the method of any of Examples 13-24.
- Example 28 includes a compute device for determining unique values, the compute device comprising one or more accelerator devices, each accelerator device comprising means for receiving input data and query configuration data, the input data including a packed array of unsigned integers of column data from a database and the query configuration data including an element width of the input data; means for generating, in response to receiving the query configuration data, a bit-map output table based on the query configuration data; means for generating a write request for each element of the input data to set a corresponding bit-map output bit of the bit-map output table which corresponds to an element value of the corresponding element; means for setting the corresponding bit-map output bit to indicate a presence of the corresponding element in response to generating the write request; and means for outputting the bit-map output table indicative of unique elements that are present in the input data in response to setting the corresponding bit-map output bit.
- Example 29 includes the subject matter of Example 28, and wherein the each accelerator device further comprises means for decompressing, in response to importing the input data, the input data; and means for pre-processing, in response to decompressing the input data, the decompressed input data.
- Example 30 includes the subject matter of any of Examples 28 and 29, and wherein the means for pre-processing the decompressed input data comprises means for aligning elements of the packed bit vector of the input data based on a width of elements of the decompressed input data and means for prepending zeroes to match a data path width.
- Example 31 includes the subject matter of any of Examples 28-30, and wherein the query configuration data further includes a hash width.
- Example 32 includes the subject matter of any of Examples 28-31, and wherein the each accelerator further comprises means for determining whether the element width is greater than the hash width; means for programming, in response to a determination that the element width is greater than the hash width, a hash function to generate a hash value that corresponds to the element value of the corresponding element; and means for generating, in response to programming the hash function, a hash value for each element value by performing the hash function on the input data.
- Example 33 includes the subject matter of any of Examples 28-32, and wherein the means for generating the write comprises means for determining a write request address based on a hash value of the corresponding element.
- Example 34 includes the subject matter of any of Examples 28-33, and wherein the means for generating the write comprises means for determining a write request address based on an element value of the corresponding element.
- Example 35 includes the subject matter of any of Examples 28-34, and wherein the means for generating the bit-map output table based on the query configuration data comprises means for determining whether the element width of the input data exceeds a threshold; means for constructing, in response to a determination that the element width exceeds the threshold, a large bit-map output table to store the bit-map output bits; and means for constructing, in response to a determination that the element width does not exceed the threshold, a small bit-map output table to store the bit-map output bits.
- Example 36 includes the subject matter of any of Examples 28-35, and wherein the large bit-map output table supports parallel accesses by duplicating the bit-map output table and the small-sized table supports multiple accesses via multiple write ports and duplicating the bit-map output table.
- Example 37 includes the subject matter of any of Examples 28-36, and wherein the means for setting the corresponding bit-map output bit comprises means for determining whether the element width exceeds a threshold; means for accessing, in response to a determination that the element width exceeds the threshold, the large bit-map output table to set the corresponding bit-map output bit; and means for accessing, in response to a determination that the element width does not exceed the threshold, the small bit-map output table to set the corresponding bit-map output bit.
- Example 38 includes the subject matter of any of Examples 28-37, and wherein the means for outputting the bit-map output table comprises means for generating a population count indicating a number of unique elements based on the bit-map output table.
- Example 39 includes the subject matter of any of Examples 28-38, and wherein the each accelerator further comprises means for accumulating the bit-map output table until a width of the bit-map output table matches a data path width.
Claims (25)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/868,594 US20190042611A1 (en) | 2017-08-30 | 2018-01-11 | Technologies for structured database query for finding unique element values |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN201741030632 | 2017-08-30 | ||
IN201741030632 | 2017-08-30 | ||
US201762584401P | 2017-11-10 | 2017-11-10 | |
US15/868,594 US20190042611A1 (en) | 2017-08-30 | 2018-01-11 | Technologies for structured database query for finding unique element values |
Publications (1)
Publication Number | Publication Date |
---|---|
US20190042611A1 true US20190042611A1 (en) | 2019-02-07 |
Family
ID=65037934
Family Applications (26)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/833,523 Abandoned US20190044809A1 (en) | 2017-08-30 | 2017-12-06 | Technologies for managing a flexible host interface of a network interface controller |
US15/856,220 Active 2038-02-10 US10554391B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for dynamically allocating data storage capacity for different data storage types |
US15/856,858 Abandoned US20190034490A1 (en) | 2017-08-30 | 2017-12-28 | Technologies for structured database query |
US15/856,173 Active 2038-03-05 US10469252B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for efficiently managing allocation of memory in a shared memory pool |
US15/856,556 Expired - Fee Related US10567166B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for dividing memory across socket partitions |
US15/856,644 Active 2038-04-12 US10728024B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for providing runtime code in an option ROM |
US15/858,569 Abandoned US20190042126A1 (en) | 2017-08-30 | 2017-12-29 | Technologies for storage discovery and reallocation |
US15/859,367 Active 2038-05-02 US10581596B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for managing errors in a remotely accessible memory pool |
US15/859,387 Active 2039-08-29 US11050554B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for managing exact match hash table growth |
US15/859,369 Active US10476670B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for providing remote access to a shared memory pool |
US15/859,391 Active 2040-06-07 US11249816B2 (en) | 2017-08-30 | 2017-12-30 | Pivot rack |
US15/868,594 Abandoned US20190042611A1 (en) | 2017-08-30 | 2018-01-11 | Technologies for structured database query for finding unique element values |
US15/868,492 Abandoned US20190042408A1 (en) | 2017-08-30 | 2018-01-11 | Technologies for interleaving memory across shared memory pools |
US15/912,733 Active 2039-08-23 US11025411B2 (en) | 2017-08-30 | 2018-03-06 | Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture |
US15/922,502 Abandoned US20190042091A1 (en) | 2017-08-30 | 2018-03-15 | Technologies for providing efficient distributed data storage in a disaggregated architecture |
US15/922,493 Abandoned US20190042090A1 (en) | 2017-08-30 | 2018-03-15 | Technologies for separating control plane management from data plane management for distributed storage in a disaggregated architecture |
US15/941,114 Abandoned US20190052457A1 (en) | 2017-08-30 | 2018-03-30 | Technologies for providing efficient sharing of encrypted data in a disaggregated architecture |
US16/045,345 Active US10756886B2 (en) | 2017-08-30 | 2018-07-25 | Technologies for load balancing a network |
US17/001,502 Active 2038-09-30 US11588624B2 (en) | 2017-08-30 | 2020-08-24 | Technologies for load balancing a network |
US17/332,733 Active 2038-03-14 US11522682B2 (en) | 2017-08-30 | 2021-05-27 | Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture |
US17/344,253 Active 2038-08-11 US11843691B2 (en) | 2017-08-30 | 2021-06-10 | Technologies for managing a flexible host interface of a network interface controller |
US17/391,549 Abandoned US20220012105A1 (en) | 2017-08-30 | 2021-08-02 | Technologies for allocating resources across data centers |
US17/871,429 Active 2038-04-02 US11888967B2 (en) | 2017-08-30 | 2022-07-22 | Technologies for dynamic accelerator selection |
US18/238,096 Pending US20230421358A1 (en) | 2017-08-30 | 2023-08-25 | Technologies for allocating resources across data centers |
US18/241,748 Pending US20230412365A1 (en) | 2017-08-30 | 2023-09-01 | Technologies for managing a flexible host interface of a network interface controller |
US18/542,308 Pending US20240195605A1 (en) | 2017-08-30 | 2023-12-15 | Technologies for dynamic accelerator selection |
Family Applications Before (11)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/833,523 Abandoned US20190044809A1 (en) | 2017-08-30 | 2017-12-06 | Technologies for managing a flexible host interface of a network interface controller |
US15/856,220 Active 2038-02-10 US10554391B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for dynamically allocating data storage capacity for different data storage types |
US15/856,858 Abandoned US20190034490A1 (en) | 2017-08-30 | 2017-12-28 | Technologies for structured database query |
US15/856,173 Active 2038-03-05 US10469252B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for efficiently managing allocation of memory in a shared memory pool |
US15/856,556 Expired - Fee Related US10567166B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for dividing memory across socket partitions |
US15/856,644 Active 2038-04-12 US10728024B2 (en) | 2017-08-30 | 2017-12-28 | Technologies for providing runtime code in an option ROM |
US15/858,569 Abandoned US20190042126A1 (en) | 2017-08-30 | 2017-12-29 | Technologies for storage discovery and reallocation |
US15/859,367 Active 2038-05-02 US10581596B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for managing errors in a remotely accessible memory pool |
US15/859,387 Active 2039-08-29 US11050554B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for managing exact match hash table growth |
US15/859,369 Active US10476670B2 (en) | 2017-08-30 | 2017-12-30 | Technologies for providing remote access to a shared memory pool |
US15/859,391 Active 2040-06-07 US11249816B2 (en) | 2017-08-30 | 2017-12-30 | Pivot rack |
Family Applications After (14)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/868,492 Abandoned US20190042408A1 (en) | 2017-08-30 | 2018-01-11 | Technologies for interleaving memory across shared memory pools |
US15/912,733 Active 2039-08-23 US11025411B2 (en) | 2017-08-30 | 2018-03-06 | Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture |
US15/922,502 Abandoned US20190042091A1 (en) | 2017-08-30 | 2018-03-15 | Technologies for providing efficient distributed data storage in a disaggregated architecture |
US15/922,493 Abandoned US20190042090A1 (en) | 2017-08-30 | 2018-03-15 | Technologies for separating control plane management from data plane management for distributed storage in a disaggregated architecture |
US15/941,114 Abandoned US20190052457A1 (en) | 2017-08-30 | 2018-03-30 | Technologies for providing efficient sharing of encrypted data in a disaggregated architecture |
US16/045,345 Active US10756886B2 (en) | 2017-08-30 | 2018-07-25 | Technologies for load balancing a network |
US17/001,502 Active 2038-09-30 US11588624B2 (en) | 2017-08-30 | 2020-08-24 | Technologies for load balancing a network |
US17/332,733 Active 2038-03-14 US11522682B2 (en) | 2017-08-30 | 2021-05-27 | Technologies for providing streamlined provisioning of accelerated functions in a disaggregated architecture |
US17/344,253 Active 2038-08-11 US11843691B2 (en) | 2017-08-30 | 2021-06-10 | Technologies for managing a flexible host interface of a network interface controller |
US17/391,549 Abandoned US20220012105A1 (en) | 2017-08-30 | 2021-08-02 | Technologies for allocating resources across data centers |
US17/871,429 Active 2038-04-02 US11888967B2 (en) | 2017-08-30 | 2022-07-22 | Technologies for dynamic accelerator selection |
US18/238,096 Pending US20230421358A1 (en) | 2017-08-30 | 2023-08-25 | Technologies for allocating resources across data centers |
US18/241,748 Pending US20230412365A1 (en) | 2017-08-30 | 2023-09-01 | Technologies for managing a flexible host interface of a network interface controller |
US18/542,308 Pending US20240195605A1 (en) | 2017-08-30 | 2023-12-15 | Technologies for dynamic accelerator selection |
Country Status (5)
Country | Link |
---|---|
US (26) | US20190044809A1 (en) |
EP (5) | EP3460662A1 (en) |
JP (1) | JP7214394B2 (en) |
CN (13) | CN109426455A (en) |
DE (1) | DE102018212479A1 (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10785549B2 (en) | 2016-07-22 | 2020-09-22 | Intel Corporation | Technologies for switching network traffic in a data center |
US11137922B2 (en) | 2016-11-29 | 2021-10-05 | Intel Corporation | Technologies for providing accelerated functions as a service in a disaggregated architecture |
US20210351943A1 (en) * | 2017-11-29 | 2021-11-11 | Taiwan Semiconductor Manufacturing Company, Ltd. | Authentication based on physically unclonable functions |
US20230176758A1 (en) * | 2021-12-03 | 2023-06-08 | Samsung Electronics Co., Ltd. | Two-level indexing for key-value persistent storage device |
Families Citing this family (138)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9367562B2 (en) * | 2013-12-05 | 2016-06-14 | Google Inc. | Distributing data on distributed storage systems |
US9448887B1 (en) * | 2015-08-22 | 2016-09-20 | Weka.IO Ltd. | Distributed erasure coded virtual file system |
CN109891908A (en) * | 2016-11-29 | 2019-06-14 | 英特尔公司 | Technology for the interconnection of millimeter wave rack |
US10534598B2 (en) | 2017-01-04 | 2020-01-14 | International Business Machines Corporation | Rolling upgrades in disaggregated systems |
US11153164B2 (en) | 2017-01-04 | 2021-10-19 | International Business Machines Corporation | Live, in-line hardware component upgrades in disaggregated systems |
US11102299B2 (en) * | 2017-03-22 | 2021-08-24 | Hitachi, Ltd. | Data processing system |
US11030126B2 (en) * | 2017-07-14 | 2021-06-08 | Intel Corporation | Techniques for managing access to hardware accelerator memory |
US20190044809A1 (en) * | 2017-08-30 | 2019-02-07 | Intel Corporation | Technologies for managing a flexible host interface of a network interface controller |
US10298496B1 (en) * | 2017-09-26 | 2019-05-21 | Amazon Technologies, Inc. | Packet processing cache |
US10726930B2 (en) * | 2017-10-06 | 2020-07-28 | Western Digital Technologies, Inc. | Method and system for a storage (SSD) drive-level failure and health prediction leveraging machine learning on internal parametric data |
JP6757708B2 (en) * | 2017-10-31 | 2020-09-23 | 株式会社日立製作所 | Information processing device and component management method |
US11262912B2 (en) * | 2017-11-13 | 2022-03-01 | Weka.IO Ltd. | File operations in a distributed storage system |
US11317542B2 (en) | 2017-12-30 | 2022-04-26 | Intel Corporation | Technologies for improving processor thermal design power |
IL275859B2 (en) * | 2018-01-28 | 2024-05-01 | Drivenets Ltd | Method and device for improving bandwidth utilization in a communication network |
US10990554B2 (en) | 2018-03-02 | 2021-04-27 | Samsung Electronics Co., Ltd. | Mechanism to identify FPGA and SSD pairing in a multi-device environment |
US10635609B2 (en) | 2018-03-02 | 2020-04-28 | Samsung Electronics Co., Ltd. | Method for supporting erasure code data protection with embedded PCIE switch inside FPGA+SSD |
US20240095196A1 (en) * | 2018-03-02 | 2024-03-21 | Samsung Electronics Co., Ltd. | Method for supporting erasure code data protection with embedded pcie switch inside fpga+ssd |
US10838647B2 (en) * | 2018-03-14 | 2020-11-17 | Intel Corporation | Adaptive data migration across disaggregated memory resources |
US10579548B2 (en) * | 2018-03-29 | 2020-03-03 | Western Digital Technologies, Inc. | Adaptive interleaving of data transfer requests |
US11108697B2 (en) * | 2018-03-30 | 2021-08-31 | Intel Corporation | Technologies for controlling jitter at network packet egress |
US11100246B2 (en) | 2018-04-13 | 2021-08-24 | Mastercard International Incorporated | Computer-implemented methods, systems comprising computer-readable media, and electronic devices for completing queries propagated across a plurality of datasources |
US11330042B2 (en) * | 2018-05-17 | 2022-05-10 | International Business Machines Corporation | Optimizing dynamic resource allocations for storage-dependent workloads in disaggregated data centers |
US10552185B2 (en) | 2018-05-24 | 2020-02-04 | International Business Machines Corporation | Lightweight and precise value profiling |
US10656990B2 (en) * | 2018-06-13 | 2020-05-19 | Nutanix, Inc. | Dynamically adjusting reserve portion and allocation portions of disaster recovery site in a virtual computing system |
US10846070B2 (en) * | 2018-07-05 | 2020-11-24 | At&T Intellectual Property I, L.P. | Facilitating cloud native edge computing via behavioral intelligence |
US10831411B2 (en) * | 2018-07-24 | 2020-11-10 | International Business Machines Corporation | Storage controller with OCS for managing active-passive backend storage arrays |
CN109325494B (en) * | 2018-08-27 | 2021-09-17 | 腾讯科技(深圳)有限公司 | Picture processing method, task data processing method and device |
US11163713B2 (en) * | 2018-09-25 | 2021-11-02 | International Business Machines Corporation | Efficient component communication through protocol switching in disaggregated datacenters |
US11182322B2 (en) | 2018-09-25 | 2021-11-23 | International Business Machines Corporation | Efficient component communication through resource rewiring in disaggregated datacenters |
US11012423B2 (en) | 2018-09-25 | 2021-05-18 | International Business Machines Corporation | Maximizing resource utilization through efficient component communication in disaggregated datacenters |
US10831698B2 (en) | 2018-09-25 | 2020-11-10 | International Business Machines Corporation | Maximizing high link bandwidth utilization through efficient component communication in disaggregated datacenters |
US10915493B2 (en) | 2018-09-25 | 2021-02-09 | International Business Machines Corporation | Component building blocks and optimized compositions thereof in disaggregated datacenters |
US11650849B2 (en) | 2018-09-25 | 2023-05-16 | International Business Machines Corporation | Efficient component communication through accelerator switching in disaggregated datacenters |
US10802988B2 (en) | 2018-09-25 | 2020-10-13 | International Business Machines Corporation | Dynamic memory-based communication in disaggregated datacenters |
US10901893B2 (en) * | 2018-09-28 | 2021-01-26 | International Business Machines Corporation | Memory bandwidth management for performance-sensitive IaaS |
US11096284B2 (en) * | 2018-10-01 | 2021-08-17 | Intel Corporation | Compact semiconductor chip system and method |
US10983985B2 (en) * | 2018-10-29 | 2021-04-20 | International Business Machines Corporation | Determining a storage pool to store changed data objects indicated in a database |
US11023155B2 (en) | 2018-10-29 | 2021-06-01 | International Business Machines Corporation | Processing event messages for changed data objects to determine a storage pool to store the changed data objects |
US11379488B2 (en) * | 2018-11-07 | 2022-07-05 | Sap Se | Energy-efficient decay algorithm for non-volatile memories |
US11429674B2 (en) | 2018-11-15 | 2022-08-30 | International Business Machines Corporation | Processing event messages for data objects to determine data to redact from a database |
US11409900B2 (en) | 2018-11-15 | 2022-08-09 | International Business Machines Corporation | Processing event messages for data objects in a message queue to determine data to redact |
US10990517B1 (en) * | 2019-01-28 | 2021-04-27 | Xilinx, Inc. | Configurable overlay on wide memory channels for efficient memory access |
FR3092218B1 (en) * | 2019-01-28 | 2023-12-22 | Ateme | Data communication method, and system for implementing the method |
US11023324B2 (en) * | 2019-01-31 | 2021-06-01 | EMC IP Holding Company LLC | Harmonization of failure domains in a distributed system |
US10983948B2 (en) * | 2019-03-07 | 2021-04-20 | Raytheon Company | Reconfigurable computing appliance |
JP7305990B2 (en) * | 2019-03-12 | 2023-07-11 | 富士通株式会社 | Transfer program, transfer method, and information processing device |
US20190235773A1 (en) * | 2019-04-09 | 2019-08-01 | Mark Schmisseur | Concept for accessing computer memory of a memory pool |
AU2020263485A1 (en) * | 2019-04-25 | 2021-11-04 | Liveperson, Inc. | Smart capacity for workload routing |
US11088967B2 (en) * | 2019-04-26 | 2021-08-10 | Intel Corporation | Shared resources for multiple communication traffics |
DK180371B1 (en) | 2019-05-20 | 2021-02-11 | Mountain Top Ind Aps | A lid arrangement for a canister for a rollup truck bed cover |
WO2020236277A1 (en) | 2019-05-23 | 2020-11-26 | Cray Inc. | System and method for facilitating tracer packets in a data-driven intelligent network |
US11397653B2 (en) | 2019-05-29 | 2022-07-26 | Intel Corporation | Technologies for fast recovery of distributed storage systems on disaggregated storage |
US10970309B2 (en) * | 2019-06-05 | 2021-04-06 | Advanced New Technologies Co., Ltd. | Data storage method and apparatus |
CN110209249A (en) * | 2019-06-06 | 2019-09-06 | 英业达科技有限公司 | The casing of server |
JP7151631B2 (en) * | 2019-06-11 | 2022-10-12 | 株式会社デンソー | VEHICLE CONTROL DEVICE, VEHICLE DISPLAY SYSTEM, AND VEHICLE DISPLAY CONTROL METHOD |
US11074177B2 (en) * | 2019-06-19 | 2021-07-27 | Micron Technology, Inc. | Garbage collection adapted to host write activity |
US11049570B2 (en) * | 2019-06-26 | 2021-06-29 | International Business Machines Corporation | Dynamic writes-per-day adjustment for storage drives |
US11163482B2 (en) | 2019-06-26 | 2021-11-02 | International Business Machines Corporation | Dynamic performance-class adjustment for storage drives |
US11137915B2 (en) | 2019-06-27 | 2021-10-05 | International Business Machines Corporation | Dynamic logical storage capacity adjustment for storage drives |
US10949362B2 (en) * | 2019-06-28 | 2021-03-16 | Intel Corporation | Technologies for facilitating remote memory requests in accelerator devices |
CN117478878A (en) | 2019-07-09 | 2024-01-30 | 北京字节跳动网络技术有限公司 | Sample determination for adaptive loop filtering |
WO2021004542A1 (en) * | 2019-07-11 | 2021-01-14 | Beijing Bytedance Network Technology Co., Ltd. | Sample padding in adaptive loop filtering |
US11803773B2 (en) * | 2019-07-30 | 2023-10-31 | EMC IP Holding Company LLC | Machine learning-based anomaly detection using time series decomposition |
US10925166B1 (en) * | 2019-08-07 | 2021-02-16 | Quanta Computer Inc. | Protection fixture |
US11283635B2 (en) * | 2019-09-28 | 2022-03-22 | Intel Corporation | Dynamic sharing in secure memory environments using edge service sidecars |
US11550617B2 (en) | 2019-10-16 | 2023-01-10 | Intel Corporation | Disaggregated rack mount storage side transaction support |
US20210019069A1 (en) * | 2019-10-21 | 2021-01-21 | Intel Corporation | Memory and storage pool interfaces |
US11782810B2 (en) * | 2019-11-22 | 2023-10-10 | Dell Products, L.P. | Systems and methods for automated field replacement component configuration |
US11861219B2 (en) | 2019-12-12 | 2024-01-02 | Intel Corporation | Buffer to reduce write amplification of misaligned write operations |
EP4085594A1 (en) * | 2020-01-02 | 2022-11-09 | Level 3 Communications, LLC | Systems and methods for storing content items in secondary storage |
US11483246B2 (en) | 2020-01-13 | 2022-10-25 | Vmware, Inc. | Tenant-specific quality of service |
US11561916B2 (en) * | 2020-01-13 | 2023-01-24 | Hewlett Packard Enterprise Development Lp | Processing task deployment in adapter devices and accelerators |
US11275705B2 (en) * | 2020-01-28 | 2022-03-15 | Dell Products L.P. | Rack switch coupling system |
US11989135B2 (en) * | 2020-02-10 | 2024-05-21 | Intel Corporation | Programmable address range engine for larger region sizes |
US10853548B1 (en) * | 2020-02-11 | 2020-12-01 | Capital One Services, Llc | Reconfiguration of hardware components of an integrated circuit |
US11599395B2 (en) * | 2020-02-19 | 2023-03-07 | Vmware, Inc. | Dynamic core allocation |
US11436367B2 (en) | 2020-02-25 | 2022-09-06 | Hewlett Packard Enterprise Development Lp | Pre-operating system environment-based sanitization of storage devices |
US11115497B2 (en) * | 2020-03-25 | 2021-09-07 | Intel Corporation | Technologies for providing advanced resource management in a disaggregated environment |
US11509079B2 (en) * | 2020-04-06 | 2022-11-22 | Hewlett Packard Enterprise Development Lp | Blind mate connections with different sets of datums |
US11360681B2 (en) * | 2020-05-27 | 2022-06-14 | Xiaoliang Zhao | Systems and methods for scalable shared memory among networked devices comprising IP addressable memory blocks |
US11962518B2 (en) | 2020-06-02 | 2024-04-16 | VMware LLC | Hardware acceleration techniques using flow selection |
US11522917B2 (en) * | 2020-06-10 | 2022-12-06 | Arista Networks, Inc. | Scalable network processing segmentation |
US11539633B2 (en) | 2020-08-31 | 2022-12-27 | Vmware, Inc. | Determining whether to rate limit traffic |
US11853798B2 (en) | 2020-09-03 | 2023-12-26 | Microsoft Technology Licensing, Llc | Disaggregated memory pool assignment |
JP2022049599A (en) * | 2020-09-16 | 2022-03-29 | キオクシア株式会社 | Communication system, device, and communication method |
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 |
US12021759B2 (en) | 2020-09-28 | 2024-06-25 | VMware LLC | Packet processing with hardware offload units |
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 |
US11792134B2 (en) | 2020-09-28 | 2023-10-17 | Vmware, Inc. | Configuring PNIC to perform flow processing offload using virtual port identifiers |
US20220100432A1 (en) | 2020-09-28 | 2022-03-31 | Vmware, Inc. | Distributed storage services supported by 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 |
US20220103290A1 (en) * | 2020-09-29 | 2022-03-31 | Qualcomm Incorporated | Interleaver design for noncoherent reed muller codes |
DE102020214951A1 (en) * | 2020-11-27 | 2022-06-02 | Robert Bosch Gesellschaft mit beschränkter Haftung | Method for dynamically allocating memory bandwidth |
US11392740B2 (en) * | 2020-12-18 | 2022-07-19 | SambaNova Systems, Inc. | Dataflow function offload to reconfigurable processors |
US20220231933A1 (en) * | 2021-01-20 | 2022-07-21 | Nvidia Corporation | Performing network congestion control utilizing reinforcement learning |
EP4281850A1 (en) * | 2021-01-25 | 2023-11-29 | Volumez Technologies Ltd. | Method and system for orchestrating remote block device connection between servers |
US11509590B2 (en) * | 2021-02-17 | 2022-11-22 | Juniper Networks, Inc. | Determining network device statistics associated with fast counters and slow counters |
US11785735B2 (en) * | 2021-02-19 | 2023-10-10 | CyberSecure IPS, LLC | Intelligent cable patching of racks to facilitate cable installation |
US11863613B1 (en) * | 2021-03-22 | 2024-01-02 | Amazon Technologies, Inc. | Allocation of workloads in dynamic worker fleet |
CN117203615A (en) | 2021-04-09 | 2023-12-08 | 微软技术许可有限责任公司 | Extending host policies via distribution |
US11799785B2 (en) | 2021-04-09 | 2023-10-24 | Microsoft Technology Licensing, Llc | Hardware-based packet flow processing |
US11652749B2 (en) | 2021-04-09 | 2023-05-16 | Microsoft Technology Licensing, Llc | High availability for hardware-based packet flow processing |
CN113127173B (en) * | 2021-04-21 | 2021-09-24 | 浙江大学 | Heterogeneous sensing cluster scheduling method and device |
US20220361354A1 (en) * | 2021-05-10 | 2022-11-10 | Vertiv It Systems, Inc. | Supplemental component mounting platform for equipment rack |
CN113347230B (en) * | 2021-05-13 | 2022-09-06 | 长沙星融元数据技术有限公司 | Load balancing method, device, equipment and medium based on programmable switch |
US11799784B2 (en) | 2021-06-08 | 2023-10-24 | Vmware, Inc. | Virtualized QoS support in software defined networks |
US11537457B2 (en) * | 2021-06-25 | 2022-12-27 | Intel Corporation | Low latency remoting to accelerators |
US11669529B2 (en) * | 2021-07-13 | 2023-06-06 | Capital One Services, Llc | Dynamic query allocation to virtual warehouses |
US11914595B2 (en) | 2021-07-13 | 2024-02-27 | Capital One Services, Llc | Virtual warehouse query monitoring and reporting |
US11494413B1 (en) | 2021-07-13 | 2022-11-08 | Capital One Services, Llc | Query alerts generation for virtual warehouse |
US11825354B2 (en) * | 2021-08-04 | 2023-11-21 | Dish Wireless L.L.C. | Customer specific network slicing |
US20230046403A1 (en) * | 2021-08-11 | 2023-02-16 | International Business Machines Corporation | Multi-device processing activity allocation |
US11910575B2 (en) * | 2021-09-02 | 2024-02-20 | Baidu Usa Llc | Rack systems and packaging for servers |
US11871547B2 (en) | 2021-09-02 | 2024-01-09 | Baidu Usa Llc | Two phase system for enclosure systems |
US20220014551A1 (en) * | 2021-09-24 | 2022-01-13 | Intel Corporation | Method and apparatus to reduce risk of denial of service resource acquisition attacks in a data center |
US20230112448A1 (en) * | 2021-10-12 | 2023-04-13 | Seagate Technology Llc | Computational storage drive using fpga implemented interface |
US11650745B1 (en) * | 2021-10-29 | 2023-05-16 | Oracle International Corporation | Increased data processing performance of a non-volatile memory express (NVME) block store |
KR20230064849A (en) * | 2021-11-04 | 2023-05-11 | 에스케이하이닉스 주식회사 | Storage Device and Operating Method Therefor |
US11880568B2 (en) | 2021-11-17 | 2024-01-23 | Seagate Technology Llc | On demand configuration of FPGA interfaces |
US20220116487A1 (en) * | 2021-12-20 | 2022-04-14 | Intel Corporation | Method and apparatus to perform operations on multiple segments of a data packet in a network interface controller |
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 |
US11934255B2 (en) * | 2022-01-04 | 2024-03-19 | Bank Of America Corporation | System and method for improving memory resource allocations in database blocks for executing tasks |
US20230214337A1 (en) * | 2022-01-06 | 2023-07-06 | Vmware, Inc. | Methods and systems for extablishing direct communications between a server computer and a smart network interface controller |
US11924029B2 (en) | 2022-01-07 | 2024-03-05 | Dell Products L.P. | System for scoring data center application program interfaces |
US11842179B2 (en) | 2022-01-07 | 2023-12-12 | Dell Products L.P. | System for automatically generating customer specific data center application program interfaces |
US11922229B2 (en) | 2022-01-10 | 2024-03-05 | Dell Products L.P. | System for determining data center application program interface readiness |
US11593189B1 (en) * | 2022-01-14 | 2023-02-28 | Dell Products L.P. | Configuring new storage systems based on write endurance |
US11848835B2 (en) * | 2022-01-20 | 2023-12-19 | Dell Products L.P. | System for quantifying data center infrastructure utilization units |
CN114442792A (en) * | 2022-02-09 | 2022-05-06 | 北京小米移动软件有限公司 | Method and device for adjusting operating frequency of processor and storage medium |
US20230038307A1 (en) * | 2022-04-06 | 2023-02-09 | Intel Corporation | Network interface device feedback for adaptive and failover multipath routing |
US11924115B2 (en) * | 2022-05-20 | 2024-03-05 | Ipco 2012 Limited | Systems and methods for use in balancing network resources |
US11928367B2 (en) | 2022-06-21 | 2024-03-12 | VMware LLC | Logical memory addressing for network devices |
US11928062B2 (en) | 2022-06-21 | 2024-03-12 | VMware LLC | Accelerating data message classification with smart NICs |
US11899594B2 (en) | 2022-06-21 | 2024-02-13 | VMware LLC | Maintenance of data message classification cache on smart NIC |
US20240020357A1 (en) * | 2022-07-15 | 2024-01-18 | Vmware, Inc. | Keyless licensing in a multi-cloud computing system |
CN115130666B (en) * | 2022-08-31 | 2022-11-22 | 之江实验室 | Two-dimensional photon convolution acceleration method and system |
CN117200422B (en) * | 2023-11-08 | 2024-03-19 | 深圳市胜威南方科技有限公司 | PDU power supply equipment for power supply of communication system |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100269024A1 (en) * | 2009-04-18 | 2010-10-21 | Fang Hao | Method and apparatus for multiset membership testing using combinatorial bloom filters |
US20140013078A1 (en) * | 2011-12-08 | 2014-01-09 | Oracle International Corporation | Efficient hardware instructions for single instruction multiple data processors |
US20150022570A1 (en) * | 2013-07-16 | 2015-01-22 | Xerox Corporation | System And Method For Optimized Application Of Release Agent In An Inkjet Printer With In-Line Coating |
US20150088926A1 (en) * | 2013-09-21 | 2015-03-26 | Oracle International Corporation | Methods and systems for fast set-membership tests using one or more processors that support single instruction multiple data instructions |
US20150220570A1 (en) * | 2014-02-06 | 2015-08-06 | International Business Machines Corporation | Multilevel filters for cache-efficient access |
US20170154099A1 (en) * | 2015-11-26 | 2017-06-01 | International Business Machines Corporation | Efficient lookup in multiple bloom filters |
Family Cites Families (217)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3583625A (en) | 1968-10-25 | 1971-06-08 | Gabriel Gero | Cigarette dispensing package |
US4258967A (en) * | 1979-11-02 | 1981-03-31 | Digital Equipment Corporation | Integral pivot and lock apparatus for slide rack mounted boxes |
JPH0731402Y2 (en) * | 1987-06-15 | 1995-07-19 | パイオニア株式会社 | Cartridge storage disk player |
JPS6450274A (en) * | 1987-08-21 | 1989-02-27 | Pioneer Electronic Corp | Auto-changer type disk player |
ES2077578T3 (en) * | 1988-03-31 | 1995-12-01 | At & T Corp | NETWORK USER INTERFACE PROTOCOL FOR PACKAGE COMMUNICATION NETWORKS. |
US5123045A (en) * | 1989-08-18 | 1992-06-16 | Massachusetts Institute Of Technology | Comprehensive software protection system |
US5226714A (en) * | 1992-05-26 | 1993-07-13 | Wright Jack V | Pivoting drawer slide system |
JP3215237B2 (en) * | 1993-10-01 | 2001-10-02 | 富士通株式会社 | Storage device and method for writing / erasing storage device |
US5469335A (en) * | 1994-11-14 | 1995-11-21 | Compaq Computer Corporation | Power distribution connector apparatus for back-to-back sandwiched circuit boards |
US5584396A (en) * | 1995-05-17 | 1996-12-17 | Dell Usa Lp | Sliding pivoting storage apparatus |
US6179489B1 (en) * | 1997-04-04 | 2001-01-30 | Texas Instruments Incorporated | Devices, methods, systems and software products for coordination of computer main microprocessor and second microprocessor coupled thereto |
US5822582A (en) * | 1996-07-19 | 1998-10-13 | Compaq Computer Corporation | Boot drive selection and hibernation file detection |
US6298370B1 (en) * | 1997-04-04 | 2001-10-02 | Texas Instruments Incorporated | Computer operating process allocating tasks between first and second processors at run time based upon current processor load |
US6105119A (en) * | 1997-04-04 | 2000-08-15 | Texas Instruments Incorporated | Data transfer circuitry, DSP wrapper circuitry and improved processor devices, methods and systems |
US5974518A (en) | 1997-04-10 | 1999-10-26 | Milgo Solutions, Inc. | Smart buffer size adaptation apparatus and method |
US6181549B1 (en) * | 1997-06-24 | 2001-01-30 | Dell Products, L.P. | Chassis retaining system for an electronics rack |
US6393483B1 (en) | 1997-06-30 | 2002-05-21 | Adaptec, Inc. | Method and apparatus for network interface card load balancing and port aggregation |
US7133940B2 (en) | 1997-10-14 | 2006-11-07 | Alacritech, Inc. | Network interface device employing a DMA command queue |
US6434620B1 (en) | 1998-08-27 | 2002-08-13 | Alacritech, Inc. | TCP/IP offload network interface device |
US6082845A (en) * | 1998-05-29 | 2000-07-04 | Lucent Technologies, Inc. | Tiltable electronics cabinet |
WO1999063438A1 (en) * | 1998-06-05 | 1999-12-09 | Mylex Corporation | Apparatus, system and method for n-way raid controller |
US6223271B1 (en) * | 1998-07-15 | 2001-04-24 | Compaq Computer Corp. | System and method for detecting system memory size using ROM based paging tables |
US7664883B2 (en) * | 1998-08-28 | 2010-02-16 | Alacritech, Inc. | Network interface device that fast-path processes solicited session layer read commands |
US6714549B1 (en) * | 1998-12-23 | 2004-03-30 | Worldcom, Inc. | High resiliency network infrastructure |
US6356951B1 (en) | 1999-03-01 | 2002-03-12 | Sun Microsystems, Inc. | System for parsing a packet for conformity with a predetermined protocol using mask and comparison values included in a parsing instruction |
US6493756B1 (en) * | 1999-10-28 | 2002-12-10 | Networks Associates, Inc. | System and method for dynamically sensing an asynchronous network event within a modular framework for network event processing |
US6484224B1 (en) | 1999-11-29 | 2002-11-19 | Cisco Technology Inc. | Multi-interface symmetric multiprocessor |
US6816963B1 (en) * | 2000-01-31 | 2004-11-09 | Intel Corporation | Platform level initialization using an image generated automatically by a remote server based upon description automatically generated and transmitted thereto by a processor-based system |
US6990685B1 (en) * | 2000-06-15 | 2006-01-24 | Dell Products L.P. | System and method for tracking bootable devices |
US6459571B1 (en) * | 2000-06-15 | 2002-10-01 | Bull Hn Information Systems Inc. | Packaging system for mass memory units |
US20020064164A1 (en) * | 2000-10-06 | 2002-05-30 | Barany Peter A. | Protocol header construction and/or removal for messages in wireless communications |
US6498716B1 (en) * | 2001-08-21 | 2002-12-24 | Compaq Information Technologies Group, L.P. | DC main power distribution |
CN1600050A (en) * | 2001-10-30 | 2005-03-23 | 伊金耐勒股份有限公司 | Simplified power and data connector for use with chassis system that house multiple processors |
US6968414B2 (en) * | 2001-12-04 | 2005-11-22 | International Business Machines Corporation | Monitoring insertion/removal of server blades in a data processing system |
US6657867B2 (en) * | 2001-12-14 | 2003-12-02 | Hewlett-Packard Development Company, Lp. | Hinged door for access to add-in cards |
US20030172205A1 (en) * | 2002-01-11 | 2003-09-11 | Bastian Richard Henry | Methods and components for mechanical computer |
US7100031B1 (en) * | 2002-03-27 | 2006-08-29 | Hewlett-Packard Development Company, L.P. | Detector and operational method for a firmware interface |
US7257105B2 (en) * | 2002-10-03 | 2007-08-14 | Cisco Technology, Inc. | L2 method for a wireless station to locate and associate with a wireless network in communication with a Mobile IP agent |
WO2004092951A2 (en) * | 2003-04-18 | 2004-10-28 | Sap Ag | Managing a computer system with blades |
US20040249932A1 (en) * | 2003-06-05 | 2004-12-09 | Bunz Shain W. | System and method for generating event notifications |
US7467417B2 (en) * | 2003-06-18 | 2008-12-16 | Architecture Technology Corporation | Active verification of boot firmware |
US7864806B2 (en) | 2004-01-06 | 2011-01-04 | Broadcom Corp. | Method and system for transmission control packet (TCP) segmentation offload |
US7120778B2 (en) * | 2004-02-18 | 2006-10-10 | Intel Corporation | Option ROM virtualization |
EP1630657A1 (en) * | 2004-08-30 | 2006-03-01 | STMicroelectronics S.r.l. | Embedded storage device with integrated data-management functions and storage system incorporating it |
US7469241B2 (en) * | 2004-11-30 | 2008-12-23 | Oracle International Corporation | Efficient data aggregation operations using hash tables |
US7386758B2 (en) * | 2005-01-13 | 2008-06-10 | Hitachi, Ltd. | Method and apparatus for reconstructing data in object-based storage arrays |
CN1809054A (en) * | 2005-01-21 | 2006-07-26 | 华为技术有限公司 | SIP message based text decoder |
US7500573B1 (en) * | 2005-01-21 | 2009-03-10 | Flynn James T | Saddle rack and harness rack lift |
US7562366B2 (en) | 2005-02-03 | 2009-07-14 | Solarflare Communications, Inc. | Transmit completion event batching |
US7330965B2 (en) * | 2005-02-09 | 2008-02-12 | International Business Machines Corporation | Multi-tiered boot list |
US7577151B2 (en) * | 2005-04-01 | 2009-08-18 | International Business Machines Corporation | Method and apparatus for providing a network connection table |
US7574623B1 (en) * | 2005-04-29 | 2009-08-11 | Network Appliance, Inc. | Method and system for rapidly recovering data from a “sick” disk in a RAID disk group |
US7460758B2 (en) * | 2005-06-03 | 2008-12-02 | Telect Inc. | Fiber management system |
US7584347B2 (en) * | 2005-06-10 | 2009-09-01 | Dell Products L.P. | System and method for identifying bootable device by generating a signature for each bootable device where the signature is independent of a location of the bootable device |
US7791890B2 (en) * | 2005-10-07 | 2010-09-07 | Nec Corporation | Computer system |
JP2007133807A (en) * | 2005-11-14 | 2007-05-31 | Hitachi Ltd | Data processing system, storage device, and management unit |
US7423870B2 (en) * | 2005-11-18 | 2008-09-09 | International Business Machines Corporation | Blade server assembly |
US7500073B1 (en) * | 2006-03-29 | 2009-03-03 | Sun Microsystems, Inc. | Relocation of virtual-to-physical mappings |
US20070233928A1 (en) * | 2006-03-31 | 2007-10-04 | Robert Gough | Mechanism and apparatus for dynamically providing required resources for a hot-added PCI express endpoint or hierarchy |
US7747749B1 (en) * | 2006-05-05 | 2010-06-29 | Google Inc. | Systems and methods of efficiently preloading documents to client devices |
US20080002711A1 (en) * | 2006-06-30 | 2008-01-03 | Bugenhagen Michael K | System and method for access state based service options |
US7987438B2 (en) * | 2006-08-10 | 2011-07-26 | International Business Machines Corporation | Structure for initializing expansion adapters installed in a computer system having similar expansion adapters |
JP4949804B2 (en) * | 2006-11-07 | 2012-06-13 | 株式会社日立製作所 | Integrated management computer, storage device management method, and computer system |
JP4723470B2 (en) * | 2006-12-28 | 2011-07-13 | 株式会社日立製作所 | Computer system and its chipset |
US8464024B2 (en) * | 2007-04-27 | 2013-06-11 | Hewlett-Packard Development Company, L.P. | Virtual address hashing |
US8644151B2 (en) * | 2007-05-22 | 2014-02-04 | Cisco Technology, Inc. | Processing packet flows |
CN101330446B (en) * | 2007-06-21 | 2012-05-09 | 中兴通讯股份有限公司 | Analysis method for enhancing protocol layer frame of special transmission channel |
US7724668B2 (en) * | 2007-06-27 | 2010-05-25 | Verizon Patent And Licensing Inc. | Bandwidth-based admission control mechanism |
US7793071B2 (en) | 2007-06-28 | 2010-09-07 | Intel Corporation | Method and system for reducing cache conflicts |
US8151081B2 (en) * | 2007-12-20 | 2012-04-03 | Intel Corporation | Method, system and apparatus for memory address mapping for sub-socket partitioning |
FI123966B (en) * | 2008-02-04 | 2014-01-15 | Tellabs Oy | Data communication device |
US7801046B2 (en) | 2008-04-28 | 2010-09-21 | Oracle America, Inc. | Method and system for bandwidth control on a network interface card |
US9015444B2 (en) * | 2008-06-09 | 2015-04-21 | Panasonic Intellectual Property Management Co., Ltd. | Access apparatus and available storage space calculation method |
US8086838B2 (en) * | 2008-08-13 | 2011-12-27 | Dell Products L.P. | Methods and systems for providing manufacturing mode detection and functionality in a UEFI BIOS |
US7921230B2 (en) * | 2008-09-08 | 2011-04-05 | International Business Corporation | USB devices pre-configuration for KVM switch |
US20100061207A1 (en) * | 2008-09-09 | 2010-03-11 | Seagate Technology Llc | Data storage device including self-test features |
TWI378384B (en) * | 2008-10-15 | 2012-12-01 | Phison Electronics Corp | Mother board system, storage device for booting up thereof and connector |
US8024719B2 (en) * | 2008-11-03 | 2011-09-20 | Advanced Micro Devices, Inc. | Bounded hash table sorting in a dynamic program profiling system |
US9184933B2 (en) | 2008-12-25 | 2015-11-10 | Mitsubishi Electric Corporation | Communication management apparatus, communication apparatus, and communication method |
US8103809B1 (en) | 2009-01-16 | 2012-01-24 | F5 Networks, Inc. | Network devices with multiple direct memory access channels and methods thereof |
US8112491B1 (en) | 2009-01-16 | 2012-02-07 | F5 Networks, Inc. | Methods and systems for providing direct DMA |
JP5393199B2 (en) * | 2009-03-02 | 2014-01-22 | キヤノン株式会社 | Start control method and apparatus |
WO2010140211A1 (en) * | 2009-06-01 | 2010-12-09 | 富士通株式会社 | Electronic unit, electronic system, and containing device |
WO2011002437A1 (en) * | 2009-06-29 | 2011-01-06 | Hewlett-Packard Development Company, L.P. | Memory agent to access memory blade as part of the cache coherency domain |
US8560798B2 (en) * | 2009-07-30 | 2013-10-15 | Cleversafe, Inc. | Dispersed storage network virtual address space |
US8832142B2 (en) * | 2010-08-30 | 2014-09-09 | Oracle International Corporation | Query and exadata support for hybrid columnar compressed data |
US9298662B2 (en) * | 2009-12-08 | 2016-03-29 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Providing expansion card settings |
US8743877B2 (en) | 2009-12-21 | 2014-06-03 | Steven L. Pope | Header processing engine |
JP5292321B2 (en) * | 2010-01-13 | 2013-09-18 | アラクサラネットワークス株式会社 | Communication device |
US8473567B2 (en) * | 2010-03-29 | 2013-06-25 | Intel Corporation | Generating a packet including multiple operation codes |
US9754266B2 (en) * | 2010-04-21 | 2017-09-05 | Excalibur Ip, Llc | Online serving threshold and delivery policy adjustment |
US8504718B2 (en) * | 2010-04-28 | 2013-08-06 | Futurewei Technologies, Inc. | System and method for a context layer switch |
US9300576B2 (en) * | 2010-05-03 | 2016-03-29 | Pluribus Networks Inc. | Methods, systems, and fabrics implementing a distributed network operating system |
CN102141825B (en) * | 2010-07-09 | 2013-01-02 | 华为技术有限公司 | Cabinet-level server system |
US8909749B2 (en) * | 2010-07-26 | 2014-12-09 | International Business Macines Corporation | Predictive context-based virtual workspace placement |
TWI406624B (en) * | 2010-11-11 | 2013-08-21 | Inventec Corp | Server |
US10033585B2 (en) * | 2010-12-15 | 2018-07-24 | Juniper Networks, Inc. | Methods and apparatus related to a switch fabric system having a multi-hop distributed control plane and a single-hop data plane |
US8812746B2 (en) * | 2010-12-16 | 2014-08-19 | Intel Corporation | Dynamically configurable device host controller |
US8582299B1 (en) * | 2010-12-23 | 2013-11-12 | Amazon Technologies, Inc. | System with movable computing devices |
US8832674B2 (en) * | 2011-02-24 | 2014-09-09 | Software Ag Usa, Inc. | Off-heap direct-memory data stores, methods of creating and/or managing off-heap direct-memory data stores, and/or systems including off-heap direct-memory data store |
JP5422777B2 (en) * | 2011-03-07 | 2014-02-19 | 株式会社日立製作所 | Network management apparatus, network management method, and network management system |
US9405550B2 (en) * | 2011-03-31 | 2016-08-02 | International Business Machines Corporation | Methods for the transmission of accelerator commands and corresponding command structure to remote hardware accelerator engines over an interconnect link |
US9645628B1 (en) * | 2011-05-09 | 2017-05-09 | EMC IP Holding Company LLC | Combined data storage and computing appliance that provides scalable storage in a clustered computing environment |
US9042402B1 (en) * | 2011-05-10 | 2015-05-26 | Juniper Networks, Inc. | Methods and apparatus for control protocol validation of a switch fabric system |
GB201107860D0 (en) * | 2011-05-11 | 2011-06-22 | Manda Ion | Rack module |
US9369341B2 (en) * | 2011-05-15 | 2016-06-14 | Orbit Communication Systems Ltd. | Static ring network for vehicle communications |
WO2012170521A2 (en) * | 2011-06-07 | 2012-12-13 | Lsi Corporation | Management of device firmware update effects as seen by a host |
US8812555B2 (en) * | 2011-06-18 | 2014-08-19 | Microsoft Corporation | Dynamic lock-free hash tables |
CN102902581B (en) * | 2011-07-29 | 2016-05-11 | 国际商业机器公司 | Hardware accelerator and method, CPU, computing equipment |
CN102929360A (en) * | 2011-08-09 | 2013-02-13 | 鸿富锦精密工业(深圳)有限公司 | Server cabinet |
US8930307B2 (en) * | 2011-09-30 | 2015-01-06 | Pure Storage, Inc. | Method for removing duplicate data from a storage array |
US9021138B2 (en) * | 2011-08-26 | 2015-04-28 | Microsoft Technology Licensing, Llc | Performance of multi-processor computer systems |
CN102999139B (en) * | 2011-09-08 | 2016-03-30 | 英业达股份有限公司 | Electric supply installation and the server rack system applying it |
US8964601B2 (en) * | 2011-10-07 | 2015-02-24 | International Business Machines Corporation | Network switching domains with a virtualized control plane |
CN103139106B (en) * | 2011-11-28 | 2014-06-11 | 英业达科技有限公司 | Server rack system |
US8788663B1 (en) * | 2011-12-20 | 2014-07-22 | Amazon Technologies, Inc. | Managing resource dependent workflows |
CN106469029B (en) * | 2011-12-31 | 2019-07-23 | 华为数字技术(成都)有限公司 | Data hierarchy storage processing method, device and storage equipment |
US8708736B2 (en) * | 2012-02-01 | 2014-04-29 | Dell Products L.P. | Systems and methods for coupling AC power to a rack-level power infrastructure |
US9396020B2 (en) * | 2012-03-30 | 2016-07-19 | Intel Corporation | Context switching mechanism for a processing core having a general purpose CPU core and a tightly coupled accelerator |
CN104204990B (en) * | 2012-03-30 | 2018-04-10 | 英特尔公司 | Accelerate the apparatus and method of operation in the processor using shared virtual memory |
US8868868B1 (en) * | 2012-05-31 | 2014-10-21 | Netapp, Inc. | Method and system for responding to client requests for information maintained by storage systems |
US9613052B2 (en) * | 2012-06-05 | 2017-04-04 | International Business Machines Corporation | Establishing trust within a cloud computing system |
US9064216B2 (en) * | 2012-06-06 | 2015-06-23 | Juniper Networks, Inc. | Identifying likely faulty components in a distributed system |
CN104272288B (en) | 2012-06-08 | 2018-01-30 | 英特尔公司 | For realizing the method and system of virtual machine VM Platform communication loopbacks |
US8838577B2 (en) * | 2012-07-24 | 2014-09-16 | International Business Machines Corporation | Accelerated row decompression |
CN103634330A (en) * | 2012-08-20 | 2014-03-12 | 曙光信息产业(北京)有限公司 | Automatic resource distribution method in cloud calculation environment |
US10230762B2 (en) * | 2012-08-31 | 2019-03-12 | Jpmorgan Chase Bank, N.A. | System and method for sharing information in a private ecosystem |
US9154298B2 (en) * | 2012-08-31 | 2015-10-06 | Cleversafe, Inc. | Securely storing data in a dispersed storage network |
US8938417B2 (en) * | 2013-02-22 | 2015-01-20 | International Business Machines Corporation | Integrity checking and selective deduplication based on network parameters |
JP6009097B2 (en) * | 2013-02-27 | 2016-10-19 | ヒタチ データ システムズ コーポレーションHitachi Data Systems Corporation | Separation of content and metadata in a distributed object storage ecosystem |
US20140282584A1 (en) * | 2013-03-14 | 2014-09-18 | Silicon Graphics International Corp. | Allocating Accelerators to Threads in a High Performance Computing System |
US9558010B2 (en) * | 2013-03-14 | 2017-01-31 | International Business Machines Corporation | Fast hot boot of a computer system |
US9317444B2 (en) | 2013-03-15 | 2016-04-19 | Vmware, Inc. | Latency reduction for direct memory access operations involving address translation |
ES2719271T3 (en) * | 2013-03-19 | 2019-07-09 | Adc Czech Republic Sro | Control of curvature and support of connection cables, mobile, for telecommunications panels |
US10037061B1 (en) * | 2013-04-30 | 2018-07-31 | Amazon Technologies, Inc. | Multiple-stage cooling system for rack |
US8898227B1 (en) * | 2013-05-10 | 2014-11-25 | Owl Computing Technologies, Inc. | NFS storage via multiple one-way data links |
US9424079B2 (en) * | 2013-06-27 | 2016-08-23 | Microsoft Technology Licensing, Llc | Iteration support in a heterogeneous dataflow engine |
WO2015023537A2 (en) * | 2013-08-16 | 2015-02-19 | Interdigital Patent Holdings, Inc. | Methods and apparatus for hash routing in software defined networking |
US10684973B2 (en) | 2013-08-30 | 2020-06-16 | Intel Corporation | NUMA node peripheral switch |
US9444914B2 (en) * | 2013-09-16 | 2016-09-13 | Annapurna Labs Ltd. | Configurable parser and a method for parsing information units |
CN105814852B (en) * | 2013-09-19 | 2019-02-19 | 华为技术有限公司 | Reduce transmission and the receiving device of the delay of end to end network message transmissions |
WO2015056101A2 (en) * | 2013-10-17 | 2015-04-23 | Marvell Israel | Processing concurrency in a network device |
US9411601B2 (en) * | 2013-10-29 | 2016-08-09 | Intel Corporation | Flexible bootstrap code architecture |
US20160292009A1 (en) * | 2013-12-20 | 2016-10-06 | David Kaplan | Execution offloading through syscall trap interface |
US9628503B2 (en) * | 2014-01-17 | 2017-04-18 | F5 Networks, Inc. | Systems and methods for network destination based flood attack mitigation |
US20150293699A1 (en) * | 2014-04-11 | 2015-10-15 | Graham Bromley | Network-attached storage enhancement appliance |
CN106233673B (en) * | 2014-04-29 | 2019-07-19 | 慧与发展有限责任合伙企业 | Device and method for network service insertion |
US10180889B2 (en) * | 2014-06-23 | 2019-01-15 | Liqid Inc. | Network failover handling in modular switched fabric based data storage systems |
US10275171B2 (en) * | 2014-09-16 | 2019-04-30 | Kove Ip, Llc | Paging of external memory |
US9626108B2 (en) * | 2014-09-16 | 2017-04-18 | Kove Ip, Llc | Dynamically provisionable and allocatable external memory |
CN106688208B (en) * | 2014-09-25 | 2020-06-30 | 英特尔公司 | Network communication using pooled storage in a rack scale architecture |
US9971619B2 (en) * | 2014-10-15 | 2018-05-15 | Keysight Technologies Singapore (Holdings) Pte Ltd | Methods and systems for forwarding network packets within virtual machine host systems |
US9501420B2 (en) * | 2014-10-22 | 2016-11-22 | Netapp, Inc. | Cache optimization technique for large working data sets |
US9596253B2 (en) * | 2014-10-30 | 2017-03-14 | Splunk Inc. | Capture triggers for capturing network data |
US10116772B2 (en) | 2014-11-14 | 2018-10-30 | Cavium, Inc. | Network switching with co-resident data-plane and network interface controllers |
US10230824B2 (en) * | 2014-11-17 | 2019-03-12 | Keysight Technologies Singapore (Holdings) Pte. Lte. | Packet classification using memory pointer information |
US9838333B2 (en) * | 2015-01-20 | 2017-12-05 | Futurewei Technologies, Inc. | Software-defined information centric network (ICN) |
US9560078B2 (en) * | 2015-02-04 | 2017-01-31 | Intel Corporation | Technologies for scalable security architecture of virtualized networks |
US9767856B2 (en) * | 2015-02-10 | 2017-09-19 | Netapp, Inc. | High density storage device system |
US9569267B2 (en) * | 2015-03-16 | 2017-02-14 | Intel Corporation | Hardware-based inter-device resource sharing |
US9792154B2 (en) * | 2015-04-17 | 2017-10-17 | Microsoft Technology Licensing, Llc | Data processing system having a hardware acceleration plane and a software plane |
US10606651B2 (en) | 2015-04-17 | 2020-03-31 | Microsoft Technology Licensing, Llc | Free form expression accelerator with thread length-based thread assignment to clustered soft processor cores that share a functional circuit |
IL238690B (en) * | 2015-05-07 | 2019-07-31 | Mellanox Technologies Ltd | Network-based computational accelerator |
US9578008B2 (en) * | 2015-05-11 | 2017-02-21 | Intel Corporation | Technologies for secure bootstrapping of virtual network functions |
US9606836B2 (en) * | 2015-06-09 | 2017-03-28 | Microsoft Technology Licensing, Llc | Independently networkable hardware accelerators for increased workflow optimization |
US10049078B1 (en) * | 2015-06-25 | 2018-08-14 | Amazon Technologies, Inc. | Accessing a memory location using a two-stage hash scheme |
US10063446B2 (en) * | 2015-06-26 | 2018-08-28 | Intel Corporation | Netflow collection and export offload using network silicon |
US9668382B2 (en) * | 2015-08-11 | 2017-05-30 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Coolant distribution unit for a multi-node chassis |
US9891935B2 (en) * | 2015-08-13 | 2018-02-13 | Altera Corporation | Application-based dynamic heterogeneous many-core systems and methods |
US9749266B2 (en) * | 2015-08-28 | 2017-08-29 | International Business Machines Corporation | Coalescing messages using a network interface controller |
US10296232B2 (en) * | 2015-09-01 | 2019-05-21 | Western Digital Technologies, Inc. | Service level based control of storage systems |
CN105183561B (en) * | 2015-09-02 | 2018-09-14 | 浪潮(北京)电子信息产业有限公司 | A kind of resource allocation methods and system |
US11068469B2 (en) * | 2015-09-04 | 2021-07-20 | Arista Networks, Inc. | System and method of a dynamic shared memory hash table with notifications |
US10321597B2 (en) * | 2015-09-07 | 2019-06-11 | Dell Products, L.P. | User interface enhanced storage sled handle with embedded security features |
US10725963B2 (en) * | 2015-09-12 | 2020-07-28 | Microsoft Technology Licensing, Llc | Distributed lock-free RDMA-based memory allocation and de-allocation |
WO2017052575A1 (en) * | 2015-09-25 | 2017-03-30 | Intel Corporation | Extending multichip package link off package |
US20170093770A1 (en) * | 2015-09-25 | 2017-03-30 | Intel Corporation | Technologies for receive side message inspection and filtering |
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 |
CN111865657B (en) * | 2015-09-28 | 2022-01-11 | 华为技术有限公司 | Acceleration management node, acceleration node, client and method |
US9996539B1 (en) * | 2015-09-30 | 2018-06-12 | EMC IP Holding Company LLC | Data protection and long term retention |
US9912788B2 (en) * | 2015-11-10 | 2018-03-06 | Telefonaktiebolaget L M Ericsson (Publ) | Systems and methods of an enhanced state-aware proxy device |
US10206297B2 (en) * | 2015-11-23 | 2019-02-12 | Liqid Inc. | Meshed architecture rackmount storage assembly |
EP3384393B1 (en) * | 2015-12-02 | 2020-03-11 | Telefonaktiebolaget LM Ericsson (publ) | Method and memory availability managing module for managing availability of memory pages |
US10218647B2 (en) * | 2015-12-07 | 2019-02-26 | Intel Corporation | Mechanism to support multiple-writer/multiple-reader concurrency for software flow/packet classification on general purpose multi-core systems |
KR102509988B1 (en) * | 2015-12-15 | 2023-03-14 | 삼성전자주식회사 | Storage system and method for connection-based load balancing |
US10230633B2 (en) * | 2016-01-21 | 2019-03-12 | Red Hat, Inc. | Shared memory communication in software defined networking |
WO2017131621A1 (en) * | 2016-01-25 | 2017-08-03 | Hewlett-Packard Development Company, L.P. | Protecting basic input/output (bios) code |
US10713314B2 (en) * | 2016-01-29 | 2020-07-14 | Splunk Inc. | Facilitating data model acceleration in association with an external data system |
KR101936950B1 (en) * | 2016-02-15 | 2019-01-11 | 주식회사 맴레이 | Computing device, data transfer method between coprocessor and non-volatile memory, and program including the same |
US9933821B2 (en) * | 2016-02-17 | 2018-04-03 | Quanta Computer Inc. | Chassis with lock mechanism |
US10180992B2 (en) * | 2016-03-01 | 2019-01-15 | Microsoft Technology Licensing, Llc | Atomic updating of graph database index structures |
US20170257970A1 (en) * | 2016-03-04 | 2017-09-07 | Radisys Corporation | Rack having uniform bays and an optical interconnect system for shelf-level, modular deployment of sleds enclosing information technology equipment |
US10069688B2 (en) * | 2016-03-07 | 2018-09-04 | International Business Machines Corporation | Dynamically assigning, by functional domain, separate pairs of servers to primary and backup service processor modes within a grouping of servers |
US10248349B2 (en) * | 2016-03-22 | 2019-04-02 | Oracle International Corporation | Efficient and thread-safe objects for dynamically-typed languages |
US10146550B2 (en) * | 2016-03-28 | 2018-12-04 | Dell Products, L.P. | System and method to remotely detect and report bootable physical disk location |
US10523598B2 (en) * | 2016-04-04 | 2019-12-31 | Futurewei Technologies, Inc. | Multi-path virtual switching |
US20180024964A1 (en) * | 2016-07-19 | 2018-01-25 | Pure Storage, Inc. | Disaggregated compute resources and storage resources in a storage system |
US10334334B2 (en) * | 2016-07-22 | 2019-06-25 | Intel Corporation | Storage sled and techniques for a data center |
US10686688B2 (en) | 2016-07-22 | 2020-06-16 | Intel Corporation | Methods and apparatus to reduce static and dynamic fragmentation impact on software-defined infrastructure architectures |
US10917456B2 (en) * | 2016-07-25 | 2021-02-09 | Red Hat, Inc. | Application management in an application deployment pipeline |
US10078468B2 (en) * | 2016-08-18 | 2018-09-18 | International Business Machines Corporation | Slice migration in a dispersed storage network |
US10277677B2 (en) * | 2016-09-12 | 2019-04-30 | Intel Corporation | Mechanism for disaggregated storage class memory over fabric |
US20180089044A1 (en) * | 2016-09-27 | 2018-03-29 | Francesc Guim Bernat | Technologies for providing network interface support for remote memory and storage failover protection |
US10853364B2 (en) * | 2016-09-28 | 2020-12-01 | Microsoft Technology Licensing, Llc | Direct table association in in-memory databases |
US10936533B2 (en) | 2016-10-18 | 2021-03-02 | Advanced Micro Devices, Inc. | GPU remote communication with triggered operations |
US10171309B1 (en) * | 2016-12-23 | 2019-01-01 | EMC IP Holding Company LLC | Topology service |
US10824355B2 (en) * | 2017-01-10 | 2020-11-03 | International Business Machines Corporation | Hierarchical management of storage capacity and data volumes in a converged system |
US10198270B2 (en) * | 2017-01-19 | 2019-02-05 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Dynamic hardware configuration via firmware interface at computing device boot |
US20180212885A1 (en) | 2017-01-20 | 2018-07-26 | Google Inc. | Device and method for scalable traffic shaping at a receiver with a time-indexed data structure |
US10922296B2 (en) * | 2017-03-01 | 2021-02-16 | Sap Se | In-memory row storage durability |
US10503427B2 (en) * | 2017-03-10 | 2019-12-10 | Pure Storage, Inc. | Synchronously replicating datasets and other managed objects to cloud-based storage systems |
US10628057B2 (en) * | 2017-03-28 | 2020-04-21 | Hewlett Packard Enterprise Development Lp | Capability based locking and access of shared persistent memory |
US10346315B2 (en) * | 2017-05-26 | 2019-07-09 | Oracle International Corporation | Latchless, non-blocking dynamically resizable segmented hash index |
US10324859B2 (en) * | 2017-06-26 | 2019-06-18 | Western Digital Technologies, Inc. | Multi-plane memory management |
US20190044809A1 (en) * | 2017-08-30 | 2019-02-07 | Intel Corporation | Technologies for managing a flexible host interface of a network interface controller |
US10334760B1 (en) * | 2018-01-12 | 2019-06-25 | Jed A. Darland | System and method for helical cooling tower for efficient cooling |
US10447273B1 (en) * | 2018-09-11 | 2019-10-15 | Advanced Micro Devices, Inc. | Dynamic virtualized field-programmable gate array resource control for performance and reliability |
-
2017
- 2017-12-06 US US15/833,523 patent/US20190044809A1/en not_active Abandoned
- 2017-12-28 US US15/856,220 patent/US10554391B2/en active Active
- 2017-12-28 US US15/856,858 patent/US20190034490A1/en not_active Abandoned
- 2017-12-28 US US15/856,173 patent/US10469252B2/en active Active
- 2017-12-28 US US15/856,556 patent/US10567166B2/en not_active Expired - Fee Related
- 2017-12-28 US US15/856,644 patent/US10728024B2/en active Active
- 2017-12-29 US US15/858,569 patent/US20190042126A1/en not_active Abandoned
- 2017-12-30 US US15/859,367 patent/US10581596B2/en active Active
- 2017-12-30 US US15/859,387 patent/US11050554B2/en active Active
- 2017-12-30 US US15/859,369 patent/US10476670B2/en active Active
- 2017-12-30 US US15/859,391 patent/US11249816B2/en active Active
-
2018
- 2018-01-11 US US15/868,594 patent/US20190042611A1/en not_active Abandoned
- 2018-01-11 US US15/868,492 patent/US20190042408A1/en not_active Abandoned
- 2018-03-06 US US15/912,733 patent/US11025411B2/en active Active
- 2018-03-15 US US15/922,502 patent/US20190042091A1/en not_active Abandoned
- 2018-03-15 US US15/922,493 patent/US20190042090A1/en not_active Abandoned
- 2018-03-30 US US15/941,114 patent/US20190052457A1/en not_active Abandoned
- 2018-07-25 US US16/045,345 patent/US10756886B2/en active Active
- 2018-07-26 DE DE102018212479.5A patent/DE102018212479A1/en active Pending
- 2018-08-16 JP JP2018153250A patent/JP7214394B2/en active Active
- 2018-08-28 EP EP18191343.5A patent/EP3460662A1/en not_active Ceased
- 2018-08-28 EP EP18191345.0A patent/EP3454530A1/en not_active Ceased
- 2018-08-28 EP EP20217841.4A patent/EP3823245A1/en not_active Withdrawn
- 2018-08-28 EP EP18191344.3A patent/EP3451196A1/en active Pending
- 2018-08-29 CN CN201810995046.XA patent/CN109426455A/en active Pending
- 2018-08-30 CN CN201811006539.2A patent/CN109426652A/en active Pending
- 2018-08-30 CN CN202311445788.2A patent/CN117725004A/en active Pending
- 2018-08-30 CN CN201811004538.4A patent/CN109426647A/en active Pending
- 2018-08-30 CN CN201811005693.8A patent/CN109426456A/en active Pending
- 2018-08-30 CN CN202110060921.7A patent/CN112732447B/en active Active
- 2018-08-30 CN CN201811005692.3A patent/CN109426648A/en active Pending
- 2018-08-30 CN CN202310326481.4A patent/CN116501683A/en active Pending
- 2018-08-30 EP EP18191862.4A patent/EP3451635B1/en active Active
- 2018-08-30 CN CN201811006541.XA patent/CN109426569A/en active Pending
- 2018-08-30 CN CN201811005808.3A patent/CN109426649A/en active Pending
- 2018-08-30 CN CN201811005604.XA patent/CN109428770A/en active Pending
- 2018-08-30 CN CN202211257988.0A patent/CN115543204A/en active Pending
- 2018-08-30 CN CN202110870167.3A patent/CN113806260A/en active Pending
-
2020
- 2020-08-24 US US17/001,502 patent/US11588624B2/en active Active
-
2021
- 2021-05-27 US US17/332,733 patent/US11522682B2/en active Active
- 2021-06-10 US US17/344,253 patent/US11843691B2/en active Active
- 2021-08-02 US US17/391,549 patent/US20220012105A1/en not_active Abandoned
-
2022
- 2022-07-22 US US17/871,429 patent/US11888967B2/en active Active
-
2023
- 2023-08-25 US US18/238,096 patent/US20230421358A1/en active Pending
- 2023-09-01 US US18/241,748 patent/US20230412365A1/en active Pending
- 2023-12-15 US US18/542,308 patent/US20240195605A1/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100269024A1 (en) * | 2009-04-18 | 2010-10-21 | Fang Hao | Method and apparatus for multiset membership testing using combinatorial bloom filters |
US20140013078A1 (en) * | 2011-12-08 | 2014-01-09 | Oracle International Corporation | Efficient hardware instructions for single instruction multiple data processors |
US20150022570A1 (en) * | 2013-07-16 | 2015-01-22 | Xerox Corporation | System And Method For Optimized Application Of Release Agent In An Inkjet Printer With In-Line Coating |
US20150088926A1 (en) * | 2013-09-21 | 2015-03-26 | Oracle International Corporation | Methods and systems for fast set-membership tests using one or more processors that support single instruction multiple data instructions |
US20150220570A1 (en) * | 2014-02-06 | 2015-08-06 | International Business Machines Corporation | Multilevel filters for cache-efficient access |
US20170154099A1 (en) * | 2015-11-26 | 2017-06-01 | International Business Machines Corporation | Efficient lookup in multiple bloom filters |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11595277B2 (en) | 2016-07-22 | 2023-02-28 | Intel Corporation | Technologies for switching network traffic in a data center |
US10791384B2 (en) | 2016-07-22 | 2020-09-29 | Intel Corporation | Technologies for switching network traffic in a data center |
US10802229B2 (en) | 2016-07-22 | 2020-10-13 | Intel Corporation | Technologies for switching network traffic in a data center |
US11128553B2 (en) | 2016-07-22 | 2021-09-21 | Intel Corporation | Technologies for switching network traffic in a data center |
US10785549B2 (en) | 2016-07-22 | 2020-09-22 | Intel Corporation | Technologies for switching network traffic in a data center |
US11137922B2 (en) | 2016-11-29 | 2021-10-05 | Intel Corporation | Technologies for providing accelerated functions as a service in a disaggregated architecture |
US11907557B2 (en) | 2016-11-29 | 2024-02-20 | Intel Corporation | Technologies for dividing work across accelerator devices |
US11977923B2 (en) | 2016-11-29 | 2024-05-07 | Intel Corporation | Cloud-based scale-up system composition |
US11995330B2 (en) | 2016-11-29 | 2024-05-28 | Intel Corporation | Technologies for providing accelerated functions as a service in a disaggregated architecture |
US20210351943A1 (en) * | 2017-11-29 | 2021-11-11 | Taiwan Semiconductor Manufacturing Company, Ltd. | Authentication based on physically unclonable functions |
US11777747B2 (en) * | 2017-11-29 | 2023-10-03 | Taiwan Semiconductor Manufacturing Company, Ltd. | Authentication based on physically unclonable functions |
US20230176758A1 (en) * | 2021-12-03 | 2023-06-08 | Samsung Electronics Co., Ltd. | Two-level indexing for key-value persistent storage device |
US11954345B2 (en) * | 2021-12-03 | 2024-04-09 | Samsung Electronics Co., Ltd. | Two-level indexing for key-value persistent storage device |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20190042611A1 (en) | Technologies for structured database query for finding unique element values | |
US10917321B2 (en) | Disaggregated physical memory resources in a data center | |
US11907557B2 (en) | Technologies for dividing work across accelerator devices | |
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:YAP, KIRK;GUILFORD, JAMES;CUTTER, DANIEL;AND OTHERS;SIGNING DATES FROM 20180119 TO 20180122;REEL/FRAME:044696/0549 |
|
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 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |