×

Parallel dynamic programming algorithms: multitransputer systems. (English) Zbl 1140.90502

Introduction: The present paper discusses problems associated with investigations the possibilities, ways and efficiency of the application of dynamic programming methods to solving dynamic optimization problems in parallel multitransputer systems. Optimization computations were implemented on the multitransputer SUPER NODE 1000 system. The obtained results served to illustrate many essential problems associated with implementation of parallel computations. In general, they refer to the influence of the parallel system structure and the manner of organizing the interprocessor communication upon the global efficiency (speedup) of parallel computations. In a particular way, dynamic programming methods are suitable for conducting such investigations, since they offer real possibilities of parallelizing computations on different levels of algorithms and, consequently, in the distribution of tasks, obtaining parallelism of a different granularity and various communication requirements. The presented results were obtained during investigations carried out by the author at the Centre for Mathematical Software Research of the University of Liverpool.

MSC:

90C39 Dynamic programming
65Y05 Parallel numerical computation
PDFBibTeX XMLCite
Full Text: EuDML