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

Detalles Bibliográficos

Publicado en:	arXiv.org (Jul 18, 2018), p. n/a
Autor Principal:	Boyar, Joan
Outros autores:	Faith, Ellen, Larsen, Kim S
Publicado:	Cornell University Library, arXiv.org
Materias:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Acceso en liña:	Citation/Abstract Full text outside of ProQuest
Etiquetas:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!