Distributed computing based on multiple nodes with...

Electrical computers and digital processing systems: multicomput – Computer network managing – Network resource allocating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S201000, C709S203000, C709S227000, C709S228000, C370S255000, C370S256000, C370S370000, C370S390000

Reexamination Certificate

active

08051170

ABSTRACT:
A network provides distributed computing services based on participation in respective resource groups by computing nodes, each resource group including a corresponding resource requirement for any computing node that joins the corresponding resource group for execution of the corresponding distributed computing service. Each computing node, in response to determining its corresponding available node capacity, is configured for selectively creating and joining at least one new resource group for execution of a corresponding distributed computing service having a corresponding resource requirement, and/or selectively joining at least one of the available resource groups, based on the corresponding available node capacity satisfying the corresponding resource requirement. Each computing node also is configured for selectively leaving any one of the joined resource groups based on determined conditions. Hence, each computing node may choose to participate in as many resource groups as needed for respective computing services, based on the corresponding available node capacity.

REFERENCES:
patent: 5428793 (1995-06-01), Odnert et al.
patent: 5555417 (1996-09-01), Odnert et al.
patent: 5951694 (1999-09-01), Choquier et al.
patent: 6014669 (2000-01-01), Slaughter et al.
patent: 6311251 (2001-10-01), Merritt et al.
patent: 6418477 (2002-07-01), Verma
patent: 6421687 (2002-07-01), Klostermann
patent: 6697064 (2004-02-01), Kilgard et al.
patent: 6865527 (2005-03-01), Go et al.
patent: 7003575 (2006-02-01), Ikonen
patent: 7047177 (2006-05-01), Lee et al.
patent: 7076783 (2006-07-01), Frank et al.
patent: 7111147 (2006-09-01), Strange et al.
patent: 7162476 (2007-01-01), Belair et al.
patent: 7203871 (2007-04-01), Turner et al.
patent: 7216090 (2007-05-01), LaCroix
patent: 7272652 (2007-09-01), Keller-Tuberg
patent: 7299410 (2007-11-01), Kays et al.
patent: 7457835 (2008-11-01), Toebes et al.
patent: 7499998 (2009-03-01), Toebes et al.
patent: 7543020 (2009-06-01), Walker et al.
patent: 2002/0077791 (2002-06-01), Go et al.
patent: 2002/0103893 (2002-08-01), Frelechoux et al.
patent: 2002/0114341 (2002-08-01), Sutherland et al.
patent: 2002/0169861 (2002-11-01), Chang et al.
patent: 2002/0188657 (2002-12-01), Traversat et al.
patent: 2003/0026268 (2003-02-01), Navas
patent: 2003/0035380 (2003-02-01), Downing et al.
patent: 2003/0051117 (2003-03-01), Burch et al.
patent: 2003/0074256 (2003-04-01), LaCroix
patent: 2003/0149847 (2003-08-01), Shyam et al.
patent: 2003/0154238 (2003-08-01), Murphy et al.
patent: 2003/0185205 (2003-10-01), Beshai
patent: 2003/0204273 (2003-10-01), Dinker et al.
patent: 2004/0039891 (2004-02-01), Leung et al.
patent: 2004/0098447 (2004-05-01), Verbeke et al.
patent: 2004/0153708 (2004-08-01), Joshi et al.
patent: 2004/0204949 (2004-10-01), Shaji et al.
patent: 2004/0208625 (2004-10-01), Beshai et al.
patent: 2004/0210767 (2004-10-01), Sinclair et al.
patent: 2004/0215650 (2004-10-01), Shaji et al.
patent: 2004/0230596 (2004-11-01), Veitch et al.
patent: 2005/0027801 (2005-02-01), Kashyap et al.
patent: 2005/0036443 (2005-02-01), Collins
patent: 2005/0060406 (2005-03-01), Zhang et al.
patent: 2005/0114478 (2005-05-01), Popescu et al.
patent: 2005/0144173 (2005-06-01), Yamamoto et al.
patent: 2005/0257220 (2005-11-01), McKee
patent: 2005/0283649 (2005-12-01), Turner et al.
patent: 2006/0179037 (2006-08-01), Turner et al.
patent: 2006/0179106 (2006-08-01), Turner et al.
patent: 2006/0206621 (2006-09-01), Toebes et al.
patent: 2007/0086433 (2007-04-01), Cunetto et al.
patent: 2007/0116234 (2007-05-01), Schneider et al.
patent: 2009/0276588 (2009-11-01), Murase
Karger et al., “Finding Nearest Neighbors in Growth-restricted Metrics”, ACM Symposium on Theory of Computing (STOC '92), Montreal, May 2002.
Anderson et al., “Global namespace for files”,IBM Systems Journal, 2004, pp. 702-722, vol. 48, No. 4, IBM.
Bourbonnais et al, “Towards an information infrastructure for the grid”,IBM Systems Journal, 2004, pp. 665-688, vol. 43, No. 4, IBM.
Carpenter et al., “Abstract interdomain security assertions: A basis for extra-grid virtual organizations”,IBM Systems Journal, 2004, pp. 689-701, vol. 43, No. 4, IBM.
Dabek et al., “Wide-area cooperative storage with CFS”,SOPS '01, Oct. 21-24, 2001, Banff, Canada.
Cates, “Robust and Efficient Data Management for a Distributed Hash Table”, Master's thesis, Mass. Institute of Technology, May 2003.
Burkard, “Herodotus: A Peer-to-Peer Web Archival System”, Master's Thesis, Massachusetts Institute of Technology, Jun. 2002.
Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications”,SIGCOMM '01, Aug. 27-31, 2001, San Diego, CA, ACM.
Dabek, “A Cooperative File System”, Master's Thesis, Massachusetts Institute of Technology, Sep. 2001.
Cox et al., “Serving DNS using a Peer-to-Peer Lookup Service”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA, pp. 1-7.
Butte (Grid IT Architect), “Solving the data warehouse dilemma with grid technology”,IBM Global Services, Aug. 2004, IBM.
Horn et al., “A Logger System based on Web services”,IBM Systems Journal, 2004, pp. 723-733, vol. 43, No. 4, IBM.
Dabek et al., “Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service”, Proceedings of the 8thWorkshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.
Liben-Nowell et al., “Observations on the Dynamic Evolution of Peer-to-Peer Networks”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA.
Joseph et al., “Evolution of grid computing architecture and grid adoption models”,IBM Systems Journal, 2004, pp. 624-645, vol. 43, No. 4, IBM.
Lewis et al., “MyMED: A database system for biomedical research on MEDLINE data”,IBM Systems Journal, 2004, pp. 756-767, vol. 43, No. 4, IBM.
Meliksetian et al., “Design and implementation of an enterprise grid”,IBM Systems Journal, 2004, pp. 646-664, vol. 43, No. 4, IBM.
Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”, ACM SIGCOMM 2001, San Diego, Aug. 2001, pp. 149-160.
Petersen et al., “A Blueprint for Introducing Disruptive Technology into the Internet”, Proceedings of the First ACM Workshop on Hot Topics in Networks (HotNets-1), Princeton, NJ, Oct. 2002.
Liben-Nowell et al., “Analysis of the Evolution of Peer-to-Peer Systems”, ACM Conf. on Principles of Distributed Computing (PODC), Monterey, CA, Jul. 2002.
“Preface”,IBM Systems Journal, 2004, pp. 622-623, vol. 43, No. 4, IBM.
Sit et al., “Security Considerations for Peer-to-Peer Distributed Hash Tables”, In the proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002, Cambridge, MA.
Tan et al., “Service domains”,IBM Systems Journal, 2004, pp. 734-755, vol. 43, No. 4, IBM.
“The BitTorrent Effect”, printed Jan. 26, 2005 (8 pages), available at http://www.wired.com/wired/archive/13.01/bittorrent—pr.html.
“Grid Computing”,Wikipedia, printed Jan. 26, 2005 (3 pages), available at http://en.wikipedia.org/wiki/Grid-computing.
Cates, “Robust and Efficient Data Management for a Distributed Hash Table”, Master's thesis, Mass. Institute of Technology, May 2003, pp. 1-64.
Mockapetris, “Domain Names—Concepts and Facilities”, Network Working Group, Request for Comments: 1034, Nov. 1987, pp. 1-55.
Mockapetris, “Domain Names—Implementation and Specification”, Network Working Group, Request for Comments: 1035, Nov. 1987, pp. 1-55.
Gulbrandsen et al., “A DNS RR for specifying the location of services (DNS SRV)”, Network Working Group, Request for Comments: 2782, Feb. 2000, pp. 1-12.
Calhoun et al., “Diamete

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

Distributed computing based on multiple nodes with... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distributed computing based on multiple nodes with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed computing based on multiple nodes with... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4308026

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