About: OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://czechuniversity.com/dokumenty/konference/2012/ICSC.pdf
Description	The article is devoted to the important role of decomposition strategy in parallel computing. This influence is illustrated on the example of very frequently used parallel algorithm and that is matrix multiplication. On the basis of the done analysis of the used parallel computers in the world these are divided to the two basic groups which are from the programmer-developer point of view very different. They are also introduced the typical principal structures for both these groups of parallel computers and also their models. The paper then in an illustrative way describes development of concrete parallel algorithm for matrix multiplication on various parallel systems. For each individual practical implementation of matrix multiplication there is introduced the derivation of its calculation complexity. The described individual ways of developing parallel matrix multiplication and their implementations are compared, analysed and discussed from sight of programmer-developer and user in order to show the very important role of decomposition strategies mainly at the class of asynchronous parallel computers. The article is devoted to the important role of decomposition strategy in parallel computing. This influence is illustrated on the example of very frequently used parallel algorithm and that is matrix multiplication. On the basis of the done analysis of the used parallel computers in the world these are divided to the two basic groups which are from the programmer-developer point of view very different. They are also introduced the typical principal structures for both these groups of parallel computers and also their models. The paper then in an illustrative way describes development of concrete parallel algorithm for matrix multiplication on various parallel systems. For each individual practical implementation of matrix multiplication there is introduced the derivation of its calculation complexity. The described individual ways of developing parallel matrix multiplication and their implementations are compared, analysed and discussed from sight of programmer-developer and user in order to show the very important role of decomposition strategies mainly at the class of asynchronous parallel computers. (en)
Title	OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS (en)
skos:prefLabel	OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS OPTIMISATION OF DECOMPOSITION STRATEGIES IN PARALLEL ALGORITHMS (en)
skos:notation	RIV/63468352:_____/12:#0000272!RIV13-MSM-63468352
http://linked.open...avai/riv/aktivita	N
http://linked.open...avai/riv/aktivity	N
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Hanuliak, Ivan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Evropský polytechnický institut, s.r.o. / (nerozlišená součást)
http://linked.open...dnocenehoVysledku	156914
http://linked.open...ai/riv/idVysledku	RIV/63468352:_____/12:#0000272
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	parallel computer, synchronous and asynchronous parallel system, systolic system, matrix multiplication, decomposition method (en)
http://linked.open.../riv/klicoveSlovo	decomposition method parallel computer matrix multiplication synchronous and asynchronous parallel system systolic system
http://linked.open...ontrolniKodProRIV	[2A28FD656387]
http://linked.open...v/mistoKonaniAkce	Kunovice
http://linked.open...i/riv/mistoVydani	Kunovice
http://linked.open...i/riv/nazevZdroje	TENTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING APPLIED IN COMPUTER AND ECONOMIC ENVIRONMENTS
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Hanuliak, Ivan
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2012-01-20 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Evropský polytechnický institut, s.r.o.
https://schema.org/isbn	978-80-7314-279-7

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software