Patent US3028515A successfully refreshed from Google Patents.
Patent US3148579A successfully refreshed from Google Patents.
Patent US5854754A successfully refreshed from Google Patents.
US5854754A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Scheduling computerized backup services
Assignee: Trend Micro Inc
•
Filing: 1996-02-12
•
Granted: 1998-12-29
•
Expires: 2016-02-12
Abstract
Abstract An apparatus and method is disclosed for scheduling a service (such as backup) in a complex computer installation given constraints of elapsed time and resource utilization. The apparatus form of the invention has two major components: a Modeler and a Scheduler. The Modeler calculates utilization of computer installation resources and elapsed time for the service for any subset of clients and/or networks using a model of the various client types, network types and their interconnections. The Scheduler invokes the Modeler with subsets of clients to find utilizations and elapsed times and adjusts the subsets to generate a schedule (if one exists) which is a list of subsets of clients which can be serviced concurrently without exceeding the utilization criterion or an elapsed time criterion. The Scheduler uses a heuristic involving client and network types to rapidly converge on the list of subsets of clients for the schedule to greatly improve over a trial and error approach.
Inventors
- 👤 Luis Felipe Cabrera
- 👤 Claudia Beinglas Dragoescu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 19:20
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5005; G06F9/5027; G06F9/5061; G06F9/5066
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
198 words
A method for scheduling a backup service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, the method comprising the steps of: (a) building a model of the computer installation which calculates elapsed time and utilization of computer installation resources for the selected service for a selected subset of clients for the selected service for a selected subset of clients, the model using definitions of client types, network types and interconnection of clients and networks in the computer installation; (b) repeatedly invoking the model with a minimum number of clients and then a maximum number of clients of a single type to find elapsed times and utilization of computer installation resources, then invoking the model with varying numbers of clients between the minimum and maximum numbers of clients until finding a number of clients for the subset for which the utilization or elapsed time criteria are met and adjusting the subsets to contain clients which can be serviced sequentially without exceeding an elapsed time criterion or a utilization criterion; and (c) generating a schedule by arranging the subsets into a sequence.
Claim 2
Independent Claim
198 words
A method for scheduling a backup service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, the method comprising the steps of: (a) building a model of the computer installation which calculates elapsed time and utilization of computer installation resources for the selected service for a selected subset of clients for the selected service for a selected subset of clients, the model using definitions of client types, network types and interconnection of clients and networks in the computer installation; (b) repeatedly invoking the model with a minimum number of clients and then a maximum number of clients of a single type to find elapsed times and utilization of computer installation resources, then invoking the model with varying numbers of clients between the minimum and maximum numbers of clients until finding a number of clients for the subset for which the utilization or elapsed time criteria are met and adjusting the subsets to contain clients which can be serviced sequentially without exceeding an elapsed time criterion or a utilization criterion; and (c) generating a schedule by arranging the subsets into a sequence.
Claim 3
Dependent Claim
19 words
The method of claim 1 wherein the invoking step initially groups the clients into subsets by network and type.
Claim 4
Independent Claim
147 words
An apparatus for scheduling a backup service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, comprising: (a) a Modeler which calculates utilization of computer installation resources and elapsed time for the selected service for a selected subset of clients, the calculations using definitions of client types, network types and interconnection of clients and networks in the computer installation, using queues to model elements in the installation which work to provide the services and using Little's Law to calculate throughput; and (b) a Scheduler which repeatedly invokes the Modeler with subsets of clients to find utilizations and elapsed times and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 5
Independent Claim
147 words
An apparatus for scheduling a backup service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, comprising: (a) a Modeler which calculates utilization of computer installation resources and elapsed time for the selected service for a selected subset of clients, the calculations using definitions of client types, network types and interconnection of clients and networks in the computer installation, using queues to model elements in the installation which work to provide the services and using Little's Law to calculate throughput; and (b) a Scheduler which repeatedly invokes the Modeler with subsets of clients to find utilizations and elapsed times and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 6
Dependent Claim
13 words
The apparatus of claim 3 wherein the services being scheduled are backup services.
Claim 7
Dependent Claim
22 words
The apparatus of claim 4 wherein the Modeler uses queues to model elements in the installation which work to provide the services.
Claim 8
Independent Claim
157 words
An apparatus for scheduling services in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, comprising: (a) first means for modeling utilization of the computer installation resources for services for a selected subset of clients, which calculates utilization of installation resources using definitions of client types, network types and interconnection of clients and networks in the computer installation; (b) second means for modeling which calculates elapsed time for the selected service for a selected subset of clients using Little's Law to calculate throughput; (c) means for scheduling which repeatedly invokes the first and second means for modeling with subsets of clients to find utilizations and elapsed times for the subsets and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 9
Independent Claim
157 words
An apparatus for scheduling services in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, comprising: (a) first means for modeling utilization of the computer installation resources for services for a selected subset of clients, which calculates utilization of installation resources using definitions of client types, network types and interconnection of clients and networks in the computer installation; (b) second means for modeling which calculates elapsed time for the selected service for a selected subset of clients using Little's Law to calculate throughput; (c) means for scheduling which repeatedly invokes the first and second means for modeling with subsets of clients to find utilizations and elapsed times for the subsets and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 10
Dependent Claim
14 words
The apparatus of claim 7 wherein the service being scheduled is a backup service.
Claim 11
Dependent Claim
25 words
The apparatus of claim 6 wherein the first means for modeling use queues to model elements in the installation which work to provide the service.
Claim 12
Dependent Claim
28 words
The apparatus of claim 7 wherein the means for scheduling initially divides the clients into subsets based on client type and network to which the clients are attached.
Claim 13
Dependent Claim
147 words
A computer readable storage device containing program code for scheduling a selected service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, the program code comprising: (a) program code for modeling utilization of the computer installation resources and elapsed time for the selected service for a selected subset of clients uses Little's Law to calculate throughout, the modeling using definitions of client types, network types and interconnection of clients and networks in the computer installation; and (b) program code for scheduling which repeatedly invokes the program code for modeling with subsets of clients to find utilizations and elapsed times and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 14
Dependent Claim
147 words
A computer readable storage device containing program code for scheduling a selected service in a computer installation having a plurality of clients consisting of more than one client type, a plurality of interconnected networks and at least one server, the program code comprising: (a) program code for modeling utilization of the computer installation resources and elapsed time for the selected service for a selected subset of clients uses Little's Law to calculate throughout, the modeling using definitions of client types, network types and interconnection of clients and networks in the computer installation; and (b) program code for scheduling which repeatedly invokes the program code for modeling with subsets of clients to find utilizations and elapsed times and adjusts the subsets to generate a schedule which is a list of subsets of clients which can be serviced sequentially without exceeding a utilization criterion or an elapsed time criterion.
Claim 15
Dependent Claim
17 words
The computer readable storage device of claim 10 wherein the service being scheduled is a backup service.
Claim 16
Dependent Claim
28 words
The computer readable storage device of claim 10 wherein the program code for modeling use queues to model elements in the installation which work to provide the service.
Claim 17
Dependent Claim
32 words
The computer readable storage device of claim 10 wherein the program code for scheduling initially divides the clients into subsets based on client type and network to which the clients are attached.
References Cited (Backward Citations)
US5381546A
Cited
US5005122A
Cited
US5345587A
Cited
US5608907A
Cited
US5133065A
Cited
US5179702A
Cited
US5369570A
Cited
US5452459A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-12-28 | 2002-06-29 | 2002-12-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-12-28 | 2006-06-29 | 2006-12-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-12-28 | 2010-06-29 | 2010-12-29 | $7700.00 | Window Closed / Lapsed |