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

International Symposium on parallel Processing

作者： B.S. Macey A.Y. Zomaya Parallel Computing Research Laboratory University of Western Australia Nedlands WA Australia

List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical path, most immediate successors first" (CP/MISF) priority. The ability of this type of scheduler to handle increased levels of communication overhead is examined in this paper. Three of the more popular list scheduling heuristics, HLFET and ISH and DSH, plus the mapping heuristic are subjected to a performance based comparison, with results demonstrating their inadequacies in communication-intensive cases. Performance degradation in these instances is partly due to the level alteration problem, but more significantly to conservative estimation of communication costs due to the assumption of zero link contention. The significance of this component of communication is also examined.

关键词： Optimal scheduling Processor scheduling Costs Scheduling algorithm Message passing Routing parallel processing Laboratories Australia Degradation

来源：评论

学校读者我要写书评

暂无评论

The TSTT mesh interface

The TSTT mesh interface

引用

44th AIAA Aerospace Sciences Meeting 2006

作者： Ollivier-Gooch, Carl Chand, Kyle Dahlgren, Tamara Diachin, Lori Freitag Fix, Brian Kraftcheck, Jason Xiaolin, Li Seol, E. Seegyoung Shephard, Mark S. Tautges, Timothy Trease, Harold Advanced Numerical Simulation Laboratory University of British Columbia Center for Applied Scientific Computing Lawrence Livermore National Laboratory Dept. of Applied Mathematics and Statistics SUNY Stonybrook Parallel Computing Sciences Sandia National Laboratories Scientific Computation Research Center Rensselaer Polytechnic Institute Pacific Northwest National Laboratory

ISBN: (纸本)1563478072

PDE-based numerical simulation applications commonly use basic software infrastructure to manage mesh, geometry, and discretization data. The commonality of this infrastructure implies the software is theoretically amenable to re-use. However, the traditional reliance on library-based implementations of these functionalities hampers experimentation with different software instances that provide similar functionality. This is especially true for meshing and geometry libraries where applications often directly access the underlying data structures, which can be quite different from implementation to implementation. Thus, using different libraries interchangeably or interoperably for this functionality has proven difficult at best and has hampered the wide spread use of advanced meshing and geometry tools developed by the research community. To address these issues, the Terascale Simulation Tools and Technologies center is working to develop standard interfaces to enable the creation of interoperable and interchangeable simulation tools. In this paper, we focus on a language-and data-structure-independent interface supporting query and modification of mesh data conforming to a general abstract data model. We describe the model and interface, and provide programming "best practices" recommendations based on early experience implementing and using the interface.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

C1-Conforming Quadrilateral Spectral Element Method for Fourth-Order Equations

引用

Communications on Applied Mathematics and Computation 2019年第3期1卷 403-434页

作者： Huiyuan Li Weikun Shan Zhimin Zhang State Key Laboratory of Computer Science/Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100190China School of Science Henan University of TechnologyZhengzhou 450001HenanChina Beijing Computational Science Research Center Beijing 100193China Department of Mathematics Wayne State UniversityDetroitMI 48202USA

This paper is devoted to Professor Benyu Guo's open question on the C1-conforming quadrilateral spectral element method for fourth-order equations which has been endeavored for years. Starting with generalized Jacobi polynomials on the reference square, we construct the C1-conforming basis functions using the bilinear mapping from the reference square onto each quadrilateral element which fall into three categories-interior modes, edge modes, and vertex modes. In contrast to the triangular element, compulsively compensatory requirements on the global C1-continuity should be imposed for edge and vertex mode basis functions such that their normal derivatives on each common edge are reduced from rational functions to polynomials, which depend on only parameters of the common edge. It is amazing that the C1-conforming basis functions on each quadrilateral element contain polynomials in primitive variables, the completeness is then guaranteed and further confirmed by the numerical results on the Petrov-Galerkin spectral method for the non-homogeneous boundary value problem of fourth-order equations on an arbitrary quadrilateral. Finally, a C1-conforming quadrilateral spectral element method is proposed for the biharmonic eigenvalue problem, and numerical experiments demonstrate the effectiveness and efficiency of our spectral element method.

关键词： Quadrilateral spectral element method Fourth-order equations Mapped polynomials C1-conforming basis Polynomial inclusion Completeness

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of MPI on Puma portals

Design and implementation of MPI on Puma portals

引用

Proceedings of the MPI Developer's Conference

作者： R. Brightwell L. Shuler Massively Parallel Computing Research Laboratory Sandia National Laboratories Albuquerque NM USA

As the successor to SUNMOS, the Puma operating system provides a flexible, lightweight, high performance message passing environment for massively parallel computers. Message passing in Puma is accomplished through the use of a new mechanism known as a portal. Puma is currently running on the Intel Paragon and is being developed for the Intel TeraFLOPS machine. We discuss issues regarding the development of the Argonne National laboratory/Mississippi State University implementation of the Message Passing Interface standard on top of portals. Included is a description of the design and implementation for both MPI point-to-point and collective communications, and MPI-2 one-sided communications.

关键词： Portals Message passing Operating systems Laboratories Standards development Kernel parallel processing Contracts Page description languages Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

DMSA: Dynamic Multi-Scale Unsupervised Semantic Segmentation Based On Adaptive Affinity 48

DMSA: Dynamic Multi-Scale Unsupervised Semantic Segmentation...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Yang, Kun Lu, Jun Heilongjiang University College of Computer Science and Technology Harbin150080 China Jiaxiang Industrial Technology Research Institute of Hlju Jining China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781728163277

The proposed method in this paper proposes an end-to-end unsupervised semantic segmentation architecture DMSA based on four loss functions. The framework uses Atrous Spatial Pyramid Pooling (ASPP) module to enhance feature extraction. At the same time, a dynamic dilation strategy is designed to better capture multi-scale context information. Secondly, a Pixel-Adaptive Refinement (PAR) module is introduced, which can adaptively refine the initial pseudo labels after feature fusion to obtain high quality pseudo labels. Experiments show that the proposed DSMA framework is superior to the existing methods on the saliency dataset. On the COCO 80 dataset, the MIoU is improved by 2.0, and the accuracy is improved by 5.39. On the Pascal VOC 2012 Augmented dataset, the MIoU is improved by 4.9, and the accuracy is improved by 3.4. In addition, the convergence speed of the model is also greatly improved after the introduction of the PAR module. © 2023 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

An implementation of the QR iterations for finding eigenvalues of matrices with CUDA on GPU

An implementation of the QR iterations for finding eigenvalu...

引用

2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer, MEC 2013

作者： Ren, Meirui Ren, Meihui Zhang, Wei Ping Wang, Tao Tian, Ning Li, Jinbao Guo, Longjiang School of Computer Science and Technology Heilongjiang University Harbin150080 China Harbin Research Institute of Electrical Instrumentation Harbin150028 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

ISBN: (纸本)9781479925650

Based on the principle of QR loop iterations, this paper implements a parallel algorithm based on the hardware of GPU (Graphic Process Unit) by using routines from CUDA (Computer Unified Device Architecture) to find the eigenvalues of general matrices. CPU and GPU computing card form a client-server computing framework. Here, CPU can be regarded as a client and GPU card is considered as a computing server. For the experiment environment, this paper chooses a GPU card with the model of NVIDIA GeForce GTX460 as a server side and a CPU with the model of Intel Core is-760 quad-core as a client side. Win7 64-bit is selected as the operating system. The parallel implementation consists of two parts: PA-H and PA-QR. PA-H is a procedure that transforms a matrix A into the Hessenberg matrix B. PA-QR is the actual parallel algorithm of the QR iterations that is imposed on the Hessenberg matrix B for finding eigenvalues of the general matrix A. The speedup ratio of the proposed algorithm is jarless when the number of iterations becomes greater. The experimental results show that the parallel implementation with CUDA on GPU only makes use of less running time than traditional sequential algorithms. The speedup ratio of PA-H is between 1.79 and 7.81. The speedup ratio of PA-QR is between 3.24 and 118.9. Especially, when the order of general matrix equals 8192, the amount of iterations becomes 10000. The speedup ratio of the PA-H and the PA-QR can run up to 7.81 and 118.9 respectively. © 2013 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Coevolution and evolving parallel cellular automata-based scheduling algorithms 5th

引用

5th International Conference on Evolution Artificielle, EA 2001

作者： Seredyński, Franciszek Zomaya, Albert Y. The University of Podlasie Computer Science Department Sienkiewicza 51 Siedlce08-110 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering The University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)3540435441

The paper reports new results on developing parallel algorithms for multiprocessor scheduling with use of cellular automata (CAs). The simpliest case when a multiprocessor system is limited to two processors, but without of any limitations on a size and parameters of parallel programs is considered. An approach called a selected neighborhood is used to design a structure of CAs for a given program graph. Co evolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem is proposed. Sequential and parallel scheduling algorithms discovered in the context of CAs - based scheduling system are compared. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed computing with coevolutionary algorithms 16

Parallel and distributed computing with coevolutionary algor...

引用

16th International parallel and Distributed Processing Symposium, IPDPS 2002

作者： Seredynski, F. Zomaya, A.Y. Department of Computer Science Institute of Insurance Wesola 52 Kielce25-353 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)0769515738

The problem of parallel and distributed function optimization is considered. Two coevolutionary algorithms with different degrees of parallelism and different levels of a global coordination are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with another coevolutionary algoritm called cooperative coevolutionary genetic algorithm (CCGA). The algorithms are applied for parallel and distributed optimization of a number of test functions known in the area of evolutionary computation. We show that both coevolutionary algorithms outperform a sequential GA. While both LCGA and CCGA algorithms offer high quality solutions, they may compete to outperform each other in some specific test optimization problems. The LCGA may be recommended to be used in optimization systems when high degree of parallelism is possible and non global coordination is expected while the CCGA algorithm is useful when low degree of parallelism and global coordination is acceptable. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Assessment of two pressure-velocity coupling strategies for local meshless numerical method

引用

9th International Conference on Advances in Fluid Mechanics - Advances in Fluid Mechanics IX, AFM 2012

作者： Kosec, G. Vertnik, R. Šarler, B. Jožef Stefan Institute Laboratory for Parallel and Distributed Computing Slovenia University of Nova Gorica Laboratory for Multiphase Processes Slovenia Štore steel d.o.o. Research Slovenia Centre of Excellence for Biosensors Automation and Process Control Laboratory for Advanced Materials Systems Slovenia

ISBN: (纸本)9781845646004

The performance of two pressure-velocity coupling strategies, associated with the primitive variable solution of incompressible Newtonian fluid with the meshless Local Radial Basis Function Collocation Method (LRBFCM), is compared with respect to computational efficiency, stability, accuracy and spatial convergence. The LRBFCM is structured with multiquadrics on five noded support domains. The explicit time stepping is used. The Backward- Facing Step problem (BFS) has been selected as a benchmark problem, previously tackled by several numerical methods. The semi-local fractional step method (FSM) and completely local pressure-velocity couplings (LPVC) are compared. The numerical results are validated against previously published data. The results are represented and compared in terms of a convergence plot of the reattachment position. We show that both approaches provide reasonable results;however, LVPC is less computationally complex and less stable in comparison to FSM. © 2012 WIT Press.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A 55 TFLOPS simulation of amyloid-forming peptides from yeast prion Sup35 with the special-purpose computer system MDGRAPE-3

A 55 TFLOPS simulation of amyloid-forming peptides from yeas...

引用

2006 ACM/IEEE Conference on Supercomputing, SC'06

作者： Narumi, Tetsu Ohno, Yousuke Okimoto, Noriaki Koishi, Takahiro Suenaga, Atsushi Futatsugi, Noriyuki Yanai, Ryoko Himeno, Ryutaro Fujikawa, Shigenori Taiji, Makoto Ikei, Mitsuru Intel K.K. High Performance Molecular Simulation Team Genomic Sciences Center Innovative Nanopatterning Laboratory Topochemical Design Laboratory Frontier Research System Advanced Center for Computing and Communication Software and Solutions Group Parallel and Distributed Solutions Group

ISBN: (纸本)0769527000

We have achieved a sustained performance of 55 TFLOPS for molecular dynamics simulations of the amyloid fibril formation of peptides from the yeast Sup35 in an aqueous solution. For performing the calculations, we used the MDGRAPE-3 system - -a special-purpose computer system for molecular dynamics simulations. Its nominal peak performance was 415 TFLOPS for Coulomb force calculations;this is the highest-ever performance reported for classical molecular dynamics simulations. Amyloid fibril formation is known to be related to the occurrence of severe diseases such as Alzheimer's, Parkinson's, and Creutzfeldt-Jakob diseases. The Sup35 protein is a "yeast prion protein," which forms mini-crystals due to aggregation;it forms an effective platform for studying the formation process of amyloid fibrils. In these simulations, we first elucidate that the amyloid-forming peptides GNNQQNY aggregate at a higher frequency than non-amyloid-forming peptides SQNGNQQRG;further, the GNNQQNY peptides tend to form parallel two-stranded -sheets that would grow into a cross- amyloid nucleus. The results are consistent with those obtained experimentally. Furthermore, we could observe an early elongation of the amyloid nucleus. This result is expected to contribute toward a deeper understanding of the amyloid growth mechanism. © 2006 IEEE.

关键词： Peptides

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：