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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

574 篇 工学
- 539 篇 计算机科学与技术...
- 343 篇 软件工程
- 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 篇 中文
2 篇 其他

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

共 1172 条记录，以下是1091-1100 订阅

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

详细简洁

排序：

Lock-free scheduling of logical processes in parallel simulation 01

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

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Jason Liu David M. Nicol King Tan Department of Computer Science Dartmouth College Hanover New Hampshire

ISBN: (纸本)9780769511047

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 safely 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 shred-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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing cell-size in grid-based DDM 00

Optimizing cell-size in grid-based DDM

引用

proceedings of the fourteenth workshop on parallel and distributed simulation

作者： Rassul Ayani Farshad Moradi Gary Tan School of Computing National University of Singapore Singapore 119260

ISBN: (纸本)9780769506678

In a large-scale distributed simulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the distributed Interactive simulation (DIS) standards is not suitable for large scale distributed *** the High Level Architecture (HLA) paradigm, the Runtime Infrastructure (RTI) provides a set of services, such as data distribution management (DDM) among federates. The goal of the DDM module in RTI is to make the data communication more efficient by sending the data only to those federates that need the data, as opposed to the broadcasting mechanism employed by *** DDM schemes have appeared in the literature. In this paper, we discuss grid-based DDM and develop a DDM model that uses grids for matching the publishing/subscription regions, and for data filtering. We show that appropriate choice of the grid-cell size is crucial in obtaining good performance. We develop an analytical model and derive a formula for identifying the optimal cell size in grid-based DDM.

关键词： HLA group communication distributed simulation data filtering data communication

来源：评论

学校读者我要写书评

暂无评论

A fast asynchronous GVT algorithm for shared memory multiprocessor architectures 95

A fast asynchronous GVT algorithm for shared memory multipro...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Z. Xiao F. Gomes B. Unger J. Cleary University of Calgary Canada University of Waikato New Zealand

ISBN: (纸本)9780818671203

The computation of Global Virtual Time is of fundamental importance in Time Warp based parallel Discrete Event simulation Systems. Shared memory multiprocessor architectures can support interprocess communication with much smaller overheads than distributed memory systems. This paper presents a new, completely asynchronous, Gvt algorithm which provides very fast and accurate Gvt estimation with significantly lower overhead than previous approaches. The algorithm presented is able to support more efficient memory management, termination, and other global control *** Gvt algorithm described enables any Time Warp entity to compute Gvt at any time without slowing down other entities, in particular, those executing on the critical path. Experimental results are presented for a shared memory Time Warp system that employs a two tiered distributed memory management *** proof of the correctness and the accuracy of the algorithm are also presented. Finally, some suggestions on possible further optimization of the implementation are given.

关键词： discrete event simulation Global Virtual Time shared memory systems distributed memory management shared memory multiprocessor Time Warp storage management time warp simulation distributed memory systems memory management Discrete Event simulation GVT algorithm

来源：评论

学校读者我要写书评

暂无评论

Super-criticality revisited 95

Super-criticality revisited

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Sudhir Srinivasan Paul F. Reynolds Department of Computer Science University of Virginia Thornton Hall Charlottesville VA

ISBN: (纸本)9780818671203

Critical path analysis has been suggested as a technique for establishing a lower bound on the completion times of parallel discrete event simulations. A protocol is super-critical if there is at least one simulation that can complete in less than the critical path time using that protocol. Previous studies have shown that several practical protocols are super-critical while others are not. We present a sufficient condition to demonstrate that a protocol is super-criticality. It has been claimed that super-criticality requires independence of one or more messages (states) on events in the logical past of those messages (states). We present an example which contradicts this claim and examine the implications of this contradiction on lower bounds.

关键词： parallel discrete event simulations critical path analysis protocols lower bound discrete event simulation protocol

来源：评论

学校读者我要写书评

暂无评论

Improving conservative VHDL simulation performance by reduction of feedback 96

Improving conservative VHDL simulation performance by reduct...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Joel F. Hurford Thomas C. Hartrum Department of Electrical and Computer Engineering School of Engineering Air Force Institute of Technology

ISBN: (纸本)9780818675393

This paper describes two forms of feedback in the simulation runtime of VHDL circuits that greatly influences performance. While circuit feedback and strongly connected components have been observed and documented as detrimental influences to conservative parallel discrete event simulation (PDES) efficiency, that influence has never been quantified. Moreover, in this study, the phenomenon of induced feedback was observed to diminish speedup to the same degree as explicit feedback. In this paper the influence of feedback on simulation runtime is analyzed and an algorithm for its elimination is presented. In addition, a metric for the quantification of feedback is introduced. By measuring feedback, it is possible to balance its influence on simulation runtime with that of other factors (e.g. load balance, number of processors, machine granularity, etc. ) through the use of a cost-based partitioning approach. This paper reports significant improvements in runtime for three circuits due to the prevention of feedback using the partitioning algorithm presented. In addition, strong correlation between the feedback metric and conservative parallel simulation overhead is demonstrated.

关键词： parallel simulation conservative simulation circuit simulation

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of the IDES framework 97

Performance modeling of the IDES framework

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： David M. Nicol Michael M. Johnson Ann S. Yoshimura Michael E. Goldsby Dept. of Computer Science Dartmouth College Hanover NH Sandia National Laboratories Livermore CA

ISBN: (纸本)9780818679650

The IDES project at Sandia National Laboratories is developing a large scale portable parallel simulator for use in stockpile stewardship. IDES will use the Breathing-Time-Buckets synchronization protocol; to support IDES development, this paper studies a performance model and describes performance experiments on expected work load and architectural parameters. A new parallel algorithm for terminating the window quickly is also described and analyzed.

关键词： IDES project stockpile stewardship parallel programming parallel algorithm Breathing-Time-Buckets large scale portable parallel simulator discrete event simulation work load performance modeling window termination architectural parameters Sandia National Laboratories synchronization protocol

来源：评论

学校读者我要写书评

暂无评论

A static partitioning and mapping algorithm for conservative parallel simulations 94

A static partitioning and mapping algorithm for conservative...

引用

proceedings of the eighth workshop on parallel and distributed simulation

作者： Azzedine Boukerche Carl Tropper School of Computer Science McGill University Montreal Canada

ISBN: (纸本)9781565550278

In this paper, we consider the problem of partitioning a conservative parallel simulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithm, its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on iPSC/860 hypercube. The results obtained are compared with a random partitioning. They show that a partitioning which makes use of our simulated annealing algorithm results in a reduction of 25-35% of the running time of the simulations when compared to the running time of a random partition of the model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Conservative synchronization in object-oriented parallel battlefield discrete event simulations 97

Conservative synchronization in object-oriented parallel bat...

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： James B. Hiller Thomas C. Hartrum Department of Electrical and Computer Engineering School of Engineering Air Force Institute of Technology Wright-Patterson AFB OH

ISBN: (纸本)9780818679650

We present a conservative strategy for spatially decomposed parallel discrete event battlefield simulation. The traditional null message algorithm provides a foundation from which a mapping to generic simulation attributes can be made. We informally discuss preservation of logical correctness and freedom from deadlock. Experimental results demonstrate the potential execution time savings when load imbalance is not dominant; more importantly, they highlight improvement opportunities in spite of potential load imbalance. The net result is that a very reasonable performance gain can be delivered for little effort in a way that supports good simulation system design principles. The approach is straightforward and can be easily implemented as part of a more general sequential or parallel simulation support environment. While the approach is expressed in terms of battlefield simulation, its essence applies to many simulation applications.

关键词： null message algorithm load imbalance conservative synchronization military computing spatially decomposed simulation simulation system design deadlock generic simulation attributes execution time savings parallel battlefield discrete event simulations logical correctness performance gain object-oriented simulation

来源：评论

学校读者我要写书评

暂无评论

parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report 00

Parallelizing a sequential logic simulator using an optimist...

引用

proceedings of the fourteenth workshop on parallel and distributed simulation

作者： Sushil K. Prasad Nikhil Junankar Computer Science Department Georgia State University Atlanta

ISBN: (纸本)9780769506678

We have parallelized the Iowa Logic Simulator, a gate-level fine-grained discrete-event simulator, by employing an optimistic algorithm framework based on a global event queue implemented as a parallel heap. The original code and the basic data structures of the serial simulator remained unchanged. Wrapper data structures for the logical processes (gates) and the events are created to allow rollbacks, all the earliest events at each logical processes are stored into the parallel heap, and multiple earliest events are simulated repeatedly by invoking the simulate function of the serial simulator. The parallel heap allowed extraction of hundreds to thousands of earliest events in each queue access. On a bus-based shared-memory multiprocessor, simulation of synthetic circuits with 250,000 gates yielding speedups of 3.3 employing five processors compared to the serial execution time of the Iowa Logic Simulator, and limited the number of rollbacks to within 2,000. The basic steps of parallelization are well-defined and general enough to be employable on other discrete-event simulators.

关键词： parallel heap parallel discrete event simulation parallelizing framework logic simulation

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel downloading for large file distribution

Analysis of parallel downloading for large file distribution

引用

IEEE workshop on Future Trends of distributed Computing Systems

作者： S.G.M. Koo C. Rosenberg Dongyan Xu School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Science Purdue University West Lafayette IN USA

Recently, the scheme of parallel downloading (PD) has been adopted by a number of Internet file downloading applications. With the wide deployment of content distribution networks and peer-to-peer networks, PD is expected to be more commonly used for file distribution. There have been experiments showing that PD results in higher aggregated downloading throughput and therefore shorter downloading time experienced by clients. However, these experimental studies focused on the performance experienced by a particular user and did not consider the impact of PD on the network when it is largely deployed. In this paper we present our efforts toward an in-depth understanding of large-scale deployment of PD through simulation and analysis. Our results suggest that while PD may achieve a shorter downloading time, its impact on the network and server is significant. Our analysis is also used for network dimensioning and content distribution service provisioning. We show that with proper admission control and dimensioning, single-server downloading can perform just as well as PD, without the complexity and overhead incurred by PD.

关键词： Network servers Analytical models Peer to peer computing Intelligent networks Throughput Tornadoes Concurrent computing Computer science Internet Application software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 106 107 108 109 110 111 112 113 114 115 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：