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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

576 篇 工学
- 541 篇 计算机科学与技术...
- 344 篇 软件工程
- 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 篇 中文
2 篇 其他

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

共 1175 条记录，以下是1161-1170 订阅

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

详细简洁

排序：

distributed interactive simulation for synthetic forces

Distributed interactive simulation for synthetic forces

引用

Heterogeneous Computing workshop

作者： P. Messina S. Brunett D. Davis T. Gottschalk D. Curkendall L. Ekroot H. Siegel Center for Advanced Computing Research California Institute of Technology Pasadena CA USA The ALPHA Group Jet Propulsion Laboratory Pasadena CA USA

Interactive simulation of battles is a valuable tool for training. The behavior and movement of hundreds or thousands of entities (tanks, trucks, airplanes, missiles, etc.) is currently simulated using dozens or more workstations on geographically distributed LANs connected by WANs. The simulated entities can move, fire weapons, receive "radio" messages, etc. The terrain that they traverse may change dynamically, for example due to rains turning dirt roads into mud or bombs forming craters. Thus the entities need to receive frequent information about the state of the terrain and the location and state of other entities. Typically, information is updated several times a second. As the number of simulated entities grows, the number of messages that need to be sent per unit of time can grow to unmanageable numbers. One approach to reducing the number of messages is to keep track of what entities need to know about which other entities and only send information to the entities that need to know. For example, tanks in Germany need not know about a change of course of a ship in the Pacific. This technique for reducing messages is known as interest management. Caltech and its Jet Propulsion Laboratory have implemented a simulation of this type on several large-scale parallel computers, exploiting both the compute power and the fast messaging fabric of such systems. The application is implemented using a heterogeneous approach. Some nodes are used to simulate entities, some to manage a database of terrain information, some to provide interest management functions, and some to route messages to the entities that do need to receive the information. Some of these tasks require more memory than others, some require faster processing capability.

关键词： Power system management Weapons Computational modeling Concurrent computing Airplanes Missiles Workstations Fires Rain Turning

来源：评论

学校读者我要写书评

暂无评论

A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment

A mathematical model, heuristic, and simulation study for a ...

引用

Heterogeneous Computing workshop

作者： Min Tan M.D. Theys H.J. Siegel N.B. Beck M. Jurczyk Cisco Systems Inc. San Jose CA USA Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Engineering and Computer Science University of Missouri Columbia Columbia MO USA

Data staging is an important data management problem for a distributed heterogeneous networking environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links. Sites in the network request data items and each item is associated with a specific deadline and priority. It is assumed that not all requests can be satisfied by their deadline. The work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. A mathematical model for the basic data staging problem is introduced. Then, a multiple-source shortest-path algorithm based heuristic for finding a suboptimal schedule of the communication steps for data staging is presented. A simulation study is provided, which evaluates the performance of the proposed heuristic. The results show the advantages of the proposed heuristic over two random based scheduling techniques. This research, based on the simplified static model, serves as a necessary step toward solving the more realistic and complicated version of the data staging problem involving dynamic scheduling, fault tolerance, and determining where to stage data.

关键词： Mathematical model Computer networks distributed computing Data engineering Military computing Intelligent networks Computer network management Environmental management Memory Satellite broadcasting

来源：评论

学校读者我要写书评

暂无评论

Maya: a Multi-Paradigm Network Modeling Framework 03

Maya: a Multi-Paradigm Network Modeling Framework

引用

proceedings of the seventeenth workshop on parallel and distributed simulation

作者： Junlan Zhou Zhengrong Ji Mineo Takai Rajive Bagrodia University of California Los Angeles Parallel Computing Laboratory 3809 Boelter Hall Los Angeles CA

ISBN: (纸本)9780769519708

This paper presents Maya, a multi-paradigm, scalableand extensible network modeling framework for emulatingdistributed applications. A novel three-tier architecture isproposed to integrate three disparate modeling paradigms,namely, discrete event models, analytical models and physicalnetwork interfaces into one unified framework of *** the first effort to integrate all three paradigms intoone framework, this paper discusses the implementationsof Maya using Qualnet, fluid flow based TCP model andphysical network interface. It addresses the performanceissues involved in attaining the real time constraints imposedby distributed applications and demonstrates the effectivenessof using analytical models in Maya. Furthermore, it identifies the negative impact on real time performance through the computation intensive ordinary differential equation (ODE) solver in the fluid flow model. A new approach to interleaved executions of the fluid flow model is proposed to hide ODE solver turnaround time. As a result, the percentage of packets missing their deadlines has been reduced from more than 6% to less than 0.2%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Removing the latency overhead of the ITB mechanism in COWs with source routing

Removing the latency overhead of the ITB mechanism in COWs w...

引用

Euromicro Conference on parallel, distributed and Network-Based Processing

作者： J. Flich M.P. Malumbres P. Lopez J. Duato Dpto. of Computer Engineering (DISCA) Universidad Politécnica de Valencia Valencia Spain

ISBN: (纸本)0769514448

Clusters of workstations (COWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. The in-transit buffer (ITB) mechanism can improve network performance when applied to COWs with irregular topology and source routing. This mechanism considerably improves the performance of this kind of network when compared to current source routing algorithms; however, it introduces a latency penalty. An implementation of this mechanism was performed, showing that the latency overhead of the mechanism may be noticeable, especially for short messages and at low network loads. In this paper, we analyze in detail the latency overhead of ITBs, proposing several mechanisms to reduce, hide and remove it. Firstly, we show, by simulation, the effect of an ITB implementation that is much slower than the one implemented. Then we propose three mechanisms that try to overcome the latency penalty. All the mechanisms are simple and can be easily implemented; also, they are out of the critical path of the ITB packet-processing procedure. The results show very good behaviour of the proposed mechanisms, considerably reducing or even completely removing the latency overhead.

关键词： Delay Cows Routing Network topology Concurrent computing Workstations Local area networks Telecommunication traffic Large-scale systems parallel processing

来源：评论

学校读者我要写书评

暂无评论

Conditional checkpoint abort: an alternative semantic for re-synchronization in CCL 02

Conditional checkpoint abort: an alternative semantic for re...

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Francesco Quaglia Andrea Santoro Bruno Ciciani Università di Roma "La Sapienza" Roma Itály

ISBN: (纸本)9780769516080

Recently, a Checkpointing and Communication Library (CCL) to support optimistic parallel simulation on myrinet based clusters has been presented. Beyond classical low latency message delivery functionalities, this library additionally offers CPU offloaded checkpointing functionalities based on data transfer capabilities provided by a programmable DMA engine on board of myrinet network cards. A re-synchronization functionality is also supported for both logical (i.e. data consistency) and practical (i.e. hardware contention) reasons, which is implemented according to the following semantic: at any re-synchronization point, the simulation application is momentarily frozen until the last activated DMA based checkpoint operation is completed. In case long freezing periods are experienced, the checkpointing functionalities offered by CCL might not be fully effective in reducing the real checkpointing overhead at the simulation application level. To tackle this drawback, we present an alternative semantic for re-synchronization, namely conditional checkpoint abort, leading to application freezing only in case at least a threshold fraction of the state vector currently being checkpointed has already been transferred into the checkpoint buffer. In the opposite case, the checkpoint operation is aborted and the simulation application is immediately allowed to proceed, thus avoiding excessive checkpointing overhead (due to freezing) at the simulation application level. We also report the results of an evaluation, carried out using classical parameterized synthetic benchmarks, which show that the execution speed of the simulation application can be significantly increased by the alternative semantic we propose.

关键词： Checkpointing Performance Optimization Optimistic simulation Rollback Based Synchronization

来源：评论

学校读者我要写书评

暂无评论

SGTNE: semi-global time of the next event algorithm 95

SGTNE: semi-global time of the next event algorithm

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Azzedine Boukerche Carl Tropper School of Computer Science McGill University Montreal Canada H3A-2A7

ISBN: (纸本)9780818671203

This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlocks inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlocks by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.

关键词： discrete event simulation SGTNE partitioning parallel algorithms FCFS queueing network model inter-processor deadlock parallelism shortest path algorithm performance results

来源：评论

学校读者我要写书评

暂无评论

Structural modeling for simulation of power electronic systems

Structural modeling for simulation of power electronic syste...

引用

IEEE workshop on Computers in Power Electronics

作者： V.P. Guzik V.E. Zolotovsky Yu.V. Chemukhin S.V. Tretyakov O.A. Muntyan R.A. Dougal Taganrog State Univ. of Radio-Eng. Russia Taganrog State University of Radio Engineering Taganrog Russia University of South Carolina Columbia SC USA

ISBN: (纸本)0780365615

Power electronic systems are described by nonlinear differential equations, typically of high order. simulation of such systems increasingly requires the high speeds available only on multiprocessor computing systems. However, the traditional methods for partitioning the system are rather inconvenient, primarily because of the additional burden created by the current operation associated with distributed systems. The concepts and methods of structural modeling provide a way to overcome this difficulty. The essence of structural modeling is the assignment of some specific computing resource to each object of the simulated physical system. The simulation of each object then operates as a formal independent procedure, and interactions between objects are implemented on a data link level. This allows parallel execution of the separate procedures on the allocated multiprocessor computing hardware. This provides two advantages: (1) a decrease in simulation time, and (2) simplification of the programming process.

关键词： Power system modeling Computational modeling Circuit simulation Power electronics Differential equations Multiprocessing systems Power system interconnection Power system simulation Libraries Physics computing

来源：评论

学校读者我要写书评

暂无评论

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

Semi-asynchronous checkpointing for optimistic simulation on...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Francesco Quaglia Andrea Santoro Dipartimento di Informatica e Sistemistica Università di Roma "La Sapienza" Via Salaria 113 00198 Roma Italy

ISBN: (纸本)9780769511047

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 in the direction to improve 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 Network 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 distinct from the CPU, namely a DMA 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 is 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 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Buffer management in shared-memory Time Warp systems 95

Buffer management in shared-memory Time Warp systems

引用

proceedings of the ninth workshop on parallel and distributed simulation

作者： Richard M. Fujimoto Kiran S. Panesar College of Computing Georgia Institute of Technology Atlanta GA

ISBN: (纸本)9780818671203

Mechanisms for managing message buffers in Time Warp parallel simulations executing on cache-coherent shared-memory multiprocessors are studied. Two simple buffer management strategies called the sender pool and receiver pool mechanisms are examined with respect to their efficiency, and in particular, their interaction with multiprocessor cache-coherence protocols. Measurements of implementations on a Kendall Square Research KSR-2 machine using both synthetic workloads and benchmark applications demonstrate that sender pools offer significant performance advantages over receiver pools. However, it is also observed that both schemes, especially the sender pool mechanism, are prone to severe performance degradations due to poor locality of reference in large simulations using substantial amounts of message buffer memory. A third strategy called the partitioned buffer pool approach is proposed that exploits the advantages of sender pools, but exhibits much better locality. Measurements of this approach indicate that the partitioned pool mechanism yields substantially better performance than both the sender and receiver pool schemes for large-scale, small-granularity parallel simulation *** central conclusions from this study are: (1) buffer management strategies play an important role in determining the overall efficiency of multiprocessor-based parallel simulators, and (2) the partitioned buffer pool organization offers significantly better performance than the sender and receiver pool schemes. These studies demonstrate that poor performance may result if proper attention is not paid to realizing an efficient buffer management mechanism.

关键词： message buffers multiprocessor-based parallel simulators buffer management message buffer memory multiprocessor cache-coherence protocols Kendall Square Research KSR-2 machine mall-granularity parallel simulation applications discrete event simulation cache-coherent shared-memory multiprocessors multiprocessing programs shared memory systems buffer storage message passing severe performance degradations sender pool time warp simulation receiver pool storage management partitioned pool mechanism shared-memory time warp systems partitioned buffer pool approach

来源：评论

学校读者我要写书评

暂无评论

Quantum neurocomputation and signal processing

Quantum neurocomputation and signal processing

引用

IEEE workshop on Neural Networks for Signal Processing

作者： H. Eghbalnia A. Assadi University of Wisconsin Madison USA

We consider a quantum computational algorithm that can be used to determine (probabilistically) how close a given signal is to one of a set of previously observed signals stored in the state of a quantum neurocomputional machine. The realization of a new quantum algorithm for factorization of integers by Shor and its implication to cryptography has created a rapidly growing field of investigation. Although no physical realization of a quantum computer is available, a number of software systems simulating a quantum computation process exist. In light of the rapidly increasing power of desktop computers and their ability to carry out these simulations, it is worthwhile to investigate possible advantages as well as realizations of quantum algorithms in signal processing applications. The algorithm presented offers a glimpse of the potential of this approach. Neural networks (NN) provide a natural paradigm for parallel and distributed processing of a wide class of signals. Neural networks within the context of classical computation have been used for approximation and classification tasks with some success. We propose a model for quantum neurocomputation (QN) and explore some of its properties and potential applications to signal processing in an information theoretic context.

关键词： Signal processing Quantum computing Signal processing algorithms Neural networks Physics computing Computational modeling Computer simulation Cryptography Software systems Application software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：