Angen Zheng |
|
Department of Computer Science University of pittsburgh 6414 Sennott Square Pittsburgh, PA 15260 E-mail: anz28@cs.pitt.edu |
|
Bio
Hello! My name is Angen Zheng, a fifth year PhD student at Computer Science Department, University of Pittsburgh.
I am co-advised by Dr. Alexandros Labrinidis and Dr. Panos K. Chrysanthis.
My current research interest lies in architecture-aware graph partitioning and repartitioning, which aims to improve the mapping of applications' communication pattern to the underlying hardware topologies (i.e., communication heterogeneity and shared resource contention). However, I am also interested in solving problems that are encountered when building systems for large scale distributed computation.
Priorly, I also worked with Dr.
Jack Lange on Palacios VMM and Kitten OS for a while.
Education
-
Sept. 2012 - April 2017: PhD Student, Computer Science, University of Pittsburgh [Proposal, Defense]
-
Sept. 2009 - April 2012: M.S., Computer Science, Beijing University of Posts and Telecommunications (BUPT), China
-
Sept. 2005 - Jun. 2009: B.S., Computer Science, Beijing Information Science & Technology University (BISTU), China
Research
- Shortest Distance Query on Dynamic Graphs (March 2016) [Link] I developed a multiple thread version of level-synchronous breadth first search (bidirectional) and an indexing and pruning scheme for concurrent query processing, achieving up to 67x speedup.
- Architecture-Aware Graph (Re)Partitioning (Jan. 2013 ~ present) [BigData16, ICDE16, EDBT16, BigGraphs14] This projects aims to come up with some new graph (re)partitioners that take the nonuniform network communication costs and shared resource contention of modern HPC clusters into considerations while (re)partitioning.
- Interference-Aware Workload Placement for Multcore Machines (Feb. 2014 ~ April 2014) [report] [bibtex] This project targets to minimize cross-workload contention for the shared resources (i.e., LLC, FSB, memory controler) of multicore machines via intelligent workload placement.
- Implementing a GDB Stub in Lightweight Kitten OS (June, 2013 ~ Dec. 2013) [report] [bibtex] This project attempts to add user-level application debugging functionality to Kitten, a lightweight kernel.
Publications
- Skew-Resistant Graph Partitioning (Short Paper) Angen Zheng, Alexandros Labrinidis, Christos Faloutsos 33nd IEEE International Conference on Data Engineering (ICDE), 2017 [paper] [bibtex]
- Argo: Architecture-Aware Graph Partitioning Angen Zheng, Alexandros Labrinidis, Panos K. Chrysanthis, Jack Lange IEEE International Conference on Big Data (IEEE BigData), 2016 [paper] [slides] [bibtex]
- Planar: Parallel Lightweight Architecture-Aware Adaptive Graph Repartitioning Angen Zheng, Alexandros Labrinidis, Panos K. Chrysanthis 32nd IEEE International Conference on Data Engineering (ICDE), 2016 [paper] [slides] [bibtex]
- Paragon: Parallel Architecture-Aware Graph Partition Refinement Algorithm Angen Zheng, Alexandros Labrinidis, Patrick Pisciuneri, Panos K. Chrysanthis, Peyman Givi 19th International Conference on Extending Database Technology (EDBT), 2016 [paper] [slides] [bibtex]
-
Architecture-Aware Graph Repartitioning for Data-Intensive Scientific Computing
Angen Zheng, Alexandros Labrinidis, Panos K. Chrysanthis
1st International Workshop on High Performance Big Graph Data Management, Analysis, and Mining (BigGraphs), 2014 [paper] [slides] [bibtex]
Courses Taken
-
cs3510: Advanced Topics in Operating Systems (Spring 2014)
-
cs2210: Compiler Design (Spring 2014)
-
cs3550: Advanced Topics in Management of Data (Fall 2013)
-
cs2110: Theory of Computation (Fall 2013)
-
cs2550: Principles of Database Systems (Spring 2013)
-
cs2410: Computer Architecture (Fall 2012)
-
cs2510: Operating Systems (Fall 2012)