No abstract

No abstract

Effective sharing of the last level cache has a significant influence on the overall performance of a multicore system. We observe that existing solutions control cache occupancy at a coarser granularity, do not scale well to large core counts and in some cases lack the flexibility to support a variety of performance goals. In this paper, we propose Probabilistic Shared Cache Management (PriSM), a framework to manage the cache occupancy of different cores at cache block granularity by controlling their eviction probabilities. The proposed framework requires only simple hardware changes to implement, can scale to larger core count and is flexible enough to support a variety of performance goals. We demonstrate the flexibility of PriSM, by computing the eviction probabilities needed to achieve goals like hit-maximization, fairness and QOS. PriSM-HitMax improves performance by 18.7% over LRU and 11.8% over previously proposed schemes in a sixteen core machine. PriSM-Fairness improves fairness over existing solutions by 23.3% along with a performance improvement of 19.0%. PriSM-QOS successfully achieves the desired QOS targets.

No abstract

Dynamic models of physical systems often contain parameters that must be estimated from experimental data. In this work, we consider the identification of parameters in nonlinear mechanical systems given noisy measurements of only some states. The resulting nonlinear optimization problem can be solved efficiently with a gradient-based optimizer, but convergence to a local optimum rather than the global optimum is common. We augment the dynamic equations with a morphing parameter and a proportional–integral–derivative (PID) controller to transform the objective function into a convex function; the global optimum can then be found using a gradient-based optimizer. The morphing parameter is used to gradually remove the PID controller in a sequence of steps, ultimately returning the model to its original form. An optimization problem is solved at each step, using the solution from the previous step as the initial guess. This strategy enables use of a gradient-based optimizer while avoiding convergence to a local optimum. The efficacy of the proposed approach is demonstrated by identifying parameters in the van der Pol–Duffing oscillator, a hydraulic engine mount system, and a magnetorheological damper system. Our method outperforms genetic algorithm and particle swarm optimization strategies, and demonstrates robustness to measurement noise.