Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
We design and implement Mars, a MapReduce framework, on graphics processors (GPUs). MapReduce is a distributed programming framework originally proposed by Google for the ease of ...
Bingsheng He, Wenbin Fang, Qiong Luo, Naga K. Govi...
Abstract. Searching for information on the Internet became much easier when Google started delivering their service. We got used to getting the most important (probably) results on...
The previous research on cluster-based servers has focused on homogeneous systems. However, real-life clusters are almost invariably heterogeneous in terms of the performance, cap...
Taliver Heath, Bruno Diniz, Enrique V. Carrera, Wa...
PageRank is one of the most popular link analysis algorithms that have shown their effectiveness in web search. However, PageRank only consider hyperlink information. In this paper...
Hui-Min Yan, Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, ...