On the scalability of parallel computations on a network of workstations (Q1288746)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the scalability of parallel computations on a network of workstations |
scientific article; zbMATH DE number 1287806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the scalability of parallel computations on a network of workstations |
scientific article; zbMATH DE number 1287806 |
Statements
On the scalability of parallel computations on a network of workstations (English)
0 references
29 March 2000
0 references
Domain decomposition method is confirmed to be a useful parallel technique for parallel simulation. Mesh partition strategy together with a master/slave construction represents a natural way of doing parallel distributed computations. In this paper, we discuss parallel strategies for domain decomposition technique, the load balancing, the communication issue among the processors, and explain the mechanism of a limit to the speed-up when the problem size increases to a certain value. We also search for the way to enhance the speed up and the scalability.
0 references
unstructured finite volume method
0 references
load balancing
0 references
limit to speed-up
0 references