A parallel Strength Pareto Multi-objective Evolutionary Algorithm (PSPMEA) is proposed. PSPMEA is a parallelcomputing model designed for solving Pareto-based multi-objective optimization problems by using an evolutio...
详细信息
ISBN:
(纸本)0780378407
A parallel Strength Pareto Multi-objective Evolutionary Algorithm (PSPMEA) is proposed. PSPMEA is a parallelcomputing model designed for solving Pareto-based multi-objective optimization problems by using an evolutionary procedure. In this procedure, both global parallelization and island parallel evolutionary algorithm models are used. Each subpopulation evolves separately with different crossover and mutation probability, but they exchange individuals in the elitist archive. The benchmark problems numerical experiment results demonstrate that the proposed method can rapidly converge to the Pareto optimal front and spread widely along the front.
In the past five years, hosts on Internet have multiplied more than five times, and along with the network's rapid expansion, more and more attention is paid to the challenging task of studying the topology charac...
详细信息
ISBN:
(纸本)0780378407
In the past five years, hosts on Internet have multiplied more than five times, and along with the network's rapid expansion, more and more attention is paid to the challenging task of studying the topology characteristics of Internet infrastructure. Based on the features of Internet topology discovery and practical experience, we present a three-level distributed architecture for Internet router-level routing topology discovering system. We employ an integrated framework for the deployment of the system. We are examining, from a macroscopic point of view, what architecture is appropriate for this-like system, with an emphasis placed on the flexibility in practical work. The architecture enjoys the advantages of a clear train of thought and high modularization. Experiments show that this architecture has an instructive meaning for the development, deployment, and maintenance of Internet topology discovering system.
In this paper we discuss a new parallel algorithm of 2-D Discrete Wavelet Transform (DWT) using MPI_Scatterv and MPI_Gatherv (MPI: Message Passing Interface). In this algorithm, the 2-D sequential Daubechies Discrete ...
详细信息
ISBN:
(纸本)0780378407
In this paper we discuss a new parallel algorithm of 2-D Discrete Wavelet Transform (DWT) using MPI_Scatterv and MPI_Gatherv (MPI: Message Passing Interface). In this algorithm, the 2-D sequential Daubechies Discrete Wavelet Transform program is first decomposed into several 1-D transforms, and then the parallel conversion is made on them. This parallel program has already been successfully implemented on the Dawning parallel Computer System, and experimental results show that high performance and pretty flexibility can be achieved.
In this paper, a new parallel Turbo encoding and decoding technique is introduced. In this technique, a long information data frame is first divided into sub-blocks which are then encoded with trellis terminating and ...
详细信息
ISBN:
(纸本)0780378407
In this paper, a new parallel Turbo encoding and decoding technique is introduced. In this technique, a long information data frame is first divided into sub-blocks which are then encoded with trellis terminating and decoded by parallel multiple SISO modules. It is shown that, at a slight increase in hardware complexity and a slight loss in the transmission efficiency due to the extra terminating bits appended, the proposed scheme can effectively reduce the decoding delay, and at the same time achieve noticeably better error performance compared with the regular schemes, especially in high code rate situation.
This paper presents a distributedparallel system for face recognition. The face database in this system is so huge (more than 1,000 thousand faces) that matching and recognition processes can not be carried out on on...
详细信息
ISBN:
(纸本)0780378407
This paper presents a distributedparallel system for face recognition. The face database in this system is so huge (more than 1,000 thousand faces) that matching and recognition processes can not be carried out on only one computer. So cluster system must be used to improve the matching speed. But many current clusters existing have some problems and can not fit our system. A special distributedparallel system was developed to complete face query and recognition. The concept of parallel virtual machine and a kind of linked table structure adopted in this system not only decreased lots of moving overhead of adding or deleting nodes in the array structure but also truly realized the infinite extensibility. Furthermore, key techniques such as distributed database, buffer and synchronization techniques in communication and multithreading in control flow were adopted to guarantee the normal running. Practical results proved that this parallel system can improve the matching speed for more than 4 times. Moreover, the greatest advantage of this system is not only increasing matching speed but breaking the upper limit of face data capacity. Consequently, the face data capability of this system can be extended to arbitrary figure as bigger as possible.
Many applications in different fields need to access large amounts of data. The difficulty of handling out-of-core data limits the performance of supercomputers. This paper first describes an out-of-core computation m...
详细信息
ISBN:
(纸本)0780378407
Many applications in different fields need to access large amounts of data. The difficulty of handling out-of-core data limits the performance of supercomputers. This paper first describes an out-of-core computation model on cluster of workstations. Then an object-oriented method is offered, which makes the out-of-core programs easier to write. Some optimal strategies, such as distribution of Local Array Files, data sieving and prefetching, also make an improvement in the performance of out-of-core parallel computations.
The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. In this paper we propose a quorum-based dis...
详细信息
ISBN:
(纸本)0780378407
The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. In this paper we propose a quorum-based distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(\Q\) in the best case and O(n\Q\) in the worst case, where \Q\ is a quorum size that the algorithm adopts, and n is the number of processes that make requests for resources.
Dempster's rule of evidence combination is computational expensive. This paper presents a parallel approach to evidence combination on a qualitative Markov tree. Binarization algorithm transforms a qualitative Mar...
详细信息
ISBN:
(纸本)0780378407
Dempster's rule of evidence combination is computational expensive. This paper presents a parallel approach to evidence combination on a qualitative Markov tree. Binarization algorithm transforms a qualitative Markov tree into a binary tree based on the computational workload in nodes for an exact implementation of evidence combination. A binary tree is then partitioned into clusters with each cluster being assigned to a processor in a parallel environment. The parallel implementation improves the computational efficiency of evidence combination.
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate self-stabilizing distributed solutions to the minimal k-redundant dominating set (MRDS)...
详细信息
ISBN:
(纸本)0780378407
Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate self-stabilizing distributed solutions to the minimal k-redundant dominating set (MRDS) problem in tree networks. The MRDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G=(VE), a set M subset of or equal to V is a k-redundant dominating set of G if and only if each vertex not in M is adjacent to at least k vertices in M. We propose a self-stabilizing distributed algorithm that solves the MRDS problem for anonymous tree networks.
Resource allocation and reallocation are very important issues affecting the performance of gang scheduling. Currently most gang scheduling systems adopt regular allocation policies. For many existing clusters of PCs,...
详细信息
ISBN:
(纸本)0780378407
Resource allocation and reallocation are very important issues affecting the performance of gang scheduling. Currently most gang scheduling systems adopt regular allocation policies. For many existing clusters of PCs, however, processors are interconnected via a fast Ethernet or a crossbar switch network and the location of processors is not a significant factor when communication costs are considered. Adopting regular allocation policies may cause unnecessary problems of fragmentation. In this paper we introduce a job-relocation method to alleviate the fragmentation problem.
暂无评论