Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2000-02-11
2004-08-10
An, Meng-Al T. (Department: 2127)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S100000, C718S102000, C718S106000, C709S200000, C707S793000, C707S793000
Reexamination Certificate
active
06775831
ABSTRACT:
BACKGROUND
Many commercial enterprises require that large volumes of data be processed in as short a time frame as possible. In recent years, businesses needing to process such large volumes of data have purchased very expensive, specialized multi-processor hardware, often referred to as mainframe computers, supercomputers or massively parallel computers. The cost of such hardware is often in the millions of dollars, with additional costs incurred by support contracts and the need to hire specialized personnel to maintain these systems. Not only is such supercomputing power expensive, but it does not afford the user much control over how any given task gets distributed among the multiple processors. How any computing task gets distributed becomes a function of the operating system of such a supercomputer.
In the field of data processing, often very similar operations are performed on different groups of data. For example, one may want to count the unique instances of a class, e.g., a group of data, for several different classes, know what the arithmetic mean of a given class is, or know what the intersection of two classes may be. In a supercomputing environment, one has to rely on the operating system to make sound decisions on how to distribute the various parts of a task among many central processing units (CPUs). Today's operating systems, however, are not capable of this kind of decision making in a data processing context.
Thus, there is a need for a system and method that overcomes these deficiencies.
BRIEF SUMMARY OF THE PRESENTLY PREFERRED EMBODIMENTS
According to the preferred embodiments, described is a system and method for allowing multiple processors, for example, a computer's central processing unit(s) (CPU), on a network to perform varying number and type of data processing tasks. Data processing tasks are provided to any of the available CPU's on a network equipped for the system and method. The system and method choose the first available CPU for performance of the data processing task. The system and method provide the task performing CPU with the minimum amount of data needed to complete the task and the necessary software instructions to complete the task.
More specifically, the preferred system and method allow for improved efficiency, in terms of both cost and time, of data processing. The user of the software considers a given data processing task, provides a set of definitions for the type of data required for each task, and specifies the task for a given group of data. The system and method then divide up the input file into the sub-task data files and ships the given data and task specifications to any available computer on the network. The CPU performs the task and returns the completed result to the computer that requested the task.
Thus, large amounts of data to be processed quickly, by ordinary, commodity personal computers, running conventional operating systems such as Windows NT or Unix. A small cluster of, for example, twelve dual processor computers or twenty-four single processor computers, running the software of the preferred embodiments, can equal, if not exceed the performance of a supercomputer with an equivalent number of CPUs.
REFERENCES:
patent: 3913070 (1975-10-01), Malcolm et al.
patent: 4972314 (1990-11-01), Getzinger et al.
patent: 5025369 (1991-06-01), Schwartz
patent: 5146559 (1992-09-01), Orimo et al.
patent: 5291613 (1994-03-01), Hirasawa et al.
patent: 5327557 (1994-07-01), Emmond
patent: 5353398 (1994-10-01), Kitahara et al.
patent: 5394394 (1995-02-01), Crowther et al.
patent: 5495618 (1996-02-01), Cok
patent: 5687372 (1997-11-01), Hotea et al.
patent: 5706500 (1998-01-01), Dzikewich et al.
patent: 5778367 (1998-07-01), Wesinger, Jr. et al.
patent: 5794210 (1998-08-01), Goldhaber et al.
patent: 5812793 (1998-09-01), Shakib et al.
patent: 5862223 (1999-01-01), Walker et al.
patent: 5864680 (1999-01-01), Edblad et al.
patent: 5944779 (1999-08-01), Blum
patent: 5946463 (1999-08-01), Carr et al.
patent: 5995996 (1999-11-01), Venable
patent: 6088705 (2000-07-01), Lightstone et al.
patent: 6185698 (2001-02-01), Wesley et al.
patent: 6269361 (2001-07-01), Davis et al.
patent: 6269373 (2001-07-01), Apte et al.
patent: 6285987 (2001-09-01), Roth et al.
patent: 6292888 (2001-09-01), Nemirovsky et al.
patent: 6336118 (2002-01-01), Hammond
patent: 6427166 (2002-07-01), Hurst et al.
patent: 2002/0004735 (2002-01-01), Gross
patent: 2 274 345 (1994-07-01), None
patent: WO 97/22066 (1997-06-01), None
patent: WO 00/16218 (2000-03-01), None
Parkes et al. “Method and System for performing a task on a computer”. US pat. app. Publication 2001/0005853 A1.*
News of The Week articles,Telephony, May 1, 1995, pp. 8 and 10.
Nuts 'N Bolts articles,Target Marketing, Oct. 1997, 1 page.
DoubleClick TestIt!, obtained at the internet address: web.archive.org/web/19980205034316/www.doubleclick.com
f/adinfo/testiset.htm, dated Oct. 16, 2002, 4 pages.
DoubleClick Frequently Asked Questions, obtained at the internet address: web.archive.org/web/19980205033925/www.doubleclick.com
f/adinfo/facts.htm, dated Oct. 16, 2002, 5 pages.
“New Service Puts Ad Auction, Search Engine Under One Roof”, article from Electronic Advertising & Marketplace Report,Simba Information, Inc.Apr. 28, 1998, 2 pages.
Google Search, communication from Jeffrey Brewer at Jeffrey@goto.com, titled “Need reverse stemming software”, dated May 27, 1998, obtained at the intenet address: ://groups.google.com/groups?selm=356CEE4A8DE882A8%40goto.com, on Dec. 19, 2002, 1 page.
Ketchpel, Steven P. et al. “U-PAI: A Universal Payment Application Interface”, conference material article from the Second USENIX Workshop on Electronic Commerce Proceedings, Oakland, California, Nov. 18-21, 1996, 17 pages.
Schwartz, Randal L., “Click-Through Tracking in Perl”Web Techniques, dated May 1998, located at the internet address: .webtechniques.com, 3 pages.
Van Roeden, Adriaan, “Your Own Search Engine With SWISH, A Custom Search Facility For Your Web Site”,Web Techniques, dated Nov. 1996, located at the internet address: .webtechniques.com, pp. 63-66 pages.
Full Catalog—Categories Menu, Sun Microsystems Sun Solutions Catalog, obtained at the internet address: http://web.archive/org.web/19981205110211/solutions.sun.com/catalogs/all/index.htm, printed on Dec. 19, 2002, 2 pages.
Help on Making Queries—Search by Company or Product, obtained at the internet address: web.archive.org/web/19981203050002/solutions.sun.com/search-help.htm, printed on Dec. 19, 2002, 4 pages.
Online Updating, Sun Microsystems Sun Solutions Catalog obtained at the internet address: web.archive.org/web/19990220190636/solutions.sun.com/editmodule/help.html, printed on Dec. 19, 2002, 2 pages.
Press Release article titled “GoTo.com Announces First round of Financing, Totaling More Than $6 Million, Led by Draper, Fisher Jurvetson”,Business Wire, dated May 19, 1998, printed form the Internet at <dialogclassic.com/main.vingw> on Nov. 9, 2000, 2 pages.
Ubois, Jeff, article titled “He who pays the piper . . . ”,MIDRANGE Systems, vol. 9, No. 12, 1996, p. 50 (1), reprinted by Cardinal Business Media, Inc.
Chapin, S.J. et al. “The Legion Resource Management System”, 5thWorkshop on Job Scheduling Strategies for Parallel Processing, IPPS/SPDP '99 Conference in San Juan Puerto Rico, Apr. 1999, obtained from the Internet on Apr. 26, 2004 at: cs.huji.ac.il/~feit/parscged/parscged99.html>, 20 pgs.
Grimshaw, Andrew et al., “Architectural Support for Extensible and Autonomy in Wise-Area Distributed Object Systems”,Proceedings of the2002Network and Distributed Systems Security Symposium, Feb. 2002, obtained from the Internet on Apr. 26, 2004 at: legion.virginia.edu/papers.html>, 34 pages.
Miaskowski, Stan, “Free utility guards against spyware”,CNN.com, Jul. 20, 1999, obtained from the Internet on Apr. 26, 2004 at: cnn.com/TECH/computing/9907/20/spyware.idg/>, 2 pages.
First Office Action for corresponding Chinese Patent Application No. 01807736.6, dated Mar. 12, 2004, 5pp.
Supplementary Search Re
Carrasco John Joseph
Doliov Stephan
Ehrenfried Frank B.
An Meng-Al T.
Brinks Hofer Gilson & Lione
Overture Services Inc.
Vo Lilian
LandOfFree
System and method for rapid completion of data processing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for rapid completion of data processing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for rapid completion of data processing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3285651