Uzi Vishkin  Home/Search
Context Related
| umd.edu/users/vishkin/XMT/spaa00.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/users/vishkin/XMT/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy wait to another thread. A thread can proceed till its termination, but no new threads can be formed. What kind of problems can such restrictive algorithms solve and still be competitive in the total number of operations they perform with the fastest serial algorithm for the same problem? Intrigued by this informal question, we considered one of the most elementary... (Update)
Similar documents based on text: More All
0.0: Explicit Instruction Parallel Bridging Models Specifications and.. - Dascal (1998) (Correct)
0.0: Optimal Parallel Approximation Algorithms for Prefix.. - Goodrich, Matias.. (1994) (Correct)
0.0: Persistent Java Objects: A Proposal - Malhotra (1996) (Correct)
BibTeX entry: (Update)
U. Vishkin, "A No-Busy-Wait Balanced Tree Parallel Algorithmic Paradigm," Proc. 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2000. http://citeseer.ist.psu.edu/vishkin00nobusywait.html More
@inproceedings{ vishkin00nobusywait,
author = "Uzi Vishkin",
title = "A no-busy-wait balanced tree parallel algorithmic paradigm",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "147-155",
year = "2000",
url = "citeseer.ist.psu.edu/vishkin00nobusywait.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1575 Computer Architecture - A Quantitative Approach (context) - Hennessy, Patterson - 1996
127 Highly Parallel Computing (context) - Almasi, Gottlieb - 1994
70 A simple parallel tree contraction algorithm (context) - Abrahamson, Dadoun et al. - 1989
58 Parallel Computer Architecture (context) - Culler, Singh - 1999
44 Optimal parallel evaluation of tree-structured computations .. (context) - Kosaraju, Delcher - 1988
26 The accelerated centroid decomposition technique for optimal.. - Cole, Vishkin - 1988
23 List ranking and parallel tree contraction (context) - Reid-Miller, Miller et al. - 1993
11 Experiments with list ranking for Explicit Multi-Threaded - Dascal, Vishkin - 1999
10 Parallel tree contraction part 1: fundamentals (context) - Miller, Reif - 1989
8 Parallel tree contraction part 2: further applications (context) - Miller, Reif - 1991
5 bridging models for instruction parallelism (context) - Vishkin, Dascal et al. - 1998
5 Asynchronous PRAM algorithms (context) - Gibbons - 1993
5 VLSI Architecture: Past (context) - Dally, Lacy - 1999
1 Optimal doubly logarithmic optimal parallel algorithms based.. (context) - Berkman, Schieber et al. - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.umiacs.umd.edu/users/vishkin/XMT/): More
Experiments with List Ranking for Explicit Multi-Threaded.. - Dascal, Vishkin (1999) (Correct)
XMT-M: A Scalable Decentralized Processor - Berkovich, Nuzman, Franklin.. (1999) (Correct)
Explicit Instruction Parallel Bridging Models Specifications and.. - Dascal (1998) (Correct)
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