Robert Boschgmbh

Carnegie Mellon University

Robert Bosch Gmbh

Michael Pressler

Dakshina Narahari Dasari

Arne Hamann

Falk Rehm

Simon Kramer

Dirk Ziegenbein

Bjoern Saballus

Sebastian Stuermer

Jascha Friedrich

Juergen Bregenzer

Elmar Ott

Anthony Rowe

Nuno Pereira

Ahsan Saeed

Tianshu Huang

Carlee Joe-Wong

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 method for predicting resource usage for applications in a distributed system. The method includes: obtaining resource usage data, the resource usage data resulting from measuring the resource usage of different applications on different devices of the distributed system; detecting, by an orchestrator, a change and/or an event in the distributed system that requires a re-configuration of the distributed system; predicting, by the orchestrator, the resource usage of at least one application when deployed on one or different devices of the distributed system, the predicting being carried out based on the obtained resource usage data; initiating the required re-configuration based on the detecting and the predicting.

Method for predicting resource usage for applications in a distributed system

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 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 dynamically assigning memory bandwidth to multiple processor units, which are connected via a data connection to a shared memory unit. In an initialization phase, each of the multiple processor units are assigned an initial value of a usable memory bandwidth, and a permissible range for a mean usage of the memory bandwidth is determined. Subsequently, the assigned memory bandwidths are checked repeatedly and adjusted if needed, a present value of a mean usage of the memory bandwidth by the multiple processor units being determined, and, if this present value is outside the permissible range, the values of the usable memory bandwidth are adjusted for at least a part of the multiple processor units.

Method for dynamically assigning memory bandwidth

A device and a method for operating a computer system, a job to be processed by the computer system being assignable to a task from a plurality of tasks for processing, the job to be processed being assigned as a function of a result of a comparison, a first value being compared to a second value in the comparison, the first value characterizing a first computing expenditure, which is to be expected in the computer system in the processing of the job to be processed in a first task of the plurality of tasks, the second value characterizing a second computing expenditure, which is to be expected in the computer system in the processing of the job to be processed in a second task of the plurality of tasks.

Device and method for selecting tasks and/or processor cores to execute processing jobs that run a machine

An apparatus and a method for processing a plurality of tasks in cycles on a plurality of computation cores, provision being made also to determine, within one cycle for processing the plurality of tasks, an allocation of the plurality of tasks to the plurality of computation cores and a sequence for an at least partial execution of the plurality of tasks.

Growing community of inventors

Karlsruhe, Germany

Michael Pressler