abstract

Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Authors:

Neeraj Sharma,

Sandeep SenAuthors Info & Claims

SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

Pages 74 - 76

https://doi.org/10.1145/2312005.2312020

Published: 25 June 2012 Publication History

Get Access

Abstract

In this paper we present a cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache. We first derive an O(n/p log n + log n log log n) expected parallel depth algorithm for sorting n numbers with expected O(n/B log_M n) cache misses where p,M and B respectively denote the number of processors, the size of an individual cache memory and the block size respectively. Although similar results have been obtained recently for sorting, we feel that our approach is simpler and general and we apply it to obtain an algorithm for 3D convex hulls with similar bounds.

We also present a simple randomized processor allocation technique without the explicit knowledge of the number of processors that is likely to find additional applications in resource oblivious environments.

References

[1]

A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, pages 1116--1127, 1988.

Digital Library

Google Scholar

[2]

L. Arge, M. T. Goodrich, M. Nelson, and N. Sitchinava. Fundamental parallel algorithms for private-cache chip multiprocessors. In SPAA, pages 197--206, 2008.

Digital Library

Google Scholar

[3]

G. E. Blelloch, P. Gibbons, and H. V. Simhadri. Low depth cache-oblivious algorithms. In SPAA, pages 189--199, 2010.

Digital Library

Google Scholar

[4]

R. Cole and V. Ramachandran. Resource oblivious sorting on multicores. In ICALP, pages 226--237, 2010.

Digital Library

Google Scholar

[5]

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, pages 285--298, 1999.

Digital Library

Google Scholar

[6]

J. H. Reif and S. Sen. Optimal parallel randomized algorithms for 3-d convex hulls and related problems. SIAM Journal on Computing, 21(3):466--485, 1992.

Digital Library

Google Scholar

[7]

R. Reischuk. A fast probabilistic parallel sorting algorithm. In FOCS, pages 212--219, 1981.

Digital Library

Google Scholar

[8]

N. Sharma and S. Sen. Efficient cache oblivious algorithms for randomized divide and conquer on the multicore model. CoRR-abs/1204.6508, available at http://arxiv.org/abs/1204.6508, 2012.

Google Scholar

[9]

L. G. Valiant. A bridging model for multi-core computing. In ESA, pages 13--28, 2008.

Digital Library

Google Scholar

Index Terms

Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Recommendations

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

We study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

We give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our ...

Comments

Information & Contributors

Information

Published In

SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

June 2012

348 pages

ISBN:9781450312134

DOI:10.1145/2312005

General Chair:
Guy Blelloch
Carnegie Mellon University, USA
,
Program Chair:
Maurice Herlihy
Brown University, USA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Abstract

Conference

SPAA '12

Sponsor:

SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures

June 25 - 27, 2012

Pennsylvania, Pittsburgh, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
157
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets

Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity