12 citations found. Retrieving documents...
M. Reid-Miller, List Ranking and List Scan on the Cray C-90, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 104--113.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001)   (1 citation)  (Correct)

....significant in our case, nearly optimal parallel speedup for this class of problems. 3. An example of experimental performance analysis for a nontrivial parallel implementation. 2 Related Work Several groups have conducted experimental studies of graph algorithms on parallel architectures [19, 20, 26, 39, 40, 44]. Their approach to producing a parallel program is similar to ours (especially that of Ramachandran et al. 17] but their test platforms have not provided them with a true, scalable, UMA shared memory environment or have relied on ad hoc hardware [26] Thus ours is the first study of speedup ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. Journal of Computer and System Sciences, 53(3):344--356, December 1996.


Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001)   (1 citation)  (Correct)

....significant in our case, nearly optimal parallel speedup for this class of problems. 3. An example of experimental performance analysis for a nontrivial parallel implementation. 2 Related Work Several groups have conducted experimental studies of graph algorithms on parallel architectures [19, 20, 26, 39, 40, 44]. Their approach to producing a parallel program is similar to ours (especially that of Ramachandran et al. 17] but their test platforms have not provided them with a true, scalable, UMA shared memory environment or have relied on ad hoc hardware [26] Thus ours is the first study of speedup ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. In Proceedings Symposium on Parallel Algorithms and Architectures, pages 104--113, Cape May, NJ, June 1994.


Evaluating Arithmetic Expressions Using Tree.. - Bader, Sreshta.. (2002)   (Correct)

....un on the CoarXO Gr ained Multicomputer (CGM)par allel machine model with ppr in p)communicationr ounds with O local computation per r ound. 2 Related Experimental Work Sever al gr oups have conducted exper imental studies of gr aph algor ithms on par allel a r hitecturz (for example, [11, 12, 14, 18, 20, 9] . However none of these r elated wor ks use test platfor ms thatpr ovide atr ue, scalable, UMA shar edmemor y envir onment and still other studies haver elied on ad hoc har war [14] Thus our s is the fir st study of speedup for over tens of pr ocessor s (andpr omise to scale over a significantr ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. J. Comput. Syst. Sci., 53(3):344--356, December 1996. 65


Evaluating Arithmetic Expressions using Tree.. - Bader, Sreshta.. (2002)   (Correct)

....on the CoarseGrained Multicomputer (CGM) parallel machine model with p processors in O(log p) communication rounds with O local computation per round. 2 Related Experimental Work Several groups have conducted experimental studies of graph algorithms on parallel architectures (for example, [11, 12, 14, 18, 20, 9]) However, none of these related works use test platforms that provide a true, scalable, UMA shared memory environment and still other studies have relied on ad hoc hardware [14] Thus ours is the first study of speedup for over tens of processors (and promise to scale over a significant range of ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. J. Comput. Syst. Sci., 53(3):344-- 356, December 1996.


Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001)   (1 citation)  (Correct)

....in our case, near y optimal parx lel speedup for this class ofprO lems. 3. An example ofexper mentalper o r ance analysis for a nontr vial par3 lel implementation. 2 Related Work Sever al gr ou s have conducted exer imental studies of gr a h algor ithms on ar allel a r hitectur; [19,20,26,39,40,44].Their ar oach tor oducing a ar allel relpO is similar to our s (es ecially that of Ramachandr an et al. 17] but their test latfor ms have notr ovided them with atr ue, scalable, UMA shar edmemor envirxF;X t or haver elied on ad hoc har war [26] Thus our s is the fir st study of s eedu over a ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. Journal of Computer and System Sciences, 53(3):344--356, December 1996. 131


Using PRAM Algorithms on a Uniform-Memory-Access.. - Bader, Illendula, .. (2001)   (1 citation)  (Correct)

....in our case, near y optimal parx lel speedup for this class ofprO lems. 3. An example ofexper mentalper o r ance analysis for a nontr vial par3 lel implementation. 2 Related Work Sever al gr ou s have conducted exer imental studies of gr a h algor ithms on ar allel a r hitectur; [19,20,26,39,40,44].Their ar oach tor oducing a ar allel relpO is similar to our s (es ecially that of Ramachandr an et al. 17] but their test latfor ms have notr ovided them with atr ue, scalable, UMA shar edmemor envirxF;X t or haver elied on ad hoc har war [26] Thus our s is the fir st study of s eedu over a ....

M. Reid-Miller. List ranking and list scan on the Cray C-90. In Proceedings Symposium on Parallel Algorithms and Architectures, pages 104--113, Cape May, NJ, June 1994. 131


DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica..   (Correct)

No context found.

M. Reid-Miller, List Ranking and List Scan on the Cray C-90, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 104--113.


Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002)   (18 citations)  (Correct)

No context found.

M. Reid-Miller, List Ranking and List Scan on the Cray C-90, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 104--113.


Efficient Parallel Graph Algorithms for Coarse-Grained.. - Dehne, Ferreira, E. (2002)   (18 citations)  (Correct)

No context found.

M. Reid-Miller, List Ranking and List Scan on the Cray C-90, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 104--113.


Efficient Parallel Graph Algorithms for.. - Dehne, Ferreira.. (2002)   (18 citations)  (Correct)

No context found.

M. Reid-Miller, List Ranking and List Scan on the Cray C-90, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 104--113.


The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998)   (7 citations)  (Correct)

No context found.

M. Reid-Miller. List ranking and list scan on the Cray C-- 90. Journal of Computer and System Sciences, 53(3):344--356, December 1996.


The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998)   (7 citations)  (Correct)

No context found.

M. Reid-Miller. List ranking and list scan on the Cray C-- 90. Journal of Computer and System Sciences, 53(3):344--356, December 1996.

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