Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Implementation of the unit commitment problem on supercomputers

Journal Article · · IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States)
DOI:https://doi.org/10.1109/59.317597· OSTI ID:7292013
;  [1]
  1. Univ. of Nevada, Las Vegas, NV (United States). Electrical and Computer Engineering Dept.
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.
OSTI ID:
7292013
Journal Information:
IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 9:1; ISSN ITPSEG; ISSN 0885-8950
Country of Publication:
United States
Language:
English

Similar Records

Vectorized hidden-surface algorithm implemented on the Cray-2 supercomputer. Master's thesis
Technical Report · Wed Nov 30 23:00:00 EST 1988 · OSTI ID:6164422

Highly vectorizable fault simulation on the Cray X-MP supercomputer
Journal Article · Thu Nov 30 23:00:00 EST 1989 · IEEE Transations on Computer-Aided Design of Integrated Circuits and Systems; (USA) · OSTI ID:6987691

Solution of the unit commitment problem by the method of unit periods
Journal Article · Wed Jan 31 23:00:00 EST 1990 · IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (USA) · OSTI ID:6882096