Telefonaktiebolaget Lm Ericsson (Publ)

Sigrid Eldh

Andreas Ermedahl

Marcus Jägemar

A method for enabling scheduling of processes in a processing system having at least one processor and associated hardware resources, at least one of the hardware resources being shared by at least two of the processes. The method is characterized by controlling execution of a process based on a usage bound of the number of allowable accesses, by the process, to a shared hardware resource by halting execution of the process when the number of allowable accesses has been reached, and enabling idle mode or start of execution of a next process. In this way, costly hardware overprovisioning and/or the need for shutting down processor cores can be avoided. By controlling execution of a process based on a usage bound of the number of allowable accesses to a shared hardware resource, instead of simply dividing CPU time between processes, highly efficient shared-resource-based process scheduling can be achieved.

Process scheduling in a processing system having at least one processor and shared hardware resources

Methods, nodes, and a system for process scheduling, as well as corresponding computer programs and computer-program products.

Growing community of inventors

Älvsjö, Sweden

Sigrid Eldh