An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2009, Pages 15-24

  Kang, Seunghwa ^a   Bader, David A ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Minimum spanning foreset; Minimum spanning tree; Transactional memory

Indexed keywords

ALGORITHMIC MODEL; DATA SYNCHRONIZATION; DESIGN ISSUES; HARDWARE SUPPORTS; MANY-CORE; MEMORY WALL; MINIMUM SPANNING FORESET; MINIMUM SPANNING FORESTS; MINIMUM SPANNING TREE; MULTI CORE; POWER WALLS; PROGRAMMING COMPLEXITY; SINGLE-THREADED; SOFTWARE TRANSACTIONAL MEMORY; SPARSE GRAPHS; TRANSACTIONAL MEMORY;

ALGORITHMS; ARCHITECTURAL DESIGN; COMPUTATION THEORY; COMPUTER SOFTWARE; SCALABILITY; STORAGE ALLOCATION (COMPUTER);

PARALLEL PROGRAMMING;

EID: 67650093462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1504176.1504182     Document Type: Conference Paper

References (31)

1. C. S. Ananian, K. Asanovic, B. C. Kuszmaul, C. E. Leiserson, and S. Lie. Unbounded transactional memory. In Proc. 11th Int'l Conf. on High-Performance Computer Architecture (HPCA), San Francisco, CA, Feb. 2005.
2. K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-2183, Electrical Engineering and Computer Sciences, University of California at Berkeley, Dec. 2006.
3. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. Journal of Parallel and Distributed Computing, 66(11), 2006. (Pubitemid 44528211)
4. D. A. Bader and K. Madduri. SNAP, small-world network analysis and partitioning: an open-source parallel graph framework for the exploration of large-scale networks. In Proc. 22nd Int'l Parallel and Distributed Processing Symp. (IPDPS), Miami, FL, Apr. 2008.
5. C. Blundell, J. Devietti, E. C. Lewis, and M. M. K. Martin. Making the fast case common and the uncommon case simple in unbounded transactional memory. In Proc. 34th Ann. Int'l Symp. on Computer Architecture (ISCA), San Diego, CA, Jun. 2007. (Pubitemid 47582088)
6. C. Blundell, E. C. Lewis, and M. M. K. Martin. Deconstructing transactional semantics: The subtleties of atomicity. In Proc. 4th Ann. Workshop on Duplicating, Deconstructing, and Debunking (WDDD), Madison, WI, Jun. 2005.
7. J. Chung, C. C. Minh, B. D. Carlstrom, and C. Kozyrakis. Parallelizing SPECjbb2000 with transactional memory. In In Proc. Workshop on Transactional Memory Workloads (WTW), Ottawa, Canada, Jun. 2006.
8. P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Hybrid transactional memory. In Proc. 12th Int'l Conf. on Architecture Support for Programming Languages and Operating Systems (ASPLOS), San Jose, CA, Oct. 2006. (Pubitemid 47168413)
9. D. Dice, M. Herlihy, D. Lea, Y. Lev, V. Luchangco, W. Mesard, M. Moir, K. Moore, and D. Nussbaum. Applications of the adaptive transactional memory test platform. In Proc. 3rd ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), Salt Lake City, UT, Feb. 2008.
10. D. Dice, O. Shalev, and N. Shavit. Transactional locking II. In Proc. 20th Int'l Symp. on Distributed Computing (DISC), Stockholm, Sweden, Sep 2006.
11. R. Guerraoui, M. Kapalka, and J. Vitek. STMBench7: a benchmark for software transactional memory. In Proc. 2nd ACM SIGOPS/EuroSys European Conf. on Computer Systems (EuroSys), Lisbon, Portugal, Mar. 2007.
12. L. Hammond, V. Wong, M. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K. Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional memory coherence and consistency. In Proc. 31st Ann. Int'l Symp. on Computer Architecture (ISCA), Munich, Germany, Jun. 2004.
13. T. Harris, S. Marlow, S. P. Jones, and M. Herlihy. Composable memory transactions. In Proc. 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Chicago, IL, Jun. 2005. (Pubitemid 43182832)
14. M. Herlihy, J. Eliot, and B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proc. 20th Ann. Int'l Symp. on Computer Architecture (ISCA), New York, NY, May 1993.
15. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software transactional memory for dynamic-sized data structures. In Proc. 22nd Ann. Symp. on Principle of Distributed Computing (PODC), Boston, MA, Jul. 2003.
16. M. Kulkarni, K. Pingali, G. Ramanarayanan, B. Walter, K. Bala, and L. P. Chew. Optimistic parallelism benefits from data partitioning. In Proc. 13th Int'l Conf. on Architecture Support for Programming Languages and Operating Systems (ASPLOS), Seattle, WA, Mar. 2008. (Pubitemid 351585410)
17. V. J. Marathe, W. N. Scherer III, and M. L. Scott. Adaptive software transactional memory. In Proc. 19th Int'l Symp. on Distributed Computing (DISC), Cracow, Poland, Mar. 2005.
18. K. Mehlhorn and S. Näher. The LEDA platform of combinatorial and geometric computing. Communications of the ACM, 38(1):96-102, 1995.
19. C. C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multi-processing. In Proc. 11th IEEE Int'l Symp. on Workload Characterization (IISWC), Seattle, WA, Sep. 2008.
20. C. C. Minh, M. Trautmann, J. Chung, A. McDonald, N. Bronson, J. Casper, C. Kozyrakis, and K. Olukotun. An effective hybrid transactional memory system with strong isolation guarantees. In Proc. 34th Ann. Int'l Symp. on Computer Architecture (ISCA), San Diego, CA, Jun. 2007. (Pubitemid 47582092)
21. K. E. Moore, J. Bobba, M. J. Moravan, M. D. Hill, and D. A. Wood. LogTM: Log-based transactional memory. In Proc. 12th Int'l Conf. on High-Performance Computer Architecture (HPCA), Austin, TX, Feb. 2006. (Pubitemid 44418396)
22. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics 15, pages 99-117. American Mathematical Society, 1994.
23. C. Perfumo, N. Sonmez, S. Stipic, O. Unsal, A. Cristal, T. Harris, and M. Valero. The limits of software transactional memory (STM):dissecting Haskell STM applications on a many-core environment. In Proc. 5th ACM Int'l Conf. on Computing Frontiers (CF), Ischia, Italy, May 2008.
24. R. Rajwar, M. Herlihy, and K. Lai. Virtualizing transactional memory. In Proc. 32nd Ann. Int'l Symp. on Computer Architecture (ISCA), Madison, WI, Jun. 2005. (Pubitemid 41543465)
25. M. L. Scott, M. F. Spear, L. Dalessandro, and V. J.Marathe. Delaunay triangulation with transactions and barriers. In Proc. 10th IEEE Int'l Symp. on Workload Characterization (IISWC), Boston, MA, Sep. 2007.
26. A. Shriraman, M. F. Spear, H. H., V. J. Marathe, S. Dwarkadas, and M. L. Scott. An integrated hardware-software approach to flexible transactional memory. In Proc. 34th Ann. Int'l Symp. on Computer Architecture (ISCA), San Diego, CA, Jun. 2007. (Pubitemid 47582095)
27. M. Tremblay and S. Chaudhry. A third-generation 65nm 16-core 32-thread plus 32-scout-thread CMT SPARC processor. In Proc. Int'l Solid State Circuits Conf. (ISSCC), San Francisco, CA, Feb. 2008.
28. T. Vijaykumar, S. Gopal, J. E. Smith, and G. Sohi. Speculative versioning cache. In Proc. 5th Int'l Conf. on High-Performance Computer Architecture (HPCA), Las Vegas, NV, Jan. 1998.
29. C. von Praun, R. Bordawekar, and C. Cascaval. Modeling optimistic concurrency using quantitative dependence analysis. In Proc. 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Salt Lake City, UT, Feb. 2008.
30. I. Watson, C. Kirkham, and M. Lujan. A study of a transactional parallel routing algorithm. In Proc. 16th Int'l Conf. on Parallel Architectures and Compilation Techniques (PACT), Brasov, Romania, Sep. 2007.
31. Y. Zhang, L. Rauchwerger, and J. Torrellas. Hardware for speculative run-time parallelization in distributed shared-memory multiprocessors. In Proc. 5th Int'l Conf. on High-Performance Computer Architecture (HPCA), Las Vegas, NV, Jan. 1998.