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

Bibliografiske detaljer

Udgivet i:	arXiv.org (Jul 18, 2018), p. n/a
Hovedforfatter:	Boyar, Joan
Andre forfattere:	Faith, Ellen, Larsen, Kim S
Udgivet:	Cornell University Library, arXiv.org
Fag:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Online adgang:	Citation/Abstract Full text outside of ProQuest
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!