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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

645 篇 工学
- 606 篇 计算机科学与技术...
- 380 篇 软件工程
- 91 篇 信息与通信工程
- 81 篇 控制科学与工程
- 62 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 8 篇 机械工程
- 8 篇 材料科学与工程（可...
- 8 篇 动力工程及工程热...
- 6 篇 力学（可授工学、理...
- 6 篇 土木工程
- 5 篇 仪器科学与技术
- 5 篇 建筑学
- 5 篇 生物工程
- 4 篇 冶金工程
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
193 篇 理学
- 148 篇 数学
- 41 篇 系统科学
- 38 篇 统计学（可授理学、...
- 22 篇 物理学
- 13 篇 化学
- 9 篇 生物学
44 篇 管理学
- 37 篇 管理科学与工程(可...
- 21 篇 工商管理
- 9 篇 图书情报与档案管...
9 篇 教育学
- 9 篇 教育学
8 篇 经济学
- 8 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 军事学
3 篇 医学
1 篇 农学

主题

255 篇 computational mo...
227 篇 computer simulat...
216 篇 discrete event s...
129 篇 concurrent compu...
95 篇 distributed comp...
84 篇 computer science
81 篇 parallel process...
73 篇 protocols
60 篇 analytical model...
55 篇 computer archite...
54 篇 time warp simula...
53 篇 large-scale syst...
50 篇 computer network...
47 篇 costs
47 篇 parallel process...
44 篇 application soft...
41 篇 circuit simulati...
41 篇 delay
39 篇 hardware
36 篇 runtime

机构

18 篇 college of compu...
13 篇 school of comput...
9 篇 georgia inst tec...
9 篇 department of co...
8 篇 dipartimento di ...
8 篇 department of co...
7 篇 school of comput...
7 篇 univ roma la sap...
6 篇 coll of william ...
6 篇 department of co...
6 篇 georgia inst of ...
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...

作者

25 篇 wentong cai
17 篇 fujimoto richard...
14 篇 cai wentong
13 篇 d.m. nicol
12 篇 nicol david m.
12 篇 r.m. fujimoto
12 篇 s.j. turner
10 篇 f. quaglia
10 篇 r. bagrodia
9 篇 rajive bagrodia
9 篇 bagrodia rajive
8 篇 r. fujimoto
8 篇 quaglia f
8 篇 b. unger
8 篇 david m. nicol
8 篇 turner stephen j...
7 篇 p.a. wilsey
7 篇 shell ying huang
7 篇 richard m. fujim...
7 篇 yu-an chen

语言

1,262 篇 英文
7 篇 俄文
4 篇 中文
3 篇 其他

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

共 1276 条记录，以下是561-570 订阅

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

详细简洁

排序：

A causality based time management mechanism for federated simulation

A causality based time management mechanism for federated si...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： Bu-Sung Lee Wentong Cai Junlan Zhou School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)076951104X

One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is time management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receipt ordering. Temporal anomalies occurring during the execution of federation due to the heterogeneous latencies in the communication network are not handled in receipt ordering. While time stamp ordering eliminates the temporal anomalies entirely, it incurs great communication latency, and huge bandwidth requirement. The paper presents a novel time management mechanism which provides a less costly message ordering service, namely causal ordering, to federates. It does not require the specification of lookahead and allows federates that do not require stringent message ordering properties to achieve much more efficient execution. A series of experiments has been carried out to benchmark the performance of this new time management mechanism and the results show that it includes a slight overhead compared to the receipt ordering mechanism but achieves significant performance improvement over the time stamp ordering mechanism.

关键词： Delay Computational modeling Technology management Engineering management Bandwidth Computer simulation Communication networks Runtime Large-scale systems Communication system control

来源：评论

学校读者我要写书评

暂无评论

Causality representation and cancellation mechanism in time warp simulations

Causality representation and cancellation mechanism in time ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： M. Chetlur P.A. Wilsey Department of ECECS Experimental Computing Laboratory Cincinnati OH USA

ISBN: (纸本)076951104X

The Time Warp synchronization protocol allows causality errors and then recovers from them with the assistance of a cancellation mechanism. Cancellation can cause the rollback of several other simulation objects that may trigger a cascading rollback situation where the rollback cycles back to the original simulation object. These cycles of rollback can cause the simulation to enter an unstable (or thrashing) state where little real forward simulation progress is achieved. To address this problem, knowledge of causal relations between events can be used during cancellation to avoid cascading rollbacks and to initiate early recovery operations from causality errors. In this paper we describe a logical time representation for Time Warp simulations that is used to disseminate causality information. The new timestamp representation, called Total Clocks, has two components: (i) a virtual time component, and (ii) a vector of event counters similar to Vector clocks. The virtual time component provides a one dimensional global simulation time and the vector of event counters records event processing rates by the simulation objects. This time representation allows us to disseminate causality information during event execution that can be used to allow early recovery, during cancellation. We propose a cancellation mechanism using Total Clocks that allows cascading rollbacks in Time Warp simulations that have FIFO communication channels.

关键词： Time warp simulation Clocks Computational modeling Synchronization Counting circuits Discrete event simulation Laboratories Protocols Acceleration

来源：评论

学校读者我要写书评

暂无评论

An agent-based DDM for High Level Architecture

An agent-based DDM for High Level Architecture

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： G. Tan Liang Xu F. Moradi S. Taylor School of Computing National University of Singapore Singapore Swedish Defence Research Agency Sweden Department of Info. Sys. & Computing Brunei University Uxbridge UK

ISBN: (纸本)076951104X

The Data Distribution Management (DDM) service is one of the six services provided in the Runtime Infrastructure (RTI) of High Level Architecture (HLA). Its purpose is to perform data filtering and reduce irrelevant data communicated between federates. The two DDM schemes proposed for RTI, region based and grid based DDM, are oriented to send as little irrelevant data to subscribers as possible, but only manage to filter part of this information and some irrelevant data is still being communicated. Previously (G. Tan et al., 2000), we employed intelligent agents to perform data filtering in HLA, implemented an agent based DDM in RTI (ARTI) and compared it with the other two filtering mechanisms. The paper reports on additional experiments, results and analysis using two scenarios: the AWACS sensing aircraft simulation and the air traffic control simulation scenario. Experimental results show that compared with other mechanisms, the agent based approach communicates only relevant data and minimizes network communication, and is also comparable in terms of time efficiency. Some guidelines on when the agent based scheme can be used are also given.

关键词： distributed decision making Air traffic control Analytical models Runtime Information filtering Information filters Intelligent agent Aircraft Aerospace control Guidelines

来源：评论

学校读者我要写书评

暂无评论

Schemes for utilizing efficiently disk bandwidth and buffer in video server

Schemes for utilizing efficiently disk bandwidth and buffer ...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Keunhyung Kim Seog Park South Korea

ISBN: (纸本)0769511538

A video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. For this purpose, the storage system of the video server needs a large disk bandwidth and buffer capacity. However, because the given disk bandwidth and buffer capacity are limited, technologies that utilize effectively the given disk bandwidth and buffer capacity without waste might be needed. We propose the schemes that not only support more users but also maintain the short startup latency by utilizing the disk bandwidth and buffer efficiently which also considers time constraint characteristics of the video stream. When multiple streams are served in the storage system of the multiple disk environment, the short startup latency might be induced by asynchronizing the disk head's moves. If the disk head also moves towards only one side, being based on double buffering, the limited disk bandwidth is saved owing to the reduced disk seek latency so that more streams might be served with satisfying the time constraint characteristics of the streams. The correctness of the proposed schemes is not only analyzed theoretically but also evaluated through simulations.

关键词： Bandwidth Streaming media Time factors Delay Buffer storage Network servers Educational institutions Computational modeling Analytical models Computer simulation

来源：评论

学校读者我要写书评

暂无评论

A causality based time management mechanism for federated simulation 01

A causality based time management mechanism for federated si...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Bu-Sung Lee Wentong Cai Junlan Zhou School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9780769511047

One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is Time Management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receive ordering. Temporal anomalies occurred during the execution of federation due to the heterogeneous latencies in the communication network are not handled in receive ordering. White time stamp ordering eliminates the temporal anomalies entirely, it incurs great communication latency and huge handwidth requirement. This paper presents a new time management mechanism which provides a less costly message ordering service, namely causal ordering, to federates. It does not require the specification of lookahead and allows federates that do not require stringent message ordering properties to achieve much more efficient execution. A series of experiments has been carried out to benchmark the performance of this new time management mechanism and the results show that if incurs a slight overhead compared to receive ordering mechanism but achieves significant performance improvement over time stamp ordering mechanism.

关键词： multicasting time management causal order delivery time stamp ordering direct dependency happen-before relationship distributed simulation

来源：评论

学校读者我要写书评

暂无评论

On adaptive communication in asynchronous real-time distributed systems

On adaptive communication in asynchronous real-time distribu...

引用

International Conference and workshop on Engineering of Computer-Based Systems

作者： B. Ravindran B. Zhang The Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA USA Department of Computer Science Virginia Polytechnic Institute and State University Blacksburg VA USA

ISBN: (纸本)0769510868

Presents adaptive communication heuristic algorithms for periodic tasks in asynchronous real-time distributed systems. The heuristic algorithms adapt the application to workload changes through trans-node message-level adaptation mechanisms. We present adaptive communication heuristics for IEEE 802.5 token ring networks that support the priority-driven protocol, and for FDDI networks that use the timed token protocol. The heuristic algorithms adapt periodic computations of the application to workload changes by re-prioritizing application messages and by dynamically changing token holding times at processor nodes, respectively. The objective of the heuristics is to minimize (end-to-end) missed deadline ratios of the tasks. We study the performance of the techniques through a combination of benchmarking and simulation. The performance of the heuristics is compared with an adaptive resource management algorithm that performs adaptation by dynamically replicating application processes for load sharing. The experimental results indicate that the adaptive communication strategies outperform the process replication algorithm for load patterns that cause communication latencies to grow faster than execution latencies. Moreover, we also observe that the adaptive communication algorithms perform as good as the process replication algorithm for load patterns that cause execution latencies to grow faster than communication latencies.

关键词： Real time systems Delay Heuristic algorithms Protocols Adaptive systems Token networks FDDI Computer applications Computational modeling Resource management

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings Fourteenth workshop on parallel and distributed simulation

Proceedings Fourteenth Workshop on Parallel and Distributed ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed simulation of a communication switch with bursty sources and losses

Efficient distributed simulation of a communication switch w...

引用

14th workshop on parallel and distributed simulation (PADS 2000)

作者： McGough, AS Mitrani, I Newcastle Univ Dept Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England

ISBN: (纸本)0769506771

Algorithms for simulating an ATM switch on a distributed memory multiprocessor are described. These include parallel generation of bursty arrival streams, along with the marking and deleting of lost cells due to buffer overflows. These algorithm increase the amount of computation carried out independently by each processor and reduce the communication between the processors. When the number of cells lost is relatively small, the nln time of the simulation is approximately O(N/P), where N is the total number of cells simulated and P is the number of processors. The cells are processed in intervals of fixed length;that length affects the structure and the performance of the algorithms.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

distributed, parallel simulation of multiple, deliberative agents

Distributed, parallel simulation of multiple, deliberative a...

引用

14th workshop on parallel and distributed simulation (PADS 2000)

作者： Uhrmacher, AM Gugler, K Univ Ulm Dept Comp Sci D-89069 Ulm Germany

ISBN: (纸本)0769506771

Multi-agent systems comprise multiple, deliberative agents embedded in and recreating patterns of interactions. Each agent's execution consumes considerable storage and calculation capacities. For testing multi-agent system, distributed parallel simulation techniques are required that take the dynamic pattern of composition and interaction of multi-agent systems into account. Analyzing the behavior of agents in virtual, dynamic environments necessitates relating the simulation time to the actual execution time of agents. Since the execution time of deliberative components can hardly be foretold, conservative techniques based on lookahead are nor applicable. On the other hand, optimistic techniques become very expensive if mobile agents and the creation and deletion of model components are affected by a rollback. The developed simulation layer of JAMES (a Java Based Agent Modeling Environment for simulation) implements a moderately optimistic strategy which splits simulation and external deliberation into different threads and allows simulation and deliberation to proceed concurrently by utilizing simulation events as synchronization points.

关键词： Computer simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共128页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：