The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing

Bibliografske podrobnosti

izdano v:	arXiv.org (Jul 18, 2018), p. n/a
Glavni avtor:	Boyar, Joan
Drugi avtorji:	Faith, Ellen, Larsen, Kim S
Izdano:	Cornell University Library, arXiv.org
Teme:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Online dostop:	Citation/Abstract Full text outside of ProQuest
Oznake:	Označite Brez oznak, prvi označite!