Subject: Computer Science - Distributed, Parallel, and Cluster Computing
Intel Xeon Phi many-integrated-core (MIC) architectures usher in a new era of terascale integration. Among emerging killer applications, parallel graph processing has been a critical technique to analyze connected data. In this paper, we empirically evaluate various com... View more
 M. Ahmad and O. Khan, “GPU concurrency choices in graph analytics,” in IEEE International Symposium on Workload Characterization, pages 1-10, 2016.
 M. Ahmad, et al., “CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores,” in IEEE International Symposium on Workload Characterization, pages 44-55, 2015.
 T. Barnes, et al., “Evaluating and Optimizing the NERSC Workload on Knights Landing,” in International Workshop on Performance Modeling, Benchmarking and Simulation of High Performance Computer Systems, pages 43-53, 2016.
 S. Beamer, et al., “Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server,” in IEEE International Symposium on Workload Characterization, pages 56-65, 2015.
 M. Burtscher, et al., “A quantitative study of irregular programs on GPUs,” in IEEE International Symposium on Workload Characterization, pages 141-151, 2012.
 C. Cantalupo, et al., “memkind: An Extensible Heap Memory Manager for Heterogeneous Memory Platforms and Mixed Memory Policies.” Technical report, Sandia National Laboratories, Albuquerque, NM, 2015.
 L. Chen, et al., “Efficient and Simplified Parallel Graph Processing over CPU and MIC,” in IEEE International Parallel and Distributed Processing Symposium, pages 819-828, 2015.
 L. Chen, et al., “Exploiting Recent SIMD Architectural Advances for Irregular Applications,” in International Symposium on Code Generation and Optimization, pages 47-58, 2016.
 Y. Chen, et al., “Deconstructing Iterative Optimization,” ACM Transactions on Architecture and Code Optimization, 9(3):21:1-21:30, October 2012.
 T. A. Davis and Y. Hu, “The University of Florida Sparse Matrix Collection,” ACM Transaction on Mathematical Software, 38(1):1:1- 1:25, December 2011.