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

Detaylı Bibliyografya

Yayımlandı:	arXiv.org (Jul 18, 2018), p. n/a
Yazar:	Boyar, Joan
Diğer Yazarlar:	Faith, Ellen, Larsen, Kim S
Baskı/Yayın Bilgisi:	Cornell University Library, arXiv.org
Konular:	Algorithms Distributed shared memory Competition Lower bounds Randomization Combinatorial analysis Distributed memory Schedules Adaptive algorithms
Online Erişim:	Citation/Abstract Full text outside of ProQuest
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!