Sciweavers

3148 search results - page 32 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
PKDD
2009
Springer
146views Data Mining» more  PKDD 2009»
14 years 1 months ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma...
PODC
2011
ACM
12 years 11 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
PODC
1999
ACM
14 years 23 days ago
Dynamically Configurable Distributed Objects
The dynamically configurable distributed object (DCDO) model helps enable object evolution and facilitate the development of distributed objects from multiple independent implemen...
Michael J. Lewis, Andrew S. Grimshaw
JISE
2002
165views more  JISE 2002»
13 years 8 months ago
Locality-Preserving Dynamic Load Balancing for Data-Parallel Applications on Distributed-Memory Multiprocessors
Load balancing and data locality are the two most important factors in the performance of parallel programs on distributed-memory multiprocessors. A good balancing scheme should e...
Pangfeng Liu, Jan-Jan Wu, Chih-Hsuae Yang
IPPS
1996
IEEE
14 years 19 days ago
An Adaptive Approach to Data Placement
Programming distributed-memory machines requires careful placement of datato balance the computationalload among the nodes and minimize excess data movement between the nodes. Mos...
David K. Lowenthal, Gregory R. Andrews