Increasing demand for computational power in contemporary constructions has created the need to build faster CPUs and construct more efficient algorithms. In this context especially the concurrent algorithms seem to be very promising. Depending on the number of available CPUs they may offer significant reductions in computation time. In this article two concurrent algorithms of potential field generation are proposed. They present two different approaches to problem domain partitioning called by the authors respectively as tearing and nibbling. It is shown that depending on the problem topology either Tear algorithm or Nibble algorithm is faster. Conclusions are summed up in form of experimental results presenting how the algorithms work in practice. However algorithms construct a discrete potential field according to some specific scheme, there should be no major problems with generalization them to other potential field schemes. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kułakowski, K., & Wa̧s, J. (2010). Two concurrent algorithms of discrete potential field construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6068 LNCS, pp. 529–538). https://doi.org/10.1007/978-3-642-14403-5_56
Mendeley helps you to discover research relevant for your work.