Oblivious algorithms for multicores and networks of processors
From MaRDI portal
(Redirected from Publication:897114)
Recommendations
Cites work
- scientific article; zbMATH DE number 1728434 (Why is no real title available?)
- scientific article; zbMATH DE number 5764815 (Why is no real title available?)
- scientific article; zbMATH DE number 53772 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 910869 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- A bridging model for multi-core computing
- Cache-oblivious algorithms
- Cache-oblivious dynamic programming
- Communication lower bounds for distributed-memory matrix multiplication
- Deterministic coin tossing with applications to optimal parallel list ranking
- Efficient parallel algorithms for some graph problems
- Encyclopedia of parallel computing.
- Network-oblivious algorithms
- Parallel Prefix Computation
- Resource oblivious sorting on multicores
- Revisiting the Cache Miss Analysis of Multithreaded Algorithms
- The cache complexity of multithreaded cache oblivious algorithms
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
Cited in
(8)- A Bridging Model for Multi-core Computing
- Open problems in queueing theory inspired by datacenter computing
- A bridging model for multi-core computing
- Resource oblivious sorting on multicores
- Network-oblivious algorithms
- Resilient dynamic programming
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
- Remote memory references at block granularity
This page was built for publication: Oblivious algorithms for multicores and networks of processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897114)