On the optimal processor assignment for computing the steady state kalman filter in parallel and distributed systems
Date
2017Language
en
Sujet
Résumé
Kalman filters have many practical applications in various fields such as sensor networks, image and video processing. Therefore, their fast computation is of paramount importance. In this paper distributed implementations for the steady state Kalman filter are proposed. The distributed algorithms are based on partitioning the measurement vector, the state vector or both of them. The number of processors is determined a priori. The optimal distribution of measurements/ states into parallel processors minimizing the computation time is also a priori determined. © Springer International Publishing AG 2017.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Exploiting task-based parallelism in Bayesian Uncertainty Quantification
Hadjidoukas P.E., Angelikopoulos P., Kulakova L., Papadimitriou C., Koumoutsakos P. (2015)We introduce a task-parallel framework for non-intrusive Bayesian Uncertainty Quantification and Propagation of complex and computationally demanding physical models on massively parallel computing architectures. The ... -
Distributed Periodic Steady State Kalman Filter
Assimakis N., Adam M., Massouros C. (2022)In this paper a distributed implementation for the periodic steady state Kalman filter is proposed. The distributed algorithm has parallel structure and can be implemented using processors in parallel without idle time. ... -
GRAL: A grouping algorithm to optimize application placement in wireless embedded systems
Tziritas, N.; Loukopoulos, T.; Lalis, S.; Lampsas, P. (2011)Recent embedded middleware initiatives enable the structuring of an application as a set of collaborating agents deployed in the various sensing/actuating entities of the system. Of particular importance is the incurred ...