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

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

来源：评论

学校读者我要写书评

暂无评论

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

Assessment of two pressure-velocity coupling strategies for ...

引用

作者： 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

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

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution 3

An efficient local address generation for the block-cyclic d...

引用

3rd International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 1997

作者： Kwon, Oh-Young Kim, Tae-Geun Han, Tack-Don Yang, Sung-Bong Kim, Shin-Dug Distributed Computing Lab. Systems Engineering Research Institute 1 Ueun-dong Yusong-gu Taejon305-333 Korea Republic of Parallel Processing System Laboratory Dept. of Computer Science Yonsei University Seoul120-749 Korea Republic of

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time ΔM table generation method is faster than other algorithms in ΔM table generation time and access time for 10,000 array elements. © 1997 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

Detecting faults by tracing companion states in cloud computing systems

引用

Jisuanji Xuebao/Chinese Journal of Computers 2012年第5期35卷 856-870页

作者： Rao, Xiang Wang, Huai-Min Chen, Zhen-Bang Zhou, Yang-Fan Cai, Hua Zhou, Qi Sun, Ting-Tao National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China Department of Computing Platform Alibaba Cloud Computing Company Hangzhou 310011 China

A common way to construct a fault model is injecting the fault into the system and observing the subsequent symptoms, e. g. event logs. However, fault features would vary during the propagation period, and present different symptoms at different stage of the fault propagation process. The exiting detection window based feature extraction methods can only identify the early symptoms of a fault, but fail to detect the latter symptoms and cause false alarms. To solve the problem, we present a fault feature extraction method, called Companion State Tracer (CSTracer), which consists of 3 integrated steps: (1) pre-process logs to remove the unrelated logs;(2) construct a general identifier for the early symptoms of a fault;(3) construct a finite state machine model for the fault to trace the latter symptoms. CSTracer can persistently monitor a fault after the fault has been identified. We have justified the effectiveness of CSTracer in an enterprise cloud system. Compared with the existing, the results show that CSTracer has a better detection accuracy.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Hierarchical diagnostic approach for performance problems in cloud computing platforms

引用

Tongxin Xuebao/Journal on Communications 2011年第7期32卷 114-124页

作者： Mi, Hai-Bo Wang, Huai-Min Cai, Hua Yin, Gang Zhou, Qi Sun, Ting-Tao Zhou, Yang-Fan National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Computing Platform Alibaba Cloud Computing Company Hangzhou 310023 China Shenzhen Research Institute Chinese Univ. of Hong Kong Shenzhen 518057 China

A hierarchical diagnosis approach, namely Magnifier, was proposed, which models the execution path graph of a user request as component layer, module layer and function layer, and detects anomalies from higher layer to lower layer separately. Extensive experiments were conducted on the Alibaba cloud computing platform. The results indicate that, under the conditions of large volume of data and high complexity of execution paths, Magnifier can accurately and efficiently locate the prime causes of performance degradation.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A general and scalable solution for heterogeneous workflow invocation and nesting

A general and scalable solution for heterogeneous workflow i...

引用

Workshop on Workflows in Support of Large-Scale Science, WORKS

作者： Tamas Kukla Tamas Kiss Gabor Terstyanszky Peter Kacsuk Centre for Parallel Computing School of Informatics University of Westminster London UK Laboratory of the Parallel and Distributed Systems Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary

Several widely utilized, grid workflow management systems emerged in the last decade. These systems were developed by different scientific communities for various purposes. Enhancing these systems with the capability of invoking and nesting the workflows of other systems within their native workflows makes these communities to be able to carry out cross-organizational experiments and share non-native workflows. The novel solution described in this paper allows the integration of different workflow engines and makes them accessible for workflow systems in order to achieve this goal. The solution is based on an application repository and submitter, which exposes different workflow engines and executes them using the computational resources of the grid. In contrast with other approaches, our solution is scalable in terms of both number of workflows and amount of data, easily extendable in the sense that the integration of a new workflow engine does not require code re-engineering, and general, since it can be adopted by numerous workflow systems.

关键词： Engines Workflow management software Risk management Petri nets parallel processing Informatics Laboratories Concurrent computing distributed computing Automation

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution

An efficient local address generation for the block-cyclic d...

引用

IEEE International Conference on Algorithms and Architectures for parallel Processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations distributed computing Systems engineering and theory parallel processing Laboratories Computer science parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion

arXiv

引用

arXiv 2024年

作者： Wang, Yilin Hu, Minghao Huang, Zhen Li, Dongsheng Yang, Dong Lu, Xicheng Defense Innovation Institute Academy of Military Sciences China Information Research Center of Military Science China National Key Laboratory of Parallel and Distributed Computing China

The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tasks such as information extraction and dialog systems. Leveraging them for KGC re-ranking is beneficial for leveraging the extensive pre-trained knowledge and powerful generative capabilities. However, it may encounter new problems when accomplishing the task, namely mismatch, misordering and omission. To this end, we introduce KC-GenRe, a knowledge-constrained generative re-ranking method based on LLMs for KGC. To overcome the mismatch issue, we formulate the KGC re-ranking task as a candidate identifier sorting generation problem implemented by generative LLMs. To tackle the misordering issue, we develop a knowledge-guided interactive training method that enhances the identification and ranking of candidates. To address the omission issue, we design a knowledge-augmented constrained inference method that enables contextual prompting and controlled generation, so as to obtain valid rankings. Experimental results show that KG-GenRe achieves state-of-the-art performance on four datasets, with gains of up to 6.7% and 7.7% in the MRR and Hits@1 metric compared to previous methods, and 9.0% and 11.1% compared to that without re-ranking. Extensive analysis demonstrates the effectiveness of components in KG-GenRe. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

parallel global routing algorithms for standard cells

Parallel global routing algorithms for standard cells

引用

International Symposium on parallel Processing

作者： Z. Xing J. Chandy P. Banerjee Computer and Systems Research Laboratory University of Illinois Urbana IL USA Cadence Design Systems Chelmsford MA USA Center for Parallel and Distributed Computing Northwestern University Evanston IL USA

In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using the Message Passing Interface (MPI), and have been evaluated on a wide range of parallel platforms such as the Sun SparcCenter 1000 and the Intel Paragon. Our experimental results show good speedups and qualities from two of these parallel algorithms. We have been able to reduce runtimes of some circuits from half an hour to 5 minutes, obtained speedups of about 4.0 to 5.0 on 8 processors, with less than 2-3% degradation of quality of the solutions.

关键词： Routing parallel algorithms distributed computing Message passing Pins Wire Contracts Concurrent computing Laboratories Sun

来源：评论

学校读者我要写书评

暂无评论

research on the weighted reconstruction of metabolic networks

Research on the weighted reconstruction of metabolic network...

引用

第五届中国蛋白质组学大会暨首届粤港蛋白质组学学术交流会

作者： Zhou Tingting Wang Zhenghua Chan, K.C.C. Beijing Proteome Research Center BeijingP.R.China102206 National Laboratory for Parallel & Distributed ProcessingNational University of Deference and TechnologyChangshaP.R.China 410073 Department of computingthe HongKong Polytechnic UniversityHonghumHongkong Department of computing the HongKong Polytechnic UniversityHonghumHongkong National Laboratory for Parallel & Distributed Processing National University of Deference and TechnologyChangshaP.R.China 410073

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：