Oblivious algorithms for multicores and networks of processors

DOI10.1016/j.jpdc.2013.04.008zbMath1327.68327OpenAlexW2028637981MaRDI QIDQ897114

Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley, Rezaul Alam Chowdhury

Publication date: 17 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2013.04.008

zbMATH Keywords

networkcacheconnected componentssortingFFTlist rankingmulticoreGaussian elimination paradigmmatrix transpositionoblivious algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items

Unnamed Item, The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation, Resilient dynamic programming, Open problems in queueing theory inspired by datacenter computing

Uses Software

• Chapel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• A bridging model for multi-core computing
• The cache complexity of multithreaded cache oblivious algorithms
• Communication lower bounds for distributed-memory matrix multiplication
• Revisiting the Cache Miss Analysis of Multithreaded Algorithms
• Encyclopedia of Parallel Computing
• Network-Oblivious Algorithms
• Cache-Oblivious Algorithms
• Cache-oblivious dynamic programming
• Resource Oblivious Sorting on Multicores
• Deterministic coin tossing with applications to optimal parallel list ranking
• A Separator Theorem for Planar Graphs
• Parallel Prefix Computation
• Efficient parallel algorithms for some graph problems