In this paper, a novel parallel evolutionary algorithm called coarse-grained parallel quantum genetic algorithm (CGPQGA) is proposed. the main points of CGPQGA are that a new chromosome representation called qubit rep...
详细信息
ISBN:
(纸本)0780378407
In this paper, a novel parallel evolutionary algorithm called coarse-grained parallel quantum genetic algorithm (CGPQGA) is proposed. the main points of CGPQGA are that a new chromosome representation called qubit representation, a novel evolutionary strategy called qubit phase comparison approach and an extended version of coarse-grained model called hierarchical ring model are introduced. Based on the concepts and principles of quantum computing and quantum parallelism introduced, CGPQGA is characterized by rapid convergence, good global search capability and the ability of possessing exploration and exploitation simultaneously. In CGPQGA, the best individual can be easy to migrate to all processors and communication overhead is much less expensive. the experimental results of infinite impulse response digital filter design demonstrate that CGPQGA can speedup the migration of the top individuals of subpopulations and CGPQGA is superior to other several genetic algorithms greatly in quality and efficiency.
In a genetic algorithm (GA), the undesirable phenomenon of excess convergence can often occur. Excess convergence is the phenomenon where the diversity of a group is lost. this phenomenon occurs because homogeneous in...
详细信息
ISBN:
(纸本)0780378407
In a genetic algorithm (GA), the undesirable phenomenon of excess convergence can often occur. Excess convergence is the phenomenon where the diversity of a group is lost. this phenomenon occurs because homogeneous individuals are increased rapidly in the group while evolving or searching. therefore, crossover loses its function. Once the excess convergence occurs, the search by the GA becomes meaningless. therefore, it is important to avoid excess convergence and maintain diversity. First, we show an implementation of a parallel GA based on a multiple-group-type island model, that uses object-shared space. Next, as a simple, effective method for avoiding excess convergence, we propose a diversity maintenance technique based on selection of the homogeneous individuals called the Noah's ark strategy for parallel GAs, and demonstrate its effectiveness on a knapsack problem. Our proposed method is to replace individuals in sub-groups that have excessively converged withthe new individuals coming from the search space. that is, we avoid excess convergence by expelling homogeneous individuals, withthe exception of one "elite" individual (that we call for Noah). thus, we limit a decrease in diversity of an entire group.
Automated meter reading, energy billing and energy management are applicationsthat are based on and require remote access to control networks. Such applications are intrinsically linked to power-lines and as such sug...
详细信息
ISBN:
(纸本)0780379373
Automated meter reading, energy billing and energy management are applicationsthat are based on and require remote access to control networks. Such applications are intrinsically linked to power-lines and as such suggest using the power distribution grid not only for energy transport but also as the communication medium. this paper describes a data acquisition and control system for energy distribution and consumption using power-lines and IP-based networks for communication. the primary application is meter reading with fine-grained resolution both in time and location of consumption. the paper describes the communication architecture and the services provided by the system and shows how the peculiarities of especially the power-line communication influence the design of the interconnection between the two network types. Security aspects of the system are an important issue and are also discussed.
the processing of three-dimensional (3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision fields. the distance transform (DT) is extensively applied in the imag...
详细信息
ISBN:
(纸本)0780378407
the processing of three-dimensional (3-D) objects from 3-D digital image data is an important task in the image processing and the computer vision fields. the distance transform (DT) is extensively applied in the image processing and computer vision areas as a key operation. In a two or three-dimensional image array, the computation of distance transform (DT) is an important task, Withthe increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. In order to provide the efficient transform computations, parallelism is employed. We develop parallel algorithms for the three-dimensional Euclidean distance transform (3D-EDT) on the SIMD hypercube computer. the time complexity of our parallel algorithm is O{log(2) N} for an N x N x N image array using N-3 processors. A generalized parallel algorithm for the 3D-EDT is also proposed and it runs O((N/p)(3) log(N) + (N/p)(2) log(2) p) time for an N x N x N binary image array on the SIMD hypercube computer using p(3) PE's, where 1 less than or equal to p less than or equal to N.
An efficient (un)marshaling framework is presented. It is designed for distributedapplications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host an...
详细信息
ISBN:
(纸本)3540406735
An efficient (un)marshaling framework is presented. It is designed for distributedapplications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. this technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. the network latency is reduced by concurrent execution of (un)marshaling and network operations. the framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at ***.
the proceedings contain 53 papers. the special focus in this conference is on Software, applications and Tools. the topics include: Solving of the alignment and scheduling problems;accuracy and stability of spatial dy...
ISBN:
(纸本)3540406735
the proceedings contain 53 papers. the special focus in this conference is on Software, applications and Tools. the topics include: Solving of the alignment and scheduling problems;accuracy and stability of spatial dynamics simulation by cellular automata evolution;resource similarities in Petri net models of distributed systems;authentication primitives for protocol specifications;an extensible coloured Petri net model of a transport protocol for packet switched networks;parallelcomputing for globally optimal decision making;parallelization of alternating direction implicit methods for three-dimensional domains;an approach to assessment of heterogeneous parallel algorithms;a hierarchy of conditions for asynchronous interactive consistency;associative parallel algorithms for dynamic edge update of minimum spanning trees;the renaming problem as an introduction to structures for wait-free computing;graph partitioning in scientific simulations;process algebraic model of superscalar processor programs for instruction level timing analysis;a polymorphic type system for bulk synchronous parallel ml;towards an efficient functional implementation of the NAS benchmark ft;a fast pipelined parallel ray casting algorithm using advanced space leaping method;formal modeling for a real-time scheduler and schedulability analysis;global system image for cluster computing;asynchronous timed multimedia environments based on the coordination paradigm;component-based development of dynamic workflow systems using the coordination paradigm;an efficient marshaling framework for distributed systems;deciding optimal information dispersal for parallelcomputing with failures and communication-efficient parallel Gaussian elimination.
Performance analysis for terascale computing requires a combination of new concepts including distribution, on-line processing and automation. As a foundation for tools realizing these concepts, we present a distribut...
详细信息
ISBN:
(纸本)354040788X
Performance analysis for terascale computing requires a combination of new concepts including distribution, on-line processing and automation. As a foundation for tools realizing these concepts, we present a distributed monitoring approach for clustered SMP architectures that tries to minimize the perturbation of the target application while retaining flexibility with respect to filtering and processing of performance data. We achieve this goal by dividing the monitor in a passive monitoring library linked to the application and an active component called runtime information producer (RIP) that provides performance data (metric- and event based) for individual nodes. Instead of adding an additional layer in the monitoring system that integrates performance data form the individual RIPs we include a directory service as a third component in our approach. Querying this directory service, tools discover which RIPs provide the data they need.
the research goal is to develop a large-scale agent-based simulation environment to support implementations of Internet simulation applications. the Small Worlds (SW) graphs are used to model Web sites and social netw...
详细信息
ISBN:
(纸本)354040788X
the research goal is to develop a large-scale agent-based simulation environment to support implementations of Internet simulation applications. the Small Worlds (SW) graphs are used to model Web sites and social networks of Internet users. Each vertex represents the identity of a simple agent. In order to cope with scalability issues, we have to consider distributedparallel processing. the focus of this paper is to present two parallel-distributed algorithms for the construction of a particular type of SW graph called beta-model. the first algorithm serializes the graph construction, while the second constructs the graph in parallel.
Designing a Java processor supporting horizontal multithreading has been becoming more attractive as network computing gains importance. Different from the traditional superscalar processors that issue multiple instru...
详细信息
ISBN:
(纸本)0780378407
Designing a Java processor supporting horizontal multithreading has been becoming more attractive as network computing gains importance. Different from the traditional superscalar processors that issue multiple instructions from a single instruction stream to exploit the instruction level parallelism (ILP), the horizontal multithreading Java processors issue multiple instructions (bytecodes) from multiple threads in parallel to exploit not only the ILP but the thread level parallelism (TLP). Such processors have multiple dispatch slots and require the instruction fetch unit to supply instructions with much higher bandwidththan superscalar processors. Using a traditional superscalar cache architecture in a horizontal multithreading Java processor results in high cache miss ratio caused by the interference among the threads. this paper investigates multibank instruction cache architecture for horizontal multithreading Java processor to meet the requirements of the high instruction fetch bandwidth. In order to evaluate the cache performance as well as the horizontal multithreading Java processor performance, we developed a trace driven simulator. the simulator consists of a trace generator that generates the Java bytecode execution traces and an architectural simulator that reads the traces and evaluates,the performance of the instruction cache and the overall performance of the Java processor. Our simulation results show that the performance improvements are obtained by the low cache miss ratio and the high instruction fetch bandwidth of the proposed cache architecture. the IPC performance is about 19 when boththe number of slots and the number of banks are 8, about 5 times better than one bank cache.
this paper presents the design, prototype implementation and experimental evaluation of DIOS++, an infrastructure for enabling rule based autonomic adaptation and control of distributed scientific applications. DIOS++...
详细信息
ISBN:
(纸本)354040788X
this paper presents the design, prototype implementation and experimental evaluation of DIOS++, an infrastructure for enabling rule based autonomic adaptation and control of distributed scientific applications. DIOS++ provides: (1) abstractions for enhancing existing application objects with sensors and actuators for runtime interrogation and control, (2) a control network that connects and manages the distributed sensors and actuators, and enables external discovery, interrogation, monitoring and manipulation of these objects at runtime, and (3) a distributed rule engine that enables the runtime definition, deployment and execution of rules for autonomic application management. the framework is currently being used to enable autonomic monitoring and control of a wide range of scientific applications including oil reservoir, compressible turbulence and numerical relativity simulations.
暂无评论