A study of a transactional parallel routing algorithm

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2007, Pages 388-398

  Watson, Ian ^a   Kirkham, Chris ^a   Luján, Mikel ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILATION TECHNIQUES; ERROR-PRONE; FINE GRAINED; INTERNATIONAL CONFERENCES; MULTI-THREADED; PARALLEL APPLICATIONS; PARALLEL ARCHITECTURES; PARALLEL IMPLEMENTATIONS; PARALLEL ROUTING; SOFTWARE DEVELOPMENT; TRANSACTIONAL MEMORIES; TRANSACTIONAL MEMORY;

CHLORINE COMPOUNDS; LOCKS (FASTENERS); NETWORK ROUTING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER); TURBO CODES;

ROUTING ALGORITHMS;

EID: 46049103887     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2007.4336228     Document Type: Conference Paper

References (28)

1. http://www.cs.manchester.ac.uk/apt/projects/TM/LeeRouting.
2. C. S. Ananian, K. Asanovic, B. C. Kuszmaul, C. E. Leiserson, and S. Lie. Unbounded transactional memory. IEEE Micro, 26(1):59-69, 2006.
3. C. Blundell, E. C. Lewis, and M. M. K. Martin. Deconstructing transactions: The subtleties of atomicity. In Fourth Annual Workshop on Duplicating, Deconstructing, and Debunking, 2005.
4. B. D. Carlstrom, A. McDonald, M. Carbin, C. Kozyrakis, and K. Olukotun. Transactional collection classes. In Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 56-67, 2007.
5. B. D. Carlstrom, A. McDonald, H. Chafi, J. Chung, C. C. Minh, C. Kozyrakis, and K. Olukotun. The Atomos transactional programming language. In Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-13, 2006.
6. W. Chuang, S. Narayanasamy, G. Venkatesh, J. Sampson, M. V. Biesbrouck, G. Pokam, B. Calder, and O. Colavin. Unbounded page-based transactional memory. In Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 347-358, 2006.
7. J. Chung, H. Chafi, C. C. Minh, A. McDonald, B. D. Carlstrom, C. Kozyrakis, and K. Olukotun. The common case transactional behavior of multithreaded programs. In Proceedings of the Twelfth International Symposium on High-Performance Computer Architecture, pages 266-277, 2006.
8. P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Hybrid transactional memory. In Proceedings of the 12th international Conference on Architectural Support for Programming Languages and Operating Systems, pages 336-346, 2006.
9. D. Dice and N. Shavit. Understanding tradeoffs in software transactional memory. In Proceedings of the International Symposium on Code Generation and Optimization, pages 21-33, 2007.
10. R. Guerraoui, M. Kapalka, and J. Vitek. Stmbench7: a benchmark for software transactional memory. In Proceedings of the 2007 Conference on EuroSys, pages 315-324, 2007.
11. T. Harris and K. Fraser. Language support for lightweight transactions. In Proceedings of the 18th annual ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications, pages 388-402, 2003.
12. M. Herlihy, V. Luchangco, M. Moir, and I. William N. Scherer. Software transactional memory for dynamic-sized data structures. In Proceedings of the twenty-second annual Symposium on Principles of Distributed Computing, pages 92-101, 2003.
13. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture, pages 289-300, May 1993.
14. M. Kurkarni, L. P. Chew, and K. Pingali. Using transactions in Delaunay mesh generation. In Proceedings of the Workshop on Transactional Memory Workloads, pages 23-31, 2006.
15. J. Larus and R. Rajwar. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan & Claypool Publishers, 2007.
16. C. Y. Lee. An algorithm for path connections and its applications. IRE Transactions on Electronic Computers, EC-10:346-365, 1961.
17. D. B. Lomet. Process structuring, synchronization, and recovery using atomic actions. In Proceedings of an ACM Conference on Language Design for Reliable Software, pages 128-137, 1977.
18. S. Matsuoka and A. Yonezawa. Analysis of inheritance anomaly in object-oriented concurrent programming languages. In Research directions in concurrent object-oriented programming, pages 107-150. MIT Press, 1993.
19. A. McDonald, J. Chung, B. D. Carlstrom, C. C. Minh, H. Chafi, C. Kozyrakis, and K. Olukotun. Architectural semantics for practical transactional memory. In Proceedings of the 33rd Annual International Symposium on Computer Architecture, pages 53-65, 2006.
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 Proceedings of the 34th annual International Symposium on Computer Architecture, pages 69-80, 2007.
21. M. J. Moravan, J. Bobba, K. E. Moore, L. Yen, M. D. Hill, B. Liblit, M. M. Swift, and D. A. Wood. Supporting nested transactional memory in logTM. In Proceedings of the 12th international Conference on Architectural Support for Programming Languages and Operating Systems, pages 359-370, 2006.
22. Y. Ni, V. S. Menon, A.-R. Adl-Tabatabai, A. L. Hosking, R. L. Hudson, J. E. B. Moss, B. Saha, and T. Shpeisman. Open nesting in software transactional memory. In Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 68-78, 2007.
23. N. Shavit and D. Touitou. Software transactional memory. In PODC '95: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pages 204-213, New York, NY, USA, 1995. ACM Press.
24. T. Skare and C. Kozyrakis. Early release: Friend or foe? In Proceedings of the Workshop on Transactional Memory Workloads, pages 45-52, 2006.
25. M. F. Spear, V. J. Marathe, L. Dalessandro, and M. L. Scott. Privatization techniques for software transactional memory. Technical Report TR 915, Department of Computer Science, University of Rochester, February 2007.
26. T. D. Spiers and D. A. Edwards. A high performance routing engine. In Proceedings of the 24th ACM/IEEE conference on Design Automation, pages 793-799, 1987.
27. C. Wang, W.-Y. Chen, Y. Wu, B. Saha, and A.-R. Adl-Tabatabai. Code generation and optimization for transactional memory constructs in an unmanaged language. In Proceedings of the International Symposium on Code Generation and Optimization, pages 34-48, 2007.
28. I.-L. Yen, R. M. Dubash, and F. B. Bastani. Strategies for mapping Lee's maze routing algorithm onto parallel architectures. In Proceedings of the 7th International Parallel Processing Symposium, pages 672-679, 1993.