Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems

Wei K. Tsai, Garng Morton Huang, John K. Antonio

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

A technique that recursively divides the original problem into a set of smaller problems which can be solved in parallel is presented. This technique is based on a hierarchical (recursive) structure of aggregation and disaggregation. For a multistage process with n stages, the present algorithm achieves a time complexity of O(log n), assuming O(1) states per stage. (Algorithms based only on the standard dynamic programming technique can achieve a time complexity no better than O(n).) The new algorithm is designed to operate on a tightly coupled parallel computer. It can serve as a fast and efficient means of decoding convolutional codes, solving routing problems in data networks, and determining minimum-fuel flight paths.

Original languageEnglish
Pages1789-1794
Number of pages6
Publication statusPublished - 1 Dec 1989
Externally publishedYes
EventProceedings of the 1989 American Control Conference - Pittsburgh, PA, USA
Duration: 21 Jun 198923 Jun 1989

Other

OtherProceedings of the 1989 American Control Conference
CityPittsburgh, PA, USA
Period21/6/8923/6/89

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tsai, W. K., Huang, G. M., & Antonio, J. K. (1989). Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems. 1789-1794. Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, .