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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

575 篇 工学
- 540 篇 计算机科学与技术...
- 343 篇 软件工程
- 76 篇 控制科学与工程
- 74 篇 信息与通信工程
- 58 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
182 篇 理学
- 140 篇 数学
- 40 篇 系统科学
- 38 篇 统计学（可授理学、...
- 18 篇 物理学
- 13 篇 化学
- 9 篇 生物学
38 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 工商管理
- 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...
53 篇 analytical model...
52 篇 computer archite...
48 篇 large-scale syst...
47 篇 computer network...
46 篇 costs
43 篇 parallel process...
40 篇 circuit simulati...
36 篇 predictive model...
34 篇 hardware
34 篇 delay
33 篇 runtime

机构

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,162 篇 英文
7 篇 俄文
4 篇 中文
1 篇 其他

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

共 1174 条记录，以下是981-990 订阅

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

详细简洁

排序：

Learning not to share [large-scale discrete event simulation]

Learning not to share [large-scale discrete event simulation...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： J. Liu D. Nicol Department of Computer Science Dartmouth College Hanover NH USA

ISBN: (纸本)076951104X

Strong reasons exist for executing a large-scale discrete-event simulation on a cluster of processor nodes (each of which may be a shared-memory multiprocessor or a uniprocessor). This is the architecture of the largest scale parallel machines, and so the largest simulation problems can only be solved this way. It is a common architecture even in less esoteric settings, and is suitable for memory-bound simulations. This paper describes our approach to porting the SSF simulation kernel to this architecture, using the Message Passing Interface (MPI) system. The notable feature of this transformation is to support an efficient two-level synchronization and communication scheme that addresses cast discrepancies between shared-memory and distributed memory. In the initial implementation, we use a globally synchronous approach between distributed-memory nodes, and an asynchronous shared-memory approach within a SMP cluster. The SSF API reflects inherently shared-memory, assumptions; we report therefore on our approach for porting an SSF kernel to a cluster of SMP nodes. Experimental results on two architectures are described, for a model of TCP/IP traffic flows over a hierarchical network. The performance on a distributed network of commodity SMPs connected through ethernet is seen to frequently exceed performance on a Sun shared-memory multiprocessor.

关键词： Large-scale systems Discrete event simulation Kernel parallel machines Message passing TCPIP Telecommunication traffic Traffic control Ethernet networks Sun

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of heterogeneous distributed applications

Performance modeling of heterogeneous distributed applicatio...

引用

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

作者： C. Anglano Dipartimento di Informatica Universitá di Torino Italy

Heterogeneous network computing allows the development of a single complex application using a distributed network of machines; these machines may differ in terms of CPU and memory capacity and/or architecture and specialized functions. We present a modeling technique, based on generalized stochastic Petri nets (GSPNs), for the performance analysis of applications targeted to this class of systems (heterogeneous applications). We illustrate the use of the proposed technique by modeling and analyzing the CASA 3D-REACT heterogeneous application.

关键词： Computer networks distributed computing Computer architecture Petri nets Memory architecture Stochastic systems Performance analysis parallel processing Application software Software systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic coupling of grid-based multidisciplinary applications

Dynamic coupling of grid-based multidisciplinary application...

引用

Euromicro workshop on parallel and distributed Processing

作者： Yun Ding M. Munch M. Laux Institute of Parallel and Distributed High-Performance Systems (IPVR) University of Stuttgart Germany IBM High Performance Support Center Heidelberg Germany

The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are devoted to a single discipline, can be interconnected to a complex simulation system via the GRISSLi coupling interface without recoding the participating programs. We introduce a data model to establish the links between the (dynamic) grids and the attached coupling values in a single application program and to establish the mappings between grids and coupling values among different application programs. The user-specified consistency model is realized using asynchronous communication based on the MPI message passing standard. Efficient communication is achieved by pre-computing an optimized communication schedule and overlapping communication with computation. Flexible coupling algorithms with adaptive grids and branches are supported in GRISSLi. We have developed a prototype implementation, which provides language bindings in ANSI C and Fortran, and runs currently on IBM RS/6000 SP, Gray T3E, SGI Origin/Octane and HP-V Class. We verify the functionality and evaluate the performance of our library using an industry relevant pilot application, the steel strip production process.

关键词： Computational modeling Runtime library Computer interfaces Grid computing Data models Asynchronous communication Message passing Communication standards Job shop scheduling Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of periodic state saving techniques in time warp simulators

Comparative analysis of periodic state saving techniques in ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： J. Fleischmann P.A. Wilsey Institute of Electronic Design Automation Technical University Munich Munich Germany Department of ECECS Center for Digital Systems Engineering Cincinnati OH USA

Checkpointing in a time warp synchronized parallel simulator is a necessary and potentially expensive operation. In the simple case, a time warp simulator checkpoints every /spl chi/ events, for some fired value /spl chi/. For larger values of /spl chi/, the simulator requires less overhead for saving the state, but incurs an increased latency during rollback. Thus, the problem is to balance the time to save states against the time to coast forward upon rollback. Unfortunately, a static determination of an optimal value for /spl chi/ is very difficult and can vary widely, even between closely related instances of a time warp simulator. Furthermore, the optimal checkpoint interval may actually vary over the lifetime of the simulation. To address these problems, several investigators have proposed dynamically adjusting the checkpoint interval /spl chi/ as the simulation progresses. This paper analyzes three previous techniques for dynamically sizing checkpoint intervals and presents a new, heuristic algorithm for this purpose. All four techniques are implemented in a common application domain (digital system simulation from VHDL descriptions) and a direct comparison between the algorithms is performed. The results show a significant difference in the performance of the implemented algorithms. However, in virtually all cases, the dynamic algorithms performed near or better than the best static value. Furthermore, the best algorithms performed as much as 12% better than the best static value.< >

关键词： Analytical models Time warp simulation Modeling Discrete event simulation Out of order Costs Hardware Checkpointing Heuristic algorithms Digital systems

来源：评论

学校读者我要写书评

暂无评论

Specification and simulation of a concurrent real-time system

Specification and simulation of a concurrent real-time syste...

引用

IEEE International workshop on Software Engineering for parallel and distributed Systems

作者： Xiaoshan Li Faculty of Science and Technology University of Macau Macau Macao China

Interval temporal logic (ITL) is a real-time logic for specifying and verifying real-time systems. In this paper, ITL is used to specify a concurrent real-time system: an assembly line which is an abstract model of industrial robot control systems. We can specify the abstract properties of the system in ITL as well as the system design using the executable subset of ITL, Tempura. Compared with other approaches, the first advantage of this methodology is that the concurrent real-time systems can be naturally specified in a true concurrent model rather than an interleaving model. The second is that the specification of the system design is executable so that the simulation can be obtained in the same formal framework. Therefore, both the properties of the system and the consistency of the specification can be checked before verification.

关键词： distributed computing

来源：评论

学校读者我要写书评

暂无评论

XTracker, a graphical tool for parallel simulations 95

XTracker, a graphical tool for parallel simulations

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Steven Bellenot Li Duty Department of Mathematics Florida State University Tallahassee FL Department of Computer Science Florida State University Tallahassee FL

ISBN: (纸本)9780818671203

A Motif based graphical tool XTracker is described. XTracker can show Gannt-like charts of the activities on each node or it can show the event messages as traffic between simulation objects. XTracker can take its data from sequential simulation runs and simulate a parallel execution under a number of simulation methods. XTracker can act as a performance modeling tool.

关键词： graphical tool software performance evaluation parallel execution XTracker digital simulation performance modeling tool simulation objects parallel programming parallel simulations

来源：评论

学校读者我要写书评

暂无评论

Dynamic file migration to support parallel database systems

Dynamic file migration to support parallel database systems

引用

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

作者： J.A. McCann N.J. Williams P. Osmon D. Bolton Systems Architecture Research Centre City University London UK

Research into DBMS (Database Management System) parallelism has been carried out to address the performance problems experienced in areas such as Decision Support. distributed shared memory can alleviate the porting of commercial DBMSs to parallel platforms. However, this restricts the scaleability and performance achievable using shared nothing approaches. Consequently we propose the use of dynamic data migration techniques to support such parallel DBMSs. Using simulation techniques, we examine the effects which parameters such as migration threshold, migration block size and degree of data sharing have on file system performance. We present simulation results, providing useful insight into file system design.< >

关键词： Database systems File systems parallel machines Kernel Process design Decision making Degradation Query processing

来源：评论

学校读者我要写书评

暂无评论

Stochastic bounds on execution times of parallel computations

Stochastic bounds on execution times of parallel computation...

引用

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

作者： F. Lo Presti M. Colajanni S. Tucci Dip. Ingegneria Elettronica Universita di Roma Tor Vergara Roma Italy

We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions for shared resources. A parallel computation is modelled as a task system with precedence constraints expressed as a directed acyclic graph (DAG). The task execution times are assumed independent random variables. The performance measure considered is the overall execution time of the computation. To obtain upper bounds on this measure, we apply stochastic ordering and stochastic comparison techniques.< >

关键词： Stochastic processes Concurrent computing Random variables Upper bound Computational modeling Time sharing computer systems Time measurement Equations distributed computing

来源：评论

学校读者我要写书评

暂无评论

The parallel waveform IQMR algorithm for transient simulation of semiconductor devices

The parallel waveform IQMR algorithm for transient simulatio...

引用

International Conference on parallel Processing workshops (ICPPW)

作者： L.T. Yang Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

We mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers since these methods are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. We propose an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step. For the Lanczos process stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. Therefore, the cost of global communication can be significantly reduced. Experimental results carried out on a Parsytec GC regarding a comparison with other accelerated approaches such as convolution SOR and waveform GMRES techniques on the waveform relaxation algorithm and pointwise methods are also described.

关键词： Computational modeling Acceleration Concurrent computing distributed computing Computer simulation Semiconductor devices Numerical stability parallel algorithms Algorithm design and analysis Time varying systems

来源：评论

学校读者我要写书评

暂无评论

Speedup of a sparse system simulation

Speedup of a sparse system simulation

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： J. Nutaro H. Sarjoughian Arizona Center for Integrative Modeling and Simulation University of Arizona Tucson USA

ISBN: (纸本)076951104X

Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterised by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.

关键词： Character generation Discrete event simulation Discrete event systems State-space methods World Wide Web Concrete Heart Continuous time systems Clocks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 95 96 97 98 99 100 101 102 103 104 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：