Implementation of the Unit Commitment Problem on Supercomputers
IEEE Transactions on Power Systems
First page number:
Last page number:
This paper proposes the application of vectorization and parallelization techniques for solving the unit commitment problem on supercomputers. A modified dynamic programming method which takes full advantage of the vector processors present in a supercomputer is presented. Parallel processing is used to further speedup the computation time. Computer simulation of a 26-unit power system is performed on a CRAY Y-MP2/216 in both scalar and vector codes. The computation time results for the conventional dynamic programming algorithm and modified algorithm are compared to demonstrate the effectiveness of the proposed method.
Application software; Computer simulation; Concurrent computing; Dynamic programming; Heuristic algorithms; Parallel processing; Power system dynamics; Power system simulation; Supercomputers; Vector processors
Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Electronic Devices and Semiconductor Manufacturing | Power and Energy | Signal Processing
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Implementation of the Unit Commitment Problem on Supercomputers.
IEEE Transactions on Power Systems, 9