BitTorrent is a popular, open-source content distribution system that is conducive for distribution of large-volume files. In this paper, we first model the parallel downloading problem as directed graph and discuss p...
详细信息
This paper introduces new approaches to the data distribution-partition problem for sparse matrices in a multiprocessor environment. In this work, the data partition problem of a sparse matrix is modeled as a Min-Max ...
详细信息
This paper introduces new approaches to the data distribution-partition problem for sparse matrices in a multiprocessor environment. In this work, the data partition problem of a sparse matrix is modeled as a Min-Max Problem subject to the uniformity constrain when the goal is to balance the load for both sparse and dense operations. This problem is NP-Complete and two heuristic solutions (ABO and GPB) are proposed. The key of ABO and GPB is to determine the permutation of rows/columns of the input sparse matrix to obtain a sorted matrix with a homogeneous density of nonzero elements. Due to the heuristic nature of the proposed methods their validation is carried out by a comparative study of the parallel efficiency of two types of problems (sparse and mixed) when ABO, GPB, Block, Cyclic and MRD data distributions are applied.
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we report on a novel parallel implementati...
详细信息
Performance profiling generates measurement overhead during parallel program execution. Measurement overhead, in turn, introduces intrusion in a program's runtime performance behavior. Intrusion can be mitigated b...
详细信息
Applications of the cellular Potts model to investigate cellular structures are becoming widely spread in the scientific literature. Despite its realism and generality, the standard Monte Carlo algorithm used to evolv...
详细信息
The traditional zero-one principle for sorting networks states that "if a network with n input lines sorts all 2(n) binary sequences into nondecreasing order, then it will sort any arbitrary sequence of n numbers...
详细信息
The traditional zero-one principle for sorting networks states that "if a network with n input lines sorts all 2(n) binary sequences into nondecreasing order, then it will sort any arbitrary sequence of n numbers into nondecreasing order". We generalize this to the situation when a network sorts almost all binary sequences and relate it to the behavior of the sorting network on arbitrary inputs. We also present an application to mesh sorting. (c) 2004 Elsevier B.V. All rights reserved.
This paper investigated an optimal method of optimal power flow in large interconnected power grids. A decomposition collaborative model based on partial duality is analyzed, and a parallel algorithm based on DC optim...
详细信息
ISBN:
(纸本)7506274078
This paper investigated an optimal method of optimal power flow in large interconnected power grids. A decomposition collaborative model based on partial duality is analyzed, and a parallel algorithm based on DC optimal power flow model is presented in multi-region decomposition of Interconnected power grids. The OPF computation of large power grid is decomposed into subproblems of multi regions, which is a quadratic programming problem used to solve a DC optimal power flow. The optimal convergence condition of multi-region is discussed. The interchange information among regions is export price and boundary nodal bus phase angle. The IEEE RTS-96 with two and three interconnected regions is studied to illustrate the effect of the proposed approach and to prove a great future in interconnected power system.
algorithms, permitting us to find synchronization-free threads comprised of iterations of perfectly nested uniform and non-uniform loops, are presented. They require an exact representation of loop-carried dependences...
详细信息
algorithms, permitting us to find synchronization-free threads comprised of iterations of perfectly nested uniform and non-uniform loops, are presented. They require an exact representation of loop-carried dependences. To describe and implement the algorithms, the dependence analysis by Pugh and Wonnacott was chosen where dependences are represented in the form of tuple relations. The main advantage of the proposed approach is that it permits us to extract more synchronization-free parallelism than that yielded with well-known techniques including the affine partitioning framework. The algorithms proposed have been implemented and verified by means of the Omega project software. Experiments with the Livermore loops are presented.
We develop a framework for parallel computation of the optimal rough set decision reducts from data. We adapt the island model for evolutionary computing. The idea is to optimize reducts within separate populations (i...
详细信息
We present a high level language called SequenceL. The language allows a programmer to describe functions in terms of abstract relationships between their inputs and outputs, and the semantics of the language are capa...
详细信息
暂无评论