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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,135 篇 会议
31 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

573 篇 工学
- 538 篇 计算机科学与技术...
- 342 篇 软件工程
- 76 篇 控制科学与工程
- 73 篇 信息与通信工程
- 59 篇 电气工程
- 46 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
182 篇 理学
- 140 篇 数学
- 40 篇 系统科学
- 38 篇 统计学（可授理学、...
- 18 篇 物理学
- 13 篇 化学
- 9 篇 生物学
37 篇 管理学
- 32 篇 管理科学与工程(可...
- 20 篇 工商管理
- 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...
52 篇 analytical model...
51 篇 computer archite...
48 篇 large-scale syst...
47 篇 computer network...
46 篇 costs
43 篇 parallel process...
40 篇 circuit simulati...
36 篇 predictive model...
34 篇 hardware
33 篇 runtime
33 篇 educational inst...

机构

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,159 篇 英文
7 篇 俄文
4 篇 中文
1 篇 其他

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

共 1171 条记录，以下是1151-1160 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Active virtual network management protocol 99

Active virtual network management protocol

引用

proceedings of the thirteenth workshop on parallel and distributed simulation

作者： Stephen F. Bush General Electric Corporate Research and Development KWC-512 One Research Circle Niskayuna NY

ISBN: (纸本)9780769501550

This paper introduces a novel algorithm, the Active Virtual Network Management Protocol, for predictive network management. It explains how the Active Virtual Network Management Protocol facilitates the management of an active network by allowing future predicted state information within an active network to be available to network management algorithms. This is accomplished by coupling ideas from optimistic discrete event simulation with active networking. The optimistic discrete event simulation method used is a form of self-adjusting Time Warp. It is self-adjusting because the system adjusts for predictions which are inaccurate beyond a given tolerance. The concept of a streptichron and autoanaplasis are introduced as mechanisms which take advantage of the enhanced flexibility and intelligence of active packets. Finally, it is demonstrated that the Active Virtual Network Management Protocol is a feasible concept.

关键词： Network Management Optimistic Discrete Event simulation Self-Prediction Active Networks

来源：评论

学校读者我要写书评

暂无评论

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%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment

A mathematical model, heuristic, and simulation study for a ...

引用

Heterogeneous Computing workshop

作者： Min Tan M.D. Theys H.J. Siegel N.B. Beck M. Jurczyk Cisco Systems Inc. San Jose CA USA Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Engineering and Computer Science University of Missouri Columbia Columbia MO USA

Data staging is an important data management problem for a distributed heterogeneous networking environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links. Sites in the network request data items and each item is associated with a specific deadline and priority. It is assumed that not all requests can be satisfied by their deadline. The work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. A mathematical model for the basic data staging problem is introduced. Then, a multiple-source shortest-path algorithm based heuristic for finding a suboptimal schedule of the communication steps for data staging is presented. A simulation study is provided, which evaluates the performance of the proposed heuristic. The results show the advantages of the proposed heuristic over two random based scheduling techniques. This research, based on the simplified static model, serves as a necessary step toward solving the more realistic and complicated version of the data staging problem involving dynamic scheduling, fault tolerance, and determining where to stage data.

关键词： Mathematical model Computer networks distributed computing Data engineering Military computing Intelligent networks Computer network management Environmental management Memory Satellite broadcasting

来源：评论

学校读者我要写书评

暂无评论

A causality based time management mechanism for federated simulation 01

A causality based time management mechanism for federated si...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Bu-Sung Lee Wentong Cai Junlan Zhou School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9780769511047

One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is Time Management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receive ordering. Temporal anomalies occurred during the execution of federation due to the heterogeneous latencies in the communication network are not handled in receive ordering. White time stamp ordering eliminates the temporal anomalies entirely, it incurs great communication latency and huge handwidth requirement. This paper presents a new time management mechanism which provides a less costly message ordering service, namely causal ordering, to federates. It does not require the specification of lookahead and allows federates that do not require stringent message ordering properties to achieve much more efficient execution. A series of experiments has been carried out to benchmark the performance of this new time management mechanism and the results show that if incurs a slight overhead compared to receive ordering mechanism but achieves significant performance improvement over time stamp ordering mechanism.

关键词： multicasting time management causal order delivery time stamp ordering direct dependency happen-before relationship distributed simulation

来源：评论

学校读者我要写书评

暂无评论

SGTNE: semi-global time of the next event algorithm 95

SGTNE: semi-global time of the next event algorithm

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Azzedine Boukerche Carl Tropper School of Computer Science McGill University Montreal Canada H3A-2A7

ISBN: (纸本)9780818671203

This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlocks inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlocks by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.

关键词： discrete event simulation SGTNE partitioning parallel algorithms FCFS queueing network model inter-processor deadlock parallelism shortest path algorithm performance results

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：