JP2005038332A - Job schedule device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a job schedule device capable of properly scheduling jobs. <P>SOLUTION: The job schedule device comprises a first storage part 15 for storing first job schedule information having a condition for the execution schedule of jobs, a second storage part 16 for storing second job schedule information having a condition for the execution schedule of jobs, a determination part 18 for determining, for a predetermined job, whether it satisfies the condition of the first job schedule information and the condition of the second job schedule information, and a job execution part 19 for executing the job that is determined to satisfy the conditions of the first and second job schedule information. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a job schedule apparatus that schedules execution of a job.

With regard to job execution, a system is known in which a schedule for a job to be executed in advance is created and the job is automatically executed based on the schedule (see, for example, Patent Document 1).
Japanese Patent Laid-Open No. 9-288525 (page 3, FIG. 1, etc.)

  However, when creating a schedule for multiple jobs, if the schedule is created without considering the relationship with other jobs, the execution of many jobs is biased at one time, and the load on the system that executes the jobs becomes excessive. there is a possibility. In particular, in a server / client system, when the execution of jobs according to a schedule is concentrated, if the server receives individual processing requests from the client, the load on the server becomes excessive. Moreover, in order to create a schedule so that such a thing does not occur, the schedule creation work becomes complicated, and the burden on the schedule creator becomes excessive.

  The present invention has been made to solve the above-described problems, and an object thereof is to provide a job schedule apparatus and the like that can appropriately perform job scheduling.

  In order to achieve the above object, a job scheduling apparatus according to the present invention provides each job related to a predetermined job in the 1st to Nth (N is an integer of 2 or more) job schedule information each having a condition related to a job execution schedule. The job is executed when the condition of the schedule information is satisfied.

  According to the present invention configured as described above, the job is executed when the conditions of the first to Nth job schedule information are satisfied, and the job can be appropriately executed.

  The job schedule apparatus according to the present invention includes a first storage unit that stores first job schedule information having a condition related to a job execution schedule, and second job schedule information having a condition related to a job execution schedule. A second storage unit to be stored; a determination unit that determines whether the condition of the first job schedule information and the condition of the second job schedule information are satisfied with respect to a predetermined job; and A job execution unit that executes a job determined to satisfy the conditions of the first and second job schedule information.

  According to the present invention configured as described above, a job can be appropriately executed according to the conditions of the first and second job schedule information.

  In the job schedule apparatus according to the present invention, an access receiving unit that receives an access request to the first and second job schedule information, and access to the job schedule information according to the access request received by the access receiving unit. And an access unit that performs the following.

According to the present invention configured as described above, it is possible to access job schedule information corresponding to an access request. For example, a user who desires access to the first job schedule information can access the first job schedule information by sending an access request to the first job schedule information to the access reception unit. . As a result, it is possible to access job schedule information within a range necessary for the user.

  The job scheduling apparatus according to the present invention further includes an access determination unit that determines whether or not the access request received by the access reception unit is accessible, and the access unit can be accessed by the access determination unit. If it is determined, access according to the access request may be performed.

  According to the present invention configured as described above, security regarding job schedule information can be improved.

  In the job schedule apparatus according to the present invention, the access determination unit may determine that the first job schedule information can be accessed only when a predetermined identifier is included in the access request.

  In the job schedule apparatus according to the present invention, the condition of the first job schedule information and the condition of the second job schedule information related to a predetermined job may be related to different condition items. .

  According to the present invention configured as described above, it is possible to avoid the generation of an unexecutable job for the different condition items. Therefore, in each job schedule information, it is possible to arbitrarily set a condition within the range of the condition items that each has, without paying attention to the occurrence of a job that cannot be executed. Convenience can be improved.

  In the job schedule apparatus according to the present invention, the first job schedule information includes a condition regarding a time for executing the job, and the second job schedule information includes a condition regarding a time for executing the job. Also good.

  According to the present invention configured as described above, for example, in a time zone in which execution of jobs by real-time requests (interactive job execution) is considered to be frequent, according to the second job schedule information, By not executing the above, it is possible to appropriately distribute the job execution in real time and the job execution according to the schedule, and to provide a comfortable job execution environment. Further, when requesting execution of a job according to a schedule, it is only necessary to specify a condition relating to time, and it is not necessary to make detailed settings or make adjustments with the execution schedule of other jobs.

  In the job schedule apparatus according to the present invention, the second job schedule information may have a condition regarding the number of jobs executed for each time zone.

  According to the present invention configured as described above, the number of job executions according to a schedule can be limited for each time period. For example, during a time period when job executions by real-time requests increase, By setting the conditions of the job schedule information so as to reduce the number of jobs, a comfortable job execution environment can be provided.

  In the job schedule apparatus according to the present invention, the first and second job schedule information is inspected to detect a non-executable job, and the non-executable job detected by the detection unit is shown. You may further provide the output part which outputs information.

  According to the present invention configured as described above, it is possible to know which job cannot be executed. In addition, the job can be executed by changing the job schedule information regarding the job that cannot be executed.

  As is clear from the above description, according to the job scheduling apparatus and the like according to the present invention, it is possible to appropriately schedule the execution of jobs.

(Embodiment 1)
A job schedule apparatus according to Embodiment 1 of the present invention will be described with reference to the drawings.

  FIG. 1 is a block diagram showing a configuration of a job schedule apparatus according to the present embodiment. In FIG. 1, a job schedule apparatus 10 according to the present embodiment includes a communication unit 11, an access reception unit 12, an access determination unit 13, an access unit 14, a first storage unit 15, and a second storage unit. 16, a calendar / clock unit 17, a determination unit 18, an execution unit 19, and a job storage unit 20.

  The communication unit 11 performs communication (information transmission and reception) with the information processing apparatus 41 and the like via the communication line 30 (for example, the Internet). This communication may be wired or wireless.

  The access reception unit 12 receives an access request to the first storage unit 15 and / or the second storage unit 16 from the information processing apparatus 41 or the like via the communication unit 11. Here, the access request is a request related to reading or changing (addition, deletion, modification, etc.) of information stored in the first storage unit 15 or the like.

  The access determination unit 13 determines whether or not the access request received by the access reception unit 12 is accessible. Then, the access request that is determined to be accessible is passed to the access unit 14, and when it is determined that access is impossible, the access is denied.

  The access unit 14 stores information stored in the first storage unit 15 and / or the second storage unit 16 in response to the access request that is determined to be accessible by the access determination unit 13. Access to. Here, “access” refers to reading or changing (addition, deletion, modification, etc.) of information.

  The first storage unit 15 stores first job schedule information. Here, the job schedule information is information having a condition related to the execution schedule of the job. For example, information specifying a job and condition items (execution date and time) related to the execution of the job are defined in each record. ing. The second storage unit 16 stores second job schedule information. The first and second storage units 15 and 16 are constituted by a recording medium such as a semiconductor memory or a magnetic disk, for example. Here, “job” refers to an execution unit in a program. Examples of jobs include program compilation processing, batch processing related to financial statements, software update processing, data backup processing, and the like.

  The calendar / clock unit 17 indicates the current calendar and time. For example, the current calendar and time of June 20, 2003, 18:45:23 are provided to the determination unit 18.

  The determination unit 18 refers to the first storage unit 15 and the second storage unit 16 and uses the current calendar and / or time provided from the calendar / clock unit 17 to execute an executable job. If there is an executable job, information for specifying the executable job is transmitted to the execution unit 19.

When the execution unit 19 receives information for specifying an executable job from the determination unit 18, the execution unit 19 reads the job from the job storage unit 20 and executes it. When a job execution request is received from the information processing apparatus 41 or the like via the communication unit 11 or the like, the job is read from the job storage unit 20 and executed. The job storage unit 20 stores a job executed by the execution unit 19, that is, a job program in association with the job name. The job storage unit 20 is configured by a recording medium such as a semiconductor memory or a magnetic disk, for example.

  Next, the operation of the job schedule apparatus according to this embodiment will be described. First, the operation when an access request is accepted will be described with reference to the flowchart of FIG. FIG. 2 is a flowchart showing the operation of the job schedule apparatus when an access request is received.

  (Step S101) The access receiving unit 12 determines whether there is an access request. If there is an access request, the access request is transferred to the access determination unit 13 and the process proceeds to step S102. On the other hand, if there is no access request, the process of step S101 is repeated until the access request is accepted. Here, the access request includes information indicating an access target, access contents (for example, reading of information, addition of information, etc.), and an apparatus ID for identifying the information processing apparatuses 41 and 42 that request access. And are included.

  (Step S <b> 102) The access determination unit 13 determines whether access is possible for the access request received from the access reception unit 12 based on the access determination information. Here, the access determination information is information indicating a relationship between an access target, possible access contents, and a device ID, which is determined in advance in order to determine whether access is possible. For example, the table of FIG. It is shown by. If access is possible, the access determination unit 13 passes the access request to the access unit 14 and proceeds to step S103. On the other hand, if access is not possible, the process proceeds to step S104.

  (Step S <b> 103) The access unit 14 performs access according to the access request received from the access determination unit 13. For example, if the access content included in the access request is “read”, desired information is read out and transmitted to the device that has made the access request via the communication unit 11 or the like. If it is determined by the access determination unit 13 that access can be made once, regarding the access target and the access contents at that time, there is an access from the information processing apparatus that has made the access request without passing through the access determination unit 13. It becomes possible.

  (Step S <b> 104) The access determination unit 13 rejects the access, and transmits information indicating that the access has been rejected to the device that has made the access request via the access reception unit 12 and the communication unit 11. Therefore, in this case, the device that has made an access request cannot access desired information.

  Next, the operation of the determination unit 18 will be described. First, the first job schedule information stored in the first storage unit 15 and the second job schedule information stored in the second storage unit 16 will be described.

The first job schedule information has conditions related to the timing of job execution. Here, the “time” indicates a calendar of “day” or more, and indicates, for example, year, month, beginning of month, end of month, day of the week, and the like. FIG. 4 is a diagram illustrating an example of the first job schedule information. In the first job schedule information shown in FIG. 4, each record includes information for identifying the record (record ID), a job name (job name), and a flag indicating whether the job is being executed. (In-execution flag), a flag indicating whether the job is repeatedly executed (repetition flag), and a time when the job is desired to be executed. Here, when “0” is assigned to the executing flag, it indicates that the job is not executed, and when “1” is assigned, it indicates that the job is being executed. . If “0” is assigned to the repeat flag, it indicates that the job is executed only once. If “1” is assigned, it indicates that the job is executed repeatedly. Show. In addition, “*” in “year”, “month”, “day”, etc. indicates that the condition is arbitrary, and “end” in “day” indicates the end of the month. Therefore, the “monthly closing process” job is scheduled to be executed on the first day of every month, and the “update” job is scheduled to be executed at the end of each month.

  The second job schedule information has conditions related to the time for executing the job. Here, “time” indicates a time in a day or a time zone from a certain time to another time, for example, a time of 10:10:10 am, 20:00:00 The time zone from the second to 22 hours 0 minutes 0 seconds is shown. FIG. 5 is a diagram illustrating an example of second job schedule information. In the second job schedule information shown in FIG. 5, each record includes a job name and a job execution time. Here, the job execution time is a time when job execution may be started after the time. The job execution time may be specified in a time zone, and the job execution may be started within that time zone. In addition, “*” in “job name” or the like indicates that the condition is arbitrary. Therefore, a record with INDEX = 1 is a condition for all jobs. Here, INDEX in FIGS. 4 and 5 is information for identifying a record, and exists for a request in table management.

  As described above, the first job schedule information shown in FIG. 4 relates to the time condition, and the second job schedule information shown in FIG. 5 relates to the time condition. The second job schedule information is related to different condition items. In FIG. 4 and FIG. 5, conditions such as time or time are defined by setting “hour”, “minute”, etc. to “*”. The job schedule information may not be included. For example, in FIG. 4, there may be no condition items such as “hour” and “minute”. In the following description, the first job schedule information shown in FIG. 4 may be referred to as a first table, and the second job schedule information shown in FIG. 5 may be referred to as a second table.

  FIG. 6 is a flowchart showing the operation of the determination unit 18.

  (Step S201) The determination unit 18 sets I and J to “1”, respectively.

  (Step S202) The determination unit 18 accesses the first table (first job schedule information) stored in the first storage unit 15, and determines the calendar and time provided from the calendar / clock unit 17. With reference to this, it is determined whether or not the condition of the record of INDEX = I in the first table is satisfied. If it is satisfied, the process proceeds to step S203. If not satisfied, the process proceeds to step S209.

  In determining whether or not the condition is satisfied, the determination regarding the time is determined based on whether or not the current calendar corresponds to the time. In addition, in the determination of time, when the condition is indicated by time, it is determined whether or not the current time is the time of the condition. When the condition is indicated by time, the current time is the condition. Judged by whether it is included in the time zone. Here, when the condition is indicated by time, even if the current time has passed the condition time, and the job has never been executed after the condition time has passed, the condition is satisfied. You may judge. For example, if the current time is 17: 30: 3, the time of the condition is 17:30:00, and the job of the record has not been executed even once after 17:30: It may be determined that the condition is satisfied.

(Step S203) The determination unit 18 accesses the second table (second job schedule information) stored in the second storage unit 16, and the INDEX in the first table.
It is determined whether the job of the record with = I and the job of the record with INDEX = J in the second table are the same job based on whether the job names match. If the job names match, it is determined that they are the same job, and the process proceeds to step S204. If the job names are different, it is determined that they are not the same job, and the process proceeds to step S207.

  (Step S204) The determination unit 18 determines whether or not the job of the record with INDEX = I in the first table is being executed based on whether or not the execution flag is “1”. That is, if the in-execution flag of the INDEX = I record in the first table is “1”, it is determined that the job is being executed, and the process proceeds to step S207. If it is “0”, the job is being executed. Otherwise, the process proceeds to step S205.

  (Step S205) The determination unit 18 accesses the second table, refers to the calendar and time provided from the calendar / clock unit 17, and satisfies the condition of the record of INDEX = J in the second table. Judge whether or not. If satisfied, the process proceeds to step S206. If not satisfied, the process proceeds to step S207.

  (Step S206) The determination unit 18 passes to the execution unit 19 information (record ID) for identifying a record with INDEX = I in the first table and an instruction to start execution of the job.

  (Step S207) The determination unit 18 determines whether “J” is the last value in the second table, that is, whether the record of INDEX = J is the last. If "J" is the last value, the process proceeds to step S209. If not, the process proceeds to step S208.

  (Step S208) The determination unit 18 increments “J” by 1, and returns to Step S203.

  (Step S209) The determination unit 18 determines whether or not “I” is the last value in the first table, that is, whether or not the record of INDEX = I is the last. If “I” is the last value, the process returns to step S201. If not, the process proceeds to step S210.

  (Step S210) The determination unit 18 increments “I” by 1, sets “J” to “1”, and returns to Step S202.

  In the flowchart shown in FIG. 6, the case is described in which the determination unit 18 first makes a determination regarding the conditions of the first table and then makes a determination regarding the conditions of the second table. Alternatively, it may be determined whether or not the conditions of the first and second tables are satisfied by other methods. In the flowchart of FIG. 6, the process is ended by powering off or interruption for aborting the process.

  Next, the operation of the execution unit 19 will be described with reference to FIG. FIG. 7 is a flowchart showing the operation of the execution unit 19.

  (Step S <b> 301) The execution unit 19 determines whether an instruction to start job execution from the determination unit 18 has been received. If received, the process proceeds to step S302. If not received, the process proceeds to step S304.

  (Step S302) The execution unit 19 assigns “1” to the execution flag of the record in the first table specified by the record ID received from the determination unit 18 in step S206 via the access unit 14. By doing so, it is indicated that the job of the record of INDEX = I in the first table is being executed.

  (Step S303) The execution unit 19 reads a job related to the record ID received from the determination unit 18 from the job storage unit 20, and starts executing the job. Here, since the execution unit 19 can execute a plurality of jobs in parallel, if there is a job that has been executed so far, it is added to the job being executed and read from the job storage unit 20. Run the job.

  (Step S304) The execution unit 19 determines whether there is a job that has been executed. When the execution of the predetermined job is completed, the process proceeds to step S305, and when the execution of any job has not been completed yet, the process returns to step S301.

  (Step S305) The execution unit 19 specifies a record related to the job that has been executed in the first table via the access unit 14 by using a record ID, and determines whether the repetition flag of the record is “1”. to decide. If “1”, the process proceeds to step S306, and if “0”, the process proceeds to step S307.

  (Step S <b> 306) The execution unit 19 assigns “0” to the execution flag of the record relating to the job whose execution has ended via the access unit 14.

  (Step S <b> 307) The execution unit 19 deletes, from the first table, a record relating to the job whose execution has ended via the access unit 14. Note that when the record is deleted, the INDEX becomes discontinuous. However, at the timing when the determination unit 18 returns to S201 in the flowchart of FIG. 6 after the record is deleted, the determination unit 18 or the execution unit 19 sets the first table. INDEX is updated so that it becomes a continuous integer.

  Next, the operation of the job schedule apparatus according to this embodiment will be described using a specific example. In this specific example, a case will be described in which the job schedule apparatus 10 is a server and a plurality of information processing terminals 41 and 42 is a server / client system in which a client PC (Personal Computer). Further, it is assumed that the device ID of the information processing device 41 is “0x101”, and the information processing device 41 can access all of the first job schedule information and the second job schedule information.

First, an administrator of a server / client system composed of the job schedule device 10, the communication line 30, and the plurality of information processing devices 41 and 42 operates the information processing device 41 to obtain second job schedule information. The operation to access the will be described. In the information processing apparatus 41, a program for making an access request for changing the job schedule information is executed, so that the display shown in FIG. When the system administrator uses the mouse to click “access to schedule (time)”, the information processing apparatus 41 makes an access request to the second job schedule information stored in the second storage unit 16. It transmits to the job schedule apparatus 10. Then, the access request is received by the access receiving unit 12 via the communication unit 11 (step S101). Here, the access request includes the second job schedule information as the access target, “0x101” as the device ID, and “change” as the access content. Then, the access determination unit 13 determines that the accepted access request can be accessed based on the access determination information shown in FIG. 3 (step S102). As a result, the information processing apparatus 41 can access the second job schedule information stored in the second storage unit 16 via the communication unit 11 and the access unit 14. The display of FIG. 9 is performed on the display of the information processing apparatus 41. In FIG. 9, when the system administrator clicks “new record” with the mouse, the display shown in FIG. 10 is performed. In FIG. 10, when desired information is input for a job name, job execution time, and the like, and the “OK” button is clicked, the job name and the like are accessed via the communication line 30 and the communication unit 11 in the access unit 14 of the job schedule apparatus 10. Received at. The access unit 14 adds information such as the received job name as a new record to the second job schedule information stored in the second storage unit 16. In this way, it is assumed that the system administrator adds the record shown in FIG. 5 to the second job schedule information.

  The second job schedule information shown in FIG. 5 is scheduled so that the use of the job schedule apparatus 10 (server) by the information processing apparatuses 41, 42 and the like and the job execution by the job schedule do not overlap. is there. That is, when this server-client type network is used in a company or the like, the use of the server by the information processing devices 41 and 42 increases during the daytime, but the server of the information processing devices 41 and 42 at nighttime. There seems to be little use. Therefore, from 1 am is set as the execution time of the job executed by job scheduling.

  When a general user of the system operates the information processing apparatus 42 (apparatus ID = 0x102) and clicks “access to schedule (time)” in the display shown in FIG. 9, the first job schedule information is displayed. An access request is transmitted to the job schedule device 10. Then, the access request is received by the access receiving unit 12 via the communication unit 11 (step S101), and the access determining unit 13 determines that access is possible based on the access determination information (step S102). As a result, the information processing apparatus 42 can change the first job schedule information (step S103). In the access, it is assumed that the user clicks “new record” in the display shown in FIG. 9 and inputs the job name of the record to be added. FIG. 11 is a diagram illustrating an example of display on the display of the information processing apparatus 42. In the display of FIG. 11, when the user clicks the “OK” button, a record is added to the first job schedule information in the same manner as in the case of adding a record to the second job schedule information.

  Even if the general user of the system attempts to change the second job schedule information by operating the information processing apparatus 42 (that is, even if “access to schedule (time)” is clicked in the display of FIG. 8). The access determination unit 13 determines that the access is not possible (step S102), the display of the information processing terminal 42 displays “access denied”, and the access is denied (step S104). In this way, only the system administrator can change the second job schedule information.

  Next, an operation in which the determination unit 18 determines that the conditions of the first and second job schedule information are satisfied and the job is executed by the execution unit 19 will be described. Here, it is assumed that the first job schedule information is the first table shown in FIG. 4, and the second job schedule information is the second table shown in FIG.

  When the calendar / clock unit 17 indicates 0:30 am on June 15, 2003, the backup job of I = 2 satisfies the condition in the first table, but in the second table, any of J = 1 Since the execution condition related to this job is not satisfied, the job execution is not started.

After that, when the calendar and time indicated by the calendar / clock unit 17 have passed 10:00 AM on June 15, 2003, when I = 2 and J = 1, the first and second tables When the condition is satisfied (steps S202 and S205), it is determined that the jobs in each record are common (step S203), and it is determined that the job is not being executed (step S204), so that the job “backup” is executed. An instruction to do so is passed from the determination unit 18 to the execution unit 19. The execution unit 19 assigns “1” to the execution flag of the record of the job “backup” based on the record ID “0x002” received together with the instruction (step S302), and a program related to the backup process is transferred from the job storage unit 20 Read and execute (step S303). In this way, the job “backup” is executed when the conditions in the first and second job schedule information regarding the job “backup” are satisfied.

  When the job “backup” is ended, the execution unit 19 determines that the job has ended (step S304), determines that the repetition flag is “1” (step S305), and sets the execution flag to “ Substitute 0 ". In this way, execution of the job “backup” is terminated.

  As described above, according to the job scheduling apparatus according to the present embodiment, it is possible to schedule a job appropriately by scheduling the execution of the job based on the first and second job schedule information. In particular, as described above, when the condition regarding the time is determined by the first job schedule information and the condition regarding the time is determined by the second job schedule information, the real time from the client in the server / client type system By defining the conditions of the second job schedule information so that the job execution by the request and the job execution by the schedule do not overlap, a comfortable work environment can be provided to the user on the client side.

  Furthermore, the user who schedules the execution of the job only needs to register a desired time, and the labor for creating the schedule is reduced. In particular, when it is necessary to determine the time in the schedule, it is necessary to adjust the time so that it does not overlap with the execution of other heavy jobs, but such a complicated work need not be performed. It will be.

  For example, because the system administrator who manages the entire system knows the entire system, it determines the job execution time so that job execution in the entire system is not concentrated at one time, while the accounting month Users of the accounting department in charge of the closing process can provide a comfortable work environment without concentrating job execution at a time by setting the time when they want to receive the processing results. The user can receive a desired processing result at a desired time.

  Note that the second job schedule information in the present embodiment may have, as a condition, the number of job executions for each time period as shown in FIG. In FIG. 12, the number of jobs that can be executed (number of job executions) is not limited in the time zone from 1 am to 5 am, but is limited to 10 from 5 am to 7 am, and from 7 am Until 9 o'clock, it is limited to 5. In this case, the execution unit 19 provides information regarding the number of jobs being executed to the determination unit 18, and the determination unit 18 uses the information to perform the determination in step S205 of FIG. Then, when the number of jobs executed by the execution unit 19 exceeds the number of jobs executed specified by the second job schedule information, the process proceeds to step S207. As described above, since the job schedule information has a condition regarding the number of executions of jobs, finer scheduling can be performed.

  In the present embodiment, the second job schedule information defines conditions for enabling a predetermined job to be executed, but the job schedule information does not execute the condition (for example, 1 pm For example, a job cannot be executed from 2 to 2 o'clock), and a predetermined flag is used to identify whether an executable condition or an inexecutable condition is indicated. Also good.

(Embodiment 2)
A job schedule apparatus according to Embodiment 2 of the present invention will be described with reference to the drawings. The job schedule apparatus according to the present embodiment detects a job that cannot be executed.

  FIG. 13 is a block diagram showing the configuration of the job schedule apparatus according to this embodiment. In FIG. 13, the job schedule apparatus 50 according to the present embodiment includes a communication unit 11, an access reception unit 12, an access determination unit 13, an access unit 14, a first storage unit 15, and a second storage unit. 16, a calendar / clock unit 17, a determination unit 18, an execution unit 19, a job storage unit 20, a detection unit 21, and an output unit 22. The configuration and operation other than the detection unit 21 and the output unit 22 are the same as those in the first embodiment, and a description thereof will be omitted.

  The detection unit 21 inspects the first job schedule information stored in the first storage unit 15 and the second job schedule information stored in the second storage unit 16, and cannot be executed. Detect jobs. Then, information indicating the job that cannot be executed is transmitted to the output unit 22.

  When the output unit 22 receives information indicating the inexecutable job detected by the detection unit 21 from the detection unit 21, the output unit 22 outputs the information. This output may be, for example, communication (transmission) to the information processing terminal 41, which is a client, or other external device, or may be video output to a display, audio output by a speaker, etc. It may be recorded or printed out. The output unit 22 may include an output device (for example, a display, a speaker, a printer, or the like), or may be only a driver that drives the output device.

  Next, operations of the detection unit 21 and the output unit 22 in the present embodiment will be described. The detection unit 21 checks the first and second job schedule information at a predetermined timing, and determines whether there is a job that cannot be executed, that is, the condition in the first job schedule information and the second job schedule information. It is determined whether or not there is an incompatible condition in any combination. Here, the timing at which the detection unit 21 inspects the first job schedule information or the like may be every predetermined period (for example, every day at 2:00 am, etc.), or a predetermined event (for example, the first or second). The job schedule information may be changed as a trigger, or other timing may be used. FIG. 14 is a flowchart showing the operation of the detection unit 21.

  (Step S401) The detection unit 21 sets I and J to “1”, respectively.

  (Step S <b> 402) The detection unit 21 is stored in the second storage unit 16 and the condition of the record of INDEX = I in the first table (see FIG. 4) stored in the first storage unit 15. It is determined whether or not the condition of the record of INDEX = J in the second table (see FIG. 5) conflicts. Here, conflicting means that both are never compatible. For example, if the job names are different or the execution dates are different, it is determined that there is a conflict. If there is a conflict, the process proceeds to step S405, and if not, the process proceeds to step S403.

  (Step S403) The detection unit 21 determines whether “I” is the last value in the first table, that is, whether the record of INDEX = I is the last. If “I” is the last value, the process ends. If not, the process proceeds to step S404.

  (Step S404) The detection unit 21 increments “I” by 1, sets “J” to “1”, and returns to Step S402.

(Step S405) The detection unit 21 determines whether “J” is the last value in the second record, that is, whether the record of INDEX = J is the last. If “J” is the last value, the process proceeds to step S406. If not “J”, the process proceeds to step S407.

  (Step S406) The detection unit 21 determines that the job of the record with INDEX = I in the first table cannot be executed, and information for specifying the job in a memory (not shown) of the detection unit 21 (For example, a record of INDEX = I in the first table) is stored.

  (Step S407) The detector 21 increments “J” by 1, and returns to step S402.

  Here, when the series of processing shown in FIG. 14 is performed, it is possible to detect that the first table includes a job that cannot be executed, but it is included in the second table. Cannot detect non-executable jobs. Therefore, in order to detect a non-executable job included in the second table, it is necessary to execute similarly by exchanging the first table and the second table in the flowchart of FIG.

  After the series of processing shown in the flowchart of FIG. 14 is completed, the detection unit 21 reads information for specifying an inexecutable job stored in the memory and passes the information to the output unit 22. The output unit 22 outputs information received from the detection unit 21.

  Next, operations of the detection unit 21 and the output unit 22 will be described using specific examples. Here, it is assumed that the first table is as shown in FIG. 4 and the second table is as shown in FIG.

  There is no conflict between the INDEX = 1 record in the first table and the INDEX = 1 record in the second table because the job “Month Closing” can be executed at 1 am on the first day of any month. (Steps S401 and S402). Then, I is incremented (steps S403 and S404), and then it is determined whether or not the INDEX = 2 record in the first table and the INDEX = 1 record in the second table conflict (step S402). ). In this way, in the case of the job schedule information shown in FIGS. 4 and 5, there is no conflict, so there is no unexecutable job. Further, the second table may be inspected to determine whether there is a job that cannot be executed.

  4 and 5 are job schedule information having different condition items, it is considered that there are no conflicting condition items. For example, a job that does not exist in the second table is the first. In the table, the job in the first table is detected as an unexecutable job.

On the other hand, if the first table is the one shown in FIG. 15 and the second table is the one shown in FIG. 5, it is determined that the conflict occurs when I is 4 and J is 1 or 2. (Step S402), if there are only records in the second table up to INDEX = 2, information for specifying the job “X × schedule creation”, that is, a record of INDEX = 4 in the table shown in FIG. It is stored in a memory (not shown) of the detection unit 21. Then, after the series of processing shown in FIG. 14 is completed, the information is passed from the detection unit 21 to the output unit 22, and the output unit 22 indicates that the record and the job of the record cannot be executed. Print out. FIG. 16 is a diagram showing that the job “XX schedule creation” printed out in this way cannot be executed. The user of the information processing devices 41 and 42 can know the job that cannot be executed by looking at the information about the printed job that cannot be executed, and the job schedule information so that the job is executed. Can be corrected.

  As described above, the job schedule apparatus according to the present embodiment includes the detection unit 21 that checks job schedule information and detects a job that cannot be executed, and the output unit 22 that outputs the detection result. Therefore, in the job execution schedule based on the first and second job schedule information, it is possible to easily detect a job that is not executed, and based on the result, the user changes the job schedule information. can do.

  An example of the hardware configuration in each of the above embodiments is as shown in FIG. That is, the job schedule device corresponds to the server (host) in FIG. 17, and the information processing devices 41 and 42 correspond to the client terminal in FIG.

  Further, in each of the embodiments described above, the case where the first and second job schedule information is given in a table format (for example, see FIG. 4) has been described. The first and second job schedule information is Any table having a condition related to the job execution schedule may be used.

  In each of the above-described embodiments, the case has been described where the first job schedule information has a condition related to time and the second job schedule information has a condition related to time. However, the first and second job schedule information Are not limited to these. For example, in the second job schedule information, “day of the week” may be newly added as a condition, and all jobs may be executed all day on Saturday and Sunday. In addition, other conditions may be included.

  Furthermore, the first and second job schedule information may relate to different condition items, or may each have the same condition item.

  In each of the above embodiments, the case where there are two pieces of job schedule information (that is, the case of the first and second job schedule information) has been described. In this case, the job is executed when the conditions of the job schedule information relating to the predetermined job are satisfied.

  In each of the above embodiments, the first and second job schedule information is stored in two storage units, that is, the first and second storage units 15 and 16, respectively. The second job schedule information may be stored in the same storage unit. In the case where they are stored in the same storage unit, the area in which the first job schedule information is stored becomes the first storage unit 15, and the area in which the second job schedule information is stored is the first. 2 storage unit 16.

  In each of the above-described embodiments, the job schedule device including the access determination unit 13 that determines whether access is possible has been described. However, the job schedule device does not include the access determination unit 13, and the access unit 14 includes the access reception unit 12. The job schedule information may be accessed in accordance with the access request received in step (b). Also in this case, the access request includes at least information indicating the access target.

Further, in each of the above embodiments, the case where the device ID for identifying the information processing devices 41 and 42 is used to determine whether access is possible has been described. However, whether access is possible is included in the access request. You may judge based on an identifier. The identifier may be information for identifying an access source device such as a device ID, or authentication information such as a password. For example, when determining whether or not access is possible based on the input authentication information (password or the like), the authentication information becomes an identifier. When correct authentication information is input, access is possible, and incorrect authentication information is input. Sometimes access is not possible.

  Further, the second job schedule information is stored in a root directory (corresponding to the second storage unit 16) that can be accessed only by the system administrator, and a subdirectory (first directory) lower than the root directory. When the first job schedule information is stored in the storage unit 15) and the access request as the system administrator is made, the access determination unit 13 permits the access to the root directory. As a result, the second job schedule information and the first job schedule information of the subdirectory that is a lower hierarchy can be accessed, and when an access request is made as a general user, the access determination unit 13 Grants access to the subdirectory, so the first job schedule information Can be Seth, can not see the second job schedule information (ie, not only can not be accessed, there do not know even) may be.

  In each of the above embodiments, a server / client system has been described. However, the job schedule in each of the above embodiments may be executed by a stand-alone information processing apparatus (job scheduling apparatus). This is particularly effective when a stand-alone information processing apparatus is logged in and used by a plurality of people.

  In each of the above embodiments, each component may be configured by dedicated hardware, or a component that can be realized by software may be configured by software under program control. An example of a program executed by a computer when configured by software is a second job having a condition regarding first job schedule information having a condition regarding a job execution schedule and a condition regarding a job execution schedule with respect to a predetermined job This is a program for causing a computer to execute a determination step for determining whether or not the condition of the schedule information is satisfied. Here, the execution of the job according to the determination result in the determination step may be performed by the computer that performed the determination, or may be performed by the information processing apparatus that has received the determination result via a network or the like. .

  Further, in the program, the computer may further execute a job execution step for executing the job determined to satisfy the conditions of the first and second job schedule information in the determination step. The “job execution” in this program may be execution of the job program itself (for example, execution of the backup program itself), start of the job (call), or the like.

  As described above, the job schedule device according to the present invention is useful for, for example, an information processing device that schedules job execution.

1 is a block diagram showing a configuration of a job schedule apparatus according to Embodiment 1 of the present invention. A flowchart showing the operation of the job schedule apparatus according to the embodiment The figure which shows an example of the access judgment information in the embodiment The figure which shows an example of the 1st job schedule information in the embodiment The figure which shows an example of the 2nd job schedule information in the embodiment A flowchart showing the operation of the job schedule apparatus according to the embodiment A flowchart showing the operation of the job schedule apparatus according to the embodiment The figure which shows an example of the display screen of the information processing apparatus in the embodiment The figure which shows an example of the display screen of the information processing apparatus in the embodiment The figure which shows an example of the display screen of the information processing apparatus in the embodiment The figure which shows an example of the display screen of the information processing apparatus in the embodiment The figure which shows an example of the 2nd job schedule information in the embodiment FIG. 3 is a block diagram showing the configuration of a job schedule apparatus according to Embodiment 2 of the present invention A flowchart showing the operation of the job schedule apparatus according to the embodiment The figure which shows an example of the 1st job schedule information in the embodiment The figure which shows an example of the output result which showed the job which cannot be executed in the embodiment The figure which shows an example of the hardware constitutions in this Embodiment 1 and 2

Explanation of symbols

DESCRIPTION OF SYMBOLS 10,50 Job schedule apparatus 11 Communication part 12 Access reception part 13 Access judgment part 14 Access part 15 1st storage part 16 2nd storage part 17 Calendar / clock part 18 Judgment part 19 Execution part 20 Job storage part 21 Detection part 22 Output unit 30 Communication line 41, 42 Information processing device

Claims (19)

In the first to Nth (N is an integer of 2 or more) job schedule information each having a condition related to a job execution schedule, the job is executed when the condition of each job schedule information related to a predetermined job is satisfied Job schedule device. A first storage unit that stores first job schedule information having a condition related to a job execution schedule;
A second storage unit for storing second job schedule information having conditions relating to a job execution schedule;
A determination unit that determines whether or not a condition of the first job schedule information and a condition of the second job schedule information are satisfied for a predetermined job;
A job schedule device comprising: a job execution unit that executes a job determined by the determination unit to satisfy the conditions of the first and second job schedule information. An access receiving unit for receiving an access request to the first and second job schedule information;
The job schedule apparatus according to claim 2, further comprising: an access unit that accesses job schedule information according to an access request received by the access receiving unit. For the access request received by the access receiving unit, further comprises an access determining unit that determines whether access is possible,
The job scheduling apparatus according to claim 3, wherein the access unit performs access in response to the access request when the access determination unit determines that access is possible. The job scheduling apparatus according to claim 4, wherein the access determination unit determines that access to the first job schedule information is possible only when a predetermined identifier is included in the access request. The job schedule according to any one of claims 2 to 5, wherein a condition of the first job schedule information and a condition of the second job schedule information relating to a predetermined job are related to different condition items. apparatus. The first job schedule information has a condition regarding a time to execute a job,
The job schedule apparatus according to claim 6, wherein the second job schedule information includes a condition related to a time for executing a job. The job schedule apparatus according to claim 7, wherein the second job schedule information includes a condition regarding the number of jobs executed for each time period. A detector that inspects the first and second job schedule information and detects an inexecutable job;
The job schedule apparatus according to claim 2, further comprising: an output unit that outputs information indicating an inexecutable job detected by the detection unit. On the computer,
Executes a step of determining whether or not the conditions of each job schedule information related to a predetermined job are satisfied in the first to Nth (N is an integer of 2 or more) job schedule information each having a condition related to a job execution schedule Program to let you. On the computer,
A determination step is executed for determining whether a condition of first job schedule information having a condition related to a job execution schedule and a condition of second job schedule information having a condition related to a job execution schedule is satisfied for a predetermined job. Program for. The program according to claim 11, further causing a computer to execute a job execution step of executing a job determined to satisfy the conditions of the first and second job schedule information in the determination step. An access accepting step for accepting access requests to the first and second job schedule information;
The program according to claim 11 or 12, for causing a computer to further execute an access step of accessing job schedule information according to an access request received in the access receiving step. For the access request accepted in the access acceptance step, the computer further executes an access judgment step for judging whether or not access is possible,
14. The program according to claim 13, wherein in the access step, access is made in response to the access request when it is determined that access is possible in the access determination step. The program according to claim 14, wherein in the access determination step, it is determined that access to the first job schedule information is possible only when a predetermined identifier is included in the access request. The program according to any one of claims 11 to 15, wherein a condition included in the first job schedule information and a condition included in the second job schedule information relating to a predetermined job are related to different condition items. The first job schedule information has a condition regarding a time to execute a job,
The program according to claim 16, wherein the second job schedule information has a condition regarding a time for executing a job. The program according to claim 17, wherein the second job schedule information has a condition regarding the number of jobs executed for each time period. A detection step of inspecting the first and second job schedule information and detecting an inexecutable job;
The program according to any one of claims 11 to 18, further causing a computer to execute an output step of outputting information indicating an inexecutable job detected in the detection step.

Images