Collective network processing system and methods

Details Collective network processing system and methods Collective network processing system and methods

2005-02-15

2005-02-15

Jaroenchonwanit, Bunjob (Department: 2143)

Electrical computers and digital processing systems: multicomput

Distributed data processing

C709S205000

Reexamination Certificate

active

06857004

ABSTRACT:
Methods and systems are provided for accelerating execution of programs of the type run by individuals or companies. The methods include the steps of communicating at least one program function to a library in data communication with the program and transmitting the function to a computing facility, typically in the form of computer clusters. The function is processed at the computing facility and results are relayed back to the user of the programs. Users of the invention pay for accelerated execution by one of several interfaces, such as through on-line transactions and/or through prearranged ISP connectivity. Accelerated processing is initiated, typically, by clicking on a computer icon; and results appear seamlessly—though accelerated—to the user. The clusters of the invention can mix and match computers of different processing speeds to maximize the MIPS per dollar in processing accelerated functions for users.

REFERENCES:
patent: 5166674 (1992-11-01), Baum et al.
patent: 5224100 (1993-06-01), Lee et al.
patent: 5371852 (1994-12-01), Attanasio et al.
patent: 5689722 (1997-11-01), Swarztrauber
patent: 5758144 (1998-05-01), Eberhard et al.
patent: 5860010 (1999-01-01), Attal
patent: 5905736 (1999-05-01), Ronen et al.
patent: 6014669 (2000-01-01), Slaughter et al.
patent: 6117180 (2000-09-01), Dave et al.
patent: 6154765 (2000-11-01), Hart
patent: 6163855 (2000-12-01), Shrivastava et al.
patent: 6167428 (2000-12-01), Ellis
patent: 6295573 (2001-09-01), Bailey et al.
patent: 20010011294 (2001-08-01), Ellis
patent: 20030135614 (2003-07-01), Hattori et al.
Thibodeaux, “organizers hope to give Lafayatte superstart in high-tech direction”, 10/27, Supercomputeronline.com, 2 pages.*
IBM, “Cluster-Based Stack Optimization Algorithm for Very Large-scale Integration”, 09/87, IBM Technical disclosure Bulletin, vol. 30, Issue 4, p. No. 1445-1447 (4).*
Chong et al, “Concurrent Processing for Picture Archiving and Comunication system (PACS)”, 06/95, IEEE, p. No. 468-472.*
Antaki et al, “The sóft side of New Enterprise”, 05/99, MIT enterprise FORUM of Dallus Network Inc., 2 pages.*
Hitachi, “The Next Generation of Information Technology”, spring 97, Hitachi today No. 39, p. No. 1-6 and cover page.*
Kahaner, “Fujitsu's 2ndParallel computing WS (PCW'93) 11/93 Kawasaki Japan” 12/93, 15 pages.*
Ryan et al, “A Scalable Distributed Multimedia Knowledge Retrieval System on a cluster of Heterogeneous High Performance Architectures”, International Journal on artificial intelligence tools, vol. 9, No. 3 (2000) p. No. 343-367.*
(author unknown), “CAD comes on line”, Feb. 21, 2000, p. s-28, Design News-Automotive.
Danny Hillis, “Massive, Parallel Supercomputers—Where they're Going—How They'll Work”, Forbes ASAP, Feb. 22, 1999, pp. 60-62 and 64.
Internet Information article: “MSC.SOFTWARE Announces visualNastran 4d2Go; A total Engineering Solution to be Bundled with CAD Products”, Mar. 6, 2000.
PCT Notification of Transmittal of the International Search Report or the Declaration, Dec. 26, 2000.
Cohen, ED et al. Efficient Covexity and Domination Algorithms for Fine-and Medium-Grain Hybercube Computers, Algoithmica, vol. 7, pp. 51-75, Springer Vertag New York, Inc., 1992.
Benedicts, E.P., “Multiprocessor architectures are converging”, Hypercube Concurrent Computers and Applications: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, vol. 1, pp. 12-20, Pasadena, California, Jan. 19-20 (1988).
Livingston, Marilyn L. and Stout, Quentin F., “Fault Tolerance of the Cyclic Buddy Subcube Location Sceme in Hypercubes”, Proceedings of the 6th Distributed Memory Computing Conference (1991), IEEE, pp. 34-41, 1991.
Fox, G.C., “What have we learnt from using real parallel machines on real problems?”, Hypercube Concurrent Computers and Applications: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, vol. 2, pp. 897-955, Pasadena, California, Jan. 19-20 (1988).
“Topologies—computational messaging for multicomputers”, Hypercube Concurrent Computers and Applications: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, vol. 1, pp. 580-593, Pasadena, California, Jan. 19-20 (1988).

Affiliated with

Also associated with

Rating

Collective network processing system and methods does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Collective network processing system and methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collective network processing system and methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3465429