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

parallel programming with a pattern language *

International Journal on Software Tools for Technology Transfer 2001年第2期3卷 217-234页

作者： Massingill, Berna L. Mattson, Timothy G. Sanders, Beverly A. Department of Computer and Information Sciences University of Florida FL 32 611 United States Parallel Algorithms Laboratory Intel Corporation Dupont WA 98 327 United States

A design pattern is a description of a high-quality solution to a frequently occurring problem in some domain. A pattern language is a collection of design patterns that are carefully organized to embody a design methodology. A designer is led through the pattern language, at each step choosing an appropriate pattern, until the final design is obtained in terms of a web of patterns. This paper describes a pattern language for parallel application programs aimed at lowering the barrier to parallel programming by guiding a programmer through the entire process of developing a parallel program. We describe the pattern language, present two example patterns, and sketch a case study illustrating the design process using the pattern language. © 2001 Springer-Verlag.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Predictive performance and scalability modeling of a large-scale application 01

Predictive performance and scalability modeling of a large-s...

引用

2001 ACM/IEEE Conference on Supercomputing, SC 2001

作者： Kerbyson, D.J. Alme, H.J. Hoisie, A. Petrini, F. Wasserman, H.J. Gittings, M. Los Alamos National Laboratory Parallel Architectures and Performance Team CCS-3 Modeling Algorithms and Informatics Group Los AlamosNM87545 United States Saic Los Alamos National Laboratory United States

ISBN: (纸本)158113293X

In this work we present a predictive analytical model that encompasses the performance and scaling characteristics of an important ASCI application. SAGE (SAIC's Adaptive Grid Eulerian hydrocode) is a multidimensional hydrodynamics code with adaptive mesh refinement. The model is validated against measurements on several systems including ASCI Blue Mountain, ASCI White, and a Compaq Alphaserver ES45 system showing high accuracy. It is parametric - - basic machine performance numbers (latency, MFLOPS rate, bandwidth) and application characteristics (problem size, decomposition method, etc.) serve as input. The model is applied to add insight into the performance of current systems, to reveal bottlenecks, and to illustrate where tuning efforts can be effective. We also use the model to predict performance on future systems. © 2001 ACM.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Air pollution modelling of accidents involving hazardous substances 16

Air pollution modelling of accidents involving hazardous sub...

引用

16th Conference of the Euro-American Consortium for Promoting the Application of Mathematics in Technical and Natural Sciences, AMiTaNS 2024

作者： Ostromsky, Tzvetan Alexiev, Kiril Parvanov, Stefan Department of Parallel Algorithms and Machine Learning Neurotechnology Laboratory Institute of Information and Communication Technologies Bulgarian Academy of Sciences Sofia Bulgaria Faculty of Fire Safety and Civil Protection Academy of the Ministry of Interior Sofia Bulgaria

Air pollution modeling for accidents involving hazardous substances is a critical aspect of emergency response and environmental protection. This modeling aims to predict the dispersion and impact of toxic substances released into the atmosphere during accidents, such as industrial spills, transport accidents, chemical plant incidents or acts of terrorism. Such dangers are among the challenges which the modern society is facing and has to overcome. In this study we propose a systematic approach for organizing monitoring, collecting data from mobile sensors, creating situation development scenarios, modelling the spread of potential toxic-element pollution in dependence with the current meteorological conditions. The UNI-DEM model for simulation of the pollutants' dispersion and transport in the air, as well as models for spread of leaking gas and liquid vapors are involved in this study. Finally, depending on the comprehensive analysis of the modeling results, an adequate response to such severe situations can be proposed. Assessment of safety, healthcare and environmental impacts should be the final result and the most socially important application of our work. The calculated pollutant concentrations can be compared with regulatory standards or health-based guidelines to assess potential health risks to exposed populations and environmental impacts on ecosystems. The importance of this information for emergency response planning, public health interventions, and environmental management strategies is beyond dispute. © 2024 Institute of Physics Publishing. All rights reserved.

关键词： Emergency services

来源：评论

学校读者我要写书评

暂无评论

Distributed center location algorithm for fault-tolerant multicast in wide-area networks

Distributed center location algorithm for fault-tolerant mul...

引用

Reliable Distributed Systems

作者： S. Ali A. Khokhar Scalable and Parallel Algorithms Laboratory (ScaPAL) Department of Electrical and Computer Engineering University of Delaware Newark USA

Group shared trees form a major component of most multicast routing protocols (e.g. PIM-SMv2, CBTv3). The shared trees are built by choosing one node as the center of the tree. The optimal location of a center under the constraints of minimal tree cost and delay for a particular group is an NP-complete problem. Current implementations of protocols decide on the location of these centers administratively, an attractive choice given that the solution is obviously sub-optimal and does not lend itself to dynamic reconfiguration of centers. We present a scalable heuristic to find a near-optimal solution to the center location problem. Our solution is easily amenable to distributed implementation and provides the protocol with a list of possible centers ranked in the order of their optimality, therefore providing fault tolerance and reducing the chances of a single point of failure at the center.

关键词： Multicast algorithms Fault tolerance Intelligent networks Multicast protocols Routing protocols Internet Tree graphs parallel algorithms Electronic mail Delay

来源：评论

学校读者我要写书评

暂无评论

A pattern language for parallel application programs 6

引用

6th International European Conference on parallel Computing, Euro-Par 2000

作者： Massingill, Berna L. Mattson, Timothy G. Sanders, Beverly A. Department of Computer and Information Science and Engineering University of Florida GainesvilleFL United States Parallel Algorithms Laboratory Intel Corporation United States Department of Computer and Information Science and Engineering University of Florida GainesvilleFL United States

ISBN: (纸本)9783540679561

A design pattern is a description of a high-quality solution to a frequently occurring problem in some domain. A pattern language is a collection of design patterns that are carefully organized to embody a design methodology. A designer is led through the pattern language, at each step choosing an appropriate pattern, until the final design is obtained in terms of a web of patterns. This paper describes a pattern language for parallel application programs. The goal of our pattern language is to lower the barrier to parallel programming by guiding a programmer through the entire process of developing a parallel program. © Springer-Verlag Berlin Heidelberg 2000.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Pixel level interleaving schemes for robust image communication

Pixel level interleaving schemes for robust image communicat...

引用

Reliable Distributed Systems

作者： R. Hasimoto-Beltran A. Khokhar Scalable and Parallel Algorithms Laboratory (ScaPAL) Department of Electrical and Computer Engineering University of Delaware Newark DE USA

Interleaving schemes have proven to be an important mechanism in reducing the effect of network errors on image transmission. Current interleaving schemes spatially decorrelate neighboring image blocks by putting them into packets that are a long way apart from each other in the transmission sequence. Most of the existing schemes, while achieving good performance on random packet losses, do not work well in the case of bursty packet losses. In this paper, we propose two interleaving schemes where the decorrelation process is applied not only at the block level but also at the pixel or coefficient level (i.e. on the information within the blocks) in the compressed domain. The decorrelation is achieved via a k-way shuffle of pixels among the blocks and by using the spatial properties of different space-filling curves, where k depends on the total number of blocks in the image. Our results show that in spite of the decorrelation of coefficients in the triangular interleaving scheme, the compression ratio is within 92% to -98% of JPEG standard compression. We also show that, when compared with existing interleaving schemes, our techniques provide improved image quality and a low mean square error in the transmitted images in the presence of random as well as bursty packet losses in networks.

关键词： Pixel Interleaved codes Robustness Image communication Decorrelation Image coding Performance loss Transform coding Image quality Mean square error methods

来源：评论

学校读者我要写书评

暂无评论

MONOTONE-SCHWARZ parallel ALGORITHM FOR NONLINEAR ELLIPTIC EQUATIONS∗

引用

parallel algorithms and Applications 1996年第3-4期9卷 173-184页

作者： Qiming He[a] D. J. Evans[b] [a] State Key Laboratory of Software Engineering Wuhan University Wuhan People's Republic of China [b] Parallel Algorithms Research Centre Loughborough University of Technology Loughborough Leicestershire UK

In this paper, a new monotone-Schwarz parallel algorithm for solving a class of semilinear elliptic systems is proposed. In the case of overlapping subdomains, the detailed procedures for constructing iterative sequen... 详细信息

关键词： Schwarz iteration monotone method monotone-Schwarz parallel algorithm convergence Schwarz iteration monotone method monotone-Schwarz parallel algorithm convergence

来源：评论

学校读者我要写书评

暂无评论

Linear algebra calculations on the BBN TC2000 2nd

Linear algebra calculations on the BBN TC2000

引用

2nd Joint International Conference on Vector and parallel Processing, CONPAR 1992

作者： Amestoy, Patrick R. Daydé, Michel J. Duff, Iain S. Morère, Pierre CERFACS 42 av. G. Coriolis Toulouse Cedex31057 France ENSEEIHT-IRIT 2 rue Camichel Toulouse CEDEX31071 France Rutherford Appleton Laboratory OxonOX11 0QX United Kingdom Parallel Algorithms Group CERFACS France

ISBN: (纸本)9783540558958

The BBN TC2000 is a distributed-memory multiprocessor with up to 512 RISC processor nodes. The originality of the BBN TC2000 comes from its interconnection network (Butterfly switch) and from its globally addressable memory. We evaluate, in this paper, the impact of the memory hierarchy of the TC2000 on the design of algorithms for linear algebra. On shared memory multiprocessor computers, block algorithms have been introduced for efficiency. We study here the potential and the limitations of such approaches on the BBN TC2000. We describe the implementation of Level 3 BLAS and examine the performance of some of the LAPACK routines. We also study the factorization of sparse matrices based on a multifrontal approach. The ideas introduced for the parallelization of full linear algebra codes are applied to the sparse case. We discuss and illustrate the limitations of this approach in sparse multi-frontal factorization. We show that the speed-ups obtained on the class of methods presented here are comparable to those obtained on more classical shared memory computers. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

BULK-SYNCHRONOUS parallel algorithms FOR QR AND QZ MATRIX FACTORISATION

引用

parallel algorithms and Applications. 1997年第1-2期11卷 97-112页

作者： RADU CALINESCU DAVID J. EVANS [a] Programming Research Group Oxford University Computing Laboratory Oxford 0X1 3QD UK [b] Parallel Algorithms Research Centre Loughborough University of Technology Loughborough Leicestershire LE11 3TU UK

This paper presents bulk-synchronous parallel (BSP) algorithms for linear system solving through QR and QZ factorisation. The two new algorithms are analysed in terms of the BSP cost model, and portable implementations of the QR and QZ decomposition methods are devised using the Oxford BSP Library. The experimental results obtained on a shared-memory multiprocessor accurately match the theoretical predictions, permitting a thorough comparison of the two algorithms.

关键词： linear system solving QR factorisation QZ factorisation bulk-synchronous parallel model

来源：评论

学校读者我要写书评

暂无评论

Advanced Stochastic Approaches for Fredholm Integral Equations 15

Advanced Stochastic Approaches for Fredholm Integral Equatio...

引用

15th Conference of the Euro-American Consortium for Promoting the Application of Mathematics in Technical and Natural Sciences, AMiTaNS 2023

作者： Todorov, Venelin Georgiev, Slavi Department of Information Modeling Institute of Mathematics and Informatics Bulgarian Academy of Sciences 8 Acad. Georgi Bonchev Str. Sofia1113 Bulgaria Department of Parallel Algorithms and Machine Learning with A Laboratory in Neurotechnologies Institute of Information and Communication Technologies Bulgarian Academy of Sciences 25A Acad. Georgi Bonchev Str. Sofia1113 Bulgaria Department of Applied Mathematics and Statistics University of Ruse 8 Studentska Str. Ruse7004 Bulgaria

Integral equations are of high applicability in different areas of applied mathematics, physics, engineering, geophysics, electricity and magnetism, kinetic theory of gases, quantum mechanics, mathematical economics, and queuing theory. That is why it is reasonable to develop and study efficient and reliable approaches to solve integral equations. For multidimensional problems the existing biased stochastic algorithms based on evaluation of finite number of integrals will suer more from the effect of high dimensionality, because they are based on quadrature points. So we need advanced unbiased algorithms for solving the multidimensional problem which is developed in this paper. A new unbiased stochastic method for solving multidimensional Fredholm integral equations of second kind is proposed and analysed. We compared the newly proposed unbiased algorithm with the old unbiased stochastic algorithm for the one dimensional problem and multidimensional problem. © Published under licence by IOP Publishing Ltd.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：