#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1986

2018

- This year (11)
- Last 5 years (62)
- Last 10 years (109)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Aapo Kyrola, Guy E. Blelloch, Carlos Guestrin
- OSDI
- 2012

Current systems for graph computation require a distributed computing cluster to handle very large real-world problems, such as analysis on social networks or the web graph. While distributedâ€¦ (More)

- Guy E. Blelloch
- 1990

ion, level of, 24 access-fixed code, 150, 217 access-restricted code, 149, 217 algorithm, biconnectivity, 114 binary search, 94 closest pair, 98 halving merge, 54 k-D tree, 96 line-drawing, 50â€¦ (More)

- Julian Shun, Guy E. Blelloch
- PPOPP
- 2013

There has been significant recent interest in parallel frameworks for processing graphs due to their applicability in studying social networks, the Web graph, networks in biology, and unstructuredâ€¦ (More)

- Guy E. Blelloch
- Commun. ACM
- 1996

In the past 20 years there has been treftlen-dous progress in developing and analyzing parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most problems for whichâ€¦ (More)

- Guy E. Blelloch
- IEEE Trans. Computers
- 1987

AbstmctIn most parallel random access machine (PRAM) models, memory references are assumed to take unit time. In practice, and in theory, certain scan operations, also known as prefix computations,â€¦ (More)

- Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
- Theory of Computing Systems
- 2000

This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlled shared-memory machines. We present lower and upper bounds on the number of cache misses usingâ€¦ (More)

This paper gives an overview of the implementation of NESL, a portable nested data-parallel language. This language and its implementation are the first to fully support nested data structures asâ€¦ (More)

We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif andâ€¦ (More)

- Julian Shun, Guy E. Blelloch, +4 authors Kanat Tangwongsan
- SPAA
- 2012

This announcement describes the problem based benchmark suite (PBBS). PBBS is a set of benchmarks designed for comparing parallel algorithmic approaches, parallel programming language styles, andâ€¦ (More)

- Perry Cheng, Guy E. Blelloch
- PLDI
- 2001

We describe a parallel, real-time garbage collector and present experimental results that demonstrate good scalability and good real-time bounds. The collector is designed for shared-memoryâ€¦ (More)