Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data transfer regulating
Reexamination Certificate
2008-10-09
2010-11-02
Bates, Kevin (Department: 2456)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data transfer regulating
C709S233000, C709S217000, C709S211000, C707S738000, C707S747000
Reexamination Certificate
active
07827302
ABSTRACT:
Resources are partitioned via a virtual partitioning system to distribute the resources over a plurality of resource servers. A virtual partition table can be kept at each of a set of resource managers handling requests for resources in tandem. When a resource is requested, a virtual partition value is calculated algorithmically, and the value is mapped to a resource component via the virtual partition table. The resource component encapsulates information indicating on which of the resource servers the resource resides and can provide a component for performing operations on the resource even though the requester does not have information about where the resource resides. The resources can be repartitioned by modifying the virtual partition table, thus allowing the addition of additional resource servers to the system while the resources remain available. Additional resource types can be added without reengineering the system.
REFERENCES:
patent: 4853843 (1989-08-01), Ecklund
patent: 5440732 (1995-08-01), Lomet et al.
patent: 5485607 (1996-01-01), Lomet et al.
patent: 5634125 (1997-05-01), Li
patent: 5659786 (1997-08-01), George et al.
patent: 5794039 (1998-08-01), Guck
patent: 5933825 (1999-08-01), McClaughry et al.
patent: 5983225 (1999-11-01), Anfindsen
patent: 6006264 (1999-12-01), Colby et al.
patent: 6029168 (2000-02-01), Frey
patent: 6044378 (2000-03-01), Gladney
patent: 6052697 (2000-04-01), Bennett et al.
patent: 6058423 (2000-05-01), Factor
patent: 6078990 (2000-06-01), Frazier
patent: 6092178 (2000-07-01), Jindal et al.
patent: 6101508 (2000-08-01), Wolff
patent: 6108715 (2000-08-01), Leach et al.
patent: 6304967 (2001-10-01), Braddy
patent: 6330653 (2001-12-01), Murray et al.
patent: 6411985 (2002-06-01), Fujita et al.
patent: 6415333 (2002-07-01), Vasell
patent: 6430618 (2002-08-01), Karger et al.
patent: 6438652 (2002-08-01), Jordan et al.
patent: 6529906 (2003-03-01), Chan
patent: 6633916 (2003-10-01), Kauffman
patent: 6751616 (2004-06-01), Chan
patent: 6857012 (2005-02-01), Sim et al.
patent: 7010578 (2006-03-01), Lewin et al.
patent: 7103625 (2006-09-01), Hipp et al.
patent: 7103645 (2006-09-01), Leighton et al.
patent: 7293090 (2007-11-01), Saleh et al.
patent: 7454516 (2008-11-01), Weinert et al.
patent: 7483981 (2009-01-01), Weinert et al.
patent: 2001/0049741 (2001-12-01), Skene et al.
patent: 2009/0198685 (2009-08-01), Bartholomew
“3.2 Query Routing Using Source Capability and User Query Profiles,” http://www.computer.org/proceedings/meta97/papers/lliu
ode5.html, pp. 1-2, Jul. 27, 2000.
“Avenida Web Server 1.1,” http://www.avenida.co.uk/products/aws/, pp. 1-3, Jul. 14, 2000.
“Creating a Macintosh CD-ROM (HFS only) with MacImage,” http://www.macdisk.com/mimhfsen.php3, pp. 1-3, Jul. 14, 2000.
“eScalability & eAvailability,” http://www.vertexsystems.com/includes/Links/eScalability.htm, pp. 1-15, Jul. 14, 2000.
“Foundry Networks Improves Web Server Farm Manageability and Security, and Reduces Infrastructure Costs with Internet Ironware 7.0,” http://biz.yahoo.com/bw/000531/ca—foundry.html, pp. 1-3, Jul. 14, 2000.
“Linux Virtual Partition System Project,” http://www.feep.net/˜roth/code/vps/, p. 1, Jul. 14, 2000.
“Microsoft Security Bulletin (MS00-019): Frequently Asked Questions,” http://www.microsoft.com/technet/security/bulletin/fq00-019.asp?a=printable, pp. 1-3, Jul. 19, 2000.
“Site Server Analysis Scalability and Performance,” http://www.microsoft.com/technet/commerce/anscale.asp, pp. 1-20, Jul. 14, 2000.
“Webworking: Networking with the Web in Mind,” http://www.alteonwebsystems.com/products/white—papers/webworking/index.shtml, pp. 1-9, Jul. 14, 2000.
Abbadi et al., “Availability in Partitioned Replicated Databases,”ACM, pp. 240-251, 1986.
Adam, “Customizing WWW Sites,”Internet Information Services Administration, New Riders, pp. 51-67, Jan. 2000.
Adam, “Internetworking Considerations,”Internet Information Services Administration, New Riders, pp. 11-24, Jan. 2000.
Bloch et al., “A Weighted Voting Algorithm for Replicated Directories,”Journal of the Association for Computing Machinery, vol. 34, No. 4, pp. 859-909, Oct. 1987.
Braginski et al., “Web Server Configuration,” http://www.microsoft.com/technet/iis/runch04.asp?a=printable, pp. 1-30, Jul. 19, 2000.
French et al., “Efficient Searching in Distributed Digital Libraries,”ACM, pp. 283-284, 1998.
Greenspun, “Tips for Using Oracle,” http://www.arsdigita.com/asj/oracle-tips, pp. 1-45, Jul. 18, 2000.
Hackathorn,Web Farming for the Data Warehouse, Cerra (ed.), Morgan Kaufmann Publishers, Inc., pp. 65-93, 1999.
Hackathorn,Web Farming for the Data Warehouse, Cerra (ed.), Morgan Kaufmann Publishers, Inc., pp. 149-179, 1999.
Harrison, “Oracle8 VLDB Enhancement,” http://www.oreview.com/9707hari.htm, pp. 1-7, Jul. 18, 2000.
Herlihy, “Dynamic Quorum Adjustment for Partitioned Data,”ACM Transactions on Database Systems, vol. 12, No. 2, pp. 170-194, Jun. 1987.
Kumar et al., “Cost and Availability Tradeoffs in Replicated Data Concurrency Control,”ACM Transactions on Database Systems, vol. 18, No. 1, pp. 102-131, Mar. 1993.
Laurie et al.,Apache the Definitive Guide, Denn (ed.), O'Reilly & Associates, Inc., pp. 58-68, 1999.
Liu, “Query Routing in Large-Scale Digital Library Systems,” http://www.computer.org/proceedings/icde/0071/00710154abs.htm, p. 1, Jul. 27, 2000.
Mohr,Designing Distributed Applications, Wrok Press, pp. 51-85, 1999.
Mueller et al., “User Account and File System Administration,”Microsoft Internet Information Server 4: The Complete Reference, McGraw-Hill, pp. 255, 281-290, 1998.
Mueller et al., “Virtual Directories and Virtual Servers,”Microsoft Internet Information Server 4: The Complete Reference, McGraw-Hill, pp. 305-325, 1998.
Notice of Allowance mailed Jun. 13, 2008, in U.S. Appl. No. 11/003,798, filed Dec. 3, 2004.
Notice of Allowance mailed Sep. 5, 2008, in U.S. Appl. No. 09/632,382, filed Aug. 3, 2000.
Salzberg, “Access Methods,”The Computer Science Engineering Handbook, Tucker (ed.), CRC Press, Inc., pp. 1012-1037, 1997.
Shasha, “Tuning Database Design for High Performance,”The Computer Science Engineering Handbook, Tucker (ed.), CRC Press, Inc., pp. 995-1011, 1997.
Skonnard, “The XML Files,” http://msdn.microsoft.com/msdnmag/issues/0300/XML/XML.asp, pp. 1-7, Jul. 14, 2000.
Wu et al., “A Buffer Allocation Scheme for ATM Networks: Complete Sharing Based on Virtual Partition,”IEEE/ACM Transactions on Networking, vol. 3, No. 6, pp. 660-670, Dec. 1995.
Yager, “'69%'> From Apache to IIS, Part II,” http://www.unixreview.com/archives/articles/1999/january/9901int.shtml, pp. 1-5, Jul. 20, 2000.
Caiafa Daniel M. C.
Morin Brian R.
Weinert Alexander T.
Bates Kevin
Klarquist & Sparkman, LLP
Microsoft Corporation
LandOfFree
Scalable virtual partitioning of resources does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scalable virtual partitioning of resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable virtual partitioning of resources will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4243740