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

International Conference on Communications, Circuits and Systems

作者： Huang, L Cai, YC Hong, XL Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)0780386477

Floorplanning is a critical phase in physical design of VLSI circuits and has been acknowledged as a compute-intensive process. As a result, several research efforts have been undertaken to parallelize the algorithm. While previous work has been focused on slicing floorplan, we present a parallel algorithm for non-slicing floorplan using Corner Block List (CBL) topological representation. In this paper, a parallel interconnection cost calculation algorithm with load balancing strategy is initiated in order to speed up the especially time consuming wire length calculation in floorplanning. Multiple Markov chains strategy is also embedded in our algorithm. The experiment results obtained from the tests on MCNC benchmarks indicate considerable speedup and preserved floorplanning quality.

关键词： VLSI floorplan parallel algorithm corner block list simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A fast efficient parallel hough transform algorithm on LARPBS

A fast efficient parallel hough transform algorithm on LARPB...

引用

International Symposium on parallel and Distributed Processing and Applications (ISPA 2003)

作者： Chen, L Chen, HJ Pan, Y Chen, YX Yangzhou Univ Dept Comp Sci Yangzhou 225009 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA

A parallel algorithm for Hough transform on a linear array with reconfigurable pipeline bus system (LARPBS) is presented. Suppose the number of theta-values to be considered is m, for an image with n x n pixels, the algorithm can complete Hough transform in O(1) time using mn(2) processors and achieve optimal speed and efficiency. We also illustrate how to partition data and perform the algorithm on a LARPBS with fewer than mn(2) processors, and hence show that the algorithm is highly scalable.

关键词： LARPBS model Hough transform parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms of the scanning mask method for primary images processing 04

Parallel algorithms of the scanning mask method for primary ...

引用

Proceedings of the 5th international conference on Computer systems and technologies

作者： Atanaska Bosakova-Ardenska Naiden Vasilev Technical University Sofia branch Plovdiv

This paper discusses the possibility of parallel images processing. It proposes several parallel algorithms for primary processing of grey and colour images by method of scanning mask. An evaluation of proposed algori... 详细信息

ISBN: (纸本)9789549641387

关键词： method of the scanning mask parallel algorithm primary images processing

来源：评论

学校读者我要写书评

暂无评论

Fourth-order parallel Rosenbrock formulae for stiff systems

引用

MATHEMATICAL AND COMPUTER MODELLING 2004年第11-12期40卷 1193-1198页

作者： Voss, DA Western Illinois Univ Dept Math Macomb IL 61455 USA

Rosenbrock methods are frequently used for the numerical solution of stiff initial value problems. Such linearly implicit methods are characterized by a relatively easy implementation together with excellent linear stability properties. In this paper, we consider modified Rosenbrock methods with s external linearly implicit stages each of which contains p additional linearly implicit internal stages. The internal stages are already parallel so that they can be solved for independently of each other and, consequently, the processors need to exchange their-results only after the completion, of each of the s external stages. We focus on the design of fourth-order methods with three external stages. Using embedded third-order methods, a variable step size implementation is compared with well-known Rosenbrock codes for performance on the Robertson problem. (C) 2005 Elsevier Ltd. All rights reserved.

关键词： Rosenbrock methods A-stable parallel algorithm stiff initial value problem adaptivity

来源：评论

学校读者我要写书评

暂无评论

A library hierarchy for implementing scalable parallel search algorithms

引用

JOURNAL OF SUPERCOMPUTING 2004年第2期28卷 215-234页

作者： Ralphs, TK Ládanyi, L Saltzman, MJ Lehigh Univ Dept Ind & Syst Engn Bethlehem PA 18015 USA IBM Corp Thomas J Watson Res Ctr Dept Math Sci Yorktown Hts NY 10598 USA Clemson Univ Dept Math Sci Clemson SC 29634 USA

This paper describes the design of the Abstract Library for parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data-intensive algorithms, in which large amounts of data are required to describe each node in the search tree. Implementing such algorithms in a scalable manner is challenging both because of data storage requirements and communication overhead. ALPS incorporates a number of new ideas to address this challenge. The paper also describes the design of two other libraries forming a hierarchy built on top of ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that supports the implementation of parallel branch and bound algorithms in which the bounds are obtained by solving some sort of relaxation, usually Lagrangian. In this layer, the notion of global data objects associated with the variables and constraints is introduced. These global objects provide a connection between the various subproblems in the search tree, but they pose further difficulties for designing scalable algorithms. The other library is the BiCePS linear integer solver (BLIS), a concretization of BiCePS, in which linear programming is used to obtain bounds in each search tree node.

关键词： parallel algorithm parallel search parallel branch and bound optimization integer programming

来源：评论

学校读者我要写书评

暂无评论

parallel Multi-grid algorithm Based on Cluster Computing with Application to Transient Heat Transfer

Parallel Multi-grid Algorithm Based on Cluster Computing wit...

引用

2004 International Symposium on Distributed Computing and Applications to Business, Engineering and Science

作者： Zongbo Zhu~1,Guoxun Yang~2,Chunxiao Liu~3,Jinsheng Xiao~4 1 Center of Advanced Educational Technology,Wuhan University of Technology,Hubei 430063,China 2 School of Computer Science and Technology,Wuhan University of Technology,Hubei 430063,China 3 School of Energy and Power Engineering,Wuhan University of Technology,Hubei 430063,China 4 State Key Laboratory of Advanced Technology for Materials Synthesis and Processing, Wuhan University of Technology,Hubei 430070,China

The partial differential equations are often used in science and engineering *** solutions cannot be got analytical,so the numerical methods are often used to get approximate *** achieve high precision,more computing time is *** the long time in practical applications is not often allowed,so the precision of final results has to be *** on cluster system,this paper studies the parallel multi-grid method and its application in the numerical analysis of heat *** results from the sample show that the method not only can expand the size of solved problems efficiently,but also can gain excellent parallel efficiency;therefore it is a method suitable for network parallel environment based on cluster system.

关键词： parallel algorithm multi-grid algorithm heat transfer heat conduction domain decomposition methods cluster computing

来源：评论

学校读者我要写书评

暂无评论

Performance and reliability modeling for a parallel image fusion system

引用

MATHEMATICAL AND COMPUTER MODELLING 2004年第1期39卷 61-73页

作者： Achalakul, T Wattanapongsakorn, N King Mongkuts Univ Technol Thonburi Dept Comp Engn Bangkok 10140 Thailand

This paper presents a novel parallel algorithm for multispectral image fusion called the s-PCT. The algorithm is designed based on a manager-worker threading concept and goes further to use redundancy to achieve fault tolerance. The paper emphasizes asymptotic analysis using analytical models and empirical studies that allow performance to be assessed for a wide variety of typical variations in use. For example, changes to the number of spectra, image resolution, number of processors, degree of redundancy, and reliability. Software reliability concept is studied and applied to the algorithm analysis. The performance and reliability relationship is also defined. The motivation in deriving the performance-reliability model is to assess the impact of changes in technology and problem size associated with different applications, allowing performance-reliability tradeoffs to be assessed. In other words, given a problem size and a reliability constraint, the model can be used to estimate the achievable performance. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： fault tolerance reliability modeling performance prediction parallel algorithm image fusion

来源：评论

学校读者我要写书评

暂无评论

parallel text categorization for multi-dimensional data

引用

5th International Conference on parallel and Distributed Computing

作者： Lertnattee, V Theeramunkong, T Silpakorn Univ Fac Pharm Nakhon Pathom 73000 Thailand Thammasat Univ Sirindhorn Int Inst Technol Pathum Thani 12000 Thailand

ISBN: (纸本)3540240136

In this paper, we propose a multi-dimensional category model (MDCM) for classifying multi-dimensional text collection. We can parallel and distribute the process of text classification in separately on each dimension. With this model, performance of classifiers improves in both accuracy and time complexity. For classification accuracy, some benefits can be obtained. Classifiers learn from larger training documents with a small number of classes on each dimension. We can select the best classifier for each dimension and combine the results from them. For time complexity, the learning and classifying phases can be in parallel and distributed manner. The efficiency of MDCM is investigated on drug information data set which assigns topics in monographs in the first dimension and primary therapeutic classes in the second dimension. The experimental results show that parallel text classification on MDCM performs better than flat model in both accuracy and time complexity.

关键词： text classification multi-dimensional data parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel transient stability limit search method for on-line transient stability assessment

A parallel transient stability limit search method for on-li...

引用

International Conference on Power System Technology (POWERCON 2004)

作者： Jin, MJ Chan, KW Mei, SW Mo, N Lu, Q Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

ISBN: (纸本)0780386108

In this paper, a modified signal energy method called the envelope method will first be proposed to estimate the transient stability limit, and then a parallel envelope method is developed to speed up the limit search for online applications. A new weighting limit estimation formula is used for improving the estimation accuracy and minimizing of the effects of observing nodes of the original signal energy method. The effectiveness and the computation speed of the proposed method have been fully evaluated on a 20 machine 100 bus UK system using a 4 CPU SW workstation. Simulation results show that the envelope method could achieve better accuracy than the original signal energy method and is very fast. Timing measurements show that even the serial envelope method could have faster computation speed than the parallel time-domain-simulation method, and the parallel envelope method is the fastest and is suitable for online security analysis and control applications.

关键词： transient stability signal energy time simulation power system stability parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving the Langford problem in parallel

Solving the Langford problem in parallel

引用

3rd International Symposium on parallel and Distributed Computing (ISPDC 2004)/3rd International Workshop on algorithms, Models and Tools for parallel Computing on Heterogeneous Networks (HeteroPar 04)

作者： Jaillet, C Krajecki, M Univ Reims Dept Math & Informat F-51687 Reims 2 France

ISBN: (纸本)0769522106

In this paper, the parallel resolution of the Langford problem is studied. Two different approaches are developed. First, an explicit construction of all the solutions is done using it shared memory. The application associated to this approach is written in C using the standard OpenMP library. Second, a parallelization of the algebraic method introduced by Godfrey is proposed. The application is taking advantage of MPI and has revealed efficient up to 128 processors. This solution opens up some new perspectives such as solving the already resolved instances of the problem more quickly and solving the next two open instances of the problem in a near future.

关键词： Langford problem OpenMP MPI parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：