Parallel execution of operations for a partitioned binary radix tree on a parallel computer
First Claim
1. A method of parallel execution of operations for a previously established partitioned binary radix tree (‘
- PBRT’
) on a parallel computer, the previously established PBRT comprising;
a plurality of logical pages that contain a plurality of entries in the previously established PBRT, each logical page included in a tier of the previously established PBRT and containing one or more subentries represented by a plurality of radix nodes organized as a sub tree on the logical page, each subentry is a portion of an entry that corresponds to the tier of the logical page containing the subentry, each entry in the previously established PBRT is composed of a subentry from each logical page on an entry path for the entry,the method comprising;
receiving, in the parallel computer, an operational entry for the previously established PBRT;
processing in parallel, on the parallel computer, each logical page in each tier of the previously established PBRT, including;
identifying a portion of the operational entry that corresponds to the tier of the logical page, andperforming an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and
selecting operation results from the logical pages on the entry path for the operational entry.
1 Assignment
0 Petitions
Accused Products
Abstract
Methods, apparatus, and products are disclosed for parallel execution of operations for a partitioned binary radix tree that include: receiving, in a parallel computer, an operational entry for the PBRT, the PBRT comprising a plurality of logical pages that contain a plurality of entries, each logical page included in a tier and containing one or more subentries corresponding to the tier of the logical page containing the subentry, each entry is composed of a subentry from each logical page on an entry path; processing in parallel, on the parallel computer, each logical page in each tier, including: identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and selecting operation results from the logical pages on the entry path for the operational entry.
-
Citations
18 Claims
-
1. A method of parallel execution of operations for a previously established partitioned binary radix tree (‘
- PBRT’
) on a parallel computer, the previously established PBRT comprising;a plurality of logical pages that contain a plurality of entries in the previously established PBRT, each logical page included in a tier of the previously established PBRT and containing one or more subentries represented by a plurality of radix nodes organized as a sub tree on the logical page, each subentry is a portion of an entry that corresponds to the tier of the logical page containing the subentry, each entry in the previously established PBRT is composed of a subentry from each logical page on an entry path for the entry, the method comprising; receiving, in the parallel computer, an operational entry for the previously established PBRT; processing in parallel, on the parallel computer, each logical page in each tier of the previously established PBRT, including; identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and selecting operation results from the logical pages on the entry path for the operational entry. - View Dependent Claims (2, 3, 4, 5, 6)
- PBRT’
-
7. A parallel computer for parallel execution of operations for a previously established partitioned binary radix tree, the parallel computer comprising:
-
a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within the computer memory computer program instructions configured to; receive, in the parallel computer, an operational entry for the previously established PBRT, the previously established PBRT comprising a plurality of logical pages that contain a plurality of entries in the previously established PBRT, each logical page included in a tier of the previously established PBRT and containing one or more subentries represented by a plurality of radix nodes organized as a sub tree on the logical page, each subentry is a portion of an entry that corresponds to the tier of the logical page containing the subentry, each entry in the previously established PBRT is composed of a subentry from each logical page on an entry path for the entry; process in parallel, on the parallel computer, each logical page in each tier of the previously established PBRT, including; identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and select operation results from the logical pages on the entry path for the operational entry. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A computer program product for parallel execution of operations for a previously established partitioned binary radix tree on a parallel computer, the computer program product:
-
disposed upon a recordable medium for machine-readable information and comprising computer program instructions configured to; receive, in the parallel computer, an operational entry for the previously established PBRT, the previously established PBRT comprising a plurality of logical pages that contain a plurality of entries in the previously established PBRT, each logical page included in a tier of the previously established PBRT and containing one or more subentries represented by a plurality of radix nodes organized as a sub tree on the logical page, each subentry is a portion of an entry that corresponds to the tier of the logical page containing the subentry, each entry in the previously established PBRT is composed of a subentry from each logical page on an entry path for the entry; process in parallel, on the parallel computer, each logical page in each tier of the previously established PBRT, including; identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and select operation results from the logical pages on the entry path for the operational entry. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification