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

Bibliográfalaš dieđut

Publikašuvnnas:	arXiv.org (Jul 18, 2018), p. n/a
Váldodahkki:	Boyar, Joan
Eará dahkkit:	Faith, Ellen, Larsen, Kim S
Almmustuhtton:	Cornell University Library, arXiv.org
Fáttát:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Liŋkkat:	Citation/Abstract Full text outside of ProQuest
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!