About: Cannon's algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Cannon's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by . It is especially suitable for computers laid out in an N × N mesh. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 2D grids has been shown to be difficult. The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors.

Attributes	Values
rdf:type	software
rdfs:label	Cannon's algorithm (en)
rdfs:comment	In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by . It is especially suitable for computers laid out in an N × N mesh. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 2D grids has been shown to be difficult. The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors. (en)
sameAs	Cannon's algorithm Cannon's algorithm
dbp:wikiPageUsesTemplate	dbt:Numerical_linear_algebra dbt:Mathapplied-stub
Subject	Distributed algorithms Mesh networking Matrix multiplication algorithms
Link from a Wikipage to an external page	https://web.archive.org/web/20070703035731/http:/www.cs.mu.oz.au/498/notes/node30.html http://www.cs.berkeley.edu/~demmel/cs267/lecture11/lecture11.html http://code.google.com/p/elemental/
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Cannon's_algorithm?oldid=1020536525&ns=0
Wikipage page ID	12022054 (xsd:integer)
page length (characters) of wiki page	5695 (xsd:nonNegativeInteger)
Wikipage revision ID	1020536525 (xsd:integer)
Link from a Wikipage to another Wikipage	Distributed algorithms Mesh networking Distributed algorithm Mesh networking Computer science ScaLAPACK Systolic array LAPACK Matrix multiplication algorithm Matrix multiplication algorithms dbr:Lynn_Elliot_Cannon
has abstract	In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by . It is especially suitable for computers laid out in an N × N mesh. While Cannon's algorithm works well in homogeneous 2D grids, extending it to heterogeneous 2D grids has been shown to be difficult. The main advantage of the algorithm is that its storage requirements remain constant and are independent of the number of processors. The Scalable Universal Matrix Multiplication Algorithm (SUMMA)is a more practical algorithm that requires less workspace and overcomes the need for a square 2D grid. It is used by the ScaLAPACK, PLAPACK, and Elemental libraries. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Cannon's_algorithm
is Link from a Wikipage to another Wikipage of	List of numerical analysis topics List of algorithms Matrix multiplication algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Cannon's_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software