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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1121-1130 订阅

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

详细简洁

排序：

Dynamic load balancing strategies for conservative parallel simulations 97

Dynamic load balancing strategies for conservative parallel ...

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： Azzedine Boukerche Sajal K. Das Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North of Texas Denton TX

ISBN: (纸本)9780818679650

This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each *** examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because it of its many cycles aid in the formation of deadlock making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40\% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

XSim: real-time analytic parallel simulations 02

XSim: real-time analytic parallel simulations

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Christopher D. Carothers Rensselaer Polytechnic Institute Troy NY

ISBN: (纸本)9780769516080

Of critical importance to any real-time system is the issue of predictability. We divide overall system predictability into two parts: algorithmic and systemic. Algorithmic predictability is concerned with ensuring that the parallel simulation engine and model from a complexity point of view are able to consistently yield results within a real-time deadline. Systemic predictability is concerned with ensuring that OS scheduling, interrupts and virtual memory overheads are consistent over a real-time period. To provide a framework for investigating systemic predictability, we define a new class of parallel simulation called Extreme simulation or XSim. An XSim is any analytic parallel simulation that is able to generate a statistically valid result by a real-time deadline. Typically, this deadline is between 10 and 100 milliseconds. XSims are expected to provide decision support to existing complex, real-time systems. As a new design and implementation methodology for realizing XSims, we embed a state-of-the-art optimistic simulator into the Linux operating system. In this operating environment, OS scheduling and interrupts are disabled. Given a 50 millisecond model completion deadline, we observe that the XSim has a systemic predictability, measure of 98% compared with only 56% for the same Time Warp system operating in user-level.

关键词： predictability real-time xsim parallel simulation time warp

来源：评论

学校读者我要写书评

暂无评论

Dag consistent parallel simulation: a predictable and robust conservative algorithm 97

Dag consistent parallel simulation: a predictable and robust...

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： Wentong Cai Emmanuelle Letertre Stephen J. Turner School of Applied Science Nanyang Technological University Singapore 639798 IFSIC Universié de Rennes I Campus de Beaulieu 35042 Rennes Cedex France and Dept. of Computer Science University of Exeter Exeter EX4 4PT U.K. Dept. of Computer Science University of Exeter Exeter EX4 4PT U.K.

ISBN: (纸本)9780818679650

We present a novel approach to parallel discrete event simulation based on the Cilk model of multithreaded computation. Cilk's runtime system not only manages the low-level aspects of program execution, but also provides the user with an algorithmic model of performance which can be used to predict the execution time of a parallel simulation. Moreover, a Cilk application can ``scale down'' to run on a single processor with nearly the same performance as that of serial code.A conservative parallel discrete event simulation algorithm has been developed in which communication between logical processes is achieved using Cilk's virtual memory model, dag consistent shared memory. The simulation executes in cycles, where each cycle involves a divide and conquer computation. Although local lookahead information can be exploited, the algorithm is robust in that it also calculates a global simulation time for each cycle. It can therefore be used for applications where zero lookahead may occur.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A parallel neurochip for neural networks implementing the reactive tabu search algorithm: application case studies

A parallel neurochip for neural networks implementing the re...

引用

Euromicro workshop on parallel and distributed Processing

作者： G. Danese I. De Lotto F. Leporati A. Quaglini S. Ramat G. Tecchioili INFM sez. Pavia Pavia Italia Dip. di Informatica e Sistemistica Università di Pavia Italy Neuricam S. p. A Via S. Maria Maddalena Trento Italia

ISBN: (纸本)0769509878

In this work we present two different applications implemented on the neurocomputer Totem Nc3001 from Neuricam Inc. The goal of the experimentation is to test, on real problems, the performance of this powerful parallel unit consisting of 32 Digital Signal Processors (DSPs) and to evaluate its suitability to neural network applications. The first problem implemented is a typical classification algorithm in which the network recognises which points belong to different regions inside a 2D space. The second problem is more computationally heavy and consists of a network able to reproduce the eye movements, if properly stimulated. A comparison is reported between Matlab implementations or handwritten code run on workstations and the performance obtained from the Totem chip.

关键词： Neural networks Artificial neural networks Signal processing algorithms Computational modeling Multilayer perceptrons Digital signal processors Digital signal processing Mathematical model Circuit simulation Testing

来源：评论

学校读者我要写书评

暂无评论

Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW

Semi-asynchronous checkpointing for optimistic simulation on...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： F. Quaglia A. Santoro Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Rome Italy

ISBN: (纸本)076951104X

Great effort has been devoted to the design of optimized checkpointing strategies for optimistic parallel discrete event simulators. On the other hand, there is less work being done in the direction of improving the execution mode of any single checkpoint operation. Specifically, checkpoint operations are typically charged to the CPU, thus leading to freezing of the simulation application while checkpointing is in progress, i.e. the execution mode of the checkpointing protocol is typically synchronous. In this paper, we focus on improvements of the execution mode and present a software architecture, designed for Myrinet-based networks of workstations (NOWs), to avoid application freezing during any checkpoint operation, thus moving the execution itself towards an asynchronous mode. This is done by charging checkpoint operations to a hardware component that is distinct from the CPU, namely a DMA (direct memory access) engine. On the other hand, totally asynchronous checkpointing could suffer from data inconsistency whenever the content of a state buffer is accessed for further modifications while a checkpoint operation involving it has not yet completed. To avoid this, the architecture includes functionalities for resynchronization on demand. We have used these functionalities to implement an execution mode of the checkpointing protocol that we refer to as semi-asynchronous. By the results of an experimental study, we argue that the semi-asynchronous mode can be an effective solution to almost completely remove the delay associated with any checkpoint operation from the completion time of the simulation.

关键词： Checkpointing Design optimization Application software Discrete event simulation Protocols Software architecture Software design Workstations Hardware Engines

来源：评论

学校读者我要写书评

暂无评论

Load balancing for conservative simulation on shared memory multiprocessor systems 00

Load balancing for conservative simulation on shared memory ...

引用

proceedings of the fourteenth workshop on parallel and distributed simulation

作者： Boon Ping Gan Yoke Hean Low Sanjay Jain Stephen J. Turner Wentong Cai Wen Jing Hsu Shell Ying Huang Gintic Institute of Manufacturing Technology 71 Nanyang Drive Singapore 638075 School of Applied Science Nanyang Technological University Nanyang Avenue Singapore 639798

ISBN: (纸本)9780769506678

Load balancing is a crucial factor in achieving good performance for parallel discrete event simulations. In this paper, we present a load balancing scheme that combines both static partitioning and dynamic load balancing. The static partitioning scheme maps simulation objects to logical processes before simulation starts while the dynamic load balancing scheme attempt to balance the load during runtime. The static scheme involves two steps. First, the simulation objects that contribute to small lookahead are merged together by using a merging algorithm. Then a partitioning algorithm is applied. The merging is needed to ensure a consistent performance for our dynamic scheme. Our dynamic scheme is tailor-made for an asynchronous simulation protocol that does not rely on null messages. The performance study on a supply-chain simulation shows that the partitioning algorithm and dynamic load balancing are important in achieving good performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Effective values: an approach for characterizing dependability parameters

Effective values: an approach for characterizing dependabili...

引用

International Conference and workshop on Engineering of Computer-Based Systems

作者： S. Noureddine A. Lehmann Department of Computer Engineering University of Federal Armed Forces Munich Germany

ISBN: (纸本)0769510868

The authors discuss a novel direction for evaluating system dependability. The research efforts outlined are part of a special focus concerning the dependability of complex distributed systems at the Department of Computer Engineering of the Federal Armed Forces University in Munich, Germany. Our approach emphasizes the behavior of components after they have been embedded in a system. We use the notion of effective values for the analysis and estimation of key dependability parameters. The concept is targeted to unify performance characterization with the dependability. Besides analysis, we report on some simulation results, which were in favor of our assumptions.

关键词： Hardware Application software Availability distributed computing Computer applications Computer science Military computing Concurrent computing parallel algorithms Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 109 110 111 112 113 114 115 116 117 118 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：