Measuring the performance for parallel matrix multiplication algorithm.

Aldea, Costel

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Measuring the performance for parallel matrix multiplication algorithm.”

On a direct sum decomposition of the Dem'yanenko matrix

Hirofumi Tsumura (1996)

Acta Arithmetica

Similarity:

Faculty information system based on open source technologies.

Škrbić, Srđan, Bodroški, Žarko, Pupovac, Biljana, Racković, Miloš (2007)

Novi Sad Journal of Mathematics

Similarity:

Implementation of an XML based system for content generation and library catalogue cards display.

Vidaković, Jovana, Racković, Miloš (2007)

Novi Sad Journal of Mathematics

Similarity:

A brief introduction to spatio-temporal modelling.

M. D. Ugarte (2008)

Boletín de Estadística e Investigación Operativa. BEIO

Similarity:

On inhomogeneous Diophantine approximation and the Nishioka-Shiokawa-Tamura algorithm

Takao Komatsu (1998)

Acta Arithmetica

Similarity:

We obtain the values concerning $(θ, ϕ) = l i m i n f_{| q | \to \infty} | q | ‖ q θ - ϕ ‖$ using the algorithm by Nishioka, Shiokawa and Tamura. In application, we give the values (θ,1/2), (θ,1/a), (θ,1/√(ab(ab+4))) and so on when θ = (√(ab(ab+4)) - ab)/(2a) = [0;a,b,a,b,...].