Computational geometry in the parallel external memory model

Continued advances in VLSI scaling combined with unsustainable power consumption of frequency scaling resulted in parallel processors having become mainstream as demonstrated by modern multicores. Current off-the-shelf processors already contain up to 16 cores and the prototypes boast up to 48 cores on a single chip.

[1]  Mikhail J. Atallah,et al.  Parallel algorithms for some functions of two convex polygons , 2005, Algorithmica.

[2]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3]  Norbert Zeh,et al.  I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4]  Guy E. Blelloch,et al.  Provably good multicore cache performance for divide-and-conquer algorithms , 2008, SODA '08.

[5]  Yi-Jen Chiang,et al.  Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep , 1998, Comput. Geom..

[6]  Michael T. Goodrich,et al.  Fundamental parallel algorithms for private-cache chip multiprocessors , 2008, SPAA '08.

[7]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[8]  Michael T. Goodrich,et al.  Parallel external memory graph algorithms , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[9]  Norbert Zeh,et al.  A parallel buffer tree , 2012, SPAA '12.

[10]  Guy E. Blelloch,et al.  Low depth cache-oblivious algorithms , 2010, SPAA '10.

[11]  Vijaya Ramachandran,et al.  Oblivious algorithms for multicores and network of processors , 2010, IPDPS.

[12]  Norbert Zeh,et al.  Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract) , 2010, ESA.

[13]  Lars Arge,et al.  The Buffer Tree: A Technique for Designing Batched External Data Structures , 2003, Algorithmica.