Fast 3D Block Parallelisation for the Matrix Multiplication Prefix Problem
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 39-50
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Parallelising Matrix Operations on Clusters for an Optimal Control-Based Quantum CompilerLecture Notes in Computer Science, 2006
- Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithmsJournal of Magnetic Resonance, 2005
- Communication lower bounds for distributed-memory matrix multiplicationJournal of Parallel and Distributed Computing, 2004
- Quantum technology: the second quantum revolutionPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2003
- A One-Way Quantum ComputerPhysical Review Letters, 2001
- Persistent Entanglement in Arrays of Interacting ParticlesPhysical Review Letters, 2001
- Scalability of Parallel Algorithms for Matrix Multiplication1993
- Parallel Prefix ComputationJournal of the ACM, 1980