Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Naive Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment (CROSBI ID 174712)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Belić, Filip ; Ševerdija, Domagoj ; Hocenski, Željko Naive Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment // Tehnički vjesnik : znanstveno-stručni časopis tehničkih fakulteta Sveučilišta u Osijeku, 18 (2011), 3; 309-314

Podaci o odgovornosti

Belić, Filip ; Ševerdija, Domagoj ; Hocenski, Željko

engleski

Naive Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment

In last few decades computational power of computers has greatly increased. Highest speeds and power are still reserved for super- computers, but high-speed computers have been available for home and amateur users for some time. Normal user most of the time uses only a small amount of computational resources available ; even in cases of high-strain, a good part of these resources stays unused. This is partly a result of poor programming. Most of programmers still use single- threaded programming although platforms for parallel programming have been widely available for long time. This article describes using one such platform (.NET Framework) to decrease time needed for multiplication of matrices. This article tries to present what results can be achieved using common equipment and easily acquirable software.

Strassen's algorithm ; parallel programming ; multi-thread ; multi-core ; computing resources

.

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

18 (3)

2011.

309-314

objavljeno

1330-3651

Povezanost rada

Računarstvo

Indeksiranost