The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing
arXiv: Data Structures and Algorithms, Volume abs/1807.06820, 2018.
This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the classical online setting. In fact, in a distributed shared memory setting, we find a counter-example to the theorem concerning classical randomized online algor...More
Full Text (Upload PDF)
PPT (Upload PPT)