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

1st Annual International Computing and Combinatorics Conference (COCOON 95)

作者： Han, YJ Shen, XJ UNIV MISSOURI COMP SCI TELECOMMUN PROGRAMKANSAS CITYMO 64110

ISBN: (纸本)354060216X

We present a conservative CRCW parallel algorithm for integer sorting. This algorithm sorts n integers from {0,1,..., m-1} in time O(n log log min (m, n,)/P + using p processors. The simulation of our parallel algorithm on the sequential machine yields a sequential algorithm for integer sorting which sorts n integers from {0,1,..., m-1) in time O(n min (log log n, log (log m/log n)).

关键词： algorithms Analysis of algorithms Bucket sorting conservative algorithms Design of algorithms Integer sorting Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of conservative algorithms in parallel simulation languages

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2000年第4期11卷 395-411页

作者： Bagrodia, RL Takai, M Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA

Parallel discrete event simulation with conservative synchronization algorithms has been used as a high performance alternative to sequential simulation. In this paper, we examine the performance of a set of parallel conservative algorithms that have been implemented in the Maisie parallel simulation language. The algorithms include the asynchronous null message algorithm, the synchronous conditional event algorithm, and a new hybrid algorithm called Accelerated Null Message that combines features from the preceding algorithms. The performance of the algorithms is compared using the Ideal Simulation Protocol. This protocol provides a tight lower bound on the execution time of a simulation model on a given architecture and serves as a useful base to compare the synchronization overheads of the different algorithms. The performance of the algorithms is compared as a function of various model characteristics that include model connectivity, computation granularity, load balance, and lookahead.

关键词： discrete-event simulation parallel and distributed simulation conservative algorithms parallel simulation languages lookahead algorithmic efficiency

来源：评论

学校读者我要写书评

暂无评论

Energy consistent algorithms for frictional contact problems

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 1998年第5期42卷 799-827页

作者： Chawla, V Laursen, TA Duke Univ Dept Civil & Environm Engn Durham NC 27708 USA

In this paper, the energy and momentum conserving algorithmic paradigm is extended to encompass a phenomenon featuring physical dissipation: dynamic frictional contact. Whereas in other works dealing with conservative systems the chief aim is often the maintenance of numerical stability in the non-linear regime, in this investigation we seek to achieve not only this benefit but also the accurate algorithmic production of physical dissipation associated with frictional processes;The approach here features a product formula algorithm for the evolution of local frictional conditions, with the associated operator split guided by an a priori energy estimate. The resulting algorithm is characterized by exact conservation of energy during stick friction, and positive dissipation consistent with the frictional model used during slip. Effectiveness of the algorithm is demonstrated by a series of finite element simulations involving large deformations and frictional slip, complete with appropriate comparisons to more traditional schemes. (C) 1998 John Wiley & Sons, Ltd.

关键词： contact friction dynamics finite elements conservative algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs

引用

SIAM JOURNAL ON COMPUTING 2002年第6期31卷 1852-1878页

作者： Han, YJ Shen, XJ Univ Missouri Sch Interdisciplinary Comp & Engn Kansas City MO 64110 USA

We present a significant improvement for parallel integer sorting. On the EREW (exclusive read exclusive write) PRAM our algorithm sorts n integers in the range {0, 1,..., m 1} in time O(log n) with O(n(q) (log n) over bar /k) operations using word length k log( m + n), where 1 less than or equal to k less than or equal to log n. In this paper we present the following four variants of our algorithm. (1) The first variant sorts integers in {0, 1,..., m - 1} in time O(log n) and in linear space with O(n) operations using word length log m log n. (2) The second variant sorts integers in {0, 1,..., n - 1} in time O ( log n) and in linear space with O(n rootlog n) operations using word length log n. (3) The third variant sorts integers in {0, 1,..., m - 1} in time O(log(3)/(2)n) and in linear space with O(n rootlog n) operations using word length log(m + n). (4) The fourth variant sorts integers in {0, 1,..., m - 1} in time O(log n) and space O(nm(epsilon)) with O(n rootlog n) operations using word length log( m + n). Our algorithms can then be generalized to the situation where the word length is k log( m + n), 1 less than or equal to k less than or equal to log n.

关键词： algorithms analysis of algorithms bucket sorting conservative algorithms design of algorithms integer sorting parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Addressing blocking and scalability in Critical Channel Traversing 16

Addressing blocking and scalability in Critical Channel Trav...

引用

16th Workshop on Parallel and Distributed Simulation

作者： Simmonds, R Kiddle, C Unger, B Univ Calgary Dept Comp Sci Calgary AB Canada

ISBN: (纸本)0769516084

This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator The first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy waiting. The second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.

关键词： parallel discrete event simulation conservative algorithms performance

来源：评论

学校读者我要写书评

暂无评论

Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs

Parallel integer sorting is more efficient than parallel com...

引用

10th Annual ACM-SIAM Symposium on Discrete algorithms

作者： Han, YJ Shen, XJ Univ Missouri Sch Interdisciplinary Comp & Engn Kansas City MO 64110 USA

ISBN: (纸本)0898714346

关键词： algorithms analysis of algorithms bucket sorting conservative algorithms design of algorithms integer sorting parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Fixing Nondeterminism in Large Discrete-Event Knowledge 25

Fixing Nondeterminism in Large Discrete-Event Knowledge

引用

25th KES International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (KES)

作者： Dusi, Michele Lamperti, Gianfranco Univ Brescia Dept Informat Engn I-25123 Brescia Italy

Discrete-event knowledge (DEK) consists in a variety of automaton-based data structures which are generated by knowledgebased and engineering systems, including intelligent diagnosis systems. Model-based diagnosis methods for discrete-event systems (DESs) are typically supported by large automata that allow for the efficient generation of the candidate diagnoses when the DES is being operated. However, the generation of the DEK may involve a determinization step, where a nondeterministic finite automaton (NFA) is transformed into an equivalent deterministic finite automaton (DFA) by means of the classical Subset Construction algorithm. When this determinization is performed online and the NFA is large, the diagnosis engine may slow down to such an extent that the entire diagnosis task is jeopardized. This is why a novel determinization algorithm is proposed, called Quick Subset Construction, which, instead of generating from scratch the equivalent DFA, removes the nondeterminism by operating directly on the NFA. This way, the larger the NFA and the smaller the portion of nondeterminism involved, the faster Quick Subset Construction will be over Subset Construction. Massive experimentation on large automata has confirmed this result empirically. (C) 2021 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the scientific committee of the KES International.

关键词： knowledge representation discrete-event knowledge model-based reasoning finite automata discrete-event systems nondeterminism determinization uncertainty subset construction large-scale systems conservative algorithms

来源：评论

学校读者我要写书评

暂无评论

Sorting and searching on the word RAM

引用

15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 98)

作者： Hagerup, T Max Planck Inst Informat D-66123 Saarbrucken Germany

ISBN: (纸本)3540642307

A word RAM is a unit-cost random-access machine with a word length of w bits, for some ur, and with an instruction repertoire similar to that found in present-day computers. The simple lower bounds for the problems of sorting and searching valid in the comparison-based model do not hold for the word RAM, so that the well-known algorithms for these tasks are not optimal for the word RAM. This paper gives an overview of faster algorithms known for sorting and searching on the word RAM, many of which were developed within the last few years.

关键词： sorting searching dictionaries word RAM word-level parallelism conservative algorithms exponential range reduction tries fusion trees exponential search trees multiplication AC(0) network flow

来源：评论

学校读者我要写书评

暂无评论

Reducing null messages using grouping and status retrieval for a conservative discrete-event simulation system 09

Reducing null messages using grouping and status retrieval f...

引用

Proceedings of the 2009 Spring Simulation Multiconference

作者： Bevin Thomas Syed S. Rizvi Khaled M. Elleithy University of Bridgeport Bridgeport CT

In this paper we investigate Chandy-Misra-Bryant Null message algorithm and propose a grouping technique to improve the performance. This technique along with status retrieval which will be explained in detail can improve the performance when compared to the traditional conservative algorithm by Chandy-Misra-Bryant. Null message algorithm is an efficient conservative algorithm that uses null messages to provide synchronization between logical processes in a parallel discrete event simulation (PDES) system. The performance can be decreased if a large number of null messages are generated by LPs to avoid deadlock. The main objective of this research work is to propose a new grouping technique that can be used to reduce the Null messages between the logical processes. Since the performance of Null Message algorithm mainly depends on the Lookahead (L) values, our proposed technique can be used to determine an optimum value of the Lookahead.

关键词： conservative algorithms parallel systems null message algorithm discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Discrete conservation laws for finite element discretisations of multisymplectic PDEs

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2021年 444卷 110520-110520页

作者： Celledoni, Elena Jackaman, James NTNU Dept Math Sci N-7491 Trondheim Norway Mem Univ Newfoundland Dept Math & Stat St John NF A1C 5S7 Canada

In this work we propose a new, arbitrary order space-time finite element discretisation for Hamiltonian PDEs in multisymplectic formulation. We show that the new method which is obtained by using both continuous and discontinuous discretisations in space, admits a local and global conservation law of energy. We also show existence and uniqueness of solutions of the discrete equations. Further, we illustrate the error behaviour and the conservation properties of the proposed discretisation in extensive numerical experiments on the linear and nonlinear wave equation and the nonlinear Schrodinger equation. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Parabolic multisymplectic PDEs Space-time finite element methods conservative algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：