Method for creating a schedule, apparatus for creating a schedule, and computer-program for creating a schedule

• US 20030046326A1
• Filed: 08/23/2002
• Published: 03/06/2003
• Est. Priority Date: 08/28/2001
• Status: Active Grant

• Current Assignee: Matsushita Electric Industrial Company Limited (Panasonic Holdings Corporation)
• Original Assignee: Matsushita Electric Industrial Company Limited (Panasonic Holdings Corporation)
• Inventors: Ito, Hayashi, Nakamitsu, Hiroaki, Matsuura, Shun
• Granted Patent: US 6,850,966 B2
• Time in Patent Office: Days
• US Class Current: 718/102
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

In a server that communicates with a large number of pieces of information equipment, a communication schedule between the server and the information equipment is created appropriately and efficiently.

Provided is an apparatus for creating a schedule that included: a calculation section for a table of maximum values of processing number for every time slot, which calculates a table of maximum values of processing number for every time slot, which is obtained by finding the maximum values of the number of processing performed in every time slot in a cycle of N days; and a time slot calculation section that finds a time slot having the minimum value out of the maximum values obtained in the foregoing manner, in order to find a time slot in which processing performed in the same time slot is brought to the minimum under the rule that the processing including communication is performed in the same time slot every N days.

Claims

1. A method for creating a schedule to find a time slot in which processing performed in the same time slot is minimized under a rule that processing is performed in a same time slot every time a specified period passes, said method comprising the steps of:

calculating a table of maximum values of processing number for every time slot to find the table of maximum values of processing number for each time slot, wherein a processing maximum value, which is the maximum value in every time slot of the number of processing performed in a cycle of specified period, is associated with the time slot and stored therein; and

calculating a time slot, which finds a time slot with which a minimum value among maximum values stored in the table of maximum values of processing number for every time slot, which has been found in the step of calculating the table of maximum values of processing number for every time slot, is associated and stored therein.

2. The method for creating schedule according to claim 1, wherein said processing performed in the same time slot every time a specified period passes is performed based on a table of time slot processing contents, where a time slot, in which processing should be performed, and a processing identifier, which is an identifier to identify the processing to be performed in the time slot, are associated with each other and held, said method further comprising the steps of:

accepting a processing identifier, which accepts said processing identifier; and

associating a processing identifier, which associates the processing identifier accepted by the step of accepting a processing identifier with the time slot found in the step of calculating time slot and stores in said table of time slot processing contents.

3. The method for creating schedule according to claim 2, wherein the processing identifier is associated one by one with the table of time slot processing contents in the step of associating processing identifier, said method further comprising the step of:

updating a processing maximum value, which increases the processing maximum value associated with said time slot in the table of maximum values of processing number for every time slot and stored therein, in the case where the number of processing, which is identified by the processing identifier associated with the time slot found in said step of calculating time slot and stored therein, is equal to the processing maximum value, which is associated with the time slot of said table of maximum values of processing number for every time slot and stored therein.

4. An apparatus for creating schedule to find a time slot in which the number of processing performed in the same time slot is minimized under a rule that the processing is performed in a same time slot every time a specified period passes, said apparatus comprising:

a calculation section for a table of maximum values of processing number for every time slot to find the table of maximum values of processing number for each time slot, where a processing maximum value, which is a maximum value in every time slot of the number of processing performed in a cycle of specified period, is associated with the time slot and stored therein; and

a time slot calculation section, which finds a time slot with which a minimum value among maximum values stored in the table of maximum values of processing number for every time slot, which has been found in the calculation section for the table of maximum values of processing number for every time slot, is associated and stored therein.

5. The apparatus for creating schedule according to claim 4, wherein said processing performed in a same time slot every time a specified period passes is performed based on a table of time slot processing contents, where a time slot, in which processing should be performed, and a processing identifier, which is an identifier to identify the processing to be performed in the time slot, are associated with each other and held, said apparatus further comprising:

a processing identifier accepting section, which accepts said processing identifier; and

a processing identifier associating section, which associates the processing identifier accepted by the processing identifier accepting section with the time slot found in the time slot calculation section and stores in said table of time slot processing contents.

6. The apparatus for creating schedule according to claim 5, wherein the processing identifier is associated one by one with the table of time slot processing contents in the processing identifier associating section, said apparatus further comprising:

a processing maximum value updating section, which increases the processing maximum value associated with said time slot in the table of maximum values of processing number for every time slot and stored therein, in the case where the number of processing, which is identified by the processing identifier associated with the time slot found in said time slot calculating section and stored therein, is equal to the processing maximum value, which is associated with the time slot of said table of maximum values of processing number for every time slot and stored therein.

7. The apparatus for creating schedule according to claim 5, wherein

said processing performed in the same time slot every time a specified period passes is processing in which a server makes calling-out to information equipment to transmit control instruction.

8. The apparatus for creating schedule according to claim 6, wherein

said processing performed in the same time slot every time a specified period passes is processing in which a server makes calling-out to information equipment to transmit control instruction.

9. A computer program for creating schedule to find a time slot in which processing performed in the same time slot is minimized under a rule that processing is performed in the same time slot every time a specified period passes, said computer-program causing a computer to execute the steps of:

calculating a table of maximum values of processing number for every time slot to find the table of maximum values of processing number for each time slot, wherein a processing maximum value, which is the maximum value in every time slot of the number of processing performed in a cycle of specified period, is associated with the time slot and stored therein; and

calculating a time slot, which finds a time slot with which a minimum value among maximum values stored in the table of maximum values of processing number for every time slot, which has been found in the step of calculating the table of maximum values of processing number for every time slot, is associated and stored therein.