3148 search results - page 129 / 630 » On the Dynamic Initialization of Parallel Computers |
109
click to vote
CONCURRENCY
2002
15 years 3 months ago
2002
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
146
Voted
PPOPP
1999
ACM
15 years 7 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
136
Voted
PVM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper presents P2P-MPI, a middleware aimed at computational grids. From the programmer point of view, P2P-MPI provides a message-passing programming model which enab...
141
click to vote
PARLE
1993
15 years 7 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
128
click to vote
PARELEC
2002
IEEE
15 years 8 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...