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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

1,170 篇 电子文献
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,158 篇 英文
7 篇 俄文
4 篇 中文
1 篇 其他

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

共 1170 条记录，以下是1011-1020 订阅

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

详细简洁

排序：

An algorithm for speculative parallel execution of rendezvous-synchronized simulation

An algorithm for speculative parallel execution of rendezvou...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： B.R. Preiss Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada

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. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the TOPO toolset. The algorithm allows speculative gate activations. This increases the available parallelism while ensuring correct execution of the computation. 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.< >

关键词： Computational modeling Delay effects parallel processing Computer simulation Concurrent computing Stochastic processes Formal specifications Councils

来源：评论

学校读者我要写书评

暂无评论

On extending parallelism to serial simulators

On extending parallelism to serial simulators

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： D. Nicol P. Heidelberger Department of Computer Science College of William and Mary VA USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA

This paper describes on approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops sub-models using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between sub-models; however, the automation requires that any such communication must take a non-zero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of sub-models on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian parallel Simulator), is described, along with performance results on the Intel Paragon.< >

关键词： Computational modeling Power system modeling Discrete event simulation parallel processing NASA Application software Time warp simulation Computer science Educational institutions Communication networks

来源：评论

学校读者我要写书评

暂无评论

Empirical study of parallel trace-driven LRU cache simulators

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

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： D. Nicol E. Carr Department of Computer Science College of William and Mary Williamsburg VA USA Department of Math and Computer Science Carleton College Northfield MN USA

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

关键词： Computational modeling Computer science Educational institutions Computer simulation File systems Databases Zinc Data structures Drives parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing of a multi-cluster simulator on a network of workstations

Dynamic load balancing of a multi-cluster simulator on a net...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： R. Schlagenhaft M. Ruhwandl C. Sporrer H. Bauer Institute of Electronic Design Automation Department of Electrical Engineering Technical University Munich Munich Germany Newbridge Networks Limited Kanata ONT Canada

Performance of Time Warp simulation systems are often measured on exclusively available parallel computing resources. In distributed systems exclusive use is normally not feasible. Instead, due to the multi-tasking operating systems, many users share the workstations and their availability for parallel simulation purposes varies extensively. Time Warp has been found to be very sensitive to variations in available processing power. This paper presents two methods for a Time Warp VLSI simulation system to reduce the negative effect of a non-ideal environment on the execution of parallel simulations. A dynamic load balancing algorithm which adapts to the change of available processing power is presented. This mechanism, together with a multi-cluster partitioning technique significantly improves the performance of Time Warp based simulation systems on heterogeneous computing resources.< >

关键词： Load management Computational modeling Time warp simulation Time measurement parallel processing Operating systems Workstations Availability Very large scale integration Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Predicting the future: resource requirements and predictive optimism

Predicting the future: resource requirements and predictive ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： B.L. Noble R.D. Chamberlain Computer and Communications Research Center Washington University Saint Louis MO USA

The partitioning of systems for parallel simulation is a complex task, requiring consideration of both computational load requirements and communications activity. Typically, this information is not accurately known prior to execution. This paper investigates the use of historical information for the prediction of future requirements, both for computation and communications. In addition, for optimistic simulation algorithms, we present a novel technique (which we call predictive optimism) whereby binary prediction schemes can be used to increase the accuracy of optimistic assumptions, thereby decreasing rollbacks and potentially improving overall simulator performance.< >

关键词： Computational modeling Predictive models Time measurement Discrete event simulation Degradation Partitioning algorithms Traffic control Very large scale integration Sequential circuits Circuit simulation

来源：评论

学校读者我要写书评

暂无评论

Memory management techniques for time warp on a distributed memory machine

Memory management techniques for time warp on a distributed ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： B.R. Preiss W.M. Loucks Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada

This paper examines memory management issues associated with time warp synchronized parallel simulation on distributed memory machines. The paper begins with a summary of the techniques which have been previously proposed for memory management on various parallel processor memory structures. It then concentrates the discussion on parallel simulation executing on a distributed memory computer-a system comprised of separate computers, interconnected by a communications network. An important characteristic of the software developed for such systems is the fact that the dynamic memory is allocated from a pool of memory that is shared by all of the processes at a given processor. This paper presents a new memory management protocol, pruneback, which recovers space by discarding previous states. This is different from all previous schemes such as artificial rollback and cancelback which recover memory space by causing one or more logical processes to roll back to an earlier simulation time. The paper includes an empirical study of a parallel simulation of a closed stochastic queueing network showing the relationship between simulation execution time and amount of memory available. The results indicate that using pruneback is significantly more effective than artificial rollback (adapted for a distributed memory computer) for this problem. In the study, varying the memory limits over a 2:1 range resulted in a 1:2 change in artificial rollback execution time and almost no change in pruneback execution time.< >

关键词： Memory management Computational modeling distributed computing Computer networks Concurrent computing Time warp simulation Computer simulation Communication networks Protocols Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

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

Efficient massively parallel simulation of dynamic channel a...

引用

3rd International workshop on Modeling, Analysis, and simulation of Computer and Telecommunication Systems, MASCOTS 1995

作者： Greenberg, A.G. Lubachevsky, B.D. Nicol, D.M. Wright, P.E. ATandT Bell Labs. United States College of William and Mary United States

ISBN: (纸本)0818669020

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× 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× with respect to the workstation simulation. © 1995 IEEE.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed simulation of free choice Petri Nets 95

Parallel and distributed simulation of free choice Petri Net...

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： François Baccelli Nathalie Furmento Bruno Gaujal INRIA Sophia-Antipolis BP 93 06902 Sophia-Antipolis France

ISBN: (纸本)9780818671203

In this paper, we present two new methods to simulate Petri Nets: a data parallel simulation and a distributed simulation. Both simulations use an equational representation of the net in the so called (min, +) algebra. The data parallel simulation is based on the use of matrix representation of these equations, and the distributed simulation on the decomposition of a Petri Net into marked graph components.

关键词： equational representation marked graph components distributed simulation matrix representation free choice Petri nets Petri nets discrete event simulation data parallel simulation

来源：评论

学校读者我要写书评

暂无评论

A technique for the distributed simulation of parallel computers

A technique for the distributed simulation of parallel compu...

引用

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

作者： L. Ricciulli SRI International Inc. USA

A new technique for the efficient asynchronous discrete event-driven simulation of parallel shared-memory computers is proposed. Our execution-driven methodology, while introducing minimal synchronization overhead to maintain a coherent distributed event causality relation, allows complete virtualization of the design at all levels and therefore is very flexible. We give a detailed description of the proposed technique together with some preliminary performance results we obtained by implementing our parallelization technique on a CM-5 computer.< >

关键词： Computational modeling Computer simulation Concurrent computing distributed computing Discrete event simulation Context modeling Hardware Access protocols Contracts parallel machines

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： K.L. Kapp T.C. Hartrum T.S. Wailes Department of Electrical and Computer Engineering School of Engineering Air Force Institute of Technology USA

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 or optimistic). 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.< >

关键词： Cost function Circuit simulation Protocols Circuit synthesis Iterative algorithms Computational modeling Computer simulation Very large scale integration Discrete event simulation Context modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 98 99 100 101 102 103 104 105 106 107 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：