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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,139 篇 会议
30 篇 期刊文献
5 册 图书

馆藏范围

1,174 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

575 篇 工学
- 540 篇 计算机科学与技术...
- 343 篇 软件工程
- 76 篇 控制科学与工程
- 74 篇 信息与通信工程
- 58 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
182 篇 理学
- 140 篇 数学
- 40 篇 系统科学
- 38 篇 统计学（可授理学、...
- 18 篇 物理学
- 13 篇 化学
- 9 篇 生物学
38 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 工商管理
- 7 篇 图书情报与档案管...
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 军事学
2 篇 医学
1 篇 农学

主题

241 篇 computational mo...
218 篇 computer simulat...
206 篇 discrete event s...
115 篇 concurrent compu...
82 篇 distributed comp...
79 篇 computer science
72 篇 parallel process...
69 篇 protocols
53 篇 time warp simula...
53 篇 analytical model...
52 篇 computer archite...
48 篇 large-scale syst...
47 篇 computer network...
46 篇 costs
43 篇 parallel process...
40 篇 circuit simulati...
36 篇 predictive model...
34 篇 hardware
34 篇 delay
33 篇 runtime

机构

18 篇 college of compu...
12 篇 school of comput...
9 篇 georgia inst tec...
9 篇 department of co...
8 篇 dipartimento di ...
8 篇 department of co...
7 篇 school of comput...
6 篇 coll of william ...
6 篇 department of co...
6 篇 georgia inst of ...
6 篇 univ roma la sap...
6 篇 computer science...
5 篇 gintic institute...
5 篇 rensselaer polyt...
5 篇 school of applie...
5 篇 school of comput...
5 篇 georgia institut...
4 篇 mitre corporatio...
4 篇 georgia inst of ...
4 篇 department of el...

作者

23 篇 wentong cai
17 篇 fujimoto richard...
13 篇 d.m. nicol
13 篇 cai wentong
12 篇 nicol david m.
12 篇 r.m. fujimoto
10 篇 f. quaglia
10 篇 r. bagrodia
9 篇 rajive bagrodia
9 篇 s.j. turner
9 篇 bagrodia rajive
8 篇 r. fujimoto
8 篇 b. unger
8 篇 david m. nicol
7 篇 p.a. wilsey
7 篇 shell ying huang
7 篇 quaglia f
7 篇 richard m. fujim...
7 篇 yu-an chen
7 篇 wilsey philip a.

语言

1,162 篇 英文
7 篇 俄文
4 篇 中文
1 篇 其他

检索条件"任意字段=Proceedings of the thirteenth workshop on Parallel and distributed simulation"

共 1174 条记录，以下是411-420 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Using quad trees for parallelizing conflict detection in a sequential simulation

Using quad trees for parallelizing conflict detection in a s...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Wieland, F Carnes, D Schultz, G Mitre Corp Ctr Adv Aviat Syst Dev Mclean VA 22102 USA

ISBN: (纸本)0769511058

This paper describes a parallel proximity detection algorithm and illustrates its application to the problem of conflict detection in an aviation simulation. The algorithm invokes a previously designed sequential function in parallel, using spatial information acquired during the traversal of a quad tree, to keep the separate invocations of the function as independent as possible. The method is generally applicable to any function (not just conflict detection) whose arguments are spatially organized. Empirical results shoe that a single-threaded version of the algorithm sped up the simulation by 57%, while a four-threaded parallel version extracted 30% of the remaining additional speedup. These results are even more noteworthy given that the architecture of the simulation remains intact: we only replace the invocation mechanism for one function.

关键词： Proximity indicators

来源：评论

学校读者我要写书评

暂无评论

Synchronous relaxation for parallel Ising spin simulations

Synchronous relaxation for parallel Ising spin simulations

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Lubachevsky, B Weiss, A Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)076951104X;0769511058

A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as "relaxation" [3];hence it is named "synchronous relaxation." We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N/logN. All communication delays, processing time, and busy waits are taken into account.

关键词： conservative simulation optimistic simulation computational physics Metropolis algorithm

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal correlations and rollback distributions in optimistic simulations

Spatio-temporal correlations and rollback distributions in o...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Overeinder, BJ Schoneveld, A Sloot, PMA Univ Amsterdam Fac Sci Sect Computat Sci NL-1098 SJ Amsterdam Netherlands

ISBN: (纸本)0769511058

In this paper we study the influence of spatio-temporal correlations on the dynamic runtime behaviour of the optimistic parallel Time Warp simulation method. By using the Ising spin model, we show experimentally that the distribution of the number of rolled back events behaves as a power-law distribution over a large range of sub-critical Ising temperatures and decays exponentially for super-critical Ising temperatures. For critical Ising temperatures, where long-range correlations occur, the computational complexity of Time Warp and physical complexity of the Ising spin model are entangled and contribute both to the runtine behavior in a nonlinear way.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

The resource sharing system:: Dynamic federate mapping for HLA-based distributed simulation

The resource sharing system:: Dynamic federate mapping for H...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Lüthi, J Grossmann, S Univ Bundeswehr Munchen Inst Tech Informat D-85577 Neubiberg Germany

ISBN: (纸本)076951104X;0769511058

Networks of workstations have become a popular architecture for distributed simulation due to their high availability as opposed to specialized multiprocessor computers. Networks of workstations are also a well-suited framework for distributed simulation systems based on the High Level Architecture (HLA). However, using workstations in a distributed simulation system may eventually effect the availability of computing resources for the users who need their computers as working tools. Thus, for coarse grained distributed simulation it may be desirable to let the users control to what extent their workstations should participate in a distributed simulation. In this paper, we present a resource sharing system (RSS) that provides a client user interface on each potentially participating workstation. With the RSS clients, users of workstations can control the availability of their computer for the HLA simulation federation. An RSS manager keeps track of available computing resources and balances the participating HLA federates among the available workstations.

关键词： fault tolerance high level architecture load balancing network of workstations

来源：评论

学校读者我要写书评

暂无评论

Optimistic simulation of parallel message-passing applications

Optimistic simulation of parallel message-passing applicatio...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Phan, T Bagrodia, R Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA

ISBN: (纸本)0769511058

Optimistic techniques can improve the performance of discrete-event simulations, but one area where optimistic simulators have been unable to show performance improvement is in the simulation of parallel programs. Unfortunately, parallel program simulation using direct execution is difficult;the use of direct execution implies that the memory and computation requirements of the simulator are at least as large as that of the target application, which restricts the target systems and application problem sizes that can be studied. Memory usage is especially important for optimistic simulators due to the need for periodic state-saving and rollback. In our research we addressed this problem and have implemented a simulation library running a Time-Warp-based optimistic engine that uses direct execution to simulate and predict the performance of parallel MPI programs while attaining good simulation speedup. For programs with data sets too large to be directly executed with our optimistic simulator, we reduced the memory and computational needs of these programs by utilizing a static task graph and code-slicing methodology, an approach which also exhibited good performance speedup.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Lock-free scheduling of logical processes in parallel simulation

Lock-free scheduling of logical processes in parallel simula...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Liu, J Nicol, DM Tan, K Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA

ISBN: (纸本)076951104X;0769511058

With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safety advance their local simulation clocks. Studies have shown that a good scheduling algorithm should preferentially schedule processes containing events on the critical path. This paper introduces a lock-free algorithm for scheduling logical processes in conservative parallel discrete-event simulation on shared-memory multiprocessor machines. The algorithm uses fetch&add operations that help avoid inefficiencies associated with using locks. The lock-free algorithm is robust. Experiments show that, compared with the scheduling algorithm using locks, the lock-free algorithm exhibits better performance when the number of logical processes assigned to each processor is small or when the workload becomes significant. In models with large number of logical processes, our algorithm shows only modest increase in execution time due to the overhead in the algorithm for extra bookkeeping.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Learning not to share

Learning not to share

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Liu, J Nicol, D Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA

ISBN: (纸本)076951104X;0769511058

Strong reasons exist for executing a large-scale discrete-event simulation on a cluster of processor nodes (each of which may be a shared-memory multiprocessor or a uniprocessor). This is the architecture of the largest scale parallel machines, and so the largest simulation problems can only be solved this way. It is a common architecture even in less esoteric settings, and is suitable for memory-bound simulations. This paper describes our approach to porting the SSF simulation kernel to this architecture, using the Message Passing Interface (MPI) system. The notable feature of this transformation is to support an efficient two-level synchronization and communication scheme that addresses cost discrepancies between shared-memory and distributed memory. In the initial implementation, we use a globally synchronous approach between distributed-memory noes, and an asynchronous shared-memory approach within a SMP cluster. The SSF API reflects inherently shared-memory assumptions;we report therefore on our approach for porting an SSF kernel to a cluster of SMP nodes. Experimental results on two architectures are described, for a model of TCP/IP traffic flows over a hierarchical network. The performance on a distributed network of commodity SMPs connected through ethernet is seen to frequently exceed performance on a Sun shared-memory multiprocessor.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

Improving lookahead in parallel discrete event simulations o...

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Deelman, E Bagrodia, R Sakellariou, R Adve, V USC ISI Los Angeles CA USA

ISBN: (纸本)076951104X;0769511058

This paper addresses the issue of efficient and accurate performance prediction of large-scale message-passing applications on high performance architectures using simulation. Such simulators are often based on parallel discrete event simulation, typically using the conservative protocol to synchronize the simulation threads. The paper considers how a compiler can be used to automatically extract information about the lookahead present in the application, and how this can be used to improve the performance of the null protocol used for synchronization. These techniques are implemented in the MPI-Sim simulator and dHPF compiler, which had previously been extended to work together for optimizing the simulation of local computational components of an application. The results show that the availability of lookahead information improves the runtime of the simulator by factors of magnitude, with 30-60% improvements being typical for the real-world codes. The experiments also show that these improvements are directly correlated with reductions in the number of null messages required by the simulations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A scaled version of the elastic time algorithm

A scaled version of the elastic time algorithm

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Quaglia, F Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

ISBN: (纸本)076951104X;0769511058

Recently a new class of synchronization algorithms for parallel discrete event simulation has been proposed, namely the near perfect state information algorithms, which are based on a notion of error potential to control the optimism of event execution. An algorithms of this class, called elastic time algorithm (ETA), has been instantiated. In this algorithm, the error potentials computed using temporal information (next event timestamp, simulation clocks etc.) and is then translated into event execution delay based on a constant factor. In this paper we present a scaled version of ETA (SEAT), in which the error potential is translated into event execution delay based on both a constant factor and an additional scaling factor determined dynamically as a function of the event granularity. We have implemented versions of ETA and SETA for a cluster of PCs connected by a Myrinet switch and we have established in an empirical study that SETA outperforms ETA if there is difference in the granularity of different event types.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An agent-based DDM for High Level Architecture

An agent-based DDM for High Level Architecture

引用

15th workshop on parallel and distributed simulation (PADS 2001)

作者： Tan, G Xu, LA Moradi, F Taylor, S Natl Univ Singapore Sch Comp Singapore 119260 Singapore

ISBN: (纸本)0769511058

The Data Distribution Management (DDM) service is one of the six services provided in the Runtime Infrastructure (RTI) of High Level Architecture (HLA). Its purpose is to perform data filtering and reduce irrelevant data communicated between federates. The two DDM schemes proposed for RTI, region-based and grid-based DDM, are oriented to send as little irrelevant data to subscribers as possible, but only manage to filter part of this information and some irrelevant data is still being communicated. In a previous paper [3], we employed intelligent agents to perform data filtering in HLA, implemented an agent-based DDM in RTI (ARTI) and compared it with the other two filtering mechanisms. This paper reports on additional experiments, results and analysis using two scenarios, the AWACS sensing aircraft simulation and the air traffic control simulation scenario Experimental results show that compared with other mechanisms, the agent-based approach communicates only relevant data and minimizes network communication, and is also comparable in terms of time efficiency. Some guidelines on when the agent-based scheme can be used are also given.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共118页 << < 38 39 40 41 42 43 44 45 46 47 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：