SWARM: A parallel programming framework for multicore processors

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Bader, David A ^a   Kanade, Varun ^a   Madduri, Kamesh ^a  

^a Georgia Institute of Technology

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; CONCURRENCY CONTROL; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; PROGRAM PROCESSORS; SORTING; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; MICROPROCESSOR ARCHITECTURES; MULTICORE PROCESSORS; PARALLEL PROGRAMMING FRAMEWORK; POINTER-JUMPING; PREFIXSUMS; SPANNING TREE; SWARM; SYMMETRY BREAKING;

PARALLEL PROGRAMMING;

EID: 34548738436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370681     Document Type: Conference Paper

References (20)

1. A. Aggarwal and J. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31:1116-1127, 1988.
2. AMD Multi-Core Products, http://multicore.amd.com/en/Products/, 2006.
3. D. Bader. SWARM: A parallel programming framework for multicore processors, https://sourceforge.net/ projects/multicore-swarm, 2006.
4. D. Bader, V. Agarwal, and K. Madduri. On the design and analysis of irregular algorithms on the Cell processor: A case study of list ranking. In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2007), Long Beach, CA, USA, 2007.
5. D. Bader, V. Chandu, and M. Yan. ExactMP: An efficient parallel exact solver for phylogenetic tree reconstruction using maximum parsimony. In Proc. 35th Int'l Conf. on Parallel Processing (ICPP), Columbus, OH, Aug. 2006.
6. D. Bader, A. Illendula, B. M. Moret, and N. Weisse-Bernstein. Using PRAM algorithms on a uniform-memory-access shared-memory architecture. In G. Brodal, D. Frigioni, and A. Marchetti-Spaccamela, editors, Proc. 5th Int'l Workshop on Algorithm Engineering (WAE 2001), volume 2141 of Lecture Notes in Computer Science, pages 129-144, Århus, Denmark, 2001. Springer-Verlag.
7. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proc. 35th Int'l Conf. on Parallel Processing (ICPP), Columbus, OH, Aug. 2006. IEEE Computer Society.
8. D. Bader, S. Sreshta, and N. Weisse-Bernstein. Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs). In S. Sahni, V. Prasanna, and U. Shukla, editors, Proc. 9th Int'l Conf. on High Performance Computing (HiPC 2002), volume 2552 of Lecture Notes in Computer Science, pages 63-75, Bangalore, India, Dec. 2002. Springer-Verlag.
9. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, Apr. 2004.
10. D. A. Bader and J. JáJá. SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing, 58(1):92-108, 1999.
11. L. Barroso, K. Gharachorloo, R. McNamara, A. Nowatzyk, S. Qadeer, B. Sano, S. Smith, R. Stets, and B. Verghese. Piranha: A scalable architecture based on single-chip multi-processing. SIGARCH Comput. Archit. News, 28(2):282-293, 2000.
12. J. Held, J. Bautista, and S. Koehl. From a Few Cores to Many: A Tera-scale Computing Research Overview. ftp://download.intel.com/research/ platform/terascale/terascale_overview_paper.pdf, 2006.
13. D. R. Helman and J. JáJá. Designing practical efficient algorithms for symmetric multiprocessors. In Algorithm Engineering and Experimentation (ALENEX'99), volume 1619 of Lecture Notes in Computer Science, pages 37-56, Baltimore, MD, Jan. 1999. Springer-Verlag.
14. Multi-Core from Intel - Products and Platforms. http://www.intel.com/ multi-core/products.htm, 2006.
15. International Technology Roadmap for Semiconductors, 2004update. http://itrs.net, 2004.
16. J. Kahle, M. Day, H. Hofstee, C. Johns, T. Maeurer, and D. Shippy. Introduction to the Cell multiprocessor. IBM J. Res. Dev., 49(4/5):589-604, 2005.
17. P. Kongetira, K. Aingaran, and K. Olukotun. Niagara: A 32-way multithreaded Sparc processor. IEEE Micro, 25(2):21-29, 2005.
18. R. Ladner, J. Fix, and A. LaMarca. The cache performance of traversais and random accesses. In Proc. 10th Ann. Symp. Discrete Algorithms (SODA-99), pages 613-622, Baltimore, MD, 1999. ACM-SIAM.
19. R. E. Ladner, R. Fortna, and B.-H. Nguyen. A comparison of cache aware and cache oblivious static search trees using program instrumentation. In R. Fleischer, E. Meineche-Schmidt, and B. Moret, editors, Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, pages 78-92. Springer-Verlag, 2002.
20. M. Mascagni and A. Srinivasan. Algorithm 806: SPRNG: a scalable library for pseudorandom number generation. ACM Trans. Math. Softw., 26(3):436-461, 2000.