206167311
Genetic algorithm for planning cable telecommunication networks
Abstract Optical fiber networks over synchronous digital hierarchy operating on ATM mode appear as one of the best alternatives for the new high-speed telecommunications networks. The network management requires planning studies so that the designed networks allow efficient operation in real time. A quantitative model evaluating the global topological design of an optical fiber network over synchronous digital hierarchy is described. The model includes the economic aspects involved in the project, the civil works, the capacity evaluation costs and the introduction of reliability conditions. A genetic approach based on the exploitation of the Kuhn–Tucker optimality conditions is proposed to solve the model.
16750894
A Genetic Algorithm for Solving a Production and Delivery Scheduling Problem with Time Windows
This paper deals with the problem of selecting and scheduling a set of orders to be processed by a manufacturing plant and immediately delivered to the customer site. Constraints to be considered are the limited production capacity, the available number of vehicles and the time windows within which orders must be served. We describe the problem relating it to similar problems studied in the literature. A genetic algorithm to solve the problem is developed and tested empirically with randomly generated problems. Comparisons with an exact procedure and a tabu search procedure show that the method finds very good-quality solutions.
14325905
Evaluating the DIPORSI Framework: Distributed Processing of Remotely Sensed Imagery
The recent advances in remote sensing are contributing to improve emerging applications like geographical information systems. One of the constraint in remotely-sensed images processing is the computational resources required to obtain an efficient and precise service. Parallel processing is applied in remote sensing in order to reduce spatial or temporal cost using the message passing paradigm. In this paper, we present our experiences in the design of a workbench, called DIPORSI, developed to provide a framework to perform the distributed processing of Landsat images using a cluster of workstations. We have focused in describing the results obtained in the implementation of the georeferring function on a biprocessor cluster. In addition, this work offers a set of reflections about the design of complex distributed software systems like the distributed geographic information systems are.
9781969
CORBA Lightweight Components : A Model for Distributed Component-BasedHeterogeneous Computation
In this article we present CORBA Lightweight Components, CORBA-LC, a new network-centered reflective component model which allows building distributed applications assembling binary independent components spread on the network. It provides a peer network view in which the component dependencies are managed automatically to perform an intelligent application run-time deployment, leading to better utilization of resources. We show the validity of the CORBA-LC approach in dealing with CSCW and Grid Computing applications.
16774617
Scalable Directory Organization for Tiled CMP Architectures
Although directory-based cache coherence protocols are the best choice when designing chip multiprocessor architectures (CMPs) with tens of processor cores on chip, the memory overhead introduced by the directory structure may not scale gracefully with the number of cores. In this work, we show that a directory organization based on duplicating tags, which are distributed among the tiles of a tiled CMP with a fine-grained interleaving, is scalable. That is to say, the size of each directory bank is independent on the number of tiles of the system. Moreover, based on this directory organization we propose and evaluate the implicit replacements mechanism which leads to savings of up to 32% in terms of number of messages in the interconnection network.
11189945
Reconfigurable Wormhole Networks: A Realistic Approach
The major problem in an interconnection network is related with the contention due to message blocking. In order to avoid this problem, many alternatives have been proposed in the literature, mainly adaptive routing, random routing and dynamic network reconfiguration. Our paper deals with dynamic reconfigurable networks. Reconfigurable networks are an alternative to reduce the negative effect that congestion produces on the performance of the network. Network reconfiguration can be done in different ways. Our researches are focused on dynamic reconfiguration. This technique consists basically of placing the different processors in the network in those positions which, at each computational moment and according to the existing communication pattern among them, are more adequate for the development of such computation.