In this paper we present a multicore architecture that introduces a novel hardware shared-resource management policy, called Worst-Case Resource Management (WC-RM), that allows executing efficiently mixed application workloads composed by hard real-time and non real-time applications in a multicore platform. Our multicore architecture forces hard real-time tasks to be executed close to their wo...

In a typical resource allocation model, clients request a xed amount of a certain resource from the resource manager (RM). Based on the current allocations, the RM grants or rejects the request. An alternative abstract model for the resource allocation problem assumes that the client speciies his request as a range of possible allocations rather than a xed point requirement. The client is assum...

Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . .+ rm = c1 + . . .+ cn. We consider the set Σ(R, C) of non-negative m × n integer matrices (contingency tables) with row sums R and column sums C as a finite probability space with the uniform measure. We prove that a random table D ∈ Σ(R, C) is close with high probability to a particular matrix (“t...