Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yizhong, Liang"'
Partitioning an input graph over a set of workers is a complex operation. Objectives are twofold: split the work evenly, so that every worker gets an equal share, and minimize edge cut to achieve a good work locality (i.e. workers can work independen
Externí odkaz:
http://arxiv.org/abs/1310.8211
