Results 71 to 80 of about 710,513 (145)

Fractal Aspects in Classical Parallel Computing

open access: yesComputers, 2016
In this paper, we prove that many parallel communication topologies and several parallel algorithms have fractal properties, which leads to the idea that there is a strong connection between the classical parallel computing and a plausible computing on a
Mitică Craus   +2 more
doaj   +1 more source

Domain Decomposition Based High Performance Parallel Computing [PDF]

open access: yesM. P. Raju and S. Khaitan, "Domain Decomposition Based High Performance Parallel Computing", International Journal of Computer Science Issues,IJCSI, Volume 5, pp27-32, October 2009, 2009
The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability.
arxiv  

A parallel algorithm for computing the polar decomposition [PDF]

open access: green, 1994
Nicholas J. Higham   +1 more
openalex   +1 more source

Computing reachable states of parallel programs [PDF]

open access: bronze, 1991
David P. Helmbold, Charles E. McDowell
openalex   +1 more source

Home - About - Disclaimer - Privacy