A Parallel Implementation of the PBSGDS Method for Solving CBAU Optimization Problems

Shieh-Shing LIN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.8   pp.1653-1660
Publication Date: 2007/08/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.8.1653
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Systems and Control
parallel implementation,  PBSGDS method,  ISO-Networks,  CBAU problems,  asynchronous effect,  

Full Text: PDF(1.3MB)>>
Buy this Article

In previous research, we have proposed a parallel block scaled gradient with decentralized step-size (PBSGDS) method. The method circumvents the difficulty of determining a step-size in the distributed computing environment and enables the proposed parallel algorithm to execute in a distributed computer network with limited amount of date transfer. In this paper, we implement the parallel algorithm within two real Independent System Operator (ISO) Networks, including homogeneous and heterogeneous types PCs-Networks environments, and demonstrate the computational efficiency and numerical satiability through numerous simulation test results in solving a Convex Block Additive Unconstrained (CBAU) optimization problem. Furthermore, the test results show that the performance of the proposed parallel algorithm appears more attractive due to the asynchronous effect in the distributed computing environment.