Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Often, some entities do not require timing-channel protection or trust others with information. We propose lattice priority scheduling (LPS), a secure memory ...
Lattice Priority Scheduling: Low-Overhead. Timing-Channel Protection for a Shared Memory Controller. Andrew Ferraiuolo1, Yao Wang1, Danfeng Zhang2, Andrew C ...
We propose lattice priority scheduling (LPS), a secure memory scheduling algorithm that improves performance by more precisely meeting the target system's ...
This design was further improved by the lattice priority scheduling [73] and quantitative security guarantee [211] to reduce performance overhead and increased ...
This assumption limits the capability of the memory controller to allocate resources effectively, and causes severe performance penalties. Further, the ...
The results show that the proposed scheme completely eliminates the timing channels in the shared memory with small hardware and performance overheads. 1.
Missing: Lattice priority
Dive into the research topics of 'Lattice priority scheduling: Low-overhead timing-channel protection for a shared memory controller'. Together they form a ...
Lattice Priority Scheduling: Low-Overhead Timing Channel Protection for a Shared Memory Controller. A Ferraiuolo, Y Wang, D Zhang, AC Myers, GE Suh. HPCA, 2016.
Lattice Priority Scheduling: Low-Overhead Timing Channel Protection for a Shared Memory Controller. A Ferraiuolo, Y Wang, D Zhang, AC Myers, GE Suh. HPCA, 2016.