JP2010134494A - Program conversion device, conversion method, program control method and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve the problem that it is difficult to secure calculation resources by arbitrary processing units regardless of such a particle size as a processor or thread in a conventional resource reservation technology, and that since it is not possible to divide processing with no parallelism, it is not possible to adjust a processing time in the parallelization technology of a program, and that any static critical section or release section to be inserted is not able to follow up any non-deterministic operation during execution in a program conversion technology for satisfying time restriction. <P>SOLUTION: A resource request given as a CPU utilization rate and its request block are given from the outside of a program to a program source, and while the CPU utilization rate is measured, a resource control routine for increasing/decreasing execution priority or for releasing resources is inserted with appropriate intervals, and the resource measurement routine for measuring an interrupted time of the object block is separately inserted before and after the main loop of the other task. Thus, it is guaranteed to complete processing while holding a prescribed resource request. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a program executed by a preemptive multitasking OS, and relates to a program conversion apparatus, method, and recording medium for converting a program so as to ensure CPU resources (utilization rate) for a specified section of the program. Is.

  Since real-time processing with time constraints is often hard-coded with careful fine tuning after trial and error, many of them are craftsmanship that ultimately cannot read performance requirements and implementation intentions. It becomes a program. A craftsmanship program with poor readability causes programmers to spend a great deal of labor in maintenance work such as bug handling and performance tuning, and lowers the productivity and quality of software. OSs that support preemptive multitasking functions such as Linux are more serious and must meet the real-time nature of each task while optimizing task scheduling. In the first place, it has been pointed out that the structure itself does not satisfy time constraints in the OS for time sharing.

  Even in an embedded system in which real-time performance is particularly important, it is becoming increasingly difficult to guarantee time constraints in recent years. Conventionally, in a system to which an embedded real-time OS is applied, tasks in the system are often fixed in advance. For this reason, skilled workers carefully set priority relationships that satisfy the time constraints of each task, and used priority-based scheduling to avoid constraint violations. In priority-based scheduling, an upper priority task that can be executed is an algorithm that can immediately interrupt the execution of the lower priority task.

  However, recently, although it is an embedded system, it is becoming an open system due to digitalization and networking, and its functionality is increasing at an accelerated speed. On such a system, it is very difficult to grasp in advance the type and behavior of an application that operates.

  Therefore, in recent years, a resource reservation type system has been proposed. In the resource reservation type system, by assigning the execution time of the explicitly set processor to the task with certainty, it is possible to secure the necessary processing amount and satisfy the task having time constraints.

  In the Resource Kernel reported in Non-Patent Document 1, a reservation is made by specifying the period and the calculation time to be allocated in that period, and the processing is completed by the deadline by assigning a processor according to the reservation. To ensure that. Patent Document 1 describes a method of recording a priority combination of a process group that satisfies a time constraint and reproducing a task schedule in that order.

  However, with these methods, it is difficult to allocate resources in detail because CPU resources are reserved for Linux processes. In coarse-grained control in process units, it is necessary to subdivide the processing into processes in order to reserve CPU resources in a partial section.

  Patent Document 2 describes a method of parallelizing a processing program that is automatically specified so as to satisfy a time constraint. However, as a matter of course, the application target is limited to a program whose performance is expected to be improved by parallelization.

  Therefore, the execution time cannot be largely controlled in a program that does not have sufficient parallelism or has little effect. Furthermore, in the case of a system that requires modification of the kernel such as Resource Kernel, portability is impaired because the platform dependency of the system becomes strong.

  Non-Patent Document 2 proposes QoSWeaver that avoids violation of the time constraint of a specific thread by a program converter without preparing a special platform. QoSWeaver inserts a statically appropriate preemption code for a thread program that occupies CPU resources excessively when overloading, especially in J2EE application servers. However, such an approach that suppresses the influence on a specific thread indirectly may cause a lot of CPU processing time to be satisfied in order to satisfy the time constraint of a certain section. not good.

JP-A-6-202884 JP 2006-126977 S. Oikawa and R. Rajkumar, “Portable RK: A Portable Resource Kernel for Guaranteed and Enforced Timing Behavior”, IEEE Real-Time Technology and Applications Symposium, 1996 K. Kourai, H. Hibino and S. Chiba, “Aspect-oriented Application-level Scheduling for J2EE Servers”, 6th International Conference on Aspect-Oriented Software Development, 2007

  The resource reservation technology described above is not limited by the granularity of processes and threads, and it has been difficult to guarantee computing resources in an arbitrary processing unit. On the other hand, the program parallelization technique cannot divide processes without parallelism, and therefore cannot adjust the processing time.

  In addition, in the program conversion technique for satisfying the time constraint, the inserted static critical section or release section may not follow the non-deterministic operation at the time of execution.

  An object of the present invention is to solve the above-described problems and to provide a program conversion apparatus that can guarantee a resource requirement of a program in a preemptive multitasking OS and that automatically generates such a program.

  In order to achieve the above object, the present invention provides a resource control routine for increasing and decreasing the execution priority and releasing resources while measuring the resource utilization rate in the target section of the resource request with respect to the program source. In addition, by inserting a resource measurement routine for measuring the interruption time of the target section before and after the main loop of another task, it is ensured that the processing is completed while maintaining a predetermined resource request. The interruption time refers to the time during which the task executing the target section is interrupted by the higher priority task. In the request section, the generated resource reservation program compares the execution time of the higher priority task with the execution time of its own task, and raises or lowers the execution priority so as to protect the specified resource utilization rate. When the resource utilization rate falls below the target, the priority of the invoking task is increased, and when it exceeds the resource utilization rate, the excess resources are released. When the execution of the target section is completed, the task is lowered based on the priority of the invoking task.

  The program conversion apparatus according to the present invention, in a preemptive multitasking OS that processes a plurality of tasks at the same time, completes the processing while satisfying the resource request with respect to a process having a predetermined resource request indicated by the CPU utilization rate. A resource conversion and request section code acquisition unit for acquiring a resource request code indicating a resource request described outside the program source and a request section code indicating the request section, and a resource request A resource reservation program generation unit that generates a resource reservation program in which a resource control routine is inserted so as to satisfy the condition, and a resource measurement that generates a resource measurement program in which a resource measurement code for measuring the resource usage of each task is inserted And a program generation unit.

  According to the present invention, when processing an arbitrary designated section of a program in a preemptive multitasking OS, appropriate resources are appropriately released while executing an appropriate processing group with high priority according to the CPU usage rate at the time of execution. By performing the above, it is possible to guarantee the resource requirement and to automatically generate such a program, so that the quality of the program can be improved and the productivity of the program can be improved.

  Hereinafter, the present invention will be described along specific embodiments shown in the drawings, but the present invention is not limited to the embodiments described below.

  FIG. 1 is a diagram showing an embodiment of a program development system incorporating the program conversion apparatus of the present invention. FIG. 1 shows a system 10 including a remote controller 20, a digital broadcast antenna 30, a display device 40, a program conversion device 50 of the present invention, and a digital broadcast receiver 60.

  The digital broadcast receiver 60 includes a storage device 61 in which a conversion program is stored, a processor 62, a signal receiver 63 that receives a signal from the remote controller 20, and video data, audio data, and subtitles via the digital broadcast antenna 30. A digital broadcast tuner 64 for receiving data and digital broadcast receiver software 65 are installed, and an OS and applications for managing various resources and making them available to applications are stored.

  The digital broadcast receiver software 65 includes a remote controller task 651, a tuner task 652, a drawing task 653, an electronic program guide task 654, and a data broadcast browser task 655.

  In the embodiment shown in FIG. 1, the digital broadcast receiver software 65 is converted into a resource reservation program by the program conversion device 50 and stored in the storage device 61. The resource reservation program stored in the storage device 61 is read into the OS of the digital broadcast receiver 65 by the processor 62 and executed. The processor 62 performs a reception process by the remote controller task 651 and an appropriate response process for a user operation using the remote controller 20.

  For example, the broadcasting station is switched by the tuner task 652 accompanying the channel selection, the electronic program guide is obtained and combined by the electronic program guide task 654 accompanying the electronic program guide viewing, and the data broadcasting content is obtained by the data broadcasting browsing task 655 accompanying the data broadcasting viewing. Then, the drawing task 653 combines the changed video and outputs it to the display device 40.

  Reception processing by the remote controller task 651 must be performed reliably and must always be operated by the processor 62. However, at the same time, in the acquisition and combination of the electronic program guide by the electronic program guide task 654 and the acquisition and combination of the data broadcast content by the data broadcast browse task 655, in the case of processing linked to the user operation, within a certain time. There is a request to complete the process. However, since these response processes perform processes that are not important, such as notification of a state change during normal times, the response processes have been conventionally performed with low priority.

  Since the operation of the digital broadcast receiver software 65 is based on a priority-based scheduling algorithm, a task with a higher priority gives priority to a task with a lower priority, and in some cases is interrupted for processing. Therefore, for example, even when it is desired to view an electronic program guide and data broadcasting content, the processor 62 gives priority to the processing time to the remote controller task 651, the tuner task 652, and the drawing task 653 that operate at high priority. Yes.

  As a result, it has been difficult to secure sufficient processing time for the electronic program guide task 654 and the data broadcast browser task 655 that temporarily have time constraints. This is because in priority-based scheduling, low-priority tasks do not interrupt high-task processing, so the remote controller task 651, tuner task 652, and drawing task 653 that operate at high priority are completed and waiting for execution. This is because the electronic program guide task 654 and the data broadcast browser task 655 wait for processing until the state transitions.

  Next, an outline of program conversion according to the present invention will be described. The program conversion apparatus of the present invention is a system for converting a program so that a calculation resource sufficient to guarantee a CPU utilization rate is given to a specific processing section, in other words, a resource reservation system at the time of program conversion. . Here, the processing time by the CPU is a computing resource. In the section where there is no resource request, the converted program is given a calculation resource based on the statically set execution priority by the OS scheduler. However, in the section where there is a resource request, it satisfies the constraints regardless of the OS scheduler. Sufficient computing resources are provided.

  Specifically, the program conversion apparatus inserts a resource control routine in an appropriate processing unit in a section where a resource request is made. The resource control routine increases the execution priority when the resource utilization rate falls below the resource request, releases the excess resources when the resource utilization rate exceeds the resource request, and executes control to restore the execution priority when the requested section is completed. .

  The insertion interval of the resource control routine may be set at an arbitrary granularity such as a function call unit, a statement unit, a block unit, or a line unit. A statement represents a sentence of a program and is separated by a semicolon in many high-level languages such as C language and Java (registered trademark) language. On the other hand, the program conversion apparatus inserts a resource measurement routine before and after the main routine of the periodic execution of each task, and obtains the time during which another task interrupts during the requested section processing, that is, the suspension time of its own task.

  In general, in an OS that performs task scheduling based on priority, a task with a high execution priority can be processed by interrupting and interrupting the processing of a low task. Therefore, among the task processing times measured by the resource measurement routine, the sum of the processing times of the higher priority tasks than the task processing the request interval is the processing interruption time in the request interval.

  Thus, the resource control routine calculates the resource utilization rate by obtaining the actual processing time of the invoking task from the difference between the elapsed time and the processing interruption time. However, the resource measurement routine is inserted only in a periodically processed task, and does not consider the interruption time due to external interrupt handling processing.

  More specifically, referring to FIG. 1, when a user transmits a remote controller signal for viewing data broadcasting, in response to the signal, the OS executed in the processor 62 dispatches a remote controller task 651. To do. Next, the data broadcast browser task 655 is dispatched, and data broadcast content acquisition and decryption processing are executed.

  As shown in FIG. 2, the program conversion system of the present invention inserts a resource control routine 55 at an appropriate interval into the requested section from the program source 51, the resource request code and the requested section code 52, and the main routine of each task. The resource reservation program source 53 and the resource measurement program source 54 into which the resource measurement routine 56 is inserted are output. In this way, the data broadcast browser task 655 converted into the resource reservation program by the program conversion system of the present invention increases or decreases the execution priority and releases the resource using the set resource request as an index.

  In FIG. 3, the behavior of the resource reservation program is schematically shown as a change in execution priority and CPU utilization rate in the resource request section in the program step. In the resource request 60% request section, the execution priority of the task executing the program is raised to the maximum value. When the CPU usage rate exceeds the required value of 60%, the excess resources are released while the execution priority is kept at the maximum value. Here, the CPU usage rate and the release time for excess usage are calculated based on the accumulated processing time in the requested section. When the processing of the request section is completed, the execution priority of the task executing the program is lowered to the initial priority.

  FIG. 4 shows an example of the resource reservation program source 53 and the resource measurement program source 54. With the program conversion apparatus of the present invention, the resource measurement routine is inserted into a task having a higher priority than the task that processes the resource request section in the task group specified by the programmer. Specifically, when the priority of the task that processes the resource request section is 50 and the task group is a task group having a priority of 20, 30, 40, the task processing time of the priority 20, 30, 40, That is, a code for measuring the time taken for the task code processing of the main loop is inserted.

  The resource control routine is inserted at an appropriate interval with respect to the source code in the resource request section. Specifically, codes for increasing the priority at the request section entrance, decreasing the priority at the request section exit, and measuring the processing time and releasing resources in the request section are inserted. However, it is determined whether each code is executed as a result of comparing the CPU usage rate and the resource request in the task group. The resource release time is also obtained based on the calculated CPU usage rate.

FIG. 5 is a block diagram showing the function of the program conversion apparatus of the present invention. The program conversion apparatus 50 according to the present invention, in a preemptive multitasking OS that processes a plurality of processes simultaneously, completes processing while maintaining the resource request for a process having a resource request using a predetermined CPU utilization rate. A resource request and request section code acquisition unit 501 for acquiring a resource request code indicating a resource request described outside the program source and a request section code indicating the request section, and a resource request. A resource reservation program generation unit 502 that generates a resource reservation program in which a resource control routine is inserted so as to satisfy, and a resource generation program that generates a resource measurement program in which a resource measurement routine for measuring the resource usage of each task is inserted And a program generation unit 503.
6 and 7 are block diagrams showing details of the resource reservation program generation unit 502 and the resource measurement program generation unit 503, respectively.

  The resource reservation program generation unit 502 reads and analyzes the program source 51, and inserts a request section specifying unit 5021 for specifying the section indicated by the resource request code and the request section code 52, and a resource control routine in the request section. Resource control routine position resolution unit 5022 that determines the position and granularity, and resource control routine insertion conversion unit 5023 that inserts a resource control routine that measures the resource usage rate at the determined position and switches the priority to one of increase and decrease With.

  In addition, the resource measurement program generation unit 503 reads and analyzes the program source 51, and determines a measurement interval specifying unit 5031 for specifying a resource measurement interval, and a resource measurement for determining a position where a resource measurement routine is inserted into the measurement interval. A routine position resolution unit 5032 and a resource measurement routine insertion conversion unit 5033 for inserting a resource measurement routine for measuring resource usage, that is, processing time, at the determined position.

  FIG. 8 illustrates a description example of the resource request code 521 out of the resource request and the request section code 52 given as input, and FIG. 9 illustrates a description example of the request section code 522. The resource request code 521 is described in, for example, Object Constraint Language (OCL), and the request section code 522 is described in the AspectJ language. However, in the present invention, the language and grammar of the resource request and request section code 52, the input program source 51, the output resource reservation program source 53, and the resource measurement program source 54 are not specified.

  In the resource request code 521, the CPU usage rate, the execution priority range (task group for calculating the CPU usage rate), the resource control routine insertion interval, the resource measurement routine insertion location, and the like are described as the resource request. it can. In the description example of FIG. 8, a resource request (521b) that is 60% or more with respect to a parameter utilization representing the CPU utilization rate is set to an execution priority using a resource request code template (521a) named BML-policy. A specification (521c) that the upper limit is 20 and the lower limit is 50 for the parameter priorityRange that represents the range of, and call that represents insertion in function call units for the parameter sampling-interval that represents the insertion interval of the resource control routine The designation (521d) is described.

  As the insertion interval of the resource control routine, various units such as a program line, a basic block of a program, and an elapsed time can be designated as well as a function call unit. In addition, for the parameter sampling indicating the insertion location of the resource measurement routine, a function group specification (521e) whose name is evnt, gui, tune, and whose return value is an int type is described. The resource measurement routine can be inserted not only at a function but also at any point in the program.

  On the other hand, the request section code 522 can describe a pointcut expression for designating a section in the program. A pointcut expression is an expression format for specifying a position in a program, which is supported by many aspect-oriented languages.

  In the description example of FIG. 9, a request section code template (522a) named QoSContract is declared, clearly indicates that it is a request section for a resource request code named BML-policy (522b), and the name is expressed as a pointcut expression. In a function call with no return value in update, a section other than the function call whose name is send_command is specified (522c). That is, the entire call flow of the function update () is specified as the request section, except for the function send_comand (). In the pointcut expression 522c, not only a function call but also an arbitrary position in the program such as a program line number and variable access can be designated.

  The resource request and request section code acquisition unit 501 performs lexical analysis of the resource request and request section code 52 according to the processing flow shown in FIG. 10 to acquire the resource request and request section, and the resource request and request section code 501 in the structure shown in FIG. Holds information about the requested section.

  In FIG. 10, first, it is checked whether there is a valid request section code (5010), and if there is, the request section code is acquired and stored (5011). Next, it is checked whether there is a valid resource request code corresponding to the stored request section (5012), and if there is, the resource request code is acquired and stored (5013).

  The resource request code has a structure as shown in FIG. 11, and includes a defined resource request identifier (name) 5210, a CPU utilization rate 5211, an execution priority range 5212, a resource control interval 5213, and a resource measurement position 5214. Retained.

  The request section code has a structure as shown in FIG. 12, and holds a defined request section identifier (name) 5220, a corresponding resource request identifier (name) 5221, and a pointcut expression 5222 representing the request section. The resource request and request section acquisition process shown in FIG. 10 is repeated until all valid codes are recorded.

  In the resource reservation program generating unit 502, the requested section specifying unit 5021 acquires the requested section code 522 according to the processing flow shown in FIG. 13, and holds the position of the requested section in the program with the structure shown in FIG. .

  In FIG. 13, first, the requested section identification unit 5021 reads a program (50210) and reads a requested section code (50211). If there is a valid requested section in the program (50212), the position indicated by the point cut expression of the requested section code is searched (50213). If there is a start point of the position indicated by the point cut expression of the requested section code (50214) and there is also an end point (50215), the program position is stored (50216).

  The program position has a structure as shown in FIG. 14 and holds the corresponding request section name 510, the file name 512 and line number 513 of the start point 511, and the file name 515 and line number 516 of the end point 514. The request section specifying unit process shown in FIG. 13 is repeated until all the positions indicated by the point cut expression of the request section code are stored, and further repeated for all valid request section codes.

  In the resource reservation program generation unit 502, the resource control routine insertion conversion unit 5023 reads the program source 51 according to the processing flow shown in FIG. 17, and performs the resource control routine insertion position determined by the resource control routine position resolution unit 5022. Program conversion to insert a resource control routine.

  In FIG. 17, first, the resource control routine insertion conversion unit 5023 reads the program source 51 (50230), performs lexical analysis, and syntax analysis, and stores all statements in the request section specified by the request section specification unit 5021. (50231). Then, it is checked whether or not all statements in the requested section are resource control positions determined by the resource control routine position resolution unit 5022 (50232). If it is the resource control position (50233), a resource control routine is inserted immediately before the statement (50234), and is written to the file as a resource reservation program source (50235). If it is not a resource control location, the statement is written as it is to the resource reservation program source file.

  In the resource reservation program generation unit 502, the resource control routine position resolution unit 5022 reads the program source 51 according to the processing flow shown in FIG. 15, and performs resource control within the range from the start point to the end point stored in the request section specifying unit 5021. The position where the routine is inserted is determined, and the program position is held in a structure as shown in FIG.

  In FIG. 15, first, the resource control routine position resolution unit 5022 reads the program (50220), and reads the start point and end point of the stored requested section (50221). If the start point and end point positions are valid in the program (50222), the stored resource control interval is read (50223). Then, the program position is stored for each resource control interval in the control flow from the start point to the end point, which is the requested section of the program (50224).

  The resource control interval is in units of function calls or program lines. The program position has a structure as shown in FIG. 16, and a corresponding file name 517 and line number 518 are held. The resource control routine position resolution processing shown in FIG. 15 is repeated until all program positions specified by the designated resource control interval are stored in the program in the requested section.

  FIG. 18 shows an example of the processing flow of the resource control routine 55 inserted by the resource control routine insertion conversion unit 5023 in step 50234. The resource control routine 55 first checks whether the task being executed has already been raised to the upper limit, that is, in the boost state (551). When the priority boost is not in progress, the elapsed time from the start point of the request section is acquired (552), and the total interruption time in the request section, that is, the total processing time of the higher priority task is acquired (553).

  Next, the resource utilization rate in the requested section is calculated from the obtained elapsed time and total interruption time (554). Then, the resource control routine compares the resource request with the resource utilization rate (555), and if the resource request is not satisfied, boosts the priority (556). The priority boost in step 556 uses a priority change function provided by many OSs. For example, in Linux, the relative and absolute values of execution priority can be set by nice () and setpriority () system calls, and in ITRON-based OS, it can be set by chg_pri () service call.

  On the other hand, if the resource amount exceeding the resource request is used, the excess time is calculated from the excess resource usage amount (557), and the resource is released by the excess time (558). As for the resource release in step 558, a CPU resource release function provided by many OSs is used. For example, CPU resources can be released for a specified time by the sleep () system call on Linux and the tsk_slp () service call on ITRON-based OS.

  FIG. 19 shows an example of the resource reservation program source into which the resource control routine is inserted by the resource control routine insertion conversion unit 5023. In FIG. 19, in the program source 5101, the requested section of 5102 is determined as the 2nd to 9th lines, and the CPU usage rate, the priority range, and the resource measurement position are given as the resource request, and the resource control interval is in line units. It shall be said that.

  By the program conversion apparatus 50 of the present invention, a resource-control () function 5302 is inserted into the resource reservation program source 5301 as a resource control routine on the second to ninth lines of the program source 5101 in line units. The resource-control () function increases the execution priority and releases resources so as to satisfy the resource request for the processes in the second to ninth lines according to the processing flow shown in FIG.

  Further, in the program source 5101 and the resource reservation program source 5301 in FIG. 19, the request section 5102 and the insertion point of the resource control routine are shown as the static position of the program. It is also possible to set a required section for a simple control flow and insert a resource control routine.

  In the resource measurement program generating unit 503, the measurement task specifying unit 5031 specifies the measurement target task from the resource request code 521 in accordance with the processing flow shown in FIG. 20, and holds the priority list.

  In FIG. 20, first, the measurement task specifying unit 5031 reads a program (50310) and reads a resource request code (50311). If there is a valid resource request code (50312), the priority range of the resource request code is acquired (50313), and it is determined whether there is a task having a priority within that range (50314). The measurement task specifying unit process shown in FIG. 20 is repeated for all priorities within the priority range, and further repeated for all valid resource request codes.

  In the resource measurement program generation unit 503, the resource measurement routine position resolution unit 5032 reads the program source 51 according to the processing flow shown in FIG. 21 and stores the main loop of the task having the priority stored in the measurement task identification unit 5031. The positions of the start point and end point are resolved, and the program position is held in the same structure as in FIG.

  In FIG. 21, first, the resource measurement routine position resolution unit 5032 reads a program (50320), and reads the priority of the stored measurement task (50321). If the read priority is valid (50322), the main loop of the measurement task for which the priority is set is searched from the program (50323). Then, the start and end positions of the main loop are stored (50324).

  The resource measurement routine position resolution process shown in FIG. 21 is repeated until the main loop start point and end point of all stored measurement tasks are stored. Since the task main loop may be declared in the external setting file, the resource measurement routine position resolution processing may obtain information from the external setting file before searching the main loop of the measurement task. .

  In the resource measurement program generation unit 503, the resource measurement routine insertion conversion unit 5033 reads the program source 51 according to the processing flow shown in FIG. 22 and performs the insertion of the resource measurement routine determined by the resource measurement routine position resolution unit 5032. Program conversion to insert the resource measurement routine.

  In FIG. 22, first, the resource measurement routine insertion conversion unit 5033 reads the program source 51 (50330), identifies and stores the main loop of all tasks (50331). Next, it is checked whether the stored main loop is a measurement object determined by the resource measurement routine position resolution unit (50332). If it is a main loop to be measured (50333), a resource control routine is inserted immediately after the start point and immediately after the end point (50334), and written into a file as a resource measurement program source (50335).

  FIG. 23 shows an example of the processing flow of the resource measurement routine 56 inserted by the resource measurement routine insertion conversion unit 5033 in step 50334. The resource measurement routine 56 first checks whether the task that processes the resource request section is in the priority boost state (561). If it is in the priority boost state and the processing time measurement has not yet started in the lower priority or the invoking task, the measurement is started (565). If the measurement is in progress, the measurement is ended (566) and the processing time is accumulated. Add to the processing time (567). If it is not the priority boost state, the accumulated processing time is reset to 0 (562).

  Here, since the upper priority task interrupts the processing of the lower priority task, the processing time measured by the lower priority task includes the interruption time. Therefore, if the processing time is already being measured in the lower priority task, the measurement is not performed in the resource measurement routine of the upper priority task. The measurement start and end in steps 565 and 566 use a time acquisition function provided by many OSs. For example, in Linux, the absolute time can be acquired by the gettimeofday () system call, and in the ITRON system OS, it can be acquired by the get_tim () service call. Therefore, the processing time is obtained by the difference between the time at the end of measurement and the time at the start.

  FIG. 24 shows an example of the resource measurement program source into which the resource measurement routine is inserted by the resource measurement routine insertion conversion unit 5033. In FIG. 24, it is assumed that in the program source 5103, the main loop of 5104 is determined as the 2nd to 9th lines, and a priority range is given as a resource request. By the program conversion apparatus 50 of the present invention, a resource-measure () function 5402 is inserted in the resource measurement program source 5401 as a resource measurement routine immediately after the start point and immediately before the end point of the main loop of the program source 5103.

  The resource-measure function measures the processing time of the main loop and stores the accumulated processing time according to the processing flow shown in FIG. Also, the program source converted to the resource measurement program source 5401 has higher priority than the task that processes the target section of the resource request among the tasks whose priorities are set within the priority range given as the resource request. Each time the main loop of the task is described.

  Up to this point, the present invention has been described based on the embodiments shown in the drawings. However, the present invention is not limited to the embodiments shown in the drawings, and programs that have described the functions of the respective units have been described above. This can be achieved by executing. In this case, the program can be provided as a recording medium.

  By using the program conversion device of the present invention, it is possible to give a resource request using the CPU utilization rate to an arbitrary section of the program and automatically convert it into a resource request program that satisfies it, so that video and audio processing and It can be applied to development environments for real-time systems such as automatic control systems and medical systems.

It is the figure which showed the Example of the system with which the program conversion apparatus was integrated. It is the figure which showed conversion from a program source to a resource reservation program source. It is a figure which shows the change of the execution priority of a resource reservation program, and CPU utilization. It is a figure which shows one example of a resource reservation program and a resource measurement program. It is the figure which showed one embodiment of the program conversion apparatus. It is the figure which showed one processing flow of the resource reservation program production | generation part. It is the figure which showed one processing flow of the resource measurement program production | generation part. It is the figure which showed one example of description of a resource request code. It is the figure which showed one example of description of a request area code. FIG. 10 is a diagram illustrating a processing flow of a resource request and request section code acquisition unit 501. FIG. 5 is a diagram illustrating an example of a structure of a resource request code held by a resource request and request section code acquisition unit 501. FIG. 5 is a diagram illustrating an example of a structure of a request section code held by a resource request and request section code acquisition unit 501. FIG. 10 is a diagram showing one processing flow of a request section specifying unit 5021. FIG. 10 is a diagram showing one structure example of a program position of a requested section held by a requested section specifying unit 5021. FIG. 10 is a diagram showing one processing flow of a resource control routine position resolution unit 5022; It is the figure which showed one structural example of the program position which inserts the resource control routine hold | maintained in the resource control routine position resolution part 5022. FIG. 10 is a diagram showing one processing flow of a resource control routine insertion conversion unit 5023. It is the figure which showed one example of operation | movement of the resource control routine inserted in a resource reservation program source. It is one example which showed typically the resource reservation program source which the program conversion apparatus of this invention converts. FIG. 10 is a diagram showing one processing flow of a measurement task specifying unit 5031. FIG. 10 is a diagram showing one processing flow of a resource measurement routine position resolution unit 5032. FIG. 10 is a diagram showing one processing flow of a resource control routine insertion conversion unit 5033. It is the figure which showed one example of operation | movement of the resource measurement routine inserted in a resource measurement program source. It is one example which showed typically the resource measurement program source which the program conversion apparatus of this invention converts.

Explanation of symbols

10 system, 20 remote controller, 30 digital broadcasting antenna, 40 display device, 50 program conversion device,
51, 510, 5101, 5103 Program source, 52 Resource request code and request section code, 53, 301 Resource reservation program source, 54, 5401 Resource measurement program source, 55, 5302 Resource control routine, 56, 5402 Resource measurement routine,
501 Resource request and request section code acquisition section 502 Resource reservation program generation section 503 Resource measurement program generation section 521 Resource request code 522 Request section code
5021 Request section identification unit, 5022 Resource control routine position resolution section, 5023 Resource control routine insertion conversion section, 5031 Measurement task identification section, 5032 Resource measurement routine position resolution section, 5033 Resource measurement routine insertion conversion section, 5102 Request section, 5104 main loop,
60 digital broadcast receiver, 61 storage device, 62 processor, 63 signal receiver, 64 digital broadcast tuner, 65 digital broadcast receiver software, 651 remote controller process,
652 tuner process, 653 drawing process, 654 electronic program guide process, 655 data broadcast browsing process

Claims (9)

A program conversion device that performs code conversion of a program executed by a preemptive multitasking OS (operating system),
A recording unit for recording the program, CPU resource request information for each predetermined processing section of the program, and the converted program;
Based on the information, a resource measurement program generation unit that inserts a resource usage time measurement code at a predetermined position of the program;
A resource reservation program generating unit that inserts a resource control code that controls a scheduler for each predetermined processing section of the program by comparing the measurement result of the resource usage time measurement code with the CPU resource request information; A program conversion apparatus characterized by the above. The program conversion device according to claim 1,
The resource conversion code increases the priority of a task when the resource utilization rate is lower than the target, and releases the excess resource when the resource utilization rate exceeds the target. A program conversion device for converting code of a program executed on a preemptive multitasking OS,
A first storage unit for storing the program;
A second value that sets a lower limit value and an upper limit value of a CPU resource request value, a lower limit value and an upper limit value of an execution priority, and a resource control interval for each section information including a start position and an end position of a processing statement for the program Recording section of
A measurement task specifying unit for determining a task to be measured among the tasks constituting the program recorded in the first storage unit;
A resource measurement routine position resolution unit that determines the positions of the start point and the end point of the main loop of periodic execution for the task determined as the measurement target by the measurement task specifying unit,
A resource measurement routine insertion conversion unit for inserting a resource measurement routine into the program recorded in the first storage unit for the measurement section;
From a program recorded in the first storage unit, a request section specifying unit for specifying a request section recorded in the second recording unit;
Resource control routine position resolution for determining whether or not the resource control position for each statement of the program from the resource control interval of the section recorded in the second recording unit for each request section specified by the request section specifying unit And
A program conversion apparatus comprising: a resource control routine insertion conversion unit that inserts a resource control routine into a program recorded in the first recording unit with respect to a resource control position. In the program conversion apparatus according to claim 3,
The measurement task specifying unit is set to a higher priority than a task for processing a request section recorded in the second recording unit among the tasks constituting the program recorded in the first storage unit. A program conversion apparatus characterized in that only tasks to be measured are measured. In the program conversion apparatus according to claim 3,
The resource measurement routine inserted / converted by the resource measurement routine insertion / conversion unit is processed only when the requested section recorded in the second recording unit is being processed and when the lower priority task is not being measured. A program conversion device for measuring time. In the program conversion apparatus according to claim 3,
The resource control routine inserted by the resource control routine insertion conversion unit increases the priority at the start point of the request section recorded in the second recording unit, decreases the priority at the end point, and releases excess resources in the request section. A program conversion apparatus characterized by the above. A program conversion method for performing code conversion of a program executed on a preemptive multitasking OS,
Obtaining a required CPU usage rate and priority range for each predetermined section of the program;
Inserting a resource measurement code into the main loop of a task that is set to a higher priority than the task that processes the predetermined section from the priority range for each predetermined section acquired in the step;
Resource control code that releases resources for the time corresponding to the excess if the CPU usage rate exceeds the requested CPU usage rate while checking the cumulative suspension time by the high priority task held by the resource measurement code inserted in the step Inserting the program into a predetermined section of the program. A method for controlling a program executed by a preemptive multitasking OS,
Obtaining a CPU usage rate for each predetermined section of the program by means of a resource usage time measurement code inserted at a predetermined position of the program;
The step of increasing the task priority when the resource utilization rate is lower than the target by comparing the acquired CPU utilization rate with the requested CPU utilization rate for each predetermined section set in advance,
The obtained CPU usage rate is compared with a requested CPU usage rate for each predetermined section that is set in advance, and when the resource usage rate exceeds a target, a CPU resource is released. Method. A program executed on a device equipped with a preemptive multitasking OS,
Obtaining a CPU usage rate for each predetermined section of the program by means of a resource usage time measurement code inserted at a predetermined position of the program;
The step of increasing the task priority when the resource utilization rate is lower than the target by comparing the acquired CPU utilization rate with the requested CPU utilization rate for each predetermined section set in advance,
A program for executing a step of releasing the CPU resource when the obtained CPU utilization rate is compared with a requested CPU utilization rate for each predetermined section set in advance and the resource utilization rate exceeds a target.

Images