A parallel dynamic programming algorithm for multi-reservoir system optimization

•We estimate RAM requirements for multi-reservoir dynamic programming (DP) problems.•We parallelize DP considering distributed computing and distributed computer memory.•The parallel DP algorithm is efficient, scalable and practical.•The parallel DP algorithm solves previously unsolvable multi-reser...

Full description

Saved in:
Bibliographic Details
Published in:Advances in water resources Vol. 67; pp. 1 - 15
Main Authors: Li, Xiang, Wei, Jiahua, Li, Tiejian, Wang, Guangqian, Yeh, William W.-G.
Format: Journal Article
Language:English
Published: Kidlington Elsevier Ltd 01.05.2014
Elsevier
Subjects:
Algorithms
China
Computation
computer hardware
Dynamic programming
Dynamical systems
Dynamics
Earth sciences
Earth, ocean, space
Exact sciences and technology
Hydrology
Hydrology. Hydrogeology
Joint operation
Memory (computers)
Message passing
Multi-reservoir system optimization
Parallel computing
Parallel processing
Water resources
Far East
Asia
China
China, People's Rep
Joint operation
Parallel computing
Multi-reservoir system optimization
Dynamic programming
algorithms
models
efficiency
interfaces
reservoirs
surface water
water resources
optimization
water resource management
performances
computers
ISSN:0309-1708, 1872-9657
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We estimate RAM requirements for multi-reservoir dynamic programming (DP) problems.•We parallelize DP considering distributed computing and distributed computer memory.•The parallel DP algorithm is efficient, scalable and practical.•The parallel DP algorithm solves previously unsolvable multi-reservoir DP problems. This paper develops a parallel dynamic programming algorithm to optimize the joint operation of a multi-reservoir system. First, a multi-dimensional dynamic programming (DP) model is formulated for a multi-reservoir system. Second, the DP algorithm is parallelized using a peer-to-peer parallel paradigm. The parallelization is based on the distributed memory architecture and the message passing interface (MPI) protocol. We consider both the distributed computing and distributed computer memory in the parallelization. The parallel paradigm aims at reducing the computation time as well as alleviating the computer memory requirement associated with running a multi-dimensional DP model. Next, we test the parallel DP algorithm on the classic, benchmark four-reservoir problem on a high-performance computing (HPC) system with up to 350 cores. Results indicate that the parallel DP algorithm exhibits good performance in parallel efficiency; the parallel DP algorithm is scalable and will not be restricted by the number of cores. Finally, the parallel DP algorithm is applied to a real-world, five-reservoir system in China. The results demonstrate the parallel efficiency and practical utility of the proposed methodology.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0309-1708
1872-9657
DOI:10.1016/j.advwatres.2014.01.002