Massively computational parallizable optimization management...

Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S213000, C709S230000, C718S107000

Reexamination Certificate

active

07013344

ABSTRACT:
A distributed processing system, program product and method of executing a computer program distributed across a plurality of computers. First, interested participants register and provide a commitment for available excess computer capacity. Participants may enter a number of available hours and machine characteristics. A normalized capacity may be derived from the machine characteristics and a normalized excess capacity may be derived from the number of hours committed for the participant. New registrants may be assigned benchmark tasks to indicate likely performance. Parties may purchase capacity for executing large computer programs and searches. The computer program is partitioned into multiple independent tasks of approximately equal size and the tasks are distributed to participants according to available excess capacity. A determination is made whether each distributed task will execute within a selected range of other distributed tasks and, if not, tasks may be reassigned. The likelihood that a task will complete may be based on the participant's past performance. As each task is completed, the completing participant is checked to determine if the task is on schedule. Any task assigned to computers that are found to be behind schedule may be reassigned to other participants. A check is made to determined whether each task is assigned to at least one participant and several tasks may be assigned to multiple participants. Once all tasks are complete, the best result is selected for each task. Each participant may be compensated for normalized excess capacity and that compensation and charges to requesting parties may be based on total available normalized capacity.

REFERENCES:
patent: 5694602 (1997-12-01), Smith
patent: 5781775 (1998-07-01), Ueno
patent: 5978830 (1999-11-01), Nakaya et al.
patent: 6112225 (2000-08-01), Kraft et al.
patent: 6223205 (2001-04-01), Harchol-Balter et al.
patent: 6240462 (2001-05-01), Agraharam et al.
patent: 6370560 (2002-04-01), Robertazzi et al.
patent: 6377975 (2002-04-01), Florman
patent: 6418462 (2002-07-01), Xu
patent: 6725250 (2004-04-01), Ellis, III
W. Sullivan et al., “A New Major SETI Project Based on Project SERENDIP data and 100,000 Personal Computers,” Astronomical and Biochemical Origins and the Search for the Life in the Universe, 1997. IAU Colloquium No. 161. Also http://citeseer.nj.nec.com/context/1281299/0.

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

Massively computational parallizable optimization management... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Massively computational parallizable optimization management..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Massively computational parallizable optimization management... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3570443

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