 | 2012 |
| 32 |  | Guojing Cong,
I-Hsin Chung,
Hui-Fang Wen,
David J. Klepacki,
Hiroki Murata,
Yasushi Negishi,
Takao Moriyama:
A Systematic Approach toward Automated Performance Analysis and Tuning.
IEEE Trans. Parallel Distrib. Syst. 23(3): 426-435 (2012) |
| 2011 |
| 31 |  | Guojing Cong,
Konstantin Makarychev:
Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform.
IPDPS 2011: 688-697 |
| 30 |  | David A. Bader,
Guojing Cong:
Spanning Tree, Minimum Weight.
Encyclopedia of Parallel Computing 2011: 1870-1877 |
| 29 |  | David A. Bader,
Guojing Cong:
SWARM: A Parallel Programming Framework for Multicore Processors.
Encyclopedia of Parallel Computing 2011: 1966-1971 |
| 28 |  | David A. Bader,
Guojing Cong:
Graph Algorithms.
Encyclopedia of Parallel Computing 2011: 796-805 |
| 27 |  | Guojing Cong,
David A. Bader:
Hybrid Programming With SIMPLE.
Encyclopedia of Parallel Computing 2011: 851-860 |
| 2010 |
| 26 |  | Judit Gimenez,
Jesús Labarta,
F. Xavier Pegenaute,
Hui-Fang Wen,
David J. Klepacki,
I-Hsin Chung,
Guojing Cong,
Felix Voigtländer,
Bernd Mohr:
Guided Performance Analysis Combining Profile and Trace Tools.
Euro-Par Workshops 2010: 513-521 |
| 25 |  | Guojing Cong,
I-Hsin Chung,
Hui-Fang Wen,
David J. Klepacki,
Hiroki Murata,
Yasushi Negishi,
Takao Moriyama:
Application tuning through bottleneck-driven refactoring.
IPDPS Workshops 2010: 1-7 |
| 24 |  | Guojing Cong,
George Almasi,
Vijay A. Saraswat:
Fast PGAS Implementation of Distributed Graph Algorithms.
SC 2010: 1-11 |
| 23 |  | Seetharami Seelam,
I-Hsin Chung,
Guojing Cong,
Hui-Fang Wen,
David J. Klepacki:
Workload performance characterization of DARPA HPCS benchmarks.
Concurrency and Computation: Practice and Experience 22(4): 441-461 (2010) |
| 2009 |
| 22 |  | Guojing Cong,
I-Hsin Chung,
Hui-Fang Wen,
David J. Klepacki,
Hiroki Murata,
Yasushi Negishi,
Takao Moriyama:
A Holistic Approach towards Automated Performance Analysis and Tuning.
Euro-Par 2009: 33-44 |
| 21 |  | Guojing Cong,
Seetharami Seelam,
I-Hsin Chung,
Sophia Wen,
David J. Klepacki:
Towards a framework for automated performance tuning.
IPDPS 2009: 1-8 |
| 20 |  | Guojing Cong,
Konstantin Makarychev:
Improving Memory Access Locality for Large-Scale Graph Analysis Applications.
ISCA PDCCS 2009: 121-127 |
| 2008 |
| 19 |  | Seetharami Seelam,
I-Hsin Chung,
Guojing Cong,
Hui-Fang Wen,
David J. Klepacki:
Workload Performance Characterization of DARPA HPCS Benchmarks.
HPCC 2008: 342-351 |
| 18 |  | Guojing 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 |
| 17 |  | Guojing Cong,
Hanhong Xue:
A scalable, asynchronous spanning tree algorithm on a cluster of SMPs.
IPDPS 2008: 1-6 |
| 16 |  | I-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 |
| 2007 |
| 15 |  | Abhinav Bhatele,
Guojing Cong:
A Selective Pro ling Tool: Towards Automatic Performance Tuning.
IPDPS 2007: 1-6 |
| 14 |  | Guojing Cong,
David A. Bader:
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.
ISPA 2007: 137-147 |
| 13 |  | Hui-Fang 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 |
| 12 |  | Simone Sbaraglia,
Hui-Fang Wen,
Seetharami Seelam,
I-Hsin Chung,
Guojing Cong,
Kattamuri Ekanadham,
David J. Klepacki:
A productivity centered application performance tuning framework.
VALUETOOLS 2007: 49 |
| 2006 |
| 11 |  | Guojing Cong,
Simone Sbaraglia:
A Study on the Locality Behavior of Minimum Spanning Tree Algorithms.
HiPC 2006: 583-594 |
| 10 |  | David 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) |
| 9 |  | Guojing Cong,
David A. Bader:
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols.
J. Parallel Distrib. Comput. 66(6): 854-866 (2006) |
| 2005 |
| 8 |  | David A. Bader,
Guojing Cong,
John Feo:
On the Architectural Requirements for Efficient Execution of Graph Algorithms.
ICPP 2005: 547-556 |
| 7 |  | Guojing 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 |
| 5 |  | David A. Bader,
Guojing Cong:
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs).
J. Parallel Distrib. Comput. 65(9): 994-1006 (2005) |
| 2004 |
| 4 |  | Guojing Cong,
David A. Bader:
Lock-Free Parallel Algorithms: An Experimental Study.
HiPC 2004: 516-528 |
| 3 |  | Guojing Cong,
David A. Bader:
The Euler Tour Technique and Parallel Rooted Spanning Tree.
ICPP 2004: 448-457 |
| 2 |  | David A. Bader,
Guojing Cong:
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors.
IPDPS 2004 |
| 1 |  | David A. Bader,
Guojing Cong:
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs.
IPDPS 2004 |