Context-Aware Set Dueling for Dynamic Policy Arbitration

Abstract summary

Conventional set dueling chooses between hardware policies using aggregate cache outcomes. This work instead incorporates execution context into that choice. Its DuelCeptron prototype uses hashed perceptrons to learn when each policy is useful, demonstrating the approach on a range of workloads. The aim is a more responsive arbitration mechanism that can be adapted to different microarchitectural decisions.

Read the source

Paper DOI PDF

Cite this work

@misc{contextawaresetduelingfordynamicpolicyarbitration,
  title = {Context-Aware Set Dueling for Dynamic Policy Arbitration},
  author = {Diamantis Patsidis and Georgios Vavouliotis},
  year = {2025},
  note = {IEEE CAL},
  url = {https://doi.org/10.1109/lca.2025.3617159}
}

Download