This HTML5 document contains 55 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
n8https://web.archive.org/web/20070703035731/http:/www.cs.mu.oz.au/498/notes/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n21https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n9http://www.cs.berkeley.edu/~demmel/cs267/lecture11/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-thhttp://th.dbpedia.org/resource/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/
n20http://code.google.com/p/elemental/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Cannon's_algorithm
Subject Item
dbr:List_of_numerical_analysis_topics
dbo:wikiPageWikiLink
dbr:Cannon's_algorithm
Subject Item
dbr:Matrix_multiplication_algorithm
dbo:wikiPageWikiLink
dbr:Cannon's_algorithm
Subject Item
dbr:Summa_(disambiguation)
dbo:wikiPageWikiLink
dbr:Cannon's_algorithm
Subject Item
dbr:Cannon's_algorithm
rdf:type
yago:WikicatDistributedAlgorithms yago:Event100029378 yago:Act100030358 yago:Abstraction100002137 dbo:Software yago:PsychologicalFeature100023100 yago:Procedure101023820 yago:YagoPermanentlyLocatedEntity yago:Algorithm105847438 yago:Activity100407535 yago:WikicatAlgorithms yago:Rule105846932
rdfs:label
Cannon's algorithm Algorithme de Cannon
rdfs:comment
L'algorithme de Cannon est utilisé pour réaliser de manière distribuée une multiplication de matrices à deux dimensions.Il fut décrit pour la première fois en 1969 par . Utilisé en informatique distribuée, le principal avantage de cet algorithme réside dans le fait qu'il nécessite un espace mémoire constant et une indépendance vis-à-vis du nombre de processeurs. 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.
dcterms:subject
dbc:Mesh_networking dbc:Distributed_algorithms dbc:Matrix_multiplication_algorithms
dbo:wikiPageID
12022054
dbo:wikiPageRevisionID
1085446416
dbo:wikiPageWikiLink
dbr:Lynn_Elliot_Cannon dbr:Systolic_array dbr:PLAPACK dbr:Computer_science dbc:Matrix_multiplication_algorithms dbc:Mesh_networking dbr:Mesh_networking dbc:Distributed_algorithms dbr:Algorithm_for_matrix_multiplication dbr:Distributed_algorithm dbr:ScaLAPACK
dbo:wikiPageExternalLink
n8:node30.html n9:lecture11.html n20:
owl:sameAs
wikidata:Q2835781 dbpedia-th:ขั้นตอนวิธีของแคนนอน yago-res:Cannon's_algorithm dbpedia-fr:Algorithme_de_Cannon n21:2e3nh freebase:m.02vm6bh
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Numerical_linear_algebra dbt:Mathapplied-stub
dbo: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. L'algorithme de Cannon est utilisé pour réaliser de manière distribuée une multiplication de matrices à deux dimensions.Il fut décrit pour la première fois en 1969 par . Utilisé en informatique distribuée, le principal avantage de cet algorithme réside dans le fait qu'il nécessite un espace mémoire constant et une indépendance vis-à-vis du nombre de processeurs.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Cannon's_algorithm?oldid=1085446416&ns=0
dbo:wikiPageLength
5753
foaf:isPrimaryTopicOf
wikipedia-en:Cannon's_algorithm
Subject Item
wikipedia-en:Cannon's_algorithm
foaf:primaryTopic
dbr:Cannon's_algorithm