Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kevin Aydin"'
Publikováno v:
Algorithms, Vol 12, Iss 8, p 162 (2019)
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the resu
Externí odkaz:
https://doaj.org/article/8d1a6e7032004694851ae66537b5a278
Autor:
Aaron Schild, Kevin Aydin, Aaron Archer, Richard Zhuang, Vahab Mirrokni, Ray Yang, MohammadHossein Bateni
Publikováno v:
Proceedings of the VLDB Endowment. 12:709-723
Our deployment of cache-aware load balancing in the Google web search backend reduced cache misses by ~0.5x, contributing to a double-digit percentage increase in the throughput of our serving clusters by relieving a bottleneck. This innovation has b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5396a62492b2c105d70fef7edd777e2
https://doi.org/10.14778/3311880.3311887
https://doi.org/10.14778/3311880.3311887
Publikováno v:
Algorithms
Volume 12
Issue 8
Algorithms, Vol 12, Iss 8, p 162 (2019)
WSDM
Volume 12
Issue 8
Algorithms, Vol 12, Iss 8, p 162 (2019)
WSDM
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, for example, in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the resu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb4157bed19ca46073211f7889574024
Publikováno v:
KDD
Web-based services often run randomized experiments to improve their products. A popular way to run these experiments is to use geographical regions as units of experimentation, since this does not require tracking of individual users or browser cook
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a161e09a991a44e4fde3e37fcee2433f
