S. Dascal and U. Vishkin. Experiments with List Ranking on ExplicitMu lti Threaded (XMT) Instru3N on Parallelism. In 3rd Workshop on Algorithms Engineering (WAE-99), me 1668 of Lecture Notes in Computer Science, page 43 #, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....algorithm is faster for large inputs, for smaller inputs a new variant of [Vi84] called the No Cut algorithm, offers competitive performance. iii) Analytic (non asymptotic) performance analysis is possible for smaller inputs. Due to space limitations, we must refer interested readers to [DV99]. 2 List Ranking Algorithms The input is an array of N elements, each having a pointer to its successor in a linked list (the successor can be anywhere in the array) The pointer is labeled with the distance it represents. The list ranking problem is to find for each element in the list its ....

....such an increase for cost effective performance improvement of existing code. Our building blocks for parallel list ranking are several parallel algorithms each of which is non dominated, i.e. for each of these algorithms there is some input size and some P value for which it is the fastest. [DV99] describes low and high level considerations that were involved in getting the best performance out of each algorithm, and for assembling them in line with the accelerating cascades technique (see [CV86a] This section discusses particularly noteworthy issues related to work and time analysis of ....

[Article contains additional citation context not shown here]

S. Dascal and U. Vishkin. Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism (extended summary), UMIACS-TR-99-33, June 1999.

.... parallelism Previous papers on XMT have discussed in detail its fine grained SPMD multi threaded programming model, architectural support for concurrently executing multiple contexts on chip, and preliminary evaluation of several parallel algorithms using handcoded assembly programs [VDB 98] [DV99]. A more recent paper describes the prototype XMT programming environment, including the XMT compiler and simulator [N 00] In this paper, we describe features of the XMT programming model that were designed for exploiting on chip parallelism, and evaluate their impact on both programmability and ....

S. Dascal and U. Vishkin, "Experiments with List Ranking on Explicit Multi-Threaded (XMT) Instruction Parallelism," Proc. 3rd Workshop on Algorithms Engineering (WAE-99), July 1999, London, U.K.

....of applications. Previous papers on XMT have discussed in detail its fine grained SPMD multi threaded programming model, architectural support for concurrently executing multiple contexts on chip, and preliminary evaluation of several parallel algorithms using handcoded assembly programs [VDB 98] [DV99]. The introduction of an XMT compiler allows us to evaluate XMT for the first time as a complete environment ( vertical prototyping ) using a much larger benchmark suite (with longer codes) than before. Due to the rather broad nature of our work, specialized parts of the work the evaluation of ....

S. Dascal and U. Vishkin, "Experiments with List Ranking on Explicit Multi-Threaded (XMT) Instruction Parallelism," Proc. 3rd Workshop on Algorithms Engineering (WAE-99), July 1999, London, U.K.

.... on chip parallelism Previous papers on XMT have discussed in detail its fine grained SPMD multithreaded programming model, architectural support for concurrently executing multiple contexts on chip, and preliminary evaluation of several parallel algorithms using hand coded assembly programs [14] [6]. A more recent paper describes the prototype XMT programming environment, including the XMT compiler and simulator [11] In this paper, we describe features of the XMT programming model that were designed for exploiting on chip parallelism, and evaluate their impact on both programmability and ....

S. Dascal and U. Vishkin, "Experiments with List Ranking on Explicit Multi-Threaded (XMT) Instruction Parallelism," Proc. 3rd Workshop on Algorithms Engineering (WAE99) , July 1999, London, U.K.

....instruction. Previous papers on XMT have discussed in detail its fine grained SPMD multi threaded programming model, architectural support for concurrently executing multiple contexts on chip, and preliminary evaluation of several parallel algorithms using hand coded assembly programs [VDB 98] [DV99]. In this paper, we evaluate XMT for the first time as a complete environment, including compiler and hardware simulator. The main contributions of this paper are as follows: We present details of a prototype implementation of XMT, including compiler and code shape. We experimentally ....

S. Dascal and U. Vishkin, "Experiments with List Ranking on Explicit Multi-Threaded (XMT) Instruction Parallelism," Proc. 3rd Workshop on Algorithms Engineering (WAE-99), July 1999, London, U.K.

.... list ranking algorithms, using the Euler tour technique with one exception: the computation of the right (and left) nearest larger elements, which is is an interesting instance of the all nearest smaller values (ANSV) problem [BSV93] Practical XMT list ranking techniques have been discussed in [DS99]. We have nothing new to add about this stage beyond [CV88a] and [DS99] A no busy wait parallel algorithm for our ANSV problem We refer the reader to [BSV93] for background and PRAM algorithms for the ANSV problem. Next, we jump directly to the no busy wait algorithm. Given are an array s1 ; s2 ....

.... the computation of the right (and left) nearest larger elements, which is is an interesting instance of the all nearest smaller values (ANSV) problem [BSV93] Practical XMT list ranking techniques have been discussed in [DS99] We have nothing new to add about this stage beyond [CV88a] and [DS99]. A no busy wait parallel algorithm for our ANSV problem We refer the reader to [BSV93] for background and PRAM algorithms for the ANSV problem. Next, we jump directly to the no busy wait algorithm. Given are an array s1 ; s2 ; sk of size k, where the s i values, k, a i , 2 i k, and n ....

S. Dascal and U. Vishkin. Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism (extended abstract). In Proc. 3rd Workshop on Algorithms Engineering (WAE'99), London, U.K., July 1999.

....OSes [25] In the serial algorithm, we traverse the list and rewrite it in the proper order. For the XMT version, we use two algorithms: 1) Wyllie s pointer jumping algorithm [18] for the 50 and 500 sized inputs and (2) the no cut coin tossing algorithm for the 5K and 250K sized inputs. The work [10] presented discussion of the various list ranking algorithms on XMT. 50 item array, 500 item array, 5K item array, 250K item array. A variant of radix sort. It sorts integers from a range of values by applying binsort in iterations for a smaller range. For speed up evaluations, one would wish to ....

S. Dascal and U. Vishkin, "Experiments with List Ranking on Explicit Multi-Threaded (XMT) Instruction Parallelism, " Proc. 3rd Workshop on Algorithms Engineering (WAE-99), July 1999, London, U.K. Downloadable from http://www.umiacs.umd.edu/~vishkin/XMT/.

No context found.

S. Dascal and U. Vishkin. Experiments with List Ranking on ExplicitMu lti Threaded (XMT) Instru3N on Parallelism. In 3rd Workshop on Algorithms Engineering (WAE-99), me 1668 of Lecture Notes in Computer Science, page 43 #, 1999.

No context found.

S. Dascal and U. Vishkin. Experiments with List Ranking on ExplicitMu lti Threaded (XMT) Instru3N on Parallelism. In 3rd Workshop on Algorithms Engineering (WAE-99), me 1668 of Lecture Notes in Computer Science, page 43 #, 1999.

No context found.

S. Dascal and U. Vishkin. Experiments with List Ranking on ExplicitMu lti Threaded (XMT) Instru3N on Parallelism. In 3rd Workshop on Algorithms Engineering (WAE-99), me 1668 of Lecture Notes in Computer Science, page 43 #, 1999.

No context found.

S. Dascal and U. Vishkin. Experiments with List Ranking on ExplicitMu lti Threaded (XMT) Instru3N on Parallelism. In 3rd Workshop on Algorithms Engineering (WAE-99), me 1668 of Lecture Notes in Computer Science, page 43 #, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC