Robert Boschgmbh

Dirk Ziegenbein

Arne Hamann

Uwe Hartmann

Simon Kramer

Christian Heinzemann

Michael Pressler

Jens Gladigau

Martin Herrmann

Michael Rittel

Nadja Schalm

Dakshina Narahari Dasari

Falk Rehm

Peter Haefele

Eckart Mayer-John

Martin Butz

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 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.

Method for providing a digital road map

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.

Method and apparatus for managing computing performance in a data processing system

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.

Method and device for operating a control unit

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.

Method for operating a processing unit

Growing community of inventors

Freiberg am Neckar, Germany

Dirk Ziegenbein