Provided by: Tekyz Inc.
Date Added: Nov 2012
Multicore shared cache processors pose a challenge for designers of embedded systems who try to achieve minimal and predictable execution time of workloads consisting of several jobs. To address this challenge the cache is statically partitioned among the cores and the jobs are assigned to the cores so as to minimize the makespan. Several heuristic algorithms have been proposed that jointly decide how to partition the cache among the cores and assign the jobs. The authors initiate a theoretical study of this problem which they call the joint cache partition and job assignment problem.