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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

574 篇 工学
- 539 篇 计算机科学与技术...
- 343 篇 软件工程
- 76 篇 控制科学与工程
- 73 篇 信息与通信工程
- 59 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
184 篇 理学
- 141 篇 数学
- 40 篇 系统科学
- 38 篇 统计学（可授理学、...
- 18 篇 物理学
- 14 篇 化学
- 9 篇 生物学
37 篇 管理学
- 32 篇 管理科学与工程(可...
- 20 篇 工商管理
- 7 篇 图书情报与档案管...
9 篇 教育学
- 9 篇 教育学
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
44 篇 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 fifteenth workshop on Parallel and distributed simulation"

共 1172 条记录，以下是931-940 订阅

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

详细简洁

排序：

Reducing synchronization overhead in parallel simulation 96

Reducing synchronization overhead in parallel simulation

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Ulana Legedza William E. Weihl Large-Scale Parallel Software Group MIT Laboratory for Computer Science Cambridge MA

ISBN: (纸本)9780818675393

Synchronization is often the dominant cost in conservative parallel simulation, particularly in simulations of parallel computers, in which low-latency simulated communication requires frequent synchronization. We present and evaluate LOCAL BARRIERS and PREDICTIVE BARRIER SCHEDULING, two techniques for reducing synchronization overhead in the simulation of message-passing multicomputers. Local barriers use nearest-neighbor synchronization to reduce waiting time at synchronization points. Predictive barrier scheduling, a novel technique that schedules synchronizations using both compile-time and runtime analysis, reduces the frequency of synchronization operations. In contrast to other work in this area, both techniques reduce synchronization overhead without decreasing the accuracy of network simulation. These techniques were evaluated by comparing their performance to that of periodic global synchronization. Experiments show that local barriers improve performance by up to 24% for communication-bound applications, while predictive barrier scheduling improves performance by up to 65% for applications with long local computation phases. Because the two techniques are complementary, we advocate a combined approach. This work was done in the context of parallel PROTEUS, a new parallel simulator of message-passing multicomputers.

关键词： network simulation parallel simulation synchronization

来源：评论

学校读者我要写书评

暂无评论

Estimating the cost of throttled execution in time warp 96

Estimating the cost of throttled execution in time warp

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Samir R. Das Division of Computer Science The University of Texas at San Antonio San Antonio TX

ISBN: (纸本)9780818675393

Over-optimistic execution has long been identified as a major performance bottleneck in Time Warp based parallel simulation systems. An appropriate throttle or control of optimism can improve performance by reducing the number of rollbacks. However, the design of an appropriate throttle is a difficult task, as correct computations on the critical path may be blocked, thus increasing the overall execution time. In this paper we build a cost model for throttled execution that involves both rollback probability and probability for an event computation being on the critical path. The model can estimate an appropriate size of time window for a throttled execution using statistics collected from the purely optimistic execution. The model is validated by an experimental study with a set of synthetic workloads.

关键词： time warp discrete event simulation performance model parallel simulation

来源：评论

学校读者我要写书评

暂无评论

On extending more parallelism to serial simulators 96

On extending more parallelism to serial simulators

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： David Nicol Philip Heidelberger Department of Computer Science The College of William and Mary Williamsburg VA IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights NY

ISBN: (纸本)9780818675393

The Utilitarian parallel Simulator (U.P.S.) extends parallelism to the CSIM sequential simulation tool by providing several new modeling constructs. Using conservative synchronization techniques, these constructs automatically support time-synchronized communications between CSIM submodels running on different processors. This paper describes extensions to U.P.S. that allow the user to assist U.P.S. by providing additional "process lookahead," thereby reducing the frequency of synchronizations. The use and effect on performance of process lookahead is described for several models. In a mobile cellular communications model, the use of process lookahead results in up to a 60% improvement in speedup on 32 nodes of the IBM SP2. A factor of 3 improvement is obtained on a closed queueing network simulation running on 32 nodes of the Intel Paragon.

关键词： queueing system communications network parallel simulation

来源：评论

学校读者我要写书评

暂无评论

Optimistic simulation of parallel architectures using program executables 96

Optimistic simulation of parallel architectures using progra...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Sashikanth Chandrasekaran Mark D. Hill Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison WI

ISBN: (纸本)9780818675393

A key tool of computer architects is computer simulation at the level of detail that can execute program executables. The time and memory requirements of such simulations can be enormous, especially when the machine under design-the target-is a parallel machine. Thus, it is attractive to use parallel simulation, as successfully demonstrated by the Wisconsin Wind Tunnel (WWT). WWT uses a conservative simulation algorithm and eschews network simulation to make lookahead adequate. Nevertheless, we find most of WWT's slowdown to be due to the synchronization overhead in the conservative simulation algorithm. This paper examines the use of optimistic algorithms to perform parallel simulations of parallel machines. We first show that we can make optimistic algorithms work correctly even with WWT's direct execution of program executables. We checkpoint processor registers (integer, floating-point, and condition codes) and use executable editing to log the value of memory words just before they are overwritten by stores. Second, we consider the performance of two optimistic algorithms. The first executes programs optimistically, but performs protocol events (e.g., sending messages) conservatively. The second executes everything optimistically and is similar to Time Warp with lazy message cancellation. Unfortunately, both approaches make parallel simulation performance worse for the default WWT assumptions. We conclude by speculating on the performance of optimistic simulation when simulating (1) target network details, and (2) on hosts with high message latencies and no synchronization hardware.

关键词： Optimistic simulation State Saving parallel Machines Direct Execution

来源：评论

学校读者我要写书评

暂无评论

Experiments in automated load balancing 96

Experiments in automated load balancing

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： Linda F. Wilson David M. Nicol Institute for Computer Applications Science and Engineering NASA Langley Research Center Hampton VA Department of Computer Science The College of William and Mary P.O. Box 8795 Williamsburg VA

ISBN: (纸本)9780818675393

One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achieved unless the system is fine-tuned to balance computation, communication, and synchronization requirements. In this paper, we discuss our experiments in automated load balancing using the SPEEDES simulation framework. Specifically, we examine three mapping algorithms that use run-time measurements. Using simulation models of queuing networks and the National Airspace System, we investigate (i) the use of run-time data to guide mapping, (ii) the utility of considering communication costs in a mapping algorithm, (iii) the degree to which computational ``hot-spots'' ought to be broken up in the linearization, and (iv) the relative execution costs of the different algorithms. We compare the performance of the three algorithms using results from the Intel Paragon.

关键词： load balancing discrete-event simulation parallel computing performance analysis

来源：评论

学校读者我要写书评

暂无评论

Hierarchical strategy of model partitioning for VLSI-design using an improved mixture of experts approach 96

Hierarchical strategy of model partitioning for VLSI-design ...

引用

proceedings of the tenth workshop on parallel and distributed simulation

作者： K. Hering R. Haupt Th. Villmann Universität Leipzig Inst. für Informatik Augustusplatz 10/11 04109 Leipzig Germany Inst. für Techno- und Wirtschaftsmathematik E.-Schrödinger-Str. Geb. 48/575 67663 Kaiserslautern Germany

ISBN: (纸本)9780818675393

The partitioning of complex processor models on the gate and register-transfer level for parallel functional simulation based on the clock-cycle algorithm is considered. We introduce a hierarchical partitioning scheme combining various partitioning algorithms in the frame of a competing strategy. Melting together different partitioning results within one level using superpositions we crossover to a mixture of experts one. This approach is improved applying genetic algorithms. In addition we present two new partitioning algorithms both of them taking cones as fundamental units for building partitions.

关键词： Logic simulation VLSI-Design Genetic Algorithms Partitioning

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of an integrated instrumentation system

Performance evaluation of an integrated instrumentation syst...

引用

International Symposium on Modeling, Analysis and simulation of Computer and Telecommunication Systems (MASCOTS)

作者： A. Waheed D.T. Rover Department of Electrical Engineering Michigan State University East Lansing MI USA

With increasing sophistication of parallel tool development technologies, runtime data collection and management activities are receiving greater attention from tool developers. We define an instrumentation system (IS) as a set of modules and functions that collect runtime data from concurrent processes and support an integrated tool environment by sharing this data along with specific control information. Presently, it is not standard practice to formally evaluate the performance and functionality of a tool early in its development. Usability and efficiency studies of prototypical tools are emerging to alleviate this situation. However; the underlying IS is removed from the end-user and is part of system infrastructure, thus necessitating more rigorous evaluation. We are developing a structured approach to plan, design, model, realize, and test an IS, called the Vista IS, to appropriately address these issues.

关键词： Instruments Prototypes Runtime Technology management System testing Standards development Usability distributed computing Real time systems Engineering management

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 90 91 92 93 94 95 96 97 98 99 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：