Guojing Cong

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

19EESeetharami Seelam, I-Hsin Chung, Guojing Cong, Hui-Fang Wen, David J. Klepacki: Workload Performance Characterization of DARPA HPCS Benchmarks. HPCC 2008: 342-351
18EEGuojing Cong, Sreedhar B. Kodali, Sriram Krishnamoorthy, Doug Lea, Vijay A. Saraswat, Tong Wen: Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing. ICPP 2008: 536-545
17EEGuojing Cong, Hanhong Xue: A scalable, asynchronous spanning tree algorithm on a cluster of SMPs. IPDPS 2008: 1-6
16EEI-Hsin Chung, Guojing Cong, David J. Klepacki, Simone Sbaraglia, Seetharami Seelam, Hui-Fang Wen: A framework for automated performance bottleneck detection. IPDPS 2008: 1-7
15EEAbhinav Bhatele, Guojing Cong: A Selective Pro ling Tool: Towards Automatic Performance Tuning. IPDPS 2007: 1-6
14EEGuojing Cong, David A. Bader: Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors. ISPA 2007: 137-147
13EEH. Wen, Simone Sbaraglia, Seetharami Seelam, I-Hsin Chung, Guojing Cong, David J. Klepacki: A Productivity Centered Tools Framework for Application Performance Tuning. QEST 2007: 273-274
12EESimone Sbaraglia, H. Wen, Seetharami Seelam, I-Hsin Chung, Guojing Cong, Kattamuri Ekanadham, David J. Klepacki: A productivity centered application performance tuning framework. VALUETOOLS 2007: 49
11EEGuojing Cong, Simone Sbaraglia: A Study on the Locality Behavior of Minimum Spanning Tree Algorithms. HiPC 2006: 583-594
10EEDavid A. Bader, Guojing Cong: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J. Parallel Distrib. Comput. 66(11): 1366-1378 (2006)
9EEGuojing Cong, David A. Bader: Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. J. Parallel Distrib. Comput. 66(6): 854-866 (2006)
8EEDavid A. Bader, Guojing Cong, John Feo: On the Architectural Requirements for Efficient Execution of Graph Algorithms. ICPP 2005: 547-556
7EEGuojing Cong, David A. Bader: An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). IPDPS 2005
6 Guojing Cong, David A. Bader: An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs. ISCA PDCS 2005: 27-34
5EEDavid A. Bader, Guojing Cong: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). J. Parallel Distrib. Comput. 65(9): 994-1006 (2005)
4EEGuojing Cong, David A. Bader: Lock-Free Parallel Algorithms: An Experimental Study. HiPC 2004: 516-528
3EEGuojing Cong, David A. Bader: The Euler Tour Technique and Parallel Rooted Spanning Tree. ICPP 2004: 448-457
2EEDavid A. Bader, Guojing Cong: A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. IPDPS 2004
1EEDavid A. Bader, Guojing Cong: Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs. IPDPS 2004

Coauthor Index

1David A. Bader [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [14]
2Abhinav Bhatele [15]
3I-Hsin Chung [12] [13] [16] [19]
4Kattamuri Ekanadham [12]
5John Feo [8]
6David J. Klepacki [12] [13] [16] [19]
7Sreedhar B. Kodali [18]
8Sriram Krishnamoorthy [18]
9Doug Lea [18]
10Vijay A. Saraswat [18]
11Simone Sbaraglia [11] [12] [13] [16]
12Seetharami Seelam [12] [13] [16] [19]
13H. Wen [12] [13]
14Hui-Fang Wen [16] [19]
15Tong Wen [18]
16Hanhong Xue [17]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)