-
1.发明申请公开(公告)号：US20180114132A1
公开(公告)日：2018-04-26
申请号：US15568307
申请日：2015-05-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Fei Chen , Maria Teresa Gonzalez Diaz , Hideaki Kimura , Krishnamurthy Viswanathan
CPC classification number: G06N5/048 , G06F12/0875 , G06F16/2379 , G06F16/278 , G06F16/9024 , G06F2212/302 , G06T1/60 , H04N19/42
Abstract: A technique includes performing graph inference in a graph inference engine that includes multiple processing nodes to determine assignments for vertices of a graph. Performing the graph inference includes controlling remote memory accesses within the engine, including storing first data in a local memory of the first processing node, where the first data represents at least assignments for a plurality of vertices of the graph; in the first processing node, determining updates for the assignments for a subset of the plurality of vertices of a partition of the graph assigned to the first processing node and modifying the first data based on the updates; and communicating the updates to at least one other processing node of the multiple processing nodes, where at least one other partition of the graph is assigned to the other processing node(s).
-
公开(公告)号：US20180011892A1
公开(公告)日：2018-01-11
申请号：US15545425
申请日：2015-01-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Hideaki Kimura
IPC: G06F17/30
CPC classification number: G06F16/2365 , G06F16/2228 , G06F16/2246 , G06F16/2308
Abstract: Example implementation disclosed herein include techniques for methods, systems, and devices for a foster twin data structure. The data structure includes data pages, keys, and pointers. The pointers define hierarchical parent-child relationships among the data pages based on the keys. Transactions that result in inserts into the data pages are handled using foster twin data pages that split key ranges and the corresponding data records into two foster twin data pages. New pointers are added to the parent data page of the split data pages to indicate the new parent child relationship between the parent data page and the foster twin data pages. The old data page can be retired by adding a moved-bit and removing the old pointers from the parent data page to guide concurrent transaction and prevent future transactions.
-
公开(公告)号：US20210042169A1
公开(公告)日：2021-02-11
申请号：US17077946
申请日：2020-10-22
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Hideaki Kimura , Tianzheng Wang , Milind M. Chabbi
IPC: G06F9/52
Abstract: In example implementations, a method include receiving a request for a lock in a Mellor-Crummey Scott (MCS) lock protocol from a guest user that is context free (e.g., a process that does not bring a queue node). The lock determines that it contains a null value. The lock is granted to the guest user. A pi value is received from the guest user to store in the lock. The pi value notifies subsequent users that the guest user has the lock.
-
公开(公告)号：US20180011893A1
公开(公告)日：2018-01-11
申请号：US15545491
申请日：2015-01-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Hideaki Kimura
CPC classification number: G06F16/2365 , G06F11/1451 , G06F12/0238 , G06F16/278 , G06F16/283 , G06F16/9014 , G06F16/9027 , G06F2201/80 , G06F2201/84 , G06F2212/202
Abstract: Example implementations disclosed herein can be used to build, maintain, and use a hash table distributed across the plurality multiple nodes in a multi-node computing system. The hash table can include data pages associated by corresponding pointers according to a tree data structure. The data pages include leaf data pages. Each leaf data page can be associated with a corresponding hash value and include a tag bitmap. When a transaction associated with a key is executed, a hash value and a tag value are generated based on the key. The leaf data pages can be searched using the hash value. A probability that a leaf data page includes the key can be determined based on a comparison tag value with the tag bitmap.
-
公开(公告)号：US11768716B2
公开(公告)日：2023-09-26
申请号：US17077946
申请日：2020-10-22
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Hideaki Kimura , Tianzheng Wang , Milind M. Chabbi
IPC: G06F9/52
CPC classification number: G06F9/526 , G06F2209/521
Abstract: In example implementations, a method include receiving a request for a lock in a Mellor-Crummey Scott (MCS) lock protocol from a guest user that is context free (e.g., a process that does not bring a queue node). The lock determines that it contains a null value. The lock is granted to the guest user. A pi value is received from the guest user to store in the lock. The pi value notifies subsequent users that the guest user has the lock.
-
Patent Agency Ranking
公开(公告)号：US11023453B2
公开(公告)日：2021-06-01
申请号：US15545491
申请日：2015-01-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Hideaki Kimura
Abstract: Example implementations disclosed herein can be used to build, maintain, and use a hash table distributed across the plurality multiple nodes in a multi-node computing system. The hash table can include data pages associated by corresponding pointers according to a tree data structure. The data pages include leaf data pages. Each leaf data page can be associated with a corresponding hash value and include a tag bitmap. When a transaction associated with a key is executed, a hash value and a tag value are generated based on the key. The leaf data pages can be searched using the hash value. A probability that a leaf data page includes the key can be determined based on a comparison tag value with the tag bitmap.
-
公开(公告)号：US20210042286A1
公开(公告)日：2021-02-11
申请号：US17079802
申请日：2020-10-26
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Hideaki Kimura
Abstract: Example implementations disclosed herein can be used to build, maintain, and access databases built database in multi-core computing systems with large VRAM and huge NVRAM. The database with optimistic concurrency control can be built on a transactional key-value data store that includes logically equivalent data pages stored in both VRAM and VRAM. Data records in volatile data pages in the VRAM represent the most recent version of the data. Data records in the NVRAM immutable and are organized in a stratified composite snapshot. A distributed log gleaner process is used to process log entries corresponding to transactions on the volatile data pages and construct the snapshot. The log gleaner sorts the log entries by epoch, key range, and most recent use to partition the snapshot across multiple nodes.
-
公开(公告)号：US20180246773A1
公开(公告)日：2018-08-30
申请号：US15756932
申请日：2015-09-10
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Hideaki Kimura , Tianzheng Wang , Milind M. Chabbi
IPC: G06F9/52
CPC classification number: G06F9/526 , G06F2209/521
Abstract: In example implementations, a method include receiving a request for a lock in a Mellor-Crummey Scott (MCS) lock protocol from a guest user that is context free (e.g., a process that does not bring a queue node). The lock determines that it contains a null value. The lock is granted to the guest user. A pi value is received from the guest user to store in the lock. The pi value notifies subsequent users that the guest user has the lock.
-
公开(公告)号：US20170371912A1
公开(公告)日：2017-12-28
申请号：US15545389
申请日：2015-01-29
Applicant: Hewlett Packard Enterprise Development LP
Inventor： Hideaki Kimura
CPC classification number: G06F16/2336 , G06F3/0619 , G06F3/0659 , G06F3/0685 , G06F11/1451 , G06F16/2315 , G06F16/2365 , G06F2201/84
Abstract: Example implementations herein can be used to build, maintain, and access databases built database in multi-core computing systems with large VRAM and huge NVRAM. The database with optimistic concurrency control can be built on a transactional key-value data store that includes logically equivalent data pages stored in both VRAM and VRAM. Data records in volatile data pages in the VRAM represent the most recent version of the data. Data records in the NVRAM immutable and are organized in a stratified composite snapshot. A distributed log gleaner process is used to process entries corresponding to transactions on the volatile data pages and construct the snapshot. The log gleaner sorts the log entries by epoch, key range, and most recent use to partition the snapshot across multiple nodes.
-
公开(公告)号：US20170046096A1
公开(公告)日：2017-02-16
申请号：US15305389
申请日：2014-04-24
Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor： Goetz Graefe , Haris Volos , Hideaki Kimura , Harumi Kuno , Alistair Veitch , Joseph Tucek , Alvin AuYoung
IPC: G06F3/06
CPC classification number: G06F3/0644 , G06F3/0604 , G06F3/064 , G06F3/0652 , G06F3/0673 , G06F12/1009
Abstract: Approaches for structuring a plurality of page images in-memory are described in various examples of the present disclosure. In one example, a unique page identifier provided within a reference page image is identified. The unique page identifier is associated with a target page image stored in-memory. Once identified, the page identifier associated with the target page image is replaced with a location specific identifier of the target page image, wherein the location specific identifier is based on an in-memory location of the target page image.
Abstract translation: 在本公开的各种示例中描述了用于构造存储器中的多个页面图像的方法。 在一个示例中，识别在参考页面图像内提供的唯一页面标识符。 独特的页面标识符与存储在内存中的目标页面图像相关联。 一旦被识别，与目标页面图像相关联的页面标识符被目标页面图像的位置特定标识符替换，其中位置特定标识符基于目标页面图像的存储器内位置。
-
-
-
-
-
-
-
-
-
Search Results
17
records
(took 0.029 seconds)
