1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015
On the Smoothness of Paging Algorithms
Jan Reineke, Alejandro Salinger
We study the smoothness of paging algorithms. How much can the number of page faults increase due to a perturbation of the request sequence? We call a paging algorithm smooth if th…
cs.DS2014★ 1 cited
Algorithms in the Ultra-Wide Word Model
Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson +1
The effective use of parallel computing resources to speed up algorithms in current multi-core parallel architectures remains a difficult challenge, with ease of programming playin…