Robert Boschgmbh

Robert Bosch Gmbh

Arne Hamann

Dakshina Narahari Dasari

Michael Pressler

Dirk Ziegenbein

Falk Rehm

Eckart Mayer-John

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.

Scheduling of computational processes

A computer-implemented method for managing cache utilization of at least a first processor when sharing a cache with a further processor. The method includes: executing, during a first regulation interval, a first application on a first processor, wherein the first application causes at least one block to be mapped from an external memory to a shared cache according to a cache utilization policy associated with the first application; monitoring a utilization of the shared cache by the first processor during the first regulation interval; comparing the utilization of the shared cache by the first processor to a cache utilization condition associated with the first processor; and adjusting the cache utilization policy associated with the first application, when the utilization of the shared cache by the first processor exceeds the cache utilization condition associated with the first processor.

Computer-implemented method for managing cache utilization

A method for operating a processing unit, in which a multiplicity of processes are carried out, which together access a resource according to a predefined resource distribution. The method includes a determination of an instantaneous actual processing time of at least one of the multiplicity of processes during an execution of the at least one of the multiplicity of processes, within which the at least one of the multiplicity of processes is processed; a comparison of the actual processing time with a setpoint processing time assigned to the at least one of the multiplicity of processes and/or with a sum of the assigned setpoint processing time and a processing time extension assigned to the at least one of the multiplicity of processes; and an adaptation of the predefined resource distribution as a function of a result of this comparison.

Method for operating a processing unit

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.

Method for operating a cache memory, cache memory and processing unit

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.

Growing community of inventors

Ludwigsburg, Germany

Arne Hamann