R. J. Anderson, and L. Snyder, A Comparison of Shared and Nonshared Memory Models of Computation, Proc. IEEE, 79(4) (1993), 480--487. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) (Correct)
....axis parallel segments and discuss an implementation of this version. Section 7 concludes the paper and outlines some important applications. 2 The Coarse Grained Multicomputer Model Speedup results for theoretical PRAM algorithms do not necessarily match the speedups observed on real machines [2, 20]. Given su#cient slackness in the number of processors, Valiant s BSP approach [22] simulates PRAM algorithms optimally on distributed memory parallel systems. Valiant points out, however, that one may want to design algorithms that utilize local computations and minimize global operations [21, ....
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation", in Proc. of the IEEE, 79(4), 1979, pp. 480-487.
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (1997) (18 citations) (Correct)
....Brasil, edson dct.ufms.br Univ. of S ao Paulo, S ao Paulo, Brazil, song ime.usp.br k Facolta di Scienze Mat. Fis. e Nat. Mestre, Italia, roncato dsi.unive.it 1 Introduction Speedup results for theoretical PRAM algorithms do not necessarily match the speedups observed on real machines [1] [36] Given sufficient slackness in the number of processors, Valiant s BSP approach[39]simulates PRAM algorithms optimally on distributed memory parallel systems. Valiant points out, however, that one maywant to design algorithms that utilize local computations and minimize global operations ....
R.J. Anderson, and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation," Proc. of the IEEE, 79(4), pp. 480--487.
A Randomized BSP/CGM Algorithm for the Maximal Independent Set.. - Schabanel (Correct)
.... best known deterministic distributed algorithm is intricate and takes O(n o(1) time [3] Parallel models of computation On the other hand, from the parallel systems viewpoint, theoretical speedups obtained with PRAM algorithms do not necessarily match the speedups observed on real machines [2]. Given sufficient slackness in the number of processors, Valiant s Bulk Synchronous Parallel (BSP) approach overcomes this obstacle, yielding optimal simulation of PRAM algorithms by distributed memory parallel systems, in which g = local computation speed router bandwidth is low, or fixed, ....
R.J. Anderson and L. Snyder. A comparison of shared and nonshared memory models of computation. Proceedings of the IEEE, 79(4):480--487, 1997.
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. (Correct)
No context found.
R. J. Anderson, and L. Snyder, A Comparison of Shared and Nonshared Memory Models of Computation, Proc. IEEE, 79(4) (1993), 480--487.
Coarse Grained Parallel Maximum Matching In Convex Bipartite.. - Bose Chan Dehne (1999) (4 citations) (Correct)
No context found.
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation. " Proc. of IEEE, vol 79(4),pp.480-487.
Randomized Parallel List Ranking For - Distributed Memory Multiprocessors (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
EfficientParallel Graph Algorithms For Coarse - Grained Multicomputers And (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) (Correct)
No context found.
R. J. Anderson and L. Snyder, A comparison of shared and nonshared memory models of computation, Proc. IEEE 79, 4 (1979), 480#487.
Coarse Grained Parallel Maximum Matching in Convex.. - Bose, Chan, Dehne, Latzel (1999) (4 citations) (Correct)
No context found.
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation. " Proc. of IEEE, vol 79(4),pp.480-487.
Randomized Parallel List Ranking For - Distributed Memory Multiprocessors (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
No context found.
R. J. Anderson, and L. Snyder, A Comparison of Shared and Nonshared Memory Models of Computation, Proc. IEEE, 79(4) (1993), 480--487.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) (Correct)
No context found.
R. J. Anderson and L. Snyder, A comparison of shared and nonshared memory models of computation, Proc. IEEE 79, 4 (1979), 480#487.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) (Correct)
No context found.
R. J. Anderson and L. Snyder, A comparison of shared and nonshared memory models of computation, Proc. IEEE 79, 4 (1979), 480#487.
Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002) (18 citations) (Correct)
No context found.
R. J. Anderson, and L. Snyder, A Comparison of Shared and Nonshared Memory Models of Computation, Proc. IEEE, 79(4) (1993), 480--487.
Coarse Grained Parallel Maximum Matching in Convex.. - Bose, Chan, Dehne, Latzel (1999) (4 citations) (Correct)
No context found.
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation. " Proc. of IEEE, vol 79(4),pp.480-487.
Randomized Parallel List Ranking For Distributed Memory.. - Dehne, Song (1996) (4 citations) (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Randomized Parallel List Ranking for Distributed Memory.. - Dehne, Song (1996) (4 citations) (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Coarse Grained Parallel Maximum Matching in Convex.. - Bose, Chan, Dehne, Latzel (1999) (4 citations) (Correct)
No context found.
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation. " Proc. of IEEE, vol 79(4),pp.480-487.
Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002) (18 citations) (Correct)
No context found.
R. J. Anderson, and L. Snyder, A Comparison of Shared and Nonshared Memory Models of Computation, Proc. IEEE, 79(4) (1993), 480--487.
A Randomized Parallel Three-Dimensional Convex Hull.. - Dehne, Deng, Dymond, al. (1997) (Correct)
No context found.
R.J. Anderson and L. Snyder. A Comparison of Shared and Nonshared Memory Models of Computation. Proceedings of IEEE, Vol. 79, No. 4, pages 480--487, 1995.
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (18 citations) (Correct)
No context found.
R.J. Anderson, andL.Snyder, "A Comparison of Shared andNonshared Memory Models of Computation," in Proc. of the IEEE, 79(4), pp. 480-487.
Coarse Grained Parallel Maximum Matching in Convex.. - Bose, Chan, Dehne, Latzel (1999) (4 citations) (Correct)
No context found.
R.J. Anderson and L. Snyder, "A Comparison of Shared and Nonshared Memory Models of Computation. " Proc. of IEEE, vol 79(4),pp.480-487.
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (1 citation) (Correct)
No context found.
R. J. Anderson and L. Snyder, A comparison of shared and nonshared memory models of computation, Proc. IEEE 79, 4 (1979), 480#487.
First 50 documents
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