Sulityaningsih, Dwi (1997) Algoritma sintetic pada perkalian metriks bujur sangkar dan aplikasinya dalam graf berarah. Undergraduate thesis, FMIPA Undip.
| PDF 21Kb | |
| PDF 340Kb | |
| PDF 234Kb | |
| PDF 299Kb | |
| PDF 558Kb | |
PDF Restricted to Repository staff only 1126Kb | ||
| PDF 220Kb | |
| PDF 218Kb | |
PDF Restricted to Repository staff only 2075Kb |
Abstract
ABSTRAKS Algoritma Sistolik merupakan algoritma yang pengoperasianya berdasar pada pengoperasian lank Sistolik. Karena algoritma Sistolik menggunakan multi prosesor yang dapat melakukan proses seoara bersamaan, maka algoritma Sistolik dapat menyingkat waktu. Algoritma Sistolik lebih efektif dipakai dalam menggunakan multi prosesor. Algoritma Sistolik perkalian matriks menpunyai kompleksitas waktu 0(n). Algoritma Systolic Transitive Closure dari Guibas-Kung --Thomson dapat digunakan untuk menentukan matriks penutup Transitif-Refleksif dari graph berarah. Algoritma ini' mempunyai komploksitas waktu a(n). • - • ' ABSTRACS Systolic algorithm is algorithm when the basic operation is Systolic arrays operation. Systolic algorithm can make time to short, because Systolic algorithm use multi prosesor which can do the process in the same time. Systolic algorithm more efective used for calculate rectangular matrixs multiplication because it use multi processor. Systolic matrixs multiplication algorithm have time complecsity 0(n). Systolic Transitive Closure algorithm from Guibas-Kung-Thomson used to certain transitive-Reflexive closure matrixs from directed graph. This algorithm have time complecsity 0(n)
Item Type: | Thesis (Undergraduate) |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
ID Code: | 31607 |
Deposited By: | Mr UPT Perpus 2 |
Deposited On: | 23 Nov 2011 14:17 |
Last Modified: | 23 Nov 2011 14:17 |
Repository Staff Only: item control page