检索结果-内蒙古大学图书馆

International Symposium on parallel and Distributed Processing (IPDPS)

作者： C. Fantozzi A. Pietracaprina G. Pucci Department of Information Engineering University of Padova Padova Italy

Summary form only given. The design of algorithms exhibiting a high degree of temporal and spatial locality of reference is crucial to attain good performance on current and foreseeable computing systems featuring ever deeper memory hierarchies. Previous work has demonstrated that task parallelism can be efficiently transformed into locality of reference in two-level hierarchies. Recently, we moved a step forward and showed how the more structured type of parallelism exposed by submachine locality can be efficiently turned into temporal locality on arbitrarily deep hierarchies. We complete and extend the above result by encompassing also spatial locality. Specifically, we present a scheme to simulate parallel algorithms designed for the decomposable BSP (a BSP variant which captures submachine locality) on the hierarchical memory model with block transfer. The simulation yields good hierarchy-conscious sequential algorithms from parallel ones, and provides evidence of the strict relation between submachine locality in parallel computation and locality of reference (both temporal and spatial) in the hierarchical memory setting.

关键词： Hidden Markov models Computational modeling Random access memory Algorithm design and analysis parallel processing parallel algorithms Concurrent computing Costs Phase change random access memory Design engineering

来源：评论

学校读者我要写书评

暂无评论

A hybrid Ling carry-select adder

A hybrid Ling carry-select adder

引用

Asilomar Conference on Signals, Systems & Computers

作者： J. Grad J.E. Stine Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA

Hybrid adders, combining a sparse carry-lookahead tree and a carry-select output stage are a well-known implementation form of high-speed adders. In this paper, a hybrid Ling carry-select adder is presented. It is shown how a carry-select output stage can be used to eliminate the entire conversion of all pseudo-carries. The adder is implemented in enhanced multiple output domino logic (EMODL). A technique is presented to avoid false discharge paths, which present impairment to EMODL, in the sum selection multiplexer.

关键词： Adders Logic Delay Concurrent computing Multiplexing Signal generators Digital systems parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem

Algorithms for the problem of K maximum sums and a VLSI algo...

引用

International Symposium on parallel Architectures, algorithms and Networks (ISPAN)

作者： Sung Eun Bae Tadao Takaoka Department of Computer Science University of Canterbury Christchurch New Zealand

ISBN: (纸本)0769521355

Given an array of positive and negative values, we consider the problem of K maximum sums. When an overlapping property needs to be observed, previous algorithms for the maximum sum are not directly applicable. We designed an O(K * n) algorithm for the K maximum subsequences problem. This was then modified to solve the K maximum subarrays problem in O(K * n/sup 3/) time. Finally, we present a VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.

关键词： Very large scale integration Circuits Phase change random access memory parallel algorithms Computer science Algorithm design and analysis Pattern recognition Image processing Data mining Data analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed mining of maximal frequent itemsets from databases on a cluster of workstations 04

Distributed mining of maximal frequent itemsets from databas...

引用

IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID)

作者： S.M. Chung C. Luo Department of Computer Science and Engineering Wright State University Dayton OH USA

ISBN: (纸本)9780780384309

In this paper, we propose a new algorithm, named Distributed Max-Miner (DMM), for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. DMM requires very low communication and synchronization overhead in distributed computing systems. DMM has the local mining phase and the global mining phase. During the local mining phase, each node mines the local database to discover the local maximal frequent itemsets, then they form a set of maximal candidate itemsets for the top-down search in the subsequent global mining phase. A new prefix-tree data structure is developed to facilitate the storage and counting of the global candidate itemsets of different sizes. This global mining phase using the prefix-tree can work with any local mining algorithm. We implemented DMM on a cluster of workstations and evaluated its performance for various cases. DMM demonstrates better performance than other sequential and parallel algorithms, and its performance is quite scalable, even when there are large maximal frequent itemsets (i.e., long patterns) in databases.

关键词： Data mining Itemsets Distributed databases Workstations Association rules Clustering algorithms parallel algorithms Computer science Data engineering Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Models for scheduling on large scale platforms: which policy for which application?

Models for scheduling on large scale platforms: which policy...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： P.-F. Dutot L. Eyraud G. Mounie D. Trystram ID-IMAG Montbonnot Saint Martin France

Summary form only given. In recent years, there was a huge development of low cost large scale parallel systems. The design of efficient parallel algorithms has to be reconsidered to take into account new parameters of such execution platforms which are characterized by a larger number of heterogeneous processors, often organized as hierarchical subsystems. Alternative computational models have been designed to take into account these new characteristics. parallel tasks model /spl times/ PT in short - is a promising alternative for scheduling parallel applications. Another way of looking at the problem (which is somehow a dual view) is the divisible load model (DL) where an application is considered as a collection of a large number of elementary - sequential - computing units. These two new views of the problem allow us to consider communications implicitly or to mask them, leading to more tractable problems. This paper, first, presents some approximation algorithms for the PT model with a special emphasis on new execution platforms. We show how to mix these results with the DL model to manage the resources of an actual computational grid of 600 processors.

关键词： Large-scale systems Costs Algorithm design and analysis parallel algorithms Computational modeling Processor scheduling Load modeling Approximation algorithms Resource management Grid computing

来源：评论

学校读者我要写书评

暂无评论

Associative Graph Processor and Its Properties

Associative Graph Processor and Its Properties

引用

International Conference on parallel Computing in Electrical Engineering (PARLEC)

作者： A. Nepomniaschaya Z. Kokosinski Institute of Computational Mathematics and Mathematical Geophysics Novosibirsk Russia Faculty of Electrical and Computer Engineering Cracow University of Technology Krakow Poland

In this paper a model of a versatile associative graph processor called AGP is proposed. The model can work both in bit-serial and in bit-parallel mode and enables simultaneous search for a set of comparands and selection of the search types. In addition it has some built-in operations designed for associative graph algorithms. The selected functions and basic procedures of this model are described and its possible architecture is discussed.

关键词： Geophysics computing Algorithm design and analysis Associative processing Mathematics Computational geometry Relational databases Artificial intelligence parallel algorithms Search problems Programming profession

来源：评论

学校读者我要写书评

暂无评论

Evolutionary algorithms for optimal placement of antennae in radio network design

Evolutionary algorithms for optimal placement of antennae in...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： E. Alba Departamento de Lenguajes y Ciencias de la Computación University of Màlaga Malaga Spain

Summary form only given. Evolutionary algorithms (EAs) are applied to solve the radio network design problem (RND). The task is to find the best set of transmitter locations in order to cover a given geographical region at an optimal cost. Usually, parallel EAs are needed in order to cope with the high computational requirements of such a problem. Here, we try to develop and evaluate a set of sequential and parallel genetic algorithms (GAs) in order to solve efficiently the RND problem. The results show that our distributed steady state GA is an efficient and accurate tool for solving RND that even outperforms existing parallel solutions. The sequential algorithm performs very efficiently from a numerical point of view, although the distributed version is much faster, with an observed linear speedup.

关键词： Evolutionary computation Intelligent networks Radio network Algorithm design and analysis Genetic algorithms parallel algorithms Performance evaluation Transmitting antennas Testing Computer networks

来源：评论

学校读者我要写书评

暂无评论

parallelization of an image compression and decompression algorithm based on 1D wavelet transformation

Parallelization of an image compression and decompression al...

引用

International Symposium on Communications Control and Signal Processing (ISCCSP)

作者： S. Khanfir M. Jemni E.B. Braiek Ecole Supérieure des Sciences et Techniques de Tunis Tunis TUNISIE

Wavelet analysis has received considerable interest in the recent years because of its efficiency in the several practical applications. Image processing for wavelet transformation is considered as one of the most powerful methods that provide a good quality of results. However, its implementation may be too time-consuming accordingly to the problem size. parallel processing can be a solution to speed up wavelet transformation programs. In this context, and in order to have a quick image compression/decompression program based on 1D wavelet transformation, we have designed three parallel algorithms that where implemented on an IBM RS6000/SP machine. The first parallel algorithm exploits control parallelism it was developed with OpenMP and executed on one four-processor node. The two others exploit data parallelism and were developed with MPI directives. Finally, we present an evaluation of these algorithms based on an experimental study.

关键词： Image coding parallel algorithms parallel processing Wavelet transforms Image processing Wavelet analysis Algorithm design and analysis Signal processing Open loop systems parallel machines

来源：评论

学校读者我要写书评

暂无评论

Algorithm suitable for parallel computing in solving linear equations involving block tridiagonal coefficient matrix

引用

Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 2004年第4期22卷 467-469页

作者： Qin, Yu Lu, Quanyi Dept. of Appl. Math. Northwestern Polytech. Univ. Xi'an 710072 China

BAOR (block accelerated over-relaxation) method, now commonly used in solving engineering problems involving block tridiagonal coefficient matrix, is not suitable for parallel computing. We proposed a parallel algorithm that like BAOR algorithm is good in convergence, but that unlike BAOR algorithm is suitable for parallel computing. We explained why BAOR algorithm is not suitable for parallel computing. This understanding helps us to make our algorithm suitable for parallel computing. We gave one illustrative example. The iterative time needed by our algorithm is roughly the same as that needed by BAOR algorithm. These results indicate preliminarily that our algorithm is effective and feasible.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Almost wait-free resizable hashtables

Almost wait-free resizable hashtables

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： H. Gao J.F. Groote W.H. Hesselink Department of Computing Science University of Groningam Groningen Netherlands Department of Computing Science Eindhovan University of Technology Eindhoven Netherlands

Summary form only given. In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Wait-free and lock-free algorithms can do without locking mechanisms, and therefore do not suffer from these problems. We present an efficient almost wait-free algorithm for parallel accessible hashtables, which promises more robust performance and reliability than conventional lock-based implementations. Our solution is as efficient as sequential hashtables. It can easily be implemented using C-like languages and requires on average only constant time for insertion, deletion or accessing of elements. The algorithm allows the hashtables to grow and shrink when needed. A true problem of wait-free and lock-free algorithms is that they are hard to design correctly, even when apparently straightforward. The reason for this is that processes can execute all statements in every conceivable order. Since our algorithm is quite large and rather complex, we turned to the interactive theorem prover PVS to prove safety of our algorithm, which we could not have done reliably by hand. To our knowledge no algorithms of comparable complexity have ever been mechanically verified. Wait-freedom is shown informally.

关键词： Delay Data structures Fault tolerant systems Robustness Algorithm design and analysis Safety Reliability theory parallel algorithms Distributed processing Memory management

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：