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

7th international symposium on Symbolic and Numeric algorithms for Scientific Computing, SYNASC 2005

作者： Yong, Feng Yaohui, Li Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications Academia Sinica 610041 Chengdu China

ISBN: (纸本)0769524532

Dixon Resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon Resultant vanishes identically yielding no information about solutions for many algebraic and geometry problems. So, Extended Dixon Method (KSY method) was proposed for the case when the Dixon matrix is singular, but satisfies RSC criteria. However, checking RSC criteria and extracting a maximum nonsingular submatrix of Dixon matrix are symbolic methods, which restrict Extended Dixon Method to be applied in more fields. In this paper, based on polynomial interpolation theory, an efficient numerical algorithm is developed to check RSC criteria and to extract a maximum nonsingular submatrix of singular Dixon matrix. Combining with interpolation methods for computing determinant, our method can solve larger scale problems. Furthermore, our method can be carried out parallel. © 2005 IEEE.

关键词： Natural sciences computing

来源：评论

学校读者我要写书评

暂无评论

Generalized Hierarchical All-to-all Exchange Patterns

Generalized Hierarchical All-to-all Exchange Patterns

引用

IEEE 27th international parallel and Distributed Processing symposium (IPDPS)

作者： Prisacari, Bogdan Rodriguez, German Minkenberg, Cyriel IBM Res Ruschlikon Ruschlikon Switzerland

ISBN: (纸本)9780769549712

The personalized all-to-all collective exchange is one of the most challenging communication patterns in HPC applications in terms of performance and scalability. We present a framework for the design of optimized collective patterns for generic hierarchical topologies. Our proposal can be applied, among others, to two types of topologies of great importance today: (i) the family of extended generalized fat tree networks (including k-ary n-trees and their variations) which are extensively used today in both HPC and commercial data centers, and (ii) direct low-diameter scalable hierarchical architectures such as the recently proposed dragonfly networks. We argue that exchange patterns that are congruent with the underlying structure of the network have inherent advantages compared to patterns that are oblivious to this structure. However, the current commonly used hierarchical pattern, the XOR exchange, has limited applicability, because it requires that the number of communicating nodes equals an integral power of two, making it suitable only for few tree designs and unsuitable for any dragonfly network. We propose several new, generic, universally applicable approaches to perform such exchanges in a hierarchical fashion that outperform current state of the art approaches. We support our claims by means of both mathematical proofs and simulation results that show that we can achieve an improvement of almost two-fold in dragonflies, and a two-to three-fold improvement in fat tree networks in cases where the XOR exchange cannot be applied.

关键词： network topology parallel algorithms trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

PASM Project: A study of reconfigurable parallel computing

PASM Project: A study of reconfigurable parallel computing

引用

Proceedings of the 1996 2nd international symposium on parallel architectures, algorithms, and Networks, I-SPAN

作者： Siegel, Howard Jay Braun, Tracy D. Dietz, Henry G. Kulaczewski, Mark B. Maheswaran, Muthucumaru Pero, Pierre Siegel, Janet M. So, John John E. Tan, Min Theys, Mitchell D. Wang, Lee Purdue Univ West Lafayette United States

PASM is a concept for a parallel processing system that allows experimentation with different architectural design alternatives. PASM is dynamically reconfigurable along three dimensions: partitionability into independent or communicating submachines, variable interprocessor connections, and mixed-mode SIMD/MIMD parallelism. With mixed-mode parallelism, a program can switch between SIMD (synchronous) and MIMD (asynchronous) parallelism at instruction-level granularity, allowing the use of both modes in a single machine. The PASM concept is presented, showing the ways in which reconfiguration can be accomplished. Trade-offs among SIMD, MIMD, and mixed-mode parallelism are explored. The small-scale PASM prototype with 16 processing elements is described. The ELP mixed-mode programming language used on the prototype is discussed. An example of a prototype-based study that demonstrates the potential of mixed-mode parallelism is given.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Enabling software DSM system for grid computing

Enabling software DSM system for grid computing

引用

8th international symposium on parallel architectures, algorithms and Networks, I-SPAN 2005

作者： Liang, Tyng-Yeu Wu, Chun-Yi Chang, Jyh-Biau Shieh, Ce-Kuen Fan, Pei-Hsin Department of Electrical Engineering National Kaohsiung University of Applied Sciences No.415 Chien-Kung Road Kaohsiung Taiwan Department of Electrical Engineering National Chung Kung University No. 1 Ta-Hsueh Road Tainan Taiwan

ISBN: (纸本)0769525091

In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent resource allocation service to easily develop applications and aggregate distributed resources for solving their problems on the grid environment. Moreover, since the communication cost of maintaining data-consistency is a big problem for the performance of the DSM applications, Teamster-G exploits a cluster cache scheme and a two-level consistency protocol to minimize the number of data-consistency messages transferred over wide area network. We will present the framework and the performance of Teamster-G in this paper. © 2005 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Nonlinear optimization and parallel computing

引用

parallel COMPUTING 2003年第4期29卷 375-391页

作者： Migdalas, A Toraldo, G Kumar, V Tech Univ Crete DSS Lab Khania 73100 Greece Univ Naples Federico II Dipartimento Ingn Agr & Agron Territorio I-80055 Portici Italy CNR ICAR Sez Napoli I-80100 Naples Italy Univ Minnesota Dept Comp Sci Minneapolis MN 55455 USA

The new computational technologies are having a very strong influence on numerical optimization, in several different ways. Many researchers have been stimulated by the need to either conform the existing numerical techniques to the new parallel architectures or to devise completely new parallel solution approaches. A mini-symposium on parallel Computing in Nonlinear Optimization was held in Naples, Italy, September 2001, during the international Conference ParCo2001, in order to bring together researchers active in this field and to discuss and share their findings. Some of the papers presented during the mini-symposium, as well as additional contributions from other researchers are collected in this special issue. Clearly, two different trends, well representative for most of the current research activities, can be identified. Firstly, there is an attempt to encapsulate parallel/linear algebra software and algorithms into optimization codes, particularly codes implementing interior point strategies for which the linear algebra issues are very critical, and secondly, there is an effort to devise new parallel solution strategies in global optimization, either for specific or general purpose problems, motivated by the large size and the combinatorial nature of them. In the present paper we review the literature on these trends and classify the contributed papers within this framework. (C) 2003 Elsevier Science B.V. All rights reserved.

关键词： parallel computing quadratic programming interior point methods global optimization heuristics

来源：评论

学校读者我要写书评

暂无评论

It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities

It's About Time: On Optimal Virtual Network Embeddings under...

引用

IEEE 28th international parallel & Distributed Processing symposium (IPDPS)

作者： Rost, Matthias Schmid, Stefan Feldmann, Anja Tech Univ Berlin Internet Network Architectures Berlin Germany

ISBN: (纸本)9780769552071

Distributed applications often require high-performance networks with strict connectivity guarantees. For instance, many cloud applications suffer from today's variations of the intra-cloud bandwidth, which leads to poor and unpredictable application performance. Accordingly, we witness a trend towards virtual networks (VNets) which can provide resource isolation. Interestingly, while the problem of where to embed a VNet is fairly well-understood today, much less is known about when to optimally allocate a VNet. This however is important, as the requirements specified for a VNet do not have to be static, but can vary over time and even include certain temporal flexibilities. This paper initiates the study of the temporal VNet embedding problem (TVNEP). We propose a continuous-time mathematical programming approach to solve the TVNEP, and present and compare different algorithms. Based on these insights, we present the c Sigma-Model which incorporates both symmetry and state-space reductions to significantly speed up the process of computing exact solutions to the TVNEP. Based on the c Sigma-Model, we derive a greedy algorithm c Sigma(G)(A) to compute fast approximate solutions. In an extensive computational evaluation, we show that despite the hardness of the TVNEP, the c Sigma-Model is sufficiently powerful to solve moderately sized instances to optimality within one hour, and under different objective functions (such as maximizing the number of embeddable VNets). We also show that the greedy algorithm exploits flexibilities well and yields good solutions. More generally, our results suggest that already little time flexibilities can improve the overall system performance significantly.

关键词： Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Improved parameterized efficient FPGA implementations of parallel 1-D filtering algorithms using Xilinx System Generator

Improved parameterized efficient FPGA implementations of par...

引用

作者： Hasan, Sami Boussakta, Said Yakovlev, Alex School of Electrical Electronic and Computer Engineering Newcastle University NE1 7RU United Kingdom

ISBN: (纸本)9781424499908

Two hardware architectures are developed via an improved parameterized efficient FPGA implementation method for parallel 1-D real-time signal filtering algorithms to provide higher performance per Watt and minimum logic area at maximum frequency. This improvement is evidently manifested rapid system-level abstraction FPGA prototyping and optimized speed, area and power, targeting Virtex-6 xc6vlX130T1-1lff1156 FPGA board to achieve lower power consumption of (820 mW) and a (27%-44%) less device utilization at a maximum frequency of up to (231 MHz) using Xilinx System Generator. The improved parameterized FPGA implementation is a system-level abstraction of hardwareoriented parallel programming, as an alternative to gate-level Hardware Descriptive Language (HDL), to satisfy the high performance computation of parallel multidimensional filtering algorithms at a minimal development-to-market time. © 2011 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel and Improvement of Pre-computation Technique for Approximation Shortest Distance Query 7

Parallel and Improvement of Pre-computation Technique for Ap...

引用

7th international symposium on parallel architectures, algorithms, and programming, PAAP 2015

作者： Liu, Huimin Fu, Qiang Zhou, Yinghua School of Computer Science University of Science and Technology of China National High Performance Computing Center at Hefei Hefei China

ISBN: (纸本)9781467391177

With the development of mobile Internet, more and more applications are associated with location. There are many applications just care about shortest distance of two points and do not care about the paths, such as take-away applications. The problem of shortest distance query of objects has caught many researchers' attention in recent years. One of solutions is pre-computation. We can select representative node for each node in graph, and approximation shortest distance of two nodes can be obtained by computing the distance between their representative nodes. The distance between any two representative nodes is pre-computed. In this paper, we propose a more effective algorithm to select representative such that the number of representatives is less than random algorithm, and we use parallel approach to compute the shortest distance between representatives and optimize the data struct to reduce the memory cost of distance result. We evaluate our approach on a real data set. The evaluation result shows the size of representative nodes are less than random algorithm, and the computing time and memory cost reduce effectively. © 2015 IEEE.

关键词： Cost reduction

来源：评论

学校读者我要写书评

暂无评论

A parallel High-Level Library for Solving Sparse Nonlinear Systems

A Parallel High-Level Library for Solving Sparse Nonlinear S...

引用

7th international Conference on Engineering Computational Technology

作者： Migallon, H. Migallon, V. Penades, J. Univ Miguel Hernandez Dept Phys & Comp Architectures Alicante Spain Univ Alicante Dept Comp Sci & Artificial Intelligence Alicante Spain

ISBN: (纸本)9781905088416

In this paper we present a parallel library treated as a high-level interface for solving nonlinear systems. This work follows the guidelines of a high-level interface in terms of usability, but in fact it is a library developed using a mixed model in relation to the utilization of different programming languages. In order to create the high-level interfaces, we have chosen the Python language. On the other hand, the developed Fortran routines offer all the performance of the low-level language. The developed library, PyPANCG, consists of two modules, PySParNLCG and PySParNLPCG. The PySparNLCG module parallelizes the conjugate gradient method for solving the nonlinear system Ax = phi(x), and the PySParNLPCG module implements the preconditioning technique based on block two-stage methods. Experimental results report the numerical accuracy and the parallel performance of our approach on different parallel computers.

关键词： parallel libraries multicore nonlinear conjugate gradient algorithms parallel preconditioners Python high-level interfaces two-stage methods ILU factorizations

来源：评论

学校读者我要写书评

暂无评论

NCIC's research and development in parallel processing

NCIC's research and development in parallel processing

引用

Proceedings of the international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Li, Guo-jie Beijing China

National Research Center for Intelligent Computing Systems (NCIC for short) is the unique national hi-tech R/D center for advanced computing technology in China. In this overview we first introduce China's Hi-Tech R&D Programme (863 programme) and NCIC, then we reported the state of the art of parallel processing at NCIC. This article discussed the key technologies being exploited by the representative Chinese R&D teams and the wide applications of parallel computers in China. The key technologies in parallel processing we are attacking and reported in this article include wormhole routing and other efficient switching techniques, the Easter series MPP systems, the Dawning series symmetric and multi-thread multiprocessor, parallel operating systems and parallel file systems, parallel compiler and efficient programming tool. The future research directions at NCIC are also mentioned.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：