Анализ масштабируемости параллельных алгоритмов численного решения задачи Коши

Abstract

A parallel algorithm quantity cannot be evaluated apart from the architecture it is implemented on. The paper is devoted application isoefficiency scalability metrics to numerical decision of Cauchy’s problem on based embedded explicit one-step methods. Obtained algorithms are realized on parallel structures with ring, mesh and hypercube topologies. The estimations of the execution time, acceleration, efficiency and scalability parallel solution are defined.