The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guojing Cong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guojing Cong, David A. Bader
    An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:27-34 [Conf]
  2. Guojing Cong, David A. Bader
    Lock-Free Parallel Algorithms: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:516-528 [Conf]
  3. Guojing Cong, Simone Sbaraglia
    A Study on the Locality Behavior of Minimum Spanning Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    HiPC, 2006, pp:583-594 [Conf]
  4. David A. Bader, Guojing Cong, John Feo
    On the Architectural Requirements for Efficient Execution of Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 2005, pp:547-556 [Conf]
  5. Guojing Cong, David A. Bader
    The Euler Tour Technique and Parallel Rooted Spanning Tree. [Citation Graph (0, 0)][DBLP]
    ICPP, 2004, pp:448-457 [Conf]
  6. David A. Bader, Guojing Cong
    A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  7. David A. Bader, Guojing Cong
    Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  8. Guojing Cong, David A. Bader
    An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  9. David A. Bader, Guojing Cong
    A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:9, pp:994-1006 [Journal]
  10. David A. Bader, Guojing Cong
    Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1366-1378 [Journal]
  11. Guojing Cong, David A. Bader
    Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:854-866 [Journal]
  12. Abhinav Bhatele, Guojing Cong
    A Selective Pro ling Tool: Towards Automatic Performance Tuning. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-6 [Conf]
  13. Guojing Cong, David A. Bader
    Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:137-147 [Conf]

  14. Improving Memory Access Locality for Large-Scale Graph Analysis Applications. [Citation Graph (, )][DBLP]


  15. A Holistic Approach towards Automated Performance Analysis and Tuning. [Citation Graph (, )][DBLP]


  16. Workload Performance Characterization of DARPA HPCS Benchmarks. [Citation Graph (, )][DBLP]


  17. Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing. [Citation Graph (, )][DBLP]


  18. A scalable, asynchronous spanning tree algorithm on a cluster of SMPs. [Citation Graph (, )][DBLP]


  19. A framework for automated performance bottleneck detection. [Citation Graph (, )][DBLP]


  20. Towards a framework for automated performance tuning. [Citation Graph (, )][DBLP]


  21. A Productivity Centered Tools Framework for Application Performance Tuning. [Citation Graph (, )][DBLP]


  22. A productivity centered application performance tuning framework. [Citation Graph (, )][DBLP]


  23. Workload performance characterization of DARPA HPCS benchmarks. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002