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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

571 篇 工学
- 536 篇 计算机科学与技术...
- 341 篇 软件工程
- 75 篇 控制科学与工程
- 73 篇 信息与通信工程
- 58 篇 电气工程
- 45 篇 电子科学与技术（可...
- 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,157 篇 英文
7 篇 俄文
4 篇 中文
2 篇 其他

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

共 1170 条记录，以下是1061-1070 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

A case study in simulating PCS networks using Time Warp 95

A case study in simulating PCS networks using Time Warp

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Christopher D. Carothers Richard M. Fujimoto Yi-Bing Lin College of Computing Georgia Institute of Technology Atlanta Georgia Bellcore Morristown New Jersey

ISBN: (纸本)9780818671203

There has been rapid growth in the demand for mobile communications over the past few years. This has led to intensive research and development efforts for complex PCS (personal communication service) networks. Capacity planning and performance modeling is necessary to maintain a high quality of service to the mobile subscriber while minimizing cost to the PCS provider. The need for flexible analysis tools and the high computational requirements of large PCS network simulations make it an excellent candidate for parallel ***, we describe our experiences in developing two PCS simulation models on a general purpose distributed simulation platform based on the Time Warp mechanism. These models utilize two widely used approaches to simulating PCS networks: (i) the call-initiated and (ii) the portable-initiated models. We discuss design decisions that were made in mapping these models to the Time Warp executive, and characterize the workloads resulting from these models in terms of factors such as communication locality and computation granularity. We then present performance measurements for their execution on a network of workstations. These measurements indicate that the call-initiated model generally outperforms the portable initiated model, but is not able to capture phenomenon such as the “busy line” effect. Moreover, these studies indicate that the high locality in large-scale PCS network simulations make them well-suited for execution on general purpose parallel and distributed simulation platforms.

关键词： time warp discrete event simulation performance measurements flexible analysis tools personal communication service telecommunication computing PCS networks parallel distributed mobile communications simulation platforms time warp simulation mobile communication

来源：评论

学校读者我要写书评

暂无评论

An algorithm for speculative parallel execution of rendezvous-synchronized simulation 95

An algorithm for speculative parallel execution of rendezvou...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Bruno R. Preiss Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario Canada N2L 3G1

ISBN: (纸本)9780818671203

This paper presents an approach for speculative parallel execution of rendezvous-synchronized simulations. Rendezvous-synchronized simulation is based on the notions of processes and gates and on the rendezvous mechanism defined in the basic process algebra of LOTOS—a standard formal specification language for temporal ordering[2]. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the TOPO toolset[4-6].The algorithm allows speculative gate activations. This increases the available parallelism while ensuring correct execution of the *** model is used to describe closed stochastic queueing network simulations. Analysis of their execution results suggests that the model makes available a promising degree of parallelism.

关键词： temporal ordering rendezvous-synchronized simulation TOPO toolset delay behaviour annotation speculative gate activations LOTOS parallel algorithms formal specification closed stochastic queueing network simulations digital simulation stochastic processes queueing theory formal specification language specification languages speculative parallel execution process algebra

来源：评论

学校读者我要写书评

暂无评论

The use of the national information infrastructure and high performance computers in industry

The use of the national information infrastructure and high ...

引用

International Conference on Massively parallel Processing Using Optical Interconnections

作者： G.C. Fox W. Furmanski Northeast Parallel Architectures Center Syracuse University Syracuse NY USA

We divide potential NII (National Information Infrastructure) services into five broad areas: Collaboration and televirtuality; InfoVISiON (Information, Video, Imagery, and simulation on Demand), and digital libraries; commerce; metacomputing; WebTop productivity services. The latter denotes the broad suite of tools we expect to be offered on the Web in a general environment we term WebWindous. We review current and future World Wide Web technologies, which could underlie these services. In particular we suggest an integration framework WebWork for high performance (parallel and distributed) computing and the NII. We point out that pervasive WebWork and WebWindows technologies will enable, facilitate and substantially accelerate such complex software processes on the NII. We briefly analyze seven broad application areas: society; business enterprises; health care; defense command and control, and crisis management; education; collaboratory; manufacturing. We contrast their use of NII services with a more detailed examination of the manufacture of complex systems, such as aircraft and automobiles. This application stresses the NII but there is a remarkable opportunity to develop new manufacturing practices that offer cost savings and reduced time to market.

关键词： Automobile manufacture Collaboration Video on demand Software libraries Business Metacomputing Productivity Web sites Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Global Virtual Time and distributed synchronization 95

Global Virtual Time and distributed synchronization

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Jeffrey S. Steinman Craig A. Lee Linda F. Wilson David M. Nicol Jet Propulation Laboratory California Inst. of Technology 4800 Oak Grove Drive Mail Stop 525-3960 Pasadena CA The Aerospace Corporation 2350 East E1 Segundo Blvd. Mail Stop M1-102 El Segundo CA ICASE NASA Langley Research Center Mail Stop 132C Hampton VA College of William and Mary Dept. of Computer Science Williamsburg VA

ISBN: (纸本)9780818671203

Global Virtual Time (GVT) is the fundamental synchronization concept in optimistic simulations. It is defined as the earliest time tag within the set of unprocessed pending events in distributed simulation. A number of techniques for determining GVT have been proposed in recent years, each having their own intrinsic properties. However, most of these techniques either focus on specific types of simulation problems or assume specific hardware support. This paper specifically addresses the GVT problem in the context of the following area• Scalability• Efficiency• Portability• Flow control• Interactive support•Real time useA new GVT algorithm, called SPEEDES GVT, has been developed in the Synchronous parallel Environment for Emulation and Discrete-Event simulation (SPEEDES) framework. The new algorithm runs periodically but does not disrupt event processing. It provides flow control by processing events risk-free while flushing out messages during the GVT computation. SPEEDES GVT is built from a set of global reduction operations that are easily implementable on any hardware system.

关键词： flow control SPEEDES GVT software fault tolerance global reduction operations parallel programming Synchronous parallel Environment for Emulation and Discrete-Event simulation framework message passing scalability event processing SPEEDES framework real time use interactive support distributed simulation optimistic simulations unprocessed pending events real-time systems portability efficiency global virtual time distributed synchronization synchronisation fundamental synchronization concept digital simulation GVT computation

来源：评论

学校读者我要写书评

暂无评论

An improved cost function for static partitioning of parallel circuit simulations using a conservative synchronization protocol 95

An improved cost function for static partitioning of paralle...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Kevin L. Kapp Thomas C. Hartrum Tom S. Wailes Department of Electrical and Computer Engineering School of Engineering Air Force Institute of Technology

ISBN: (纸本)9780818671203

Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallel simulation introduces the problem of how to partition the logic gates and system behaviors of the circuit among the available processors in order to obtain maximum speedup. A complicating factor that is often ignored is the effect of the time-synchronization protocol (conservative [1] or optimistic [2]). Inherent in the partitioning problem is the question of how to effectively measure the relative quality of a partition. This paper describes an objective cost function for measuring the relative quality of a task partition that includes a synchronization factor for a conservative NULL-message protocol. A graph-based partitioning tool based on this cost function is used to perform the static task allocation for parallel simulation of a structural VHDL circuit. Results for two 1000 – 4000 gate circuits demonstrate that the additional consideration of the synchronization protocol in the cost function generates partitions that exhibit improved speedup.

关键词： logic CAD time-synchronization protocol parallel programming logic partitioning static partitioning conservative synchronization protocol VLSI circuit design parallel simulation parallel circuit simulations objective cost function graph-based partitioning tool discrete event simulation circuit analysis computing synchronization protocol

来源：评论

学校读者我要写书评

暂无评论

parallel Discrete-Event simulation (PDES): a case study in design, development, and performance using SPEEDES 95

Parallel Discrete-Event Simulation (PDES): a case study in d...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Frederick Wieland Eric Blair Tony Zukas The MITRE Corporation 7525 Colshire Dr. McLean VA

ISBN: (纸本)9780818671203

Can parallel simulations efficiently exploit a network of workstations? Why haven't PDES models followed standard modeling methodologies? Will the field of PDES survive, and if so, in what form? Researchers in the PDES field have addressed these questions and others in a series of papers published in the last few years [1,2,3,4]. The purpose of this paper is to shed light on these questions, by documenting an actual case study of the development of an optimistically synchronized PDES application on a network of workstations. This paper is unique in that its focus is not necessarily on performance, but on the whole process of developing a model, from the physical system being simulated, through its conceptual design, validation, implementation, and, of course, its performance. This paper also presents the first reported performance results indicating the impact of risk on performance. The results suggest that the optimal value of risk is sensitive to the latency parameters of the communications network.

关键词： performance network of workstations implementation aerospace simulation validation flight simulation aerospace computing communications network SPEEDES discrete event simulation conceptual design parallel discrete-event simulation optimistically synchronized PDES operations research

来源：评论

学校读者我要写书评

暂无评论

Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications

Efficient massively parallel simulation of dynamic channel a...

引用

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

作者： A.G. Greenberg B.D. Lubachevsky P.E. Wright D.M. Nicol AT and T Bell Laboratories Inc. USA College of William and Mary USA

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, we use conservative methods; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16 K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15/spl times/ over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, we developed new methods that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50% and the speedup over the optimized serial code to about 120/spl times/ with respect to the workstation simulation.< >

关键词： Discrete event simulation Resource management Cellular networks Workstations Wireless communication Automata Land mobile radio cellular systems Educational institutions parallel algorithms Communication networks

来源：评论

学校读者我要写书评

暂无评论

Empirical study of parallel trace-driven LRU cache simulators 95

Empirical study of parallel trace-driven LRU cache simulator...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： David Nicol Eric Carr Department of Computer Science College of William and Mary Williamsburg VA Department of Math and Computer Science Carleton College Northfield MN

ISBN: (纸本)9780818671203

This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC92 benchmark programs.

关键词： associative cache content-addressable storage storage management cache storage parallel algorithms SPEC92 benchmark programs parallel trace-driven LRU cache simulators Least-Recently-Used replacement policy Intel Paragon efficient serial algorithm MasPar MP-2 virtual machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 103 104 105 106 107 108 109 110 111 112 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：