Abstract: A method for updating an application of an automotive electronic control unit. The method includes: converting the application of the automotive electronic control unit into a bytecode representation of the application; modifying the bytecode representation of the application at least with regard to at least one input and/or output interface thereof, the at least one input and/or output interface enabling a communication to at least one other application and/or to at least one other automotive electronic control unit; deploying the bytecode representation of the application on the automotive electronic control unit and/or on the at least one other automotive electronic control unit. A computer program, an apparatus, and a storage medium are also described.

Abstract: A method for resource allocation for applications and/or application containers in a distributed system of heterogeneous compute nodes, which are heterogeneous at least with respect to their hardware platforms and/or operating systems. The method includes: executing one of the applications and/or the application containers based on an intermediate instruction set architecture by means of a runtime environment, wherein the runtime environment is provided on at least one of the compute nodes; carrying out resource monitoring of resource usage at the compute node by means of the runtime environment, wherein the resource monitoring is carried out based on the intermediate instruction set architecture; carrying out resource allocation based on the resource monitoring that has been carried out.

Abstract: A method for carrying out a decision for upgrading and/or deploying software on multiple heterogenous devices. The method includes: receiving a request to upgrade and/or deploy software on at least one of the devices; initiating a connection to the at least one of the devices; initiating a process for determining at least one capability of the at least one connected device for executing the software, the initiating being carried out via the connection, the process being initiated for being executed by the at least one connected device; receiving a result of the initiated process; and carrying out the decision for the upgrade and/or deployment of the software based on the received result.

Abstract: A method for operating a cache memory having a set having multiple memory blocks configured for storing data blocks. In a write process of a data block into a memory block of the set, the data block is written into the memory block, a relevance rank value of the data block and a first access time rank value are determined. Rank data associated with the memory block are determined using a write rank mapping from the relevance rank value and the first access time rank value, and the determined rank data are stored. If no memory block of the set is free, a memory block that is to be overwritten is selected from the memory blocks of the set based on the rank data, which are associated with the memory blocks, and the data block to be stored is written into the selected memory block by using the write process.

Abstract: A method for adaptive resource allocation for applications in a distributed system of heterogeneous compute nodes. The following adaptation steps are carried out repeatedly and in an automated manner by an allocation and migration unit at least partially during a runtime of the applications: carrying out monitoring of the applications and the resources of the system to ascertain a need for changes of a resource allocation of the resources of the system for the applications; adapting the resource allocation based on the ascertained need for changes.

Abstract: A method for providing a distribution mechanism for distributing at least one application in a system of distributed computing nodes. Each of at least one of the computing nodes of the system performs the following assessment steps: receiving an application requirement from a request service, wherein the application requirement specifies at least one requirement of the application concerning at least one resource of the computing node, analyzing the received application requirement in order to compare the at least one requirement of the application with an availability of the at least one resource at the computing node, so as to ascertain a suitability result regarding a suitability of the computing node for executing the application, transmitting the ascertained suitability result to a messaging service in order to provide the suitability result at said messaging service together with further suitability results regarding the suitability of further computing nodes of the system.

Abstract: A method for providing an item of time information related to a piece of communication content in a distributed system of at least one application. The method includes: providing the time information about a time of a generation of the communication content, providing the communication content for the purpose of a chained processing of the communication content, comprising at least one interim processing operation and a target processing operation by different processing blocks of the at least one application, wherein the time information is provided for at least one of the different processing blocks in order to evaluate the time information at least during the target processing operation for the purpose of assessing the processed communication content.

Abstract: A method of a quality of service scheduler for scheduling the execution of a first and second linked atomic computational process on a heterogenous processing system including a first and a second processor of a different type. The method includes: receiving, from an application, a request to compute a job, the job including first and second linked atomic computational processes, and being associated with a quality of service requirement; determining, based on a register of elements of the heterogenous processing system, one or more tentative execution plans of the first and second linked atomic computational processes on the elements; selecting, as an intended execution plan, an execution plan of the first and second linked atomic computational processes, wherein the intended execution plan is capable of meeting the quality of service requirement provided by the application; and scheduling the execution of the first and second linked atomic computational processes.

Abstract: A method for operating a cache memory having a set having multiple memory blocks configured for storing data blocks. In a write process of a data block into a memory block of the set, the data block is written into the memory block, a relevance rank value of the data block and a first access time rank value are determined. Rank data associated with the memory block are determined using a write rank mapping from the relevance rank value and the first access time rank value, and the determined rank data are stored. If no memory block of the set is free, a memory block that is to be overwritten is selected from the memory blocks of the set based on the rank data, which are associated with the memory blocks, and the data block to be stored is written into the selected memory block by using the write process.

Abstract: A computer-implemented method for providing a digital road map for testing an at least partially automated vehicle system. the method includes: accessing a database in which are stored permissible characteristics of the road properties for a multitude of road properties; creating at least one road map section by one of the possible characteristics being selected for the road map section for the first of the multitude of road properties, in each particular case in automated fashion from the database; providing the digital road map, the digital road map including the at least one road map section.

Abstract: A method for managing computing performance in a real-time data processing system, having at least one apparatus for controlling at least one computing device that is embodied for execution of a first and of at least one further application, at least the first application encompassing at least one anytime algorithm. The method includes: assigning a first computing-performance budget, as a function of a first point in time, to the first application; activating the computing device for execution of the first application, at the first point in time by the computing device; checking whether, after execution of the first application, a portion of the first computing-performance budget is still available and, in the event a portion of the budget is still available, performing (i) activating the computing device for re-execution of the first application, or (ii) assigning the portion of the first computing-performance budget to at least one further application.

Abstract: A method for operating a control unit, in particular for a motor vehicle, the control unit including at least one execution unit for executing task programs, a first task program and a second task program being executed at least intermittently, the first task program providing data for the second task program at the end of a first predefined time interval, wherein a transfer of the data from the first task program to the second task program only takes place after a particular last execution of the first task program within a predefined second time interval for the execution of the second task program, the second time interval being longer than the first time interval.

Abstract: A method for operating a control unit, in particular for a motor vehicle, the control unit including at least one execution unit for executing task programs, a first task program and a second task program being executed at least intermittently, the first task program providing data for the second task program at the end of a first predefined time interval, wherein a transfer of the data from the first task program to the second task program only takes place after a particular last execution of the first task program within a predefined second time interval for the execution of the second task program, the second time interval being longer than the first time interval.

Abstract: A method for managing computing performance in a real-time data processing system, having at least one apparatus for controlling at least one computing device that is embodied for execution of a first and of at least one further application, at least the first application encompassing at least one anytime algorithm. The method includes: assigning a first computing-performance budget, as a function of a first point in time, to the first application; activating the computing device for execution of the first application, at the first point in time by the computing device; checking whether, after execution of the first application, a portion of the first computing-performance budget is still available and, in the event a portion of the budget is still available, performing (i) activating the computing device for re-execution of the first application, or (ii) assigning the portion of the first computing-performance budget to at least one further application.

Abstract: A computer-implemented method for testing a vehicle system. In the method, data of a digital road map are read in, zones are determined for the digital road map, possible sequences of drives along a road of the digital road map are ascertained as a function of the determined zones, a behavior of the vehicle or of a vehicle system of the vehicle is ascertained in a simulation for at least one of the possible sequences, and it is determined as a function of a comparison of the ascertained behavior with at least one predetermined requirement whether the vehicle system exhibits an error or a weakness.

Abstract: A computer-implemented method for controlling a vehicle. The method includes: data of a digital road map are read in, zones are determined for the digital road map, possible sequences of drives along a road of the digital road map are ascertained as a function of the determined zones, a behavior of the vehicle or of a vehicle system of the vehicle is ascertained in a simulation for at least one of the possible sequences, and the vehicle is controlled in accordance with one of the possible sequences as a function of a comparison of the ascertained behavior with at least one predetermined requirement.

Abstract: A computer-implemented method for providing a digital road map for testing an at least partially automated vehicle system. the method includes: accessing a database in which are stored permissible characteristics of the road properties for a multitude of road properties; creating at least one road map section by one of the possible characteristics being selected for the road map section for the first of the multitude of road properties, in each particular case in automated fashion from the database; providing the digital road map, the digital road map including the at least one road map section.

Abstract: A method for operating a processing unit, including a memory and at least one processor core that executes a plurality of program functions of a computer program, includes ascertaining all program instructions that belong to a program function to be executed at a future execution point in time and providing the ascertained program instructions in the memory before the execution point in time.

Abstract: A method for operating a processing unit, including a memory and at least one processor core that executes a plurality of program functions of a computer program, includes ascertaining all program instructions that belong to a program function to be executed at a future execution point in time and providing the ascertained program instructions in the memory before the execution point in time.