Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism

ACM Journal of Experimental Algorithmics

Volumn 5, Issue , 2000, Pages 10-

  Dascal, Shlomit ^a   Vishkin, Uzi ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858665952     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/351827.384252     Document Type: Article

References (25)

1. Anderson R. and Miller G.L. A Simple randomized parallel algorithm for list-ranking. Information Processing Letters, 33(5), 1990, 269-273.
2. Cole R. and Vishkin U. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proc. 18th Annual ACM Symp. on Theory of Computing, 1986, 206-219.
3. Cole R. and Vishkin U. Faster optimal parallel prefix sums and list ranking. Information and Computation 81(3), 1989, 334-352.
4. D.E. Culler and J.P. Singh. Parallel Computer Architecture. Morgan Kaufmann, 1999.
5. W.J. Dally and S. Lacy. VLSI Architecture: Past, Present, and Future, Proc. Advanced Research in VLSI Conference, Atlanta, March 1999.
6. S. Dascal. Experiments with List Ranking Algorithms for Explicit Instruction Parallelism. M.Sc. Thesis. Department of Computer Science, Tel Aviv University, August 1998.
7. S. Dascal. Explicit Multi-Threading (XMT) bridging models - specifications and assumptions, UMIACS-TR 2000-74, 1998. See also a document entitled “Specifications and Assumptions” under http ://www.umiacs.umd.edu/~vishkin/XMT/.
8. S. Dascal and U. Vishkin. Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism (extended summary), UMIACS-TR-99-33, June 1999.
9. Hennessy J.L., Patterson D.A., Computer Organization and Design - The Hardware / Software Interface. Morgan/Kaufmann. 1994.
10. Hennessy J.L., Patterson D.A., Computer Architecture - A Quantitative Approach, 2nd Edition. Morgan/Kaufmann. 1996.
11. Hsu T. and Ramachandran V. Efficient massively parallel implementation of some combinatorial problems. Theor. Comp. Sci. 6(2), 1996, 297-322.
12. Knuth D.E. The Art of Computer Programming, Vol. 2 - Seminumerical Algorithms, 2nd Edition. Addison-Wesley. 1981.
13. Miller G.L. and Reif J.H. Parallel tree contraction and its applications. In Proc. Symposium on Foundations of Computer Science, 1985, 478-489.
14. th Workshop on Multi-Threaded Execution, Architecture and Compilation (MTEA C2000), December 2000 (held in conjunction with the 33rd Int. Symp. on Microarchitecture MICRO-33).
15. Ranade A. A simple list ranking algorithm. In Proc. Int. Conj. of High Performance Computing, December 1998.
16. Reid-Miller M. List ranking and list scan on the Cray C90. In Proc. 6th ACM-SPAA, 1994, 104-113.
17. Sibeyn J.F. Better Trade-Offs for parallel list ranking. In Proc. 9th ACM-SPAA, 1997, 221-230.
18. Sibeyn J.F. From Parallel to external list ranking. TR-MPI-I-97-1-021, Max-Planck-Institut Fur Informatik, Saarbrucken, Germany, 1997.
19. Sibeyn J.F., Guillaume F. and Seidel T. Practical parallel list ranking. Journal of Parallel and Distributed Computing, 56(2), 1999, 156-180.
20. Sibeyn J.F. Ultimate parallel list ranking? In Proc. Int. Conf. of High Performance Computing, December 1999.
21. Traff J.L. List ranking on the PRAM. The PAD Library Documentation, Max-Planck-Institut fur Informatik, Saarbrucken, 1996.
22. Vishkin U. Randomized speed-ups in parallel computation. In Proc. 16th ACM-STOC, 1984, 230-239.
23. Vishkin U. From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum. In Proc. 9th ACM-SPAA, 1997, 260-271.
24. Vishkin U., S. Dascal, E. Berkovich and J. Nuzman. Explicit Multi-Threading (XMT) bridging models for instruction parallelism (extended abstract). In Proc. SPAA ’98, 1998. For greater detail see the extended summary of this extended abstract under
25. http ://www.umiacs.umd.edu/~vishkin/XMT/. U. Vishkin. A no-busy-wait balanced tree parallel algorithmic paradigm. In Proc. 12th A CM Symposium on Parallel Algorithms and Architectures (SPAA), 2000.