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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1151-1160 订阅

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

详细简洁

排序：

Efficient implementation of cellular algorithms on reconfigurable hardware

Efficient implementation of cellular algorithms on reconfigu...

引用

Euromicro Conference on parallel, distributed and Network-Based Processing

作者： P. Corsonello G. Spezzano G. Staino D. Talia DIMET University of Reggio Calabria Italy ISI-CNR Rende Italy DEIS University of Calabria Italy

ISBN: (纸本)0769514448

Reconfigurable architectures represent an innovative approach to the computer system design paradigm, which tries to cope with a problem of inefficiency of conventional computing systems, due to their general purpose nature. On the other hand, cellular automata are attractive computing models due to their fine grain parallelism, simple computational structures and local communication patterns. The inherently parallel cellular automata model is well suited to be implemented on reconfigurable hardware architectures such as field programmable gate arrays (FPGA) that can provide significant speedup. This paper describes the CAREM system that provides an efficient implementation of cellular automata algorithms on FPGA systems exploiting their reconfigurable features for executing different cellular automata rules. Its application to an image processing application and a forest fire simulation are presented and discussed. Performance evaluation and comparison with different implementations of cellular automata are presented.

关键词： Hardware Field programmable gate arrays Automata Logic devices Reconfigurable logic Application software Computer architecture Programmable logic arrays Concurrent computing parallel processing

来源：评论

学校读者我要写书评

暂无评论

The ultimate bead counter: efficient massively parallel simulation of ballistic deposition 95

The ultimate bead counter: efficient massively parallel simu...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Boris D. Lubachevsky Vladimir Privman Subhas C. Roy AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ Department of Physics Clarkson Univercity Potsdam NY Department of Computer Science College of William and Mary Williamsburg VA

ISBN: (纸本)9780818671203

We simulate ballistic particle deposition wherein a large number of spherical particles are “dropped” vertically over a planar horizontal surface. Upon first contact (with the surface or with a previously deposited particle) each particle stops. This model helps material scientists to study the adsorption and sediment formation [1]. The model is sequential, with particles deposited one by one. We have found an equivalent formulation using a continuous time random process and we simulate the latter in parallel using a method similar to the one previously employed for simulating Ising spins [2]. We augment the parallel algorithm for simulating Ising spins with several techniques aimed at the increase of efficiency of producing the particle configuration and statistics collection. Some of these techniques are similar to [3], [4], [5]. We implement the resulting algorithm on a 16K PE MasPar MP-1 and a 4K PE MasPar MP-2. The parallel code runs on MasPar computers two orders of magnitude faster than an optimized sequential code runs on a fast workstation.

关键词： massively parallel simulation 16K PE MasPar MP-1 parallel algorithm Ising model digital simulation atom-surface impact parallel algorithms statistics collection physics computing particle configuration equivalent formulation ultimate bead counter material scientists Ising spins simulation 4K PE MasPar MP-2 continuous time random process ballistic deposition sediment formation adsorption sputter deposition

来源：评论

学校读者我要写书评

暂无评论

Discrete-event simulation and the event horizon part 2: event list management 96

Discrete-event simulation and the event horizon part 2: even...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Jeffrey S. Steinman Metron Incorporated 512 Via De La Vane Suite 301 Solana Beach CA

ISBN: (纸本)9780818675393

The event horizon is a very important concept that applies to both parallel and sequential discrete-event simulations. By exploiting the event horizon, parallel simulations can processes events optimistically in a risk-free manner (i.e., without requiring antimessages) using adaptable "breathing" time cycles with variable time widths. Additionally, exploiting the event horizon can significantly reduce the overhead of event list management that is common to virtually all discrete-event simulations. This paper is a continuation of work previously reported at PADS94. In that report, a complete mathematical formulation of the event horizon was derived under equilibrium conditions using the hold model. Various forms of the beta density function were consequently used to verify the predicted results of the analytic model. This second report describes how the concept of the event horizon can also be applied to event list management. By exploiting the event horizon, the performance of several priority queue data structures are improved including: linked lists, various binary trees, and heaps. A somewhat detailed description of these modified data structures along with other relevant background information is provided for completeness. Performance results for each of these priority queue data structure is provided.

关键词： parallel simulation Event Horizon SPEEDES Priority Queues SPEEDES Qheap Event List Management

来源：评论

学校读者我要写书评

暂无评论

Massively parallel simulations of ATM systems 96

Massively parallel simulations of ATM systems

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Krishnan Kumaran Boris Lubachevsky Anwar Elwalid Department of Physics Rutgers University Piscataway NJ and AT&T Bell Labs Murray Hill NJ Lucent Technologies Bell Labs Innovations 600 Mountain Avenue Murray Hill NJ

ISBN: (纸本)9780818675393

We simulate models of ATM communication systems on a massively parallel SIMD computer. Fast simulations of ATM models are needed because the regimes of interest usually involve high volumes of traffic and low failure rates. Unexpected practical and theoretical difficulties, partly due to the massive parallelism and SIMD aspects, were encountered and we show how to cope with them. In a replica-parallel simulation of an ATM system, large variations in computed statistics are caused by small differences in the distribution of employed random number generators. A comparison of these distributions using a secondary statistical measure served to disambiguate the results. It was also found that time-parallel simulations of ATM systems with Markov sources can be efficiently performed using parallel prefix methods only when the sources have a small number of states, while more complex sources require end-state matching for efficient simulation. We discovered that, with the proper choice of initial state distributions and partial regeneration points, the time and memory requirements can be much improved. Our simulations were carried out on the MasPar MP-1216 system with 16,384 processors, which was compared against an SGI workstation. We achieved about 60%-70% efficiency (speed-up of approx 35 compared to the ideal of approx 51).

关键词： random sampling markov sources replica-parallel time-parallel order statistics parallel prefix

来源：评论

学校读者我要写书评

暂无评论

The treatment of state in optimistic systems 95

The treatment of state in optimistic systems

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： David Bruce Defence Research Agency st. Andrews Road Malvern Worcestershire WR14 3PS United Kingdom

ISBN: (纸本)9780818671203

Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous “over-optimistic” computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use.I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of state in optimistic systems, but also as a simple yet general mechanism for performing the necessary state saving with minimal impact on application *** results based on a benchmark application and an existing optimistic simulator are presented, showing that providing support for fully general object states is a realistic and practical option. In addition, I show how some existing state saving techniques—including support for shared state—can be derived, and discuss a number of ways in which the model might be extended.

关键词： state saving optimistic methods parallel discrete event simulation persistent data structures

来源：评论

学校读者我要写书评

暂无评论

Time Warp simulation in time constrained systems 93

Time Warp simulation in time constrained systems

引用

proceedings of the seventh workshop on parallel and distributed simulation

作者： Kaushik Ghosh Richard M. Fujimoto Karsten Schwan

ISBN: (纸本)9781565550551

The suitability of the Time Warp mechanism to perform simulations with real-time constraints is examined. A model for Time Warp is developed that accounts for overheads such as state saving, state restoration, and sending and transmitting positive and negative messages. A criterion called R-schedulability is defined to indicate whether or not computations can meet real-time deadlines. It is shown that if false events (events that will be rolled back or cancelled later) are generated, and there are no committed events with timestamps equal to those of the false events, Time Warp cannot meet the R-schedulability criterion. Further, if aggressive cancellation is used, scheduling guarantees still cannot be made even in the absence of such false events. However, Time Warp using lazy cancellation is shown to be R-schedulable provided such false events do not exist. Finally, based on these results, bounds on the execution time of a Time Warp simulation are derived.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PCI-DMA/CPU handoff for increased effectiveness of checkpointing functionalities in CCL 03

PCI-DMA/CPU handoff for increased effectiveness of checkpoin...

引用

International workshop/Symposium on distributed simulation and Real-Time Applications (DS-RT)

作者： A. Santoro F. Quaglia Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Rome Italy

ISBN: (纸本)9780769520360

Checkpointing and Communication Library (CCL) is recently developed software in support of optimistic parallel discrete event simulation on myrinet clusters. Beyond low latency message delivery functionalities, CCL also offers non-blocking checkpointing functionalities supported by a programmable PCI DMA engine on board of myrinet cards. CCL employs resynchronization functionality between PCI DMA activities and CPU activities to maintain the consistency of checkpointed information (i.e. to prevent the CPU from updating information that still needs to be copied through DMAing). If re-synchronization is invoked before the checkpoint operation is completed, simulation activities carried out by the CPU may be forced to wait for checkpoint completion. Since data copy through the PCI DMA is slower than what achievable with the CPU, in pathological situations a re-synchronization period may last more than a whole checkpoint operation performed by the CPU, thus nullifying the potential benefit from offloading checkpointing from the CPU. This paper tackles such an issue by presenting the design and implementation of a handoff mechanism of checkpoint operations between PCI (Peripheral Component Interconnect) DMA (direct memory access)and CPU to enhance the effectiveness of checkpointing functionalities offered by CCL. Although a checkpoint operation is initially entrusted to the PCI DMA, whenever re-synchronization forces the simulation application to wait for its completion, the checkpoint operation is dynamically switched to the CPU, namely the fastest available device, since its timely completion has become a performance critical task for the simulation application.

关键词： Checkpointing Discrete event simulation Engines Synchronization Remuneration Software libraries Delay Pathology Clocks

来源：评论

学校读者我要写书评

暂无评论

Automatic incremental state saving 96

Automatic incremental state saving

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Darrin West Kiran Panesar Science Applications International Corporation 4301 N Fairfax Drive Arlington VA Georgia Institute of Technology 801 Atlantic Drive Atlanta GA

ISBN: (纸本)9780818675393

We present an Incremental State Saving technique for which the state saving calls are inserted automatically by directly editing the application executable. This method has the advantage of being easy to use since it is fully automatic, and has good performance since it adds overhead only where state is being modified. Since the editing happens on executable code, the method is independent of the compiler, and allows third party libraries to be used. None of the previous incremental state saving methods have both of these features. We find that it is beneficial to use Automatic Incremental State Saving if less than 15% of the state is modified in each event as compared to copy state saving. This technique allows us to efficiently parallelize existing simulations, and makes Time Warp more accessible to non-Time Warp experts.

关键词： parallel Discrete Event simulation Checkpointing Incremental State Saving State Saving Time Warp

来源：评论

学校读者我要写书评

暂无评论

distributed interactive simulation for synthetic forces

Distributed interactive simulation for synthetic forces

引用

Heterogeneous Computing workshop

作者： P. Messina S. Brunett D. Davis T. Gottschalk D. Curkendall L. Ekroot H. Siegel Center for Advanced Computing Research California Institute of Technology Pasadena CA USA The ALPHA Group Jet Propulsion Laboratory Pasadena CA USA

Interactive simulation of battles is a valuable tool for training. The behavior and movement of hundreds or thousands of entities (tanks, trucks, airplanes, missiles, etc.) is currently simulated using dozens or more workstations on geographically distributed LANs connected by WANs. The simulated entities can move, fire weapons, receive "radio" messages, etc. The terrain that they traverse may change dynamically, for example due to rains turning dirt roads into mud or bombs forming craters. Thus the entities need to receive frequent information about the state of the terrain and the location and state of other entities. Typically, information is updated several times a second. As the number of simulated entities grows, the number of messages that need to be sent per unit of time can grow to unmanageable numbers. One approach to reducing the number of messages is to keep track of what entities need to know about which other entities and only send information to the entities that need to know. For example, tanks in Germany need not know about a change of course of a ship in the Pacific. This technique for reducing messages is known as interest management. Caltech and its Jet Propulsion Laboratory have implemented a simulation of this type on several large-scale parallel computers, exploiting both the compute power and the fast messaging fabric of such systems. The application is implemented using a heterogeneous approach. Some nodes are used to simulate entities, some to manage a database of terrain information, some to provide interest management functions, and some to route messages to the entities that do need to receive the information. Some of these tasks require more memory than others, some require faster processing capability.

关键词： Power system management Weapons Computational modeling Concurrent computing Airplanes Missiles Workstations Fires Rain Turning

来源：评论

学校读者我要写书评

暂无评论

Maya: a Multi-Paradigm Network Modeling Framework 03

Maya: a Multi-Paradigm Network Modeling Framework

引用

proceedings of the seventeenth workshop on parallel and distributed simulation

作者： Junlan Zhou Zhengrong Ji Mineo Takai Rajive Bagrodia University of California Los Angeles Parallel Computing Laboratory 3809 Boelter Hall Los Angeles CA

ISBN: (纸本)9780769519708

This paper presents Maya, a multi-paradigm, scalableand extensible network modeling framework for emulatingdistributed applications. A novel three-tier architecture isproposed to integrate three disparate modeling paradigms,namely, discrete event models, analytical models and physicalnetwork interfaces into one unified framework of *** the first effort to integrate all three paradigms intoone framework, this paper discusses the implementationsof Maya using Qualnet, fluid flow based TCP model andphysical network interface. It addresses the performanceissues involved in attaining the real time constraints imposedby distributed applications and demonstrates the effectivenessof using analytical models in Maya. Furthermore, it identifies the negative impact on real time performance through the computation intensive ordinary differential equation (ODE) solver in the fluid flow model. A new approach to interleaved executions of the fluid flow model is proposed to hide ODE solver turnaround time. As a result, the percentage of packets missing their deadlines has been reduced from more than 6% to less than 0.2%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 109 110 111 112 113 114 115 116 117 118 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：