Automatically segmenting and populating a distributed...

Electrical computers and digital processing systems: multicomput – Distributed data processing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07467180

ABSTRACT:
A method is described for automatically segmenting and populating a distributed problem, including determining a bounding space that is at least equal in size to a problem space volume, partitioning the bounding space into a plurality of sub-spaces capable of holding collections of original problem cells, mapping the distributed problem into the partitioned bounding space to populate the sub-spaces with data from the problem, and determining boundaries between the sub-spaces. The method further includes determining coupling interdependencies between sub-spaces, determining complexities associated with boundaries, calculating densities of the data from the problem, and if the densities of two or more contiguous collections fall below a lower level threshold, dynamically joining the two or more contiguous collections, if a particular collection density exceeds an upper threshold, dynamically subdividing the particular collection into a finer granularity, and processing the problem based on the boundaries, the coupling interdependencies, the complexities, and the densities.

REFERENCES:
patent: 5031089 (1991-07-01), Liu et al.
patent: 5442569 (1995-08-01), Osano
patent: 5630129 (1997-05-01), Wheat
patent: 5938722 (1999-08-01), Johnson
patent: 6008848 (1999-12-01), Tiwari et al.
patent: 6009455 (1999-12-01), Doyle
patent: 6049819 (2000-04-01), Buckle et al.
patent: 6058266 (2000-05-01), Megiddo et al.
patent: 6088727 (2000-07-01), Hosokawa et al.
patent: 6101538 (2000-08-01), Brown
patent: 6141699 (2000-10-01), Luzzi et al.
patent: 6308208 (2001-10-01), Jung et al.
patent: 6345287 (2002-02-01), Fong et al.
patent: 6370560 (2002-04-01), Robertazzi et al.
patent: 6418462 (2002-07-01), Xu
patent: 7124071 (2006-10-01), Rich et al.
patent: 7159217 (2007-01-01), Pulsipher et al.
patent: 2002/0065870 (2002-05-01), Baehr-Jones et al.
patent: 2004/0210627 (2004-10-01), Kroening
Saniya Ben Hassen et al., “A Task-and Data-Parallel Programming Language Based on Shared Objects,” ACM Transactions on Programming Languages and Systems, vol. 20, No. 6, Nov. 1998, pp. 1131-1170.
Kwan-Liu Ma et al., “A Scalable Parallel Cell-Projection Volume Rendering Algorithm for Three-Dimensional Unstructured Data”, IEEE 1997.
Chen-Chen Feng et al., “A Parallel Hierarchical Radiosity Algorithm for Complex Scenes,” Proceedings IEEE Symposium on Parallel Rendering (PRS) '97, IEEE Computer Society Technical Committee on Computer Graphics in cooperation with ACM SIGGRAPH.
Chiang Lee et al., “A Self-Adjusting Data Distribution Mechanism for Multidimensional Load Balancing in Multiprocessor-Based Database Systems,” Information Systems vol. 19, No. 7, pp. 549-567, 1994.
Ed Andert, “A Simulation of Dynamic Task Allocation in a Distributed Computer System,” Proceedings of the 1987 Winter Simulation Conference, 1987.
“A Data Modeling Technique Used to Model Data Used in Task Analysis,” Research Disclosure—Mar. 1998/297.
“User Interface for a Parallel File System,” IBM Technical Disclosure Bulletin, vol. 37, No. 11, Nov. 1994.
J. Kaufman et al., “The Almaden SmartGrid project Autonomous optimization of distributed computing on the Grid,” IEEE TFCC Newsletter, vol. 4, No. 2, Mar. 2003.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Automatically segmenting and populating a distributed... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Automatically segmenting and populating a distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatically segmenting and populating a distributed... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4043472

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.