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

Detalhes bibliográficos

Publicado no:	arXiv.org (Jul 18, 2018), p. n/a
Autor principal:	Boyar, Joan
Outros Autores:	Faith, Ellen, Larsen, Kim S
Publicado em:	Cornell University Library, arXiv.org
Assuntos:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Acesso em linha:	Citation/Abstract Full text outside of ProQuest
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!