DistOpt: A Software Framework for Modeling and Evaluating Optimization Problem Solutions in Distributed Environments

We present a flexible software environment, named DistOpt, which is useful in building coarse-grain algorithms for solving optimization problems and simulating the solution of the resulting subproblems in multicomputer systems. It is based on a decomposition-coordination approach, by which large optimization problems can be split into subproblems, which are then easier to solve and can be solved in parallel. The object-oriented methodology on which DistOpt is based, and its graphical user interface, are well suited to modify, interface, and extend existing software modules with minimal impact. DistOpt is a flexible and innovative software environment that can be customized by the user in a short development time.

[1]  Michel Dubois,et al.  Effects of Asynchronism on the Convergence Rate of Iterative Algorithms , 1996, J. Parallel Distributed Comput..

[2]  Erol Gelenbe,et al.  Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems , 1995 .

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[4]  Robert S. Germain,et al.  Large Scale Systems , 1996 .

[5]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[6]  Leon S. Lasdon,et al.  Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems , 1978 .

[7]  G. Cohen.  Auxiliary problem principle and decomposition of optimization problems , 1980 .

[8]  L. Lasdon,et al.  A multi-level technique for optimization , 1965 .

[9]  John K. Ousterhout,et al.  Tcl and the Tk Toolkit , 1994 .

[10]  Afonso Ferreira,et al.  Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers , 1999, J. Parallel Distributed Comput..

[11]  Panos M. Pardalos,et al.  Parallel algorithms for global optimization problems , 1996, Solving Combinatorial Optimization Problems in Parallel.

[12]  Sarosh Talukdar,et al.  Asynchronous Procedures for Parallel Processing , 1983, IEEE Transactions on Power Apparatus and Systems.

[13]  M. Mesarovic,et al.  Theory of Hierarchical, Multilevel, Systems , 1970 .

[14]  Albert Y. Zomaya,et al.  A Parallel Simulated Annealing Algorithm with Low Communication Overhead , 1995, IEEE Trans. Parallel Distributed Syst..

[15]  Andrea E. F. Clementi,et al.  Parallel approximation of optimization problems , 1996, Solving Combinatorial Optimization Problems in Parallel.

[16]  Jon B. Weissman.  Gallop: The Benefits of Wide-Area Computing for Parallel Processing , 1998, J. Parallel Distributed Comput..

[17]  Teodor Gabriel Crainic,et al.  PARALLEL BRANCH-AND-BOUND ALGORITHMS: SURVEY AND SYNTHESIS , 1993 .

[18]  Harvey J. Greenberg,et al.  Design and implementation of optimization software , 1977, Math. Program..