Method for statically assigning and allocating information to storage area, information technology system and vehicle
By executing one-time analysis and data allocation strategies in the information technology system, the output data is allocated to a fixed storage area, which solves the complexity and low efficiency of microcontroller memory management, and realizes more efficient memory utilization and task execution time shorten.
Patent Information
- Application Number
- CN202380031883.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2022-10-05
- Filing Date
- 2023-09-18
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2043-09-18
AI Technical Summary
In information technology systems, especially microcontrollers, memory management is complex and inefficient, resulting in rapid storage space consumption and increasing program running time.
By performing a one-time analysis process in an information technology system, checking the output data processed by the processor during iteration and accurately allocating it to a fixed storage area, allowing different output data to share the same storage area in a static memory assignment, using Auxiliary memory performs data replacement and management.
It reduces the storage demand of memory, reduces the use of storage space, improves the memory utilization efficiency of information technology systems, and shortens the task execution time.
Smart Images

Figure CN118974710A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a method of the type defined in more detail in the introduction to claim 1 for statically assigning and allocating information to a storage area of an external memory of a processor of an information technology system, an information technology system for carrying out the method and a vehicle having such an information technology system. Background Art
[0002] Information technology systems, such as PCs or microcontrollers, for example in the form of embedded systems, include various electrical and electronic components. Of particular importance in this context are processors for executing code and storage elements for storing the corresponding code and for storing information obtained by the processor during the processing of the code. The availability of usable memory in information technology systems is usually limited. Although mass storage devices, such as hard disks or solid-state drives, have relatively large storage spaces and are therefore relatively inexpensive, the access times to them by the processor are relatively slow. In general, the faster the processor can access the storage element, the smaller the available storage space and the more expensive the storage element.
[0003] In order to reduce the running time of a program, it is desirable to allocate as high a proportion of data processing as possible to memory elements that have a relatively short access time for the processor.
[0004] The part of the operating system that manages the memory hierarchy is called memory management. In the context of a PC, for example, memory management aims to provide efficient and comfortable access to the physical memory. During the operation of the operating system, information about the operating system itself and the programs running on it is written to the memory so that the computer's processor can access it. In this case, a situation may arise where there is not enough memory to accommodate all the information. This is also known as the "overflow effect". A remedy is provided by the so-called dynamic memory management, in which data that is not currently required is written from the memory to the corresponding mass storage medium, such as a hard disk or solid-state drive. If this information is to be processed further, it is reloaded into the memory and the other information is deleted from the memory.
[0005] Dynamic memory management can be achieved using bitmaps and linked lists.
[0006] For example, a method for dynamic memory allocation based on the use of linked lists is known from US 005784698 A. In this case, the memory of a computer system is divided into a series of so-called buffer pools, each of which includes a plurality of buffers. The buffers in each buffer pool have the same size and are different in different buffer pools. If information is now to be written to the memory, the individual buffers are gradually filled, wherein, in this case, the largest free buffer is filled with information until an excess of information occurs. It is then checked which buffer is still large enough to accommodate this excess memory. This allows providing as small a buffer as possible to accommodate the excess, thereby preventing too much unused memory from being left in the buffer. This ensures efficient memory utilization. However, this is a dynamic process and is therefore complex.
[0007] Furthermore, DE 10 2019 217 844 A1 discloses a method for configuring memory cells of a computing unit. This is a method for dynamic memory management, which allows the memory cells to be reconfigured during normal operation of the computing unit. To this end, the division of the memory cells into individual storage areas is dynamically changed during operation.
[0008] Microcontrollers place special demands on memory management, since the computing resources available on microcontrollers are particularly scarce. Dynamic memory management on microcontrollers is therefore often too complex, which is why static memory allocation is performed. To this end, the memory of the microcontroller is divided into individual segments with fixed allocations, and during the processing of a program or program segment (also called a function), the information obtained during operation is written to the corresponding memory segment. In this case, the corresponding information is gradually distributed over the various memory segments, as a result of which the available storage space of the memory is quickly consumed. If the storage space is no longer sufficient, the information must be moved out to another memory. Due to the delays associated with memory access, this increases the runtime of the corresponding program. Summary of the invention
[0009] The object of the present invention is to provide an improved method for statically assigning and allocating information to a storage area of a processor external memory of an information technology system, which method allows the information technology system to operate more efficiently.
[0010] According to the invention, this object is achieved by a method for statically assigning and allocating information to a storage area of an external memory of a processor of an information technology system having the features of claim 1. Advantageous embodiments and developments as well as a corresponding information technology system and a vehicle having such an information technology system are derived from the associated claims.
[0011] A method for statically assigning and allocating information to storage areas of an external memory of a processor of an information technology system of the type mentioned initially, wherein the information technology system processes a plurality of cascaded functions by the processor during an execution iteration in order to solve a task, wherein the respective function after its processing provides output data as information which can be read by a function downstream in the direction of the information flow, and wherein the respective output data are respectively written to a separate storage area of a memory accessed by the respective function in order to be made available for reading, is further developed according to the invention in that the information technology system performs the following operations in a one-time analysis process:
[0012] - Check which output data of the function are processed simultaneously by the processors during the execution iteration;
[0013] - assigning output data to fixed storage areas, wherein each output data is assigned to exactly one fixed storage area, and wherein at least a first output data and a second output data processed by the processor at different points in time during an execution iteration are assigned to the same fixed storage area; and
[0014] During the execution of an iteration, the IT system:
[0015] - writing the first output data to the fixed storage area allocated thereto and leaving it in the fixed storage area at least until the processor has processed the first function requiring the first output data; and
[0016] - before a function requiring the second output data is processed by the processor, writing the second output data to the same fixed storage area to replace the first output data.
[0017] The method according to the invention allows different output data to be assigned to the same memory area despite the static memory assignment. This reduces the storage requirements of the memory, as a result of which smaller memories can be installed in the information technology system or the freed storage space can be used for other things.
[0018] This is achieved by a one-off analysis process that is carried out separately from the standard operation of the IT system. The method is particularly suitable for IT systems that operate within a limited characteristic diagram, i.e. within a narrow range of fixed predetermined boundary conditions. This includes microcontrollers, for example in the form of embedded systems, since a limited number of "standard program sequences" are processed here. This means that the number of functions to be processed in one task remains manageable. Accordingly, the expenditure of checking which output data of a function is processed simultaneously by the processor during an execution iteration and of appropriately allocating the output data to fixed memory areas can be kept within certain limits.
[0019] Then, for example, during the development of an information technology / embedded system, a one-time analysis process can be performed. Thus, in the development of an embedded system, its requirements specifications are defined, thereby defining the tasks to be processed and correspondingly defining the functions to be processed. Thus, it is fixedly defined which output data and when they occur, which allows a fixed memory allocation for the corresponding output data according to the method of the invention.
[0020] Two cases must be distinguished. The first case provides that a function requiring the first output data exists in the task only before the function(s) requiring the second output data, while the second case provides that at least one function requiring the first output data exists in the task even after such a function requiring the second output data. These cases will be discussed in detail below.
[0021] Therefore, an advantageous improvement of the method provides that the third output data is provided before the fourth output data, and when the processor processes a function requiring the third output data after the function requiring the fourth output data, the third output data and the fourth output data are allocated to different fixed storage areas. Therefore, different functions processed by the processor at different time points require the third output data and the fourth output data, however, the third output data and the fourth output data are not suitable for jointly allocating the same storage area. This is to meet the second situation.
[0022] According to a further advantageous embodiment of the method, the memory is formed by a main memory, the information technology system has at least one auxiliary memory, and in order to replace the first output data with the second output data, the first output data are discarded from the main memory or are moved to the at least one auxiliary memory.
[0023] In general, the output data provided or read in by any function can in each case form the first, second, third, fourth or other output data, depending on which other output data the output data in question is associated with. The terms "first", "second", "third" and "fourth" are used here only to better distinguish the editing order in the direction of information flow.
[0024] According to the first case, the first output data can be deleted from the fixed memory area and replaced by the second output data, since the first output data is then no longer required by any further function.
[0025] According to the second case, the third output data cannot be simply deleted from the memory because the third output data is needed again after the fourth output data is processed by at least one function. There are two strategies to solve this problem.
[0026] Alternatively, the third and fourth output data are written to separate storage areas, so that the problem of having to remove the third output data from the storage area so that the fourth output data can be written therein no longer exists at all.
[0027] Alternatively, the third output data may be moved out to the auxiliary memory as long as the fourth output data is needed by the function. In this case, moving out means that the third output data is also deleted from the main memory, but is copied to the auxiliary memory before being discarded. As described above, the third output data and the fourth output data may be understood as analogous to the first and second output data.
[0028] Another advantageous design of the method also provides that the auxiliary memory has an access time different from the main memory, in particular, a tightly coupled memory (TCM) is used as the auxiliary memory. In other words, the auxiliary memory can be implemented by a storage element that is physically different from the main memory. In this case, the access time, i.e. the time required to read or write information, can be longer or shorter. This is particularly advantageous if it is a TCM and therefore has a particularly short access time. A TCM is a storage element that is physically particularly close to the corresponding processor. This makes the access time particularly short. For example, it can be an SRAM multi-transistor memory module. In this case, the management cost for managing the memory of the TCM, also called "overhead", is lower than the management cost of the processor's cache. In addition to output data, time-critical routines, such as so-called interrupt handling routines, real-time tasks and so-called interrupt stacks, can also be stored in the TCM.
[0029] According to another advantageous embodiment of the method, the information technology system solves at least two different tasks at least temporarily at the same time. With the help of the information technology system, it is also possible to process several tasks at the same time. In this case, the respectively available computing resources must be allocated to the individual tasks. The method according to the invention is particularly effective here, because even on information technology systems with limited computing resources, in particular storage elements, an effective division of information is possible. During the analysis, the information technology system then checks which output data of the individual functions of all tasks are processed simultaneously by the processor. Therefore, the corresponding output data of the functions of all tasks can also be effectively allocated to fixed storage areas of the memory. The processor can process at least two different tasks completely simultaneously, i.e. start and end at the same time, or have different start and end time points from each other.
[0030] Another advantageous design of the method also provides that the output data of the function of the first task is written to the main memory, and the output data of the function of the second task is written to one of the auxiliary memories. Typically, all output data of tasks other than the first task can be written to the same auxiliary memory, or, if the information technology system has multiple auxiliary memories, the output data from a single task can also be written to a separate auxiliary memory. Storing output data according to task division allows more efficient memory management. This is particularly advantageous if there is no need to exchange information, i.e. output data, between tasks. As a result, computing resources are particularly efficiently utilized so that the waiting time for writing or reading the output data of the corresponding task to the storage element due to the delay does not prevent write or read access to another task. Therefore, the execution time or solution time of a single task can be shortened. If two tasks rely on information exchange, the output data of these tasks can be written to a shared memory.
[0031] According to another advantageous embodiment of the method, the information technology system determines the storage requirement for each output data and only allocates those output data with substantially the same storage requirement to the same fixed storage area. In this case, substantially the same means exactly the same, i.e., for example, two different output data are both 156KB in size, and two different output data may also be of different sizes, but with only a relatively small difference. For example, the first output data may be 128KB and the second output data may be 156KB. The difference in file size for two different output data to be considered "substantially" the same may be fixed or also depend on the file size of the respective output data. For example, the allowed size difference may correspond to a proportional percentage value such as 10% or 20% of the file size of the output data. For example, if the output data is 128KB, the allowed deviation may be 13 or 26KB.
[0032] Allocating such output data of substantially the same size to a fixed storage area allows more efficient use of the storage space of the memory. This is because, if output data of different sizes are allocated to the same fixed storage area, if only relatively small output data is stored after particularly large output data, the available storage space on the memory will be wasted. This can be prevented.
[0033] Another advantageous embodiment of the method also provides that the information technology system applies a genetic algorithm during the analysis to determine which output data are to be assigned to the same fixed storage area in each case. The question of which output data are to be assigned to which fixed storage areas constitutes a Pareto optimal optimization problem. In general, other optimization algorithms can also be used, such as so-called greedy or dynamic optimization, but these no longer have a polynomial running time. However, the genetic algorithm reliably leads to a convergent solution in any case. This increases the reliability of finding the optimal allocation.
[0034] According to another advantageous embodiment of the method, the first optimization goal pursued is to minimize the total running time of the task to be solved, and the second optimization goal pursued is to minimize the proportion of memory occupied by fixed storage areas. For users of information technology systems, it is of particular interest if the tasks to be completed are solved, i.e. processed, particularly quickly. This is therefore the main goal of the optimization. In addition, it is important to reduce the share of memory occupied so that it can be used for other purposes. This is therefore a secondary condition.
[0035] The runtime of a task and the proportion of memory occupied are interdependent. In the previous static memory assignment, each output data was assigned to a separate fixed memory area. Accordingly, the memory is relatively occupied and the output data must be moved out if necessary. The more output data that is transferred to the stack available on the auxiliary memory, the longer the runtime of the corresponding task is, because the corresponding output data must be "exchanged" between the main memory and the auxiliary memory. These access times lead to increased latency and thus to an increase in the execution time of the task. Therefore, it is desirable to assign as many output data as possible to the same memory area in each case.
[0036] The method according to the invention makes this possible, resulting in more storage space being available on the memory, which allows, depending on the complexity of the task to be processed, no longer storing output data to the auxiliary memory.
[0037] However, as mentioned above, it may also happen that the output data are needed again at a later point in time, with the result that the corresponding output data cannot simply be deleted from the main memory. It is therefore important to assign the output data to the fixed storage area in such a way that the number of required removal operations is reduced to a minimum even when the output data are assigned to the same fixed storage area several times. Taking into account the first and second optimization objectives, the genetic algorithm finds a relatively optimal solution here particularly reliably.
[0038] According to the invention, the information technology system for carrying out the above method is designed as a microcontroller. The particular suitability of the method according to the invention for use in an environment designed as a microcontroller has already been explained above.
[0039] According to the invention, a vehicle comprises an information technology system as described above. In this case, the information technology system is particularly advantageously designed as a microcontroller. The method according to the invention can thus be integrated into individual control devices or computing units of the vehicle, thereby increasing the efficiency of the corresponding hardware components. As a result, the memory can be used particularly efficiently and the runtime of the tasks processed by the individual control devices can be reduced.
[0040] The vehicle may be any vehicle, such as a car, truck, van, bus, etc. In addition to road vehicles, rail vehicles, water vehicles or, for example, aircraft are also suitable for integrating the information technology system. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] Further advantageous embodiments of the method according to the invention for statically assigning information to a storage area of a processor-external memory also emerge from the exemplary embodiments, which will be described in more detail below with reference to the drawings.
[0042] in:
[0043] Figure 1 A schematic diagram showing a component data flow diagram of a function for solving a task by an information technology system;
[0044] Figure 2 A schematic diagram showing a classical memory assignment is shown;
[0045] Figure 3 A schematic diagram showing memory assignment according to the present invention is shown; and
[0046] Figure 4 A schematic diagram showing a component data flow graph for two tasks that run at different times. DETAILED DESCRIPTION
[0047] Information technology systems, such as personal computers or embedded systems, are used in everyday life to solve a wide variety of problems. To do this, information is processed by the processors of the information technology systems. Figure 1 A component data flow diagram showing information processed by a processor. For clarity, not all relevant locations in the drawings are indicated by reference numerals.
[0048] A first and a second task 3.1 and 3.2 can be identified. The respective tasks 3.1 and 3.2 can be implemented by separate programs or subroutines. The tasks 3.1, 3.2 are processed during an execution iteration 5. The current point in time in the execution iteration 5 is designated here as the execution position 7. To solve the respective tasks 3.1, 3.2, the processor processes individual functions 4 which are dependent on each other or build on each other. Such functions 4 are likewise implemented by separate program code modules. The function 4 can have an input interface 8.1 for receiving output data 6 and an output interface 8.2 for outputting the output data 6.
[0049] At respective points in time during the execution of an iteration 5, different output data 6 are active, also referred to as "live". This means that these output data 6 must be processed by the processor and are accordingly available to the processor. In the embodiment shown, the output data 6: "a", "b", "h" and "n" are active at the execution location 7.
[0050] In order to be able to solve tasks 3.1, 3.2, the processor must be able to access the corresponding output data 6. To this end, the output data 6 are written to the memory 2 after they have been generated. Figure 2 and Figure 3 The memory 2 is shown in more detail. Figure 2 Memory assignment according to known methods is shown.
[0051] In the embodiment variant shown in the figure, the information technology system has a main memory 2.1 and an auxiliary memory 2.2. The auxiliary memory 2.2 is preferably a so-called tightly coupled memory (TCM). Usually, after the output data 6 are generated by the function 4, the output data 6 are written successively to the individual storage areas 1 of the memory 2. In this case, a part of the memory is reserved for the code 9. For example, this is the code 9 for forming the function 4.
[0052] The corresponding output data 6 may differ in their storage requirements. Figure 2 Indicated by boxes of different sizes.
[0053] Furthermore, the auxiliary memory 2.2 is used to store a so-called stack 10, which is used to remove information, in particular the output data 6. Figure 2 As can be seen, the main memory 2.1 has been completely filled according to the process known in the prior art for static memory assignment. The output data 6 generated in the subsequent sequence of execution iterations 5 cannot be easily written to the main memory 2.1. The output data 6 that are no longer needed must then be moved out of the main memory 2.1 to the auxiliary memory 2.2. However, due to the read access to the main memory 2.1 and the write access to the auxiliary memory 2.2, this is time-consuming, thus increasing the execution time or running time of the corresponding tasks 3.1, 3.2 during the execution iteration 5.
[0054] The static memory assignment method according to the invention is used to reduce the storage requirements and improve the running time. This provides that, in a one-time analysis process, the information technology system checks which output data 6 of the function 4 are processed simultaneously by the processor during the execution iteration 5. Then, this assignment of the output data 6 to the fixed storage area 1 is performed, wherein each output data 6 is precisely assigned a fixed storage area 1, and wherein at least one first output data 6.1 and a second output data 6.2 processed by the processor at different points in time during the execution iteration 5 are assigned to the same fixed storage area 1. In standard operation during the execution iteration 5, the information technology system then writes the first output data 6.1 to the fixed storage area 1.1 assigned to it and keeps it there until the function 4.1 requiring the first output data 6.1 has been processed by the processor. The information technology system then writes the second output data 6.2 to the same fixed storage area 1.1 to replace the first output data 6.1 before the processor processes the function 4.2 requiring the second output data 6.2. Generally, each output data 6 can form the first, second or third or fourth output data 6.1, 6.2, 6.3 and 6.4. As an example, corresponding reference numerals are selected for the output data 6 “a” and “c”. Figure 3 A corresponding division of the memory 2 is shown.
[0055] from Figure 1 It can be seen that the output data 6 "a" are no longer necessary and are therefore no longer active after being processed by the function 4 marked with the letter C. Therefore, the output data 6 "a" can be replaced by the output data 6 "c".
[0056] In a particularly simple embodiment of the method according to the invention, the output data 6 which are no longer active during the execution of the iteration 5 are completely deleted from the main memory 2.1. Therefore, no removal into the auxiliary memory 2.2 is required. However, the storage space requirement on the main memory 2.1 increases, since the amount of output data 6 which can be provided on the same fixed memory area 1 can be reduced.
[0057] This is because, if the processor processes function 4.3 requiring third output data 6.3 after function 4.4 requiring fourth output data 6.4, the situation previously referred to as the "second case" may occur, that is, the third output data 6.3 (here as an example, output data 6"h") is provided before the fourth output data 6.4 (here output data 6"b"), and the third output data 6.3 and the fourth output data 6.4 are allocated to different fixed storage areas 1.2 and 1.3.
[0058] However, it is usually possible to assign the output data 6 "h" and "b" to the same fixed storage area 1, since the two output data 6 are not processed by the processor at the same time. However, the output data 6 "h" is needed again later, so it must be loaded into the main memory 2.1 again so that the processor or function 4.3 can access it. Optionally, the output data 6 "h" can be moved out to the auxiliary memory 2.2 for this purpose. This allows saving more storage space in the main memory 2.1, however, the runtime of the corresponding task 3.1 increases due to data access. For example, the output data 6 "h" must first be read out from the main memory 2.1, then written to the auxiliary memory 2.2, and then read out from the auxiliary memory 2.2 and written to the main memory 2.1 again.
[0059] However, if the auxiliary memory 2.2 is fast enough so that its access time is in the order of magnitude of the processor's clock frequency, for example in the case of an embodiment as TCM, if necessary, the individual output data 6 can also be read directly from the auxiliary memory 2.2 into the processor without first being written to the main memory 2.1. Thus, the runtime for executing iteration 5 can be further reduced.
[0060] Furthermore, when the auxiliary memory 2.2 is designed as a TCM, so-called hot code 11 can also be provided in the auxiliary memory 2.2. So-called hot code 11 is a code element that is processed particularly frequently by the processor, such as the body or core of a loop. Thus, the execution time can be further reduced.
[0061] like Figure 4 As shown, each function 4 may have an individual processing time indicated by boxes of different lengths. This is caused on the one hand by the access time required to read or write the corresponding output data 6 and the actual processor time to process the corresponding function 4. This may therefore result in different execution durations for the individual tasks 3.1 and 3.2. Figure 4 As shown, the individual execution iterations 5 of the individual tasks 3.1 and 3.2 can be connected seamlessly to one another (solid lines). The information technology system takes this into account during the analysis in order to determine which output data 6 from the individual functions 4 are to be processed simultaneously by the processor.
[0062] However, the information technology system can also provide a pause in order to coordinate the execution iteration 5 of the first task 3.1 so that the first task 3.1 is not executed again until the second task 3.2 is also restarted. Figure 4 , which is indicated by a dashed line and a time shift ΔT. This has the advantage that the processing time of the individual functions 4 is not shifted / delayed, so that the number of possible combinations of functions 4 or output data 6 to be processed simultaneously is reduced. However, this has the disadvantage that the frequency of processing the first task 3.1 is reduced. In this case, it is important to weigh which variant the information technology system should execute depending on the application.
Claims
1. A method for statically assigning and allocating information to a storage area (1) of an external memory (2) of a processor of an information technology system, wherein: The information technology system processes a plurality of cascaded functions (4) by a processor during an execution iteration (5) to solve a task (3.1, 3.2), wherein the respective function (4) after its processing provides output data (6) as information which can be read by a function (4) downstream in the direction of the information flow, and wherein the respective output data (6) are respectively written to a separate storage area (1) of the memory (2) accessed by the respective function (4) to provide for reading, It is characterized in that During the one-time analysis, the information technology system: - checking which output data (6) of the function (4) are processed simultaneously by the processor during the execution of an iteration (5); - assigning the output data (6) to fixed storage areas (1), wherein each output data (6) is assigned to exactly one fixed storage area (1), and wherein, At least first output data (6.1) and second output data (6.2) processed by the processor at different points in time during the execution iteration (5) are allocated to the same fixed storage area (1); and The information technology system, during standard operation during iteration (5): - writing said first output data (6.1) into a fixed storage area (1.1) allocated thereto, and leaving it in said fixed storage area (1.1) at least until said function (4.1) requiring said first output data (6.1) has been processed by said processor; and - before the function (4.2) requiring the second output data (6.2) is processed by the processor, writing the second output data (6.2) to the same fixed storage area (1.1) to replace the first output data (6.1).
2. The method according to claim 1, It is characterized in that The third output data (6.3) is provided before the fourth output data (6.4), and when the processor processes a function (4.3) requiring the third output data (6.3) after the function (4.4) requiring the fourth output data (6.4), the third output data (6.3) and the fourth output data (6.4) are allocated to different fixed storage areas (1.2, 1.3).
3. The method according to claim 1 or 2, It is characterized in that The memory (2) is formed by a main memory (2.1), the information technology system has at least one auxiliary memory (2.2), and in order to replace the first output data (6.1) with the second output data (6.2), the first output data (6.1) is discarded from the main memory (2.1) or the first output data (6.1) is moved out to the at least one auxiliary memory (2.2).
4. The method according to claim 3, It is characterized in that The auxiliary memory (2.2) has an access time different from that of the main memory (2.1). In particular, a tightly coupled memory is used as the auxiliary memory (2.2).
5. The method according to any one of claims 1 to 4, It is characterized in that The information technology system at least temporarily solves at least two different tasks simultaneously (3.1, 3.2).
6. The method according to claim 5, It is characterized in that The output data (6) of the function (4) of the first task (3.1) is written to the main memory (2.1), and the output data (6) of the function (4) of the second task (3.2) is written to one of the auxiliary memories (2.2).
7. The method according to any one of claims 1 to 6, It is characterized in that The information technology system determines the storage requirement of each output data (6) and allocates only those output data (6) having substantially the same storage requirement to the same fixed storage area (1).
8. The method according to any one of claims 1 to 7, It is characterized in that The information technology system uses a genetic algorithm in the analysis process to determine which output data (6) are to be assigned to the same fixed storage area (1) in each case.
9. The method according to claim 8, It is characterized in that The first optimization goal pursued is to minimize the total running time of the task (3.1, 3.2) to be solved, and the second optimization goal pursued is to minimize the proportion of the memory (2) occupied by the fixed memory area (1).
10. An information technology system for carrying out the method according to any one of claims 1 to 9, Features As a microcontroller implementation.
11. A vehicle, Features An information technology system configured to carry out the method according to any one of claims 1 to 9, in particular an information technology system according to claim 10.
Citation Information
Patent Citations
Memory management model and interface for unmodified applications
CN103635876A
Methods and apparatus to optimize dynamic memory assignments in multi-tiered memory systems
CN110658984A
Systems and methods for debugging application code on target computer
CN111984525A
Memory management optimization method and device, electronic equipment and storage medium
CN115145727A
Configuration technique for an electronic control unit with intercommunicating applications
US20140053165A1
