X
Xin Sui
Researcher at University of Texas at Austin
Publications - 12
Citations - 655
Xin Sui is an academic researcher from University of Texas at Austin. The author has contributed to research in topics: Data structure & Graph partition. The author has an hindex of 8, co-authored 11 publications receiving 626 citations. Previous affiliations of Xin Sui include Peking University.
Papers
More filters
Journal ArticleDOI
The tao of parallelism in algorithms
Keshav Pingali,Donald Nguyen,Milind Kulkarni,Martin Burtscher,M. Amber Hassaan,Rashid Kaleem,Tsung-Hsien Lee,Andrew Lenharth,Roman Manevich,Mario Méndez-Lojo,Dimitrios Prountzos,Xin Sui +11 more
TL;DR: It is suggested that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming.
Proceedings ArticleDOI
Proactive Control of Approximate Programs
TL;DR: This paper addresses the problem of controlling approximation for non-streaming programs that have a set of "knobs" that can be dialed up or down to control the level of approximation of different components in the program, and describes a system called Capri that uses machine learning to learn cost and error models for the program.
Proceedings ArticleDOI
Structure-driven optimizations for amorphous data-parallel programs
Mario Méndez-Lojo,Donald Nguyen,Dimitrios Prountzos,Xin Sui,M. Amber Hassaan,Milind Kulkarni,Martin Burtscher,Keshav Pingali +7 more
TL;DR: This paper shows that many irregular algorithms have structure that can be exploited and presents three key optimizations that take advantage of algorithmic structure to reduce speculative overheads and describes the implementation of these optimizations in the Galois system and presents experimental results to demonstrate their benefits.
Journal ArticleDOI
Exploiting the commutativity lattice
TL;DR: It is shown how commutativity specifications from this lattice can be systematically implemented in one of three different schemes: abstract locking, forward gatekeeping and general gatekeeping, and it is shown that these schemes are practical and can deliver speedup on three real-world applications.
Proceedings ArticleDOI
Scalable and Memory-Efficient Clustering of Large-Scale Social Networks
TL;DR: Experimental results show that GEM produces clusters of quality comparable to or better than existing state-of-the-art graph clustering algorithms, while it is much faster and consumes much less memory.