Exploring the performance of massively multithreaded architectures

Concurrency and Computation: Practice and Experience

Volumn 22, Issue 5, 2010, Pages 588-616

  Bokhari, Shahid ^a   Saltz, Joel ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b EMORY UNIVERSITY   (United States)

Author keywords

Cray MTA; Cray XMT; IBM x3755; Itanium; Multicore; Multithreading; Opteron; Parallel algorithms; Parallel computing; SGI Altix; Shared memory

Indexed keywords

DYNAMIC PROGRAMMING; MULTITASKING; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; SUPERCOMPUTERS;

CRAY MTA; CRAY XMT; IBM X3755; ITANIUM; MULTI CORE; MULTI-THREADING; OPTERON; SGI ALTIX; SHARED MEMORY;

MEMORY ARCHITECTURE;

EID: 77949582630     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1484     Document Type: Article

References (28)

1. Alverson G, Alverson R, Callahan D, Koblenz B, Porterfield A, Smith B. Exploiting heterogeneous parallelism on a multithreaded multiprocessor. Proceedings of the International Conference on Supercomputing, Washington, DC, 1992; 188-1187
2. Alverson R, Callahan D, Cummings D, Koblenz B, Porterfield A, Smith B. The Tera computer system. Proceedings of the International Conference on Supercomputing, Amsterdam, 1990; 1-6.
3. Snavely A, Carter L, Boisseau J, Majumdar A, Gatlin KS, Mitchell N, Feo J, Koblenz B. Multi-processor performance on the Tera MTA. Supercomputing'98: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM). IEEE Computer Society: Washington, DC, 1998; 1-8.
4. Anderson W, Briggs P, Hellberg CS, Hess DW, Khokhlov A, Lanzagorta M, Rosenberg R. Early experience with scientific programs on the Cray MTA-2. SC'03: Proceedings of the 2003 ACM/IEEE Conference on Supercomputing. IEEE Computer Society: Washington, DC, 2003; 46.
5. Bokhari SH, Glaser MA, Jordan HF, Lansac Y, Sauer JR, Van Zeghbroeck B. Parallelizing a DNA simulation code for the Cray MTA-2. Proceedings of the IEEE Computer Society Bioinformatics Conference, Stanford, CA, 2002; 291-302.
6. Bokhari SH, Sauer JR. A parallel graph decomposition algorithm for DNA sequencing with nanopores. Bioinformatics 2005; 21(7):889-896. Web published: 11 November 2004.
7. Feo J, Harper D, Kahan S, Konecny P. Eldorado. CF'05: Proceedings of the Second International Conference on Computing Frontiers. ACM: New York, NY, 2005; 28-34.
8. Nieplocha J, Má rquez A, Feo J, Chavarría D, Chin G, Scherrer C, Beagley N. Evaluating the potential of multithreaded platforms for irregular scientific computations. CF'07: Proceedings of the Fourth International Conference on Computing Frontiers. ACM: New York, NY, 2007; 47-58.
9. Plimpton S, Hendrickson B, Burns S, McLendon III W. Parallel algorithms for radiation transport on unstructured grids. Proceedings of the IEEE/ACM Supercomputing Conference, Dallas, TX, 2000; 25.
10. Gardner DR, Vaughan CT. The development and performance of a message-passing version of the PAGOSA shock-wave physics code. Technical Report SAND97-2551, Sandia National Laboratories, October 1997.
11. Norton A, Melton E. A class of boolean linear transformations for conflict-free power-of-two stride access. Proceedings of the 1987 International Conference on Parallel Processing, University Park, PA, 1987; 247-254.
12. Bokhari S, Sauer J. Parallel algorithms for bioinformatics. Parallel Computing for Bioinformatics, Zomaya A (ed.). Wiley: New York, 2006; 509-529.
13. Bokhari SH, Sauer JR. Sequence alignment on the Cray MTA-2. Concurrency and Computation 2004; 16:823-839.
14. Cray Inc. Cray XMT system overview. Document S-2466-12, 2008.
15. Bokhari S, Saltz J. Exploring the performance of massively multithreaded architectures. Technical Report OSUBMI-TR-2009-n01, Department of Biomedical Informatics, The Ohio State University, 2009. Available at: bmi.osu.edu/~shahid/ mtaxmt [16 July 2009].
16. Stone HS. Parallel processing with the perfect shuffle. IEEE Transactions on Computers 1971; C-30(5):153-161.
17. Cormen TH, Rivest RL, Leiserson CE, Stein C. Introduction to Algorithms (2nd edn). McGraw-Hill: New York, 2001.
18. Brandt A. Guide to multigrid development. Multigrid Methods (Lecture Notes in Mathematics), Hackbusch W, Trottenberg U (eds.). Springer: Berlin, 1981; 960.
19. Bokhari SH. Multiprocessing the Sieve of Eratosthenes. IEEE Computer 1987; 20(4):50-58.
20. Crandall R, Pomerance C. Prime Numbers: A Computational Perspective. Springer: New York, 2001.
21. Knuth DE. Sorting and Searching. The Art of Computer Programming, vol.3. Addison-Wesley: Reading, MA, 1973.
22. Hoare CAR. Quicksort: Algorithm 64. Communications of the ACM 1961; 4(7):321.
23. Stone HS. High-performance Computer Architecture (3rd edn). Addison-Wesley: Reading, MA, 1993.
24. Heidelberger P, Norton A, Robinson JT. Parallel quicksort using fetch-and-add. IEEE Transactions on Computers 1990; 39(1):133-138.
25. Pfister GF, Brantley WC, George DA, Harvey SL, Kleinfelder WJ, McAuliffe KP, Melton ES, Norton VA, Weiss J. The IBM research parallel processor prototype (RP3): Introduction and architecture. International Conference on Parallel Processing, University Park, PA, 1985; 764-771.
26. Gottlieb A, Grishman R, Kruskal CP, McAuliffe KP, Rudolph L, Snir M. The NYU Ultracomputer: Designing an MIMD shared memory parallel computer. IEEE Transactions on Computers 1983; 32(2):175-189.
27. Jordan HF, Alaghband G. Fundamentals of Parallel Processing. Prentice-Hall: Upper Saddle River, NJ, 2003.
28. Gusfield D. Algorithms on Strings, Trees, and Sequences. Cambridge University Press: Cambridge, 1997