JP2006039669A - Information processing device and method therefor - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To grant licenses for a limited number of applications nearly equally to all jobs which are requested to execute. <P>SOLUTION: A request for executing a job using an application is received, and whether license information for executing the job-execution request exists is determined. If not, the job is on standby. Then, after a prescribed time passes, a job under execution is stopped, and control is made so that the job on standby may be executed. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to an information processing apparatus and method for managing job execution using an application.

  2. Description of the Related Art Conventionally, a method has been used in which a license for an application is shared by a plurality of users, and control is performed so as not to cause a conflict of licenses to be used when a plurality of users use the application (Patent Document 1). The application assumed here means that one job using the application requires one license, and no other job can use this license while the job is being executed.

  FIG. 6 shows a conventional example in which a plurality of application licenses are shared by a plurality of users or a plurality of jobs using the application. In FIG. 6, when the job execution receiving unit 430 receives a job execution request from a job executor that executes a job, the job execution request is registered in the job execution queue unit 440. The job execution monitoring unit 420 monitors the job queue unit 440 and the license management unit 470 that manages the number of jobs in use among a plurality of application licenses. It is checked whether there is a license (empty license) that is present and unused in the license management unit 470. If there is a free license, a job activation command is issued to the job execution unit 450. As a result, the job execution unit 450 acquires the application license from the license management unit 470 and executes the waiting job.

  When the job being executed by the job execution unit 450 is completed, the license of the application is returned to the license management unit 470. If there is a waiting job in the job queue unit 440 and no license is used in the license management unit 470, the job execution unit 450 terminates the currently executing job in the waiting job. , It is made to wait until the license becomes available. According to such a method, the job executor can execute the job without worrying about the number of licenses and usage status of the application. Here, if there are always waiting jobs in the job queue 440, the application license is fully used, and the maximum effect is obtained by investing in the application. become.

For example, in verification of a logic circuit in semiconductor development, logic verification is performed using an application that performs logic simulation. When a limited application license is shared by a plurality of people or a plurality of jobs, the method of sharing the application license as described above is used. In this logic verification process, if a defect is included in the created test or verification target circuit, the application is stopped when the defect is found, the defect is corrected, and then simulation is executed again Is repeated.
JP 2002-258962 A

  However, the presence or absence of defects cannot be predicted in advance, so if there are more job execution requests than the number of licenses you have, the job that detected the failure will wait for a long time due to another job execution request. There was a problem. The key to shortening the verification period is how quickly the defect is corrected and removed in the above-mentioned logic verification work, but in the past, it takes a long time to correct the defect, resulting in a prolonged verification period. There was a problem.

  The present invention has been made in view of the above problems, and the feature of the present invention is that a plurality of jobs are executed on an average basis by stopping a job being executed and executing a job that is not permitted to be executed. An information processing apparatus and a method thereof are provided.

An information processing apparatus according to one embodiment of the present invention has the following configuration. That is,
An information processing apparatus for managing job execution using an application,
Management means for managing license information permitting execution of the job;
An execution means for executing a job permitted by the license information;
Standby means for waiting for jobs not permitted by the license information;
The execution means is characterized in that when a job to be executed is switched, the job being executed is stopped and the job on standby is executed.

An information processing method according to an aspect of the present invention includes the following steps. That is,
An information processing method for managing job execution using an application,
A management process for managing license information permitting execution of the job;
An execution means for executing a job permitted by the license information;
A standby process for waiting for jobs that are not permitted by the license information,
The execution step is characterized in that when the job to be executed is switched, the job being executed is stopped and the job on standby is executed.

  According to the present invention, a plurality of jobs are executed almost on average by stopping jobs being executed and executing jobs that are not permitted to be executed according to the license information.

  DESCRIPTION OF EMBODIMENTS Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

  FIG. 1 is a block diagram illustrating a configuration example of a job management system according to an embodiment of the present invention.

  Upon receiving the job execution request 111 from the application user, the job execution reception unit 130 registers the received job in the job queue unit 140 and waits (112). The license management unit 170 manages how many licenses are in use out of the total number of licenses of the owned application. The job execution management unit 120 monitors the job queue unit 140 and the license management unit 170, and issues an execution command to the job execution unit 150 when there is a waiting job and there is an unused license. (113). In response to this execution instruction, the job execution unit 150 acquires the application license 114 from the license management unit 170 and executes the job.

  FIG. 2 explains changes in the status of each job according to the status of each job and the passage of time in job execution unit 150, job queue unit 140, and job execution status temporary storage unit 160 according to the present embodiment. FIG.

  At time t500, the job execution unit 150 is executing three jobs j1, j2, and j3. Here, the total number of licenses of the application is “6”. Next, when an execution request for a new job j4 is made at time t510, the license management unit 170 holds an unused license for executing the requested job j4. The job j4 is immediately executed.

  Next, at time t520, execution requests for four jobs j7, j8, j9, and j10 are input while all of the licenses ("6") that are owned are used and jobs j1 to j6 are being executed. Indicates the state. In this case, four jobs j7, j8, j9, and j10 for which new execution requests have been issued are registered in the job execution queue unit 140 and are waiting.

  Next, at time t530, since the execution of job j3 being executed has been completed, the state where the earliest job j7 among the jobs that have been waiting is being executed is shown.

  In the job execution queue unit 140, the left end indicates the earliest job execution request at the left end, and the execution request for the job issued later as it goes to the right side. In this embodiment, the first job on the left side is preferentially executed.

  When there is an unused license in the license management unit 170, the job execution management unit 120 acquires the license (122), and the waiting job is immediately executed. Therefore, there is no waiting job even though there is an unused license.

  As shown in FIG. 1, the system according to the present embodiment further includes a timer unit 110 that measures a set predetermined time and a time setting unit 100 that sets a predetermined time 115 in the timer unit 110. When the job execution management unit 120 receives information 116 indicating that a predetermined time has elapsed from the timer unit 110, the job execution management unit 120 checks whether there is a job waiting in the job queue unit 140 (119). If there is no job waiting at this time, nothing is done.

  If there is a job waiting, that is, if there is no unused license in the license management unit 170, a job currently being executed in order to execute the job waiting in the job queue unit 140 The number of jobs corresponding to the number of waiting jobs is stopped.

  Referring to the example of FIG. 2, at time t530, six jobs are being executed and three jobs are in a standby state with respect to the number of licenses of the owned application “6”. At time t530, jobs j1, j2, j4 to j7 are jobs permitted by the license, and jobs j8, j9, and j10 are jobs not permitted by the license. Here, a state when a notification that a predetermined time has elapsed from the timer unit 110 is shown at time t540. Time t540 is when the job to be executed is switched (first).

  Here, the job execution management unit 120 issues an instruction to the job execution unit 150 to stop three jobs j1, j2, and j4 among the jobs currently being executed (113). Upon receiving this stop instruction, the job execution unit 150 saves the current execution state of each job in the job execution state temporary storage unit 160 (117). Thereafter, the job execution management unit 120 issues execution commands for the three jobs j8, j9, and j10 that are waiting to the job execution unit 150 (113). As a result, the job execution unit 150 acquires licenses for three jobs from the license management unit 170 (122), reads out the jobs waiting in the job queue unit 140 (123), and outputs the jobs (j8, j9, j10).

  Here, the case where there are three jobs waiting in the job queue unit 140 has been described. For example, when eight jobs exceeding the total number of licenses are waiting, the number of licenses owned “6” The above-mentioned stop command is performed with “” as the upper limit. The remaining two jobs are executed when the currently running job ends and the license is empty, or the next notification from the timer unit 110 that a predetermined time has elapsed.

  Further, in this embodiment, when three are selected from the six jobs currently being executed, the selection is made from the oldest one of the six execution start times in this embodiment, but other methods may be used. Absent.

  Time t550 indicates a case where one job j6 is completed in the job execution unit 150 from the state at time t540. When the job is completed in the job execution unit 150, the job execution unit 150 returns the license to the license management unit 170 (118). The job execution management unit 120 monitors this, and when an unused license is found, checks the job waiting state in the job queue unit 140 (119). If there is a waiting job, it is executed. In the example of FIG. 2, since there is no job waiting at time t550, it is checked whether there is a job that is stored in the job execution state temporary storage unit 160 and whose processing is interrupted (124). Since there is a waiting job here, the earliest job j1 is selected from these, and the job execution management unit 120 issues an execution instruction for the job j1 to the job execution unit 150 (113). Upon receiving this execution instruction, the job execution unit 150 reads the job execution state of the job j1 from the job execution state temporary storage unit 160 (121), and executes the continuation of the job j1 that has been interrupted.

  Next, at time t570, all licenses are in use, there are jobs saved in the job execution status temporary storage unit 160, and there are jobs j11 and j12 that are waiting in the execution queue 140. At time t570, jobs j5, j7 to j10, j1 are jobs permitted by the license, and jobs j2, j4, j11, j12 are jobs not permitted by the license. In this state, a state when the elapse of a predetermined time is confirmed by the timer unit 110 is shown at a time t580. Time t580 is when the job to be executed is switched (second). In this case, two jobs are waiting in the job queue unit 140, and in order to execute these jobs, the job execution unit 150 stops the two jobs currently being executed. At this time, the upper limit of the number of jobs to be stopped is “6”, and the number of jobs to be stopped is less than this, so that jobs saved in the job status temporary storage unit 160 can also be executed. Since the number of jobs saved in the job execution state temporary storage unit 160 is two, the total number of jobs to be stopped is “4”. As a result, j5, j7, j8, and j9 are stopped from the jobs that are currently being executed. Instead, j11 and j12 that are waiting in the job queue unit 140, and jobs that are saved in the job execution state temporary storage unit 160 are stored. j2 and j4 are executed. Jobs j2 and j4 are jobs stopped at time t540 (during the first switching of the job to be executed). In this case, jobs j5, j7, j8, and j9 whose temporary execution is interrupted are registered in the job execution state temporary storage unit 160.

  FIG. 3 is a block diagram showing a hardware configuration of apparatuses that constitute the job management system according to the present embodiment. This system may be composed of, for example, a general personal computer or a workstation.

  In the figure, a CPU 300 is a CPU such as a microprocessor, and executes various control operations according to a program stored in the memory 301. The memory 301 includes a RAM unit and a ROM unit. The RAM unit is used as a work area when the CPU 300 operates, and temporarily stores various data. When the control program is executed, the control program is loaded from the HD 304. Executed. The ROM unit stores a program such as a boot program and BIOS. The display unit 302 includes a liquid crystal, a CRT, and the like, and displays various data and messages. The input unit 303 has a keyboard, a mouse, and the like, and is used to input various data by being operated by a user, and is also used to input a job execution request. An HD (hard disk) 304 is a large-capacity storage device that stores a control program executed by the CPU 300 and various data. The HD 304 stores information managed and stored by the above-described job queue unit 140, job execution state temporary storage unit 160, and license management unit 170. A NIC (network interface controller) exchanges data with a network via a communication line. The timer 306 performs the function as the timer unit 110 described above, measures time in accordance with an instruction from the CPU 300, and notifies the CPU 300 by an interrupt or the like when a specified time has elapsed. A system bus 307 connects the above-described units.

  FIG. 4 is a flowchart for explaining the flow of processing in the job management system according to the present embodiment. A program for executing this processing is stored in the HD 304 and loaded into the memory 301 at the time of execution. The CPU 300 executes the control process described in this flowchart in accordance with the loaded program.

  When this process is started, it is first checked in step S320 whether there is a job waiting in the job queue unit 140 or whether there is a job being saved in the job execution state temporary storage unit 160. If there is no corresponding job, the process returns to step S320. If there is a corresponding job in step S320, the process proceeds to step S330, and it is confirmed whether the license management unit 170 has a free license (unused license). If there is a free license, the process advances to step S360 to execute a job waiting in the job queue unit 140 or a job being saved for the number of free licenses.

  On the other hand, if there is no free license in step S330, the process proceeds to step S340, and it is confirmed based on the time measured by the timer unit 110 whether a predetermined time set in advance has elapsed. If it is determined in step S340 that the predetermined time has not elapsed, the process returns to step S320. If the predetermined time has elapsed, the process proceeds to step S350, the number of jobs that are currently being executed are stopped, and the execution state is changed. The job execution state is temporarily saved in the storage unit 160. Then, the process proceeds to step S360 to execute a desired job, and after executing this job, the process returns to step S320.

  FIG. 5 is a flowchart showing details of the processing of steps S350 and S260 of FIG. 4. When the timer unit 110 detects that a predetermined time has elapsed in step S340, the process proceeds to step S410 and is registered in the job queue unit 140. In step S420, the number of jobs stored in the job execution state temporary storage unit 160 is acquired. In step S430, it is checked whether the total number T of jobs acquired in steps S410 and S420 is 6 or less (0 <T ≦ 6). If so, the process advances to step S450 to stop the execution of the total number of jobs and save the information of the jobs whose execution has been stopped in the job execution state temporary storage unit 160. If the total number T of jobs is “0”, this means that there is no job that is waiting or being saved, and in this case, nothing is done and the process proceeds to step S320. In step S460, the job stored in job queue unit 140 and job execution state temporary storage unit 160 is executed, and the process proceeds to step S320. At this time, if the number of jobs stored in the job queue unit 140 and the job execution state temporary storage unit 160 is “0”, nothing is done.

  If it is determined in step S430 that the total number of jobs acquired in steps S410 and S420 is not less than 6, the process proceeds to step S440, and six jobs to be executed are selected from these stored or saved jobs. Then, the process proceeds to step S450 to execute the above-described processing. In this step S440, for example, jobs registered in the job queue unit 140 are preferentially selected, and when the total number is less than 6, the rest are stored in the job execution state temporary storage unit 160. Alternatively, a job stored in the job execution state temporary storage unit 160 may be prioritized.

  As described above, according to the present embodiment, a job in the standby state in the job execution queue unit 140 or a job saved in the job execution state temporary storage unit 160 is currently being executed at regular intervals. It can be executed alternately, and time sharing can be performed for all jobs that want to execute a limited application license. That is, in the operation of executing a plurality of jobs and correcting a job including a defect among the plurality of jobs, the time that the execution of the job including the defect waits for the execution of the job not including the defect is shortened. , It is possible to measure the efficiency of work by fixing the time until the defect is corrected.

  When this embodiment is applied to a semiconductor logic circuit verification method, an application for executing a job is simulation software for simulating a semiconductor logic circuit on a computer, and the job is verified using simulation software. A batch process that executes

  In this state, if there are more job execution requests than the number of licenses possessed, there is a possibility that the semiconductor verification job in which the problem has occurred will be kept waiting for a long time by another job. However, according to the present embodiment, even if the execution is temporarily interrupted by another job execution request, it is restarted when a predetermined time elapses, so that the period of the logic verification work can be shortened as a whole. . As a result, the development period of the semiconductor logic circuit can be shortened, and a product equipped with the semiconductor logic circuit can be put on the market early.

[Other Embodiments]
The embodiment of the present invention has been described in detail above. However, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of one device.

  In the present invention, a software program that realizes the functions of the above-described embodiments is supplied directly or remotely to a system or apparatus, and the computer of the system or apparatus reads and executes the supplied program code. In some cases, it can be achieved by In that case, as long as it has the function of a program, the form does not need to be a program. Accordingly, since the functions of the present invention are implemented by computer, the program code installed in the computer also implements the present invention. That is, the present invention includes a computer program itself for realizing the functional processing of the present invention. In this case, the program may be in any form as long as it has a program function, such as an object code, a program executed by an interpreter, or script data supplied to the OS.

  As a storage medium for supplying the program, for example, floppy (registered trademark) disk, hard disk, optical disk, magneto-optical disk, MO, CD-ROM, CD-R, CD-RW, magnetic tape, nonvolatile memory card ROM, DVD (DVD-ROM, DVD-R) and the like. As another program supply method, a client computer browser is used to connect to an Internet homepage, and the computer program of the present invention itself or a compressed file including an automatic installation function is downloaded from the homepage to a storage medium such as a hard disk. Can also be supplied. It can also be realized by dividing the program code constituting the program of the present invention into a plurality of files and downloading each file from a different home page. That is, a WWW server that allows a plurality of users to download a program file for realizing the functional processing of the present invention on a computer is also included in the claims of the present invention.

  In addition, the program of the present invention is encrypted, stored in a storage medium such as a CD-ROM, distributed to users, and key information for decryption is downloaded from a homepage via the Internet to users who satisfy predetermined conditions. It is also possible to execute the encrypted program by using the key information and install the program on a computer.

  In addition to the functions of the above-described embodiments being realized by the computer executing the read program, the OS running on the computer based on the instruction of the program may be part of the actual processing or The functions of the above-described embodiment can also be realized by performing all the processing and performing the processing.

  Furthermore, after the program read from the recording medium is written in a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, the function expansion board or The CPU or the like provided in the function expansion unit performs part or all of the actual processing, and the functions of the above-described embodiments are realized by the processing.

  As described above, according to the present embodiment, a limited application license can be given equally to all jobs that have been requested to be executed. The time that is waited for by executing a job that does not include a job can be shortened, and the timing for correcting a defect that is latent in the job can be advanced. In other words, it is possible to improve the efficiency of the work of eliminating the problem of the job and normalizing the job.

It is a block diagram explaining the functional structure of the job management system which concerns on embodiment of this invention. It is a transition diagram explaining the execution state of the job in the job management system concerning this embodiment. It is a block diagram which shows the hardware constitutions of the apparatus which comprises the job management system which concerns on this Embodiment. It is a flowchart explaining the flow of processing in the job management system according to the present embodiment. It is a flowchart which shows the detail of the process of step S350 of FIG. 4, and S260. It is a figure explaining operation | movement of the conventional job management system.

Claims (14)

An information processing apparatus for managing job execution using an application,
Management means for managing license information permitting execution of the job;
An execution means for executing a job permitted by the license information;
Standby means for waiting for jobs not permitted by the license information;
The information processing apparatus according to claim 1, wherein the execution unit stops a job being executed and executes a waiting job when switching a job to be executed.   The information processing apparatus according to claim 1, further comprising a timing unit that counts when a job to be executed is switched.   The information processing apparatus according to claim 1, wherein the standby unit stores information regarding a stopped job.   4. The information processing apparatus according to claim 1, wherein the execution unit stops execution of a number of jobs corresponding to the number of jobs waiting in the standby unit. 5.   5. The information processing apparatus according to claim 1, wherein the execution unit further executes a job stopped at the time of the first switching at the time of the second switching. 6.   The information processing apparatus according to claim 1, wherein the execution unit stops execution of a job from a job that has been executed first among jobs being executed. An information processing method for managing job execution using an application,
A management process for managing license information permitting execution of the job;
An execution means for executing a job permitted by the license information;
A standby process for waiting for jobs that are not permitted by the license information,
An information processing method characterized in that the execution step stops a job being executed and executes a waiting job when the job to be executed is switched.   The information processing method according to claim 7, further comprising a timing step of timing the time of switching jobs to be executed.   The information processing method according to claim 7 or 8, wherein the waiting step stores information on a stopped job.   10. The information processing method according to claim 7, wherein the execution step stops execution of a number of jobs corresponding to the number of jobs waiting in the standby step.   The information processing method according to any one of claims 7 to 10, wherein the execution step further executes a job stopped at the time of the first switching at the time of the second switching.   The information processing method according to any one of claims 7 to 11, wherein in the execution step, execution of the job is stopped from a job that has been executed first among jobs being executed.   The program which performs the information processing method of any one of Claims 7 thru | or 12.   A storage medium storing a program for executing the information processing method according to any one of claims 7 to 12.

Images