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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

645 篇 工学
- 606 篇 计算机科学与技术...
- 380 篇 软件工程
- 91 篇 信息与通信工程
- 81 篇 控制科学与工程
- 62 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 8 篇 机械工程
- 8 篇 材料科学与工程（可...
- 8 篇 动力工程及工程热...
- 6 篇 力学（可授工学、理...
- 6 篇 土木工程
- 5 篇 仪器科学与技术
- 5 篇 建筑学
- 5 篇 生物工程
- 4 篇 冶金工程
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
193 篇 理学
- 148 篇 数学
- 41 篇 系统科学
- 38 篇 统计学（可授理学、...
- 22 篇 物理学
- 13 篇 化学
- 9 篇 生物学
44 篇 管理学
- 37 篇 管理科学与工程(可...
- 21 篇 工商管理
- 9 篇 图书情报与档案管...
9 篇 教育学
- 9 篇 教育学
8 篇 经济学
- 8 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 军事学
3 篇 医学
1 篇 农学

主题

255 篇 computational mo...
227 篇 computer simulat...
216 篇 discrete event s...
129 篇 concurrent compu...
95 篇 distributed comp...
84 篇 computer science
81 篇 parallel process...
73 篇 protocols
60 篇 analytical model...
55 篇 computer archite...
54 篇 time warp simula...
53 篇 large-scale syst...
50 篇 computer network...
47 篇 costs
47 篇 parallel process...
44 篇 application soft...
41 篇 circuit simulati...
41 篇 delay
39 篇 hardware
36 篇 runtime

机构

18 篇 college of compu...
13 篇 school of comput...
9 篇 georgia inst tec...
9 篇 department of co...
8 篇 dipartimento di ...
8 篇 department of co...
7 篇 school of comput...
7 篇 univ roma la sap...
6 篇 coll of william ...
6 篇 department of co...
6 篇 georgia inst of ...
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...

作者

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

语言

1,262 篇 英文
7 篇 俄文
4 篇 中文
3 篇 其他

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

共 1276 条记录，以下是1231-1240 订阅

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

详细简洁

排序：

Breathing time warp

Breathing time warp

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Steinman, Jeff S. California Inst of Technology Pasadena CA United States

ISBN: (纸本)1565550552

Time Warp and Breathing Time Buckets are two general-purpose optimistic synchronization strategies for supporting parallel discrete-event simulations. However, each one of these approaches has potential fatal shortcomings. Time Warp may exhibit rollback explosions that can cause an avalanche of antimessages. Breathing Time Buckets, on the other hand, may not be able to process enough events per synchronization cycle to remain efficient. A new strategy, called Breathing Time Warp, has been developed in the Synchronous parallel Environment for Emulation and Discrete-Event simulation (SPEEDES) operating system. This new strategy solves both of these problems by mixing the two algorithms together, resulting in the best of both methods. This paper describes the implementation of the Breathing Time Warp algorithm in SPEEDES, and then shows how this new approach sometimes improves the performance of parallel discrete-event simulations.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Disseminating critical target-specific synchronization information in parallel discrete event simulations

Disseminating critical target-specific synchronization infor...

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Pancerella, Carmen M. Reynolds Jr., Paul F. Univ of Virginia Charlottesville VA United States

ISBN: (纸本)1565550552

A hardware-based framework which supports a wide range of parallel discrete event synchronization protocols has been proposed in [Reyn92]. This framework offloads all synchronization activity from the host processors and host communication network in the system. The underlying hardware computes results of global, binary associative operations, or global reductions. In this paper we present results of simulations that strongly suggest the need for a next-generation reduction network which computes and disseminates results of target-specific reductions to support both aggressive and non-aggressive parallel discrete event simulations. Target-specific reductions allow a logical process to receive synchronization information only from those logical processes which may have a direct or indirect impact on its performance.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Local time warp approach to parallel simulation

Local time warp approach to parallel simulation

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Rajaei, Hassan Ayani, Rassul Thorelli, Lars-Erik Dep of Teleinformatics Stockholm Sweden

ISBN: (纸本)1565550552

The two main approaches to parallel discrete event simulation - conservative and optimistic - are likely to encounter some limitations when the size and complexity of the simulation system increases. For such large scale simulations, the conservative approach appears to be limited by blocking overhead and sensitivity to lookahead, whereas the optimistic approach may become prone to cascading rollbacks, state saving overhead, and demands for larger memory space. These drawbacks restrict the synchronization schemes based on each of the two approaches from scaling up. A combined approach may resolve these limitations, while preserving and utilizing potential advantages of each method. However, the schemes proposed so far integrate the two views at the same level, i.e. local to a logical process, and hence may not be able to fully solve the problems. In this paper we propose the Local Time Warp method for parallel discrete-event simulation and present a novel synchronization scheme for it called HCTW. The new scheme hierarchically combines a Conservative Time Window algorithm with Time Warp and aims at reducing cascade rollbacks, sensitivity to lookahead, and the scalability problems. Local Time Warp is believed to be suitable for parallel machines equipped with thousands of processors and thus an appropriate candidate for simulation of large and complex systems.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Analytical comparison of periodic checkpointing and incremental state saving

Analytical comparison of periodic checkpointing and incremen...

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Palaniswamy, Avinash C. Wilsey, Philip A. Cent for Digital Systems Engineering Cincinnati OH United States

ISBN: (纸本)1565550552

The successful application of optimistic synchronization techniques in parallel simulation requires that rollback overheads be contained. The chief contributions to rollback overhead in a Time Warp simulation are the time required to save state information and the time required to restore a previous state. Two competing techniques for reducing rollback overhead are periodic checkpointing (Lin and Lazowska, 1989) and incremental state saving (Bauer et al., 1991). This paper analytically compares the relative performance of periodic checkpointing to incremental state savings. The analytical model derived for periodic checkpointing is based almost entirely on the previous model developed by Lin (Lin and Lazowska, 1989). The analytical model for incremental state saving has been developed for this study. The comparison assumes an optimal checkpoint interval and shows under what simulation parameters each technique performs best.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Time warp simulation in time constrained systems

Time warp simulation in time constrained systems

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Ghosh, Kaushik Fujimoto, Richard M. Schwan, Karsten Georgia Inst of Technology Atlanta GA United States

ISBN: (纸本)1565550552

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.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Selecting the checkpoint interval in time warp simulation 93

Selecting the checkpoint interval in time warp simulation

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Lin, Yi-Bing Preiss, Bruno R. Loucks, Wayne M. Lazowska, Edward D. Bellcore Morristown NJ United States

ISBN: (纸本)1565550552

In Time Warp parallel simulation, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implementations checkpoint after every state transition, this is not necessary, and the checkpoint interval is in reality a tuning parameter of the simulation. Lin and Lazowska proposed a model to derive the optimal checkpoint interval by assuming that the rollback behavior of Time Warp is not affected by the frequency of checkpointing. An experimental study conducted by Preiss et al. indicates that the behavior of rollback is affected by the frequency of checkpointing in general, and that the Lin-Lazowska model may not reflect the real situations in general. This paper extends the Lin-Lazowska model to include the effect of the checkpoint interval on the rollback behavior. The relationship among the checkpoint interval, the rollback behavior, and the overhead associated with state saving and restoration is described. A checkpoint interval selection algorithm which quickly determines the optimal checkpoint interval during the execution of Time Warp simulation is proposed. Empirical results indicate that the algorithm converges quickly and always selects the optimal checkpoint interval.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Developing parallel applications using high-performance simulation 93

Developing parallel applications using high-performance simu...

引用

3rd workshop on parallel and distributed Debugging, WPADD 1993

作者： Brewer, Eric A. Weihl, William E. MIT Laboratory for Computer Science United States

ISBN: (纸本)0897916336

Researchers already use high-performance simulators for algorithm development and architectural studies. Advances in simulation technology and workstation performance have made program development on top of simulators- debugging, testing, and some tuning-fast enough for real applications. Simulators provide many advantages over running directly on a multiprocessor, including versatility, trivial repeatability, and detailed nonintrusive data collection and debugging. We make the case for application development via simulation and address simulation s traditional disadvantages. We also propose a development methodology that integrates simulation into the multiprocessor development environment. Finally, we examine the software engineering issues required by this integration and the use of parallel simulators for development. We believe that most multiprocessor application development should be done on top of a high-performance simulator (running on a workstation) rather than directly on the multiprocessor. Researchers already use these high-performance simulators for algorithm development [CBDW91], architectural studies [HM92], and language and compiler design (WBC+91, HWW93]. The primary advantages of development via simulation are the cost effectiveness of workstations, the ability to exploit powerful sequential debuggers, the support for nonintrusive data collection and invariant checking, and the versatility of simulation. Although traditional multiprocessor simulators arc too slow to run real applications, high-performance simulators. including TangoLite [DGH91], RPPT [CDJ+91], and our own system Proteus [BDCW91], achieve orders of magnitude speedup over traditional simulators;typical development simulations take only a few minutes. The rapid increases in workstation performance will continue to diminish the turn-Around time. Although we designed proteus to explore algorithms and language issues, our experience and that of other users indicates that development is

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of two software distributed shared memory models 3

Performance evaluation of two software distributed shared me...

引用

3rd International workshop on Object Orientation in Operating Systems, IWOOOS 1993

作者： Koch, P.T. Department of Computer Science University of Copenhagen Universitetsparken 1 Copenhagen2100 Denmark

ISBN: (纸本)0818652705

By offering a shared address space across a number of processors connected by a local area network, the distributed shared memory model offers an attractive way of programming parallel-distributed applications. Such programming can be done either using a memory model based on objects or linear memory. Very few performance studies have been made of such systems. The author describes the motivation and the methodology for a project which compares performance of the object model to the linear memory model. Execution-driven simulation is used to analyze the performance and scalability of the systems for appearing fast processors and new highspeed networks. © 1993 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of event sets in time warp

Efficient implementation of event sets in time warp

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Ronngren, Robert Ayani, Rassul Fujimoto, Richard M. Das, Samir R. Royal Inst of Technology Stockholm Sweden

ISBN: (纸本)1565550552

The implementation of the pending event set (PES) is crucial to the execution speed of discrete event simulation programs. This paper studies the implementation of the PES in the context of simulations executing on parallel computers using the Time Warp mechanism. We present a scheme for implementing Time Warp's PES based on well-known data structures for priority queues. This scheme supports efficient management of future and past events, especially for rollback and fossil collection operations. A comparative study of several queue implementations is presented. Experiments with a Time Warp system executing on a Kendall Square Research multiprocessor (KSR1) demonstrate that the implementation of the input queue can have a dramatic impact on performance, as large as an order of magnitude, that is much greater than what can be accounted for by simply the reduced execution time to access the data structure. In particular, it is demonstrated that an efficient input queue implementation can also significantly reduce the number of rollbacks, and the efficiency of memory management policies such as Jefferson's cancelback protocol. In the context of this work we also present an improved version of the skew heap that allows dequeueing of arbitrary elements at low cost. In particular, the possibility of dequeueing arbitrary elements will improve memory utilization. This ability is also important in applications where frequent rescheduling may occur, as in ready queues used to select the next logical process to execute.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Performance study of the cancelback protocol for time warp

Performance study of the cancelback protocol for time warp

引用

proceedings of the 7th workshop on parallel and distributed simulation

作者： Das, Samir R. Fujimoto, Richard M. Georgia Inst of Technology Atlanta United States

ISBN: (纸本)1565550552

This work presents results from an experimental evaluation of the space-time tradeoffs in Time Warp augmented with the cancelback protocol for memory management. An implementation of the cancelback protocol on Time Warp is described that executes on a shared memory multiprocessor, a 32 processor Kendall Square Research Machine (KSR1). The implementation supports canceling back more than one object when memory has been exhausted. The limited memory performance of the system is evaluated for three different workloads with varying degrees of symmetry. These workloads provide interesting stress cases for evaluating limited memory behavior. We, however, make certain simplifying assumptions (e.g, uniform memory requirement by all the events in the system) to keep the experiments tractable. The experiments are extensively monitored to determine the extent to which various overheads affect performance. It is observed that (i) depending on the available memory and asymmetry in the workload, canceling back several (called the salvage parameter) events at one time may improve performance significantly, by reducing certain overheads, (ii) a performance nearly equivalent to that with unlimited memory can be achieved with only a modest amount of memory depending on the degree of asymmetry in the workload.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共128页 << < 119 120 121 122 123 124 125 126 127 128 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：