Abstract
Algorithms for the problem of list ranking are empirically studied with respect to the Explicit Multi-Threaded (XMT) platform for instruction-level parallelism (ILP). The main goal of this study is to understand the differences between XMT and more traditional parallel computing implementation platforms/models as they pertain to the well studied list ranking problem. The main two findings are: (i) Good speedups for much smaller inputs are possible. (ii) In part, this finding is based on competitive performance by a new variant of a 1984 algorithm, called the No-Cut algorithm. The paper incorporates analytic (non-asymptotic) performance analysis into experimental performance analysis for relatively small inputs. This provides an interesting example where experimental research and theoretical analysis complement one another.1
Explicit Multi-Threading (XMT) is a fine-grained computation framework introduced in our SPAA’98 paper. Building on some key ideas of parallel computing, XMT covers the spectrum from algorithms through architecture to implementation; the main implementation related innovation in XMT was through the incorporation of low-overhead hardware and software mechanisms (for more effective fine-grained parallelism). The reader is referred to that paper for detail on these mechanisms. The XMT platform aims at faster single-task completion time by way of ILP.
Partially supported by NSF grant CCR-9416890 at U. Maryland.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson R. and Miller G.L. A Simple randomized parallel algorithm for list-ranking. Information Processing Letters, 33(5), 1990, 269–273.
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.
Cole R. and Vishkin U. Faster optimal parallel prefix sums and list ranking. Information and Computation 81(3), 1989, 334–352.
W.J. Dally and S. Lacy. VLSI Architecture: Past, Present, and Future, Proc. Advanced Research in VLSI Conference, Atlanta, March 1999.
S. Dascal and U. Vishkin. Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism (extended summary), UMIACS-TR-99-33, June 1999.
Hennessy J.L., Patterson D.A., Computer Organization and Design-The Hardware / Software Interface. Morgan/Kaufmann. 1994.
Hennessy J.L., Patterson D.A., Computer Architecture-A Quantitative Approach, 2nd Edition. Morgan/Kaufmann. 1996.
Hsu T. and Ramachandran V. Efficient massively parallel implementation of some combinatorial problems. Theor. Comp. Sci. 6(2), 1996, 297–322.
Miller G.L. and Reif J.H. Parallel tree contraction and its applications. In Proc. Symposium on Foundations of Computer Science, 1985, 478–489.
Reid-Miller M. List ranking and list scan on the Cray C90. In Proc. 6th ACM-SPAA, 1994, 104–113.
Sibeyn J.F. Better Trade-Offs for parallel list ranking. In Proc. 9th ACM-SPAA, 1997, 221–230.
Sibeyn J.F. From Parallel to external list ranking. TR-MPI-I-97-1-021, Max-Planck-Institut Fur Informatik, Saarbrucken, Germany, 1997.
Sibeyn J.F., Guillaume F. and Seidel T. Practical parallel list ranking. Preprint, 1997.
Traff J.L. List ranking on the PRAM. The PAD Library Documentation, Max-Planck-Institut fur Informatik, Saarbrucken, 1996.
Vishkin U. Randomized speed-ups in parallel computation. In Proc. 16th ACM-STOC, 1984, 230–239.
Vishkin U. From algorithm parallelism to instruction-level parallelism: An encode-decode chain using preffix-sum. In Proc. 9th ACM-SPAA, 1997, 260–271.
Vishkin U. et al. 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 http://www.umiacs.umd.edu/~;vishkin/XMT/.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dascal, S., Vishkin, U. (1999). Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-48318-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66427-7
Online ISBN: 978-3-540-48318-2
eBook Packages: Springer Book Archive