Solving non-smooth unconstrained optimization problem with LAMGAC in a LAN-WLAN grid domain

Authors:
Elsa Ma Macías;Alvaro Suárez;C. N. Ojeda-Guerra
Affiliations:
Departamento de Ingeniería Telemática, Universidad de Las Palmas de G.C.;Departamento de Ingeniería Telemática, Universidad de Las Palmas de G.C.;Departamento de Ingeniería Telemática, Universidad de Las Palmas de G.C.
Venue:
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Year:
2002

Citing 8
Cited 0

Some NP-complete problems in quadratic and nonlinear programming

Mathematical Programming: Series A and B
PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Twisted GFSR generators II

ACM Transactions on Modeling and Computer Simulation (TOMACS)
A novel programming strategy considering portable wireless nodes in a heterogeneous cluster

Distributed and parallel systems
Architecture for a Grid Operating System

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Adaptive Scheduling for Master-Worker Applications on the Computational Grid

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Programming Parallel Applications with LAMGAC in a LAN-WLAN Environment

Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
The Cycle Server: A Web Platform for Running Parallel Monte Carlo Applications on a Heterogeneous Condor Pool of Workstations

ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, the Local Area Network (LAN) has been used for parallel programming with PVM and MPI. The improvement of communications in Wireless Local Area Networks (WLANs) achieving till 11 Mbps make them, according to some authors, candidates to be used as a resource for Grid Computing. In this paper we use our library based on LAM/MPI named LAMGAC in order to parallelize an algorithm that finds the global minimum of a nonlinear real valued continuous function. The algorithm uses a strategy based on the division of the domain into small boxes and it locates the extreme by means of a multiple start algorithm (MRS). The local minimizer is carried out by means of the steepest descent and the DFP method. The novel of this approach is that we can vary the parallel virtual machine in runtime (spawning new processes using functions defined in MPI- 2), we generate algorithms in which computations and communications are efficiently overlapped and we include a web interface to offer our system as a Grid resource. At this moment we have measured the execution time of some algorithms and the components of LAMGAC, obtaining interesting results.