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

Agglomeration
Flight paths
Convolutional codes
Dynamic programming
Decoding

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, .

Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems. / Tsai, Wei K.; Huang, Garng Morton; Antonio, John K.

1989. 1789-1794 Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, .

Research output: Contribution to conferencePaper

Tsai, WK, Huang, GM & Antonio, JK 1989, 'Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems' Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, 21/6/89 - 23/6/89, pp. 1789-1794.
Tsai WK, Huang GM, Antonio JK. Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems. 1989. Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, .
Tsai, Wei K. ; Huang, Garng Morton ; Antonio, John K. / Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems. Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, .6 p.
@conference{58204e0e8fcf476fa5d26616e363c151,
title = "Fast parallel hierarchical aggregation/disaggregation algorithms for multistage optimization problems and shortest path problems",
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.",
author = "Tsai, {Wei K.} and Huang, {Garng Morton} and Antonio, {John K.}",
year = "1989",
month = "12",
day = "1",
language = "English",
pages = "1789--1794",
note = "Proceedings of the 1989 American Control Conference ; Conference date: 21-06-1989 Through 23-06-1989",

}

TY - CONF

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

AU - Tsai, Wei K.

AU - Huang, Garng Morton

AU - Antonio, John K.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024887888&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024887888&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0024887888

SP - 1789

EP - 1794

ER -