Efficient maximum response time analysis method for multiprocessor system, electronic equipment and computer readable storage medium
By calculating the upper bound of the release interval of adjacent tasks, the maximum reaction time analysis of causal chains is simplified, the problem of high computational complexity in the existing technology is solved, and efficient and accurate analysis of the maximum reaction time of causal chains in multiprocessor systems is achieved. .
Patent Information
- Application Number
- CN202411128974.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-16
- Publication Date
- 2024-11-15
AI Technical Summary
The maximum reaction time analysis method of causal chain in existing multiprocessor systems is not suitable for offset asynchronous tasks, and the calculation complexity is high, making it difficult to accurately and efficiently analyze the maximum reaction time in multiprocessor systems, especially in automotive systems and In complex systems such as drones.
By calculating the upper bound of the release interval of adjacent tasks in the causal chain and iteratively accumulate, the maximum reaction time analysis problem of the causal chain is simplified, and the calculation complexity is reduced. An analysis method of polynomial time complexity is proposed.
It realizes efficient and relatively accurate analysis of the maximum reaction time of the causal chain of the multiprocessor system within the polynomial time complexity, improves the analysis efficiency and accuracy, and is suitable for complex systems such as automotive systems and drones.
Smart Images

Figure CN118964137A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of end-to-end delay analysis of real-time systems and relates to a maximum response time analysis method for a multi-processor system. Background Art
[0002] In recent years, real-time system applications are often deployed on highly integrated multi-processor platforms to achieve higher computing power and functional integration. Some safety-critical real-time system applications, such as automotive systems and drones, usually model the propagation of data in the system as a causal chain, which must meet strict end-to-end timing constraints to ensure compliance with safety standards. Therefore, it is crucial to provide effective end-to-end timing analysis for causal chains in multi-processor systems.
[0003] At present, for periodic task sets on multiprocessor systems, Kloda et al. proposed a causal chain maximum reaction time analysis method based on data propagation path analysis. This method gives a closed expression and can accurately estimate the causal chain maximum reaction time in the worst case. However, this method is not suitable for offset asynchronous tasks. In actual systems, asynchronous offsets are usually assigned to tasks to reduce system jitter and the worst-case response time (WCRT) of tasks. In addition, this method needs to analyze all data propagation paths within the super cycle of the task set. With the increase of the number of tasks and the growth of the maximum cycle, its computational complexity increases exponentially. Günzel proposed a causal chain maximum reaction time analysis method for offset asynchronous tasks. This method analyzes all job chains within the super cycle of the task set by simulating system scheduling. Its computational complexity is even higher than Kloda's method. The limitations of these two methods are particularly prominent in interactive design environments, because the maximum reaction time analysis algorithm needs to be executed multiple times during the design phase to evaluate and optimize multiple design options. With the rapid growth of the scale and complexity of automotive system software, the problem of high computational complexity has become more and more serious, making it difficult to accurately and efficiently analyze the maximum reaction time of multi-processor systems such as automotive systems and drones. Summary of the invention
[0004] The purpose of the present invention is to solve the end-to-end delay analysis problem of offset asynchronous periodic causal chains in a multi-processor system and to provide an efficient and relatively accurate causal chain maximum reaction time analysis method.
[0005] According to some embodiments of the present application, an efficient maximum response time analysis method for a multi-processor system includes the following steps:
[0006] S100: Calculate the worst-case response time of all tasks in the causal chain of a multiprocessor system;
[0007] S200: Obtaining the initial maximum reaction time of the causal chain according to the worst-case response time of the task;
[0008] S300: Iteratively calculating the upper bound of the release interval of adjacent tasks in the causal chain;
[0009] S400: Iteratively adding the upper bound of the adjacent task release interval to the initial maximum reaction time to obtain the final maximum reaction time of the causal chain.
[0010] According to some embodiments of the present application, an efficient maximum response time analysis method for a multi-processor system, the initial maximum response time of the causal chain is the sum of the cycle of the first task in the causal chain and the worst-case response time of the last task.
[0011] According to some embodiments of the present application, the method for analyzing the efficient maximum reaction time of a multi-processor system, in step S300, calculating the upper bound of the release interval of adjacent tasks in the causal chain of the current iteration includes the following steps:
[0012] S310: Calculating the greatest common divisor of two adjacent task cycles in the causal chain;
[0013] S320: Calculate the minimum value of the release interval between two adjacent tasks according to the greatest common divisor and the difference between the release offsets of two adjacent tasks;
[0014] S330: Calculate an upper bound of a release interval between two adjacent tasks according to a priority relationship between two adjacent tasks, whether they are assigned to the same processor, and a minimum value of a release interval between the two adjacent tasks.
[0015] According to the efficient maximum reaction time analysis method for a multi-processor system in some embodiments of the present application, the initial maximum reaction time of the causal chain is as shown in formula (1):
[0016] MRT=T1+R n (1)
[0017] In the formula, MRT represents the maximum reaction time, T1 represents the cycle of the first task, and R n Represents the worst-case response time of the last task.
[0018] According to the efficient maximum response time analysis method for a multi-processor system in some embodiments of the present application, in step S310, the greatest common divisor of two adjacent task cycles in the causal chain is calculated, as shown in formula (2):
[0019] η i,i+1 =gcd(T i ,T i+1 ) (2)
[0020] Where η i,i+1 represents the greatest common divisor of two adjacent task cycles, gcd(·) represents a function that returns the greatest common divisor of two integers, T i represents the period of the ith task, T i+1 Indicates the period of the i+1th task.
[0021] According to the efficient maximum response time analysis method for a multi-processor system in some embodiments of the present application, in step S320, the minimum value of the release interval between two adjacent tasks is calculated according to the greatest common divisor and the difference between the release offsets of two adjacent tasks, as shown in formula (3):
[0022]
[0023] In the formula, O i represents the release offset of the i-th task, O i+1 represents the release offset of the i+1th task, η i,i+1 Represents the greatest common divisor of two adjacent task cycles, Φ i,i+1 Indicates the minimum value of the release interval between two adjacent tasks, T i represents the period of the ith task, and mod(·) represents the remainder function.
[0024] According to the efficient maximum response time analysis method for a multi-processor system in some embodiments of the present application, in step S330, according to the priority relationship between two adjacent tasks, whether they are assigned to the same processor, and the minimum value of the release interval of the two adjacent tasks, the upper bound of the release interval of two adjacent tasks is calculated, including:
[0025] Case (331): The priority of the i-th task is lower than that of the i+1-th task, the i-th task and the i+1-th task are assigned to the same processor, and when the minimum value Φ of the release interval between the two adjacent tasks is i,i+1 = 0, the upper bound of the release interval between two adjacent tasks is expressed by formula (4):
[0026]
[0027] In the formula, R i represents the worst-case response time of the ith task, T i+1 represents the period of the i+1th task, η i,i+1 represents the greatest common divisor of two adjacent task cycles, and mod(·) represents the remainder function;
[0028] Case (332): The priority of the i-th task is lower than that of the i+1-th task, the i-th task and the i+1-th task are assigned to the same processor, and when the minimum value Φ of the release interval between the two adjacent tasks is i,i+1 When ≠0, the upper bound of the release interval between two adjacent tasks is expressed by formula (5):
[0029]
[0030] Case (333): When the priority of the i-th task is higher than that of the i+1-th task, or the i-th task and the i+1-th task are assigned to different processors, the upper bound of the release interval between two adjacent tasks is expressed by formula (6):
[0031]
[0032] According to the efficient maximum reaction time analysis method for a multi-processor system in some embodiments of the present application, in step 400, the upper bound of the adjacent task release interval is iteratively added to the initial maximum reaction time to obtain the final maximum reaction time of the causal chain, as shown in formula (7):
[0033]
[0034] Where MRT represents the maximum reaction time, Indicates the upper bound of the release interval between two adjacent tasks.
[0035] In a second aspect, an embodiment of the present application further provides an electronic device, comprising: one or more processors, a memory, and one or more programs; wherein the one or more programs are stored in the memory, and the one or more programs include instructions, which, when executed by the electronic device, enable the electronic device to execute the first aspect and any possible technical solution of the first aspect.
[0036] In a third aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium includes a computer program. When the computer program runs on an electronic device, the electronic device executes the first aspect and any possible technical solution of the first aspect.
[0037] Beneficial effects: The present invention proposes a causal chain maximum reaction time analysis method with polynomial time complexity for offset asynchronous periodic task sets on multi-processor systems (such as automotive systems and drone systems). The core idea of the present invention is to simplify the problem of analyzing the maximum reaction time of the causal chain into the problem of analyzing the release interval of adjacent tasks through problem decoupling. By deriving the upper bound of the release interval of adjacent tasks, under the premise of the worst-case response time of the known tasks, this method can efficiently obtain a relatively accurate maximum reaction time within the polynomial time complexity. The present invention can accurately and efficiently analyze and predict the maximum reaction time of the causal chain modeled by data propagation in multi-processor systems such as automotive systems and drone systems, and provide effective end-to-end time analysis for causal chains in multi-processor systems. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 is a task set of an embodiment of the present invention;
[0039] Figure 2 is a task scheduling and data propagation path diagram of an embodiment of the present invention;
[0040] Figure 3 It is a comparison of the analysis accuracy of the present invention and other analysis methods in a multi-core system;
[0041] Figure 4 It is a comparison of the analysis efficiency of the present invention and other analysis methods in a multi-core system;
[0042] Figure 5 It is the overall flow chart of the present invention. DETAILED DESCRIPTION
[0043] In order to better illustrate the purpose and advantages of the present invention, the invention is further described below with reference to the accompanying drawings and examples. It should be pointed out that the implementation of the present invention is not limited to the following embodiments, and any form of modification or change made to the present invention will fall within the scope of protection of the present invention. The present application provides a method, an electronic device, and a computer-readable storage medium. Among them, the method, the device, and the computer-readable storage medium are based on the same technical concept. Since the principles of solving problems by the method, the device, and the computer-readable storage medium are similar, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.
[0044] like Figure 5 As shown, the efficient maximum response time analysis method for a multi-processor system of the present invention comprises the following steps:
[0045] Step 1: Calculate the worst-case response time of all tasks in the causal chain, which can be obtained by using response time analysis or simulation scheduling method. The present invention analyzes the maximum reaction time of the causal chain under the premise that the worst-case response time of the task is known.
[0046] Step 2: Initialize the maximum reaction time of the causal chain as the sum of the period of the first task in the chain and the worst-case response time of the last task, as shown in formula (1).
[0047] MRT=T1+R n (1)
[0048] In the formula, MRT represents the maximum reaction time, T1 represents the cycle of the first task, and R n Represents the worst-case response time of the last task.
[0049] Step 3: Iterate and calculate the upper bound of the release interval of adjacent task instances. When there are n tasks in the causal chain, iterate n-1 times. Below, i represents the current iteration.
[0050] Step 3.1: Calculate the greatest common divisor of two adjacent task cycles, as shown in formula (2).
[0051] η i,i+1 =gcd(T i ,T i+1 ) (2)
[0052] Where η i,i+1 represents the greatest common divisor of two adjacent task cycles, gcd(·) represents a function that returns the greatest common divisor of two or more integers, T i represents the period of the ith task, T i+1 Indicates the period of the i+1th task.
[0053] Step 3.2: According to the difference between the release offsets of two adjacent tasks, the minimum value of the release interval between two adjacent task instances is calculated in different situations, as shown in formula (3).
[0054]
[0055] Among them, O i represents the release offset of the i-th task, O i+1 represents the release offset of the i+1th task, η i,i+1 Represents the greatest common divisor of two adjacent task cycles, Φ i,i+1 Indicates the minimum value of the release interval between two adjacent tasks, T i represents the period of the ith task, and mod(·) represents the remainder function.
[0056] Step 3.3: According to the priority relationship between two adjacent tasks and whether they are assigned to the same processor, calculate the upper bound of the release interval between two adjacent tasks in different situations.
[0057] Case 3.3.1: The priority of the i-th task is lower than that of the i+1-th task, and the i-th task and the i+1-th task are assigned to the same processor. i,i+1 = 0, the upper bound of the release interval between two tasks is calculated by formula (4).
[0058]
[0059] In the formula, R i represents the worst-case response time of the ith task, T i+1 represents the period of the i+1th task, η i,i+1 represents the greatest common divisor of two adjacent task cycles, and mod(·) represents the remainder function;
[0060] Case 3.3.2: The priority of the i-th task is lower than that of the i+1-th task, and the i-th task and the i+1-th task are assigned to the same processor. i,i+1 When ≠0, the upper bound of the release interval between two tasks is calculated by formula (5).
[0061]
[0062] Case 3.3.3: When the priority of the i-th task is higher than that of the i+1-th task or the i-th task and the i+1-th task are assigned to different processors, the upper bound of the release interval between the two tasks is calculated by equation (6).
[0063]
[0064] Step 3.4: Iterate and add the upper bound of the task release interval calculated in the previous step to the maximum reaction time, as shown in formula (7).
[0065]
[0066] Where MRT represents the maximum reaction time, Indicates the upper bound of the release interval between two adjacent tasks.
[0067] The present invention utilizes step 3.3 to decouple the problem of analyzing the maximum reaction time of the causal chain into the problem of analyzing the release interval of adjacent tasks. By deriving the upper bound of the release interval of adjacent tasks, the upper bound of the maximum reaction time of the causal chain is obtained.
[0068] Embodiment: The efficient maximum response time analysis method for a multi-processor system described in this embodiment is specifically implemented in the following steps:
[0069] like Figure 1 As shown, the task set of the embodiment includes two tasks, namely τ1 and τ2, where C i represents the worst case execution time, T iIndicates the period of the task, D i Indicates the relative deadline of the task, O i Indicates the release offset of the task.
[0070] like Figure 2 As shown, this is Figure 1 In the scheduling process of the task set shown, the causal chain is τ1→τ2, and the priority of τ1 is higher than τ2.
[0071] Step 1: Calculate the worst-case response time of all tasks in the causal chain. Since the scheduling algorithm is a fixed-priority preemptive scheduling, and τ1 has a higher priority than τ2, the worst-case response time of τ1 is R1=C1=1, and the worst-case response time of τ2 is R2=sup{2-6,6-4,10-8,...}=2.
[0072] Step 2: Initialize the maximum reaction time of the causal chain as the sum of the period of the first task in the chain and the worst-case response time of the last task, MRT = T1 + R2 = 4 + 2 = 6.
[0073] Step 3: Iterate and calculate the upper bound of the release interval of adjacent task instances. Since the causal chain of the embodiment has only two tasks, it is iterated only once.
[0074] Step 3.1: Calculate the greatest common divisor of two adjacent task cycles, η 1,2 =gcd(T1,T2)=gcd(4,4)=1.
[0075] Step 3.2: According to the difference between the release offsets of two adjacent tasks, calculate the minimum value of the release interval between two adjacent task instances. Since O1 = 0, O2 = 3, O1 < O2,
[0076]
[0077] Step 3.3: According to the priority relationship between two adjacent tasks and whether they are assigned to the same processor, calculate the upper bound of the release interval between two adjacent tasks. Since τ1 has a higher priority than τ2, Φ 1,2 =0, mod(R1,η 1,2 )=mod(1,1)=0, so
[0078]
[0079] Step 3.4: Iterate and add the upper bound of the task release interval calculated in the previous step to the maximum reaction time.
[0080]
[0081] In contrast, the precise maximum reaction time of the above embodiment can be obtained by using Günzel's precise analysis method, which is 8, which is less than the value analyzed by the method proposed in the present invention. Therefore, the present invention can calculate the safe maximum reaction time. Note that Günzel's method has exponential complexity, while the method proposed in the present invention has polynomial complexity.
[0082] Experimental evaluation: In order to evaluate the analysis efficiency and accuracy of the present invention, the existing maximum reaction time analysis method was selected for comparative experiments with the present invention. The method of the present invention is called δ-Bound, and the methods selected for comparison are Günzel's method Günzel-B and Davare's method Davare-B. Since Kloda's method is not suitable for multi-processor systems, the experiment does not include the comparison of Kloda-B.
[0083] The present invention conducts experiments on an 8-processor system. For the experimental load, the present invention generates 1000 offset asynchronous task sets based on AutomotiveBenchmark. The periods of all tasks are randomly selected from the set {1, 2, 5, 10, 20, 50, 100, 200, 1000}, and the normalized utilization of the task set is 0.5. In addition, the present invention ensures that all 1000 task sets used for the experiment are schedulable. For each task set, the present invention generates 50 causal chains, each chain consists of 1 to 3 different periods, and 2 to 5 different tasks are selected for each period. The release offset of each task is sampled from a uniform distribution on [0, HP], where HP is the super period of the task set.
[0084] In order to illustrate the accuracy of the analysis, the present invention uses the delay obtained by Davare-B analysis as a comparison benchmark and uses formula (11) to calculate the delay reduction LR, where L(A) represents the maximum response time obtained by analysis using method A. The larger the delay reduction, the higher the analysis accuracy.
[0085]
[0086] Figure 3 The latency reduction for offset asynchronous task sets on an 8-processor system is illustrated. Figure 3 In the figure, the black line indicates the maximum and minimum range of all delay reductions, the blue box marks the middle half of all value ranges, and the red line indicates the average delay reduction. It can be seen that the analysis results of δ-Bound and Günzel-B are quite close, and the maximum value of the improvement is slightly higher than Günzel-B, which shows that the analysis accuracy of the present invention is close to the most accurate results available.
[0087] In order to illustrate the efficiency of the analysis, the present invention compares the average analysis time under different chain lengths, such as Figure 4Note that, in order to make the results clearer, Figure 4 The vertical axis uses a logarithmic scale with a base of 10. The Davare-B analysis with linear time complexity is the most efficient, while the analysis method of the present invention has polynomial complexity. Figure 4 It can be seen that its analysis efficiency is slightly lower than Davare-B, but much higher than Günzel-B. This proves that the analysis efficiency of the present invention is close to that of the most efficient existing method, but is much better than that of the most accurate existing method.
[0088] In summary, the present invention discloses an efficient maximum reaction time analysis method for a multi-processor system, which can obtain a relatively accurate maximum reaction time within a polynomial time complexity.
[0089] Based on the above embodiments, an embodiment of the present application further provides an electronic device, and when the computer program runs on the electronic device, the electronic device executes the method provided in the above embodiments.
[0090] Based on the above embodiments, the embodiments of the present application further provide a computer storage medium, in which a computer program is stored. When the computer program is executed by a computer, the computer executes the method provided in the above embodiments.
[0091] The storage medium may be any available medium that can be accessed by a computer. For example, but not limited to, a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer.
[0092] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0093] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0094] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0095] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.
[0096] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.
Claims
1. An efficient maximum response time analysis method for a multi-processor system, characterized in that: The following steps are involved: S100: Calculate the worst-case response time of all tasks in the causal chain of a multiprocessor system; S200: Obtaining the initial maximum reaction time of the causal chain according to the worst-case response time of the task; S300: Iteratively calculating the upper bound of the release interval of adjacent tasks in the causal chain; S400: Iteratively adding the upper bound of the adjacent task release interval to the initial maximum reaction time to obtain the final maximum reaction time of the causal chain.
2. The efficient maximum response time analysis method for a multi-processor system according to claim 1, characterized in that: The maximum reaction time at the beginning of the causal chain is the sum of the period of the first task in the causal chain and the worst-case response time of the last task.
3. The efficient maximum response time analysis method for a multi-processor system according to claim 1, characterized in that: The method for calculating the upper bound of the release interval of adjacent tasks in the causal chain of the current iteration in step S300 comprises the following steps: S310: Calculating the greatest common divisor of two adjacent task cycles in the causal chain; S320: Calculate the minimum value of the release interval between two adjacent tasks according to the greatest common divisor and the difference between the release offsets of two adjacent tasks; S330: Calculate an upper bound of a release interval between two adjacent tasks according to a priority relationship between two adjacent tasks, whether they are assigned to the same processor, and a minimum value of a release interval between the two adjacent tasks.
4. The efficient maximum response time analysis method for a multi-processor system according to claim 2, characterized in that: The maximum reaction time at the beginning of the causal chain is as shown in formula (1): MRI=T1+R n (1) In the formula, MRT represents the maximum reaction time, T1 represents the cycle of the first task, and R n Represents the worst-case response time of the last task.
5. The efficient maximum response time analysis method for a multi-processor system according to claim 3, characterized in that: In step S310, the greatest common divisor of two adjacent task cycles in the causal chain is calculated, as shown in formula (2): the i,i+1 =gcd(T i ,T i+1 ) (2) Where η i,i+1 represents the greatest common divisor of two adjacent task cycles, gcd(·) represents a function that returns the greatest common divisor of two integers, T i represents the period of the i-th task, T i+1 Indicates the period of the i+1th task.
6. The efficient maximum response time analysis method for a multi-processor system according to claim 3, characterized in that: In step S320, the minimum value of the release interval between two adjacent tasks is calculated according to the greatest common divisor and the difference between the release offsets of two adjacent tasks, as shown in formula (3): In the formula, O i represents the release offset of the i-th task, O i+1 represents the release offset of the i+1th task, η i,i+1 Represents the greatest common divisor of two adjacent task cycles, Φ i,i+1 Indicates the minimum value of the release interval between two adjacent tasks, T i represents the period of the ith task, and mod(·) represents the remainder function.
7. The efficient maximum response time analysis method for a multi-processor system according to claim 3, characterized in that: In step S330, the upper bound of the release interval between two adjacent tasks is calculated according to the priority relationship between the two adjacent tasks, whether they are assigned to the same processor, and the minimum value of the release interval between the two adjacent tasks, including: Case (331): The priority of the i-th task is lower than that of the i+1-th task, the i-th task and the i+1-th task are assigned to the same processor, and when the minimum value Φ of the release interval between the two adjacent tasks is i,i+1 = 0, the upper bound of the release interval between two adjacent tasks is expressed by formula (4): In the formula, R i represents the worst-case response time of the ith task, T i+1 represents the period of the i+1th task, η i,i+1 represents the greatest common divisor of two adjacent task cycles, and mod(·) represents the remainder function; Case (332): The priority of the i-th task is lower than that of the i+1-th task, the i-th task and the i+1-th task are assigned to the same processor, and when the minimum value Φ of the release interval between the two adjacent tasks is i,i+1 When ≠0, the upper bound of the release interval between two adjacent tasks is expressed by formula (5): Case (333): When the priority of the i-th task is higher than that of the i+1-th task, or the i-th task and the i+1-th task are assigned to different processors, the upper bound of the release interval between two adjacent tasks is expressed by formula (6):
8. The efficient maximum response time analysis method for a multi-processor system according to claim 1, characterized in that: In step 400, the upper bound of the adjacent task release interval is iteratively added to the initial maximum reaction time to obtain the final maximum reaction time of the causal chain, as shown in formula (7): Where MRT represents the maximum reaction time, Indicates the upper bound of the release interval between two adjacent tasks.
9. An electronic device, comprising: One or more processors, a memory, and one or more programs; wherein the one or more programs are stored in the memory, and the one or more programs include instructions, which, when executed by the electronic device, enable the electronic device to perform any one of the methods described in claims 1-8.
10. A computer-readable storage medium, comprising a computer program, and when the computer program is executed on an electronic device, the electronic device is enabled to execute the method according to any one of claims 1 to 8.
