Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Using a distributed active tree in Java for the parallel and distributed implementation of a nested optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Moritsch, H.W. ; Sch. of Bus., Econ. & Comput. Sci., Univ. Wien, Vienna, Austria ; Pflug, G.C.

Large tree structured optimization problems can be solved efficiently with decomposition methods. We present a parallel and distributed Java implementation and compare a synchronous version with an asynchronous one. We describe a Java distributed active tree middleware on top of which the algorithm has been implemented. In the algorithmic layer, active tree node objects perform loop iterations and interact via coordination objects provided by the coordination layer which has been implemented on top of Java remote method invocation. The programming model allows for an object oriented, data parallel, shared memory formulation of parallel and distributed algorithms operating on tree structures, and is extensible to other structures as well. We discuss our implementation strategy and experimental results obtained on a Beowulf SMP-cluster and on a network of workstations. The optimization algorithm is part of a high performance decision support tool for asset and liability management.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003