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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A scaled version of the elastic time algorithm

A scaled version of the elastic time algorithm

引用

workshop on Principles of Advanced and distributed simulation (PADS)

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

ISBN: (纸本)076951104X

Recently a new class of synchronization algorithms for parallel discrete event simulation has been proposed, namely the near perfect state information algorithms, which are based on a motion of error potential to control the optimism of event execution. An algorithm of this class, called elastic time algorithms (ETA), has been instantiated. In this algorithm, the error potential is computed using temporal information (next event timestamp, simulation clocks etc.) and is then translated into event execution delay based on a constant factor. In this paper we present a scaled version of ETA (SETA), in which the error potential is translated into event execution delay based on both a constant factor and art additional scaling factor determined dynamically as a function of the event granularity. We have implemented versions of ETA and SETA for a cluster of PCs connected by a Myrinet switch and we have established in an empirical study that SETA outperforms ETA if there is difference in the granularity of different event types.

关键词： Time of arrival estimation Discrete event simulation Delay Switches Synchronization Error correction Motion control Computational modeling Clocks Art

来源：评论

学校读者我要写书评

暂无评论

Influence Of Energy Transport Related Effects On NPN BJT Device Performance And ECL Gate Delay Analyzed By 2D parallel Mixed Level Device/circuit simulation

Influence Of Energy Transport Related Effects On NPN BJT Dev...

引用

International workshop on VLSI Process and Device Modeling, VPAD

作者： M. Stecher B. Meinerzhagen I. Bork J.M.J. Krucken P. Maas W.L. Engl Institute for Theoretische Electrotechnik RWTH Aachen University Aachen Germany

来源：评论

学校读者我要写书评

暂无评论

A distributed numerical/simulative algorithm for the analysis of large continuous time Markov chains 97

A distributed numerical/simulative algorithm for the analysi...

引用

proceedings of the eleventh workshop on parallel and distributed simulation

作者： Peter Buchholz Informatik IV Universität Dortmund D-44221 Dortmund Germany

ISBN: (纸本)9780818679650

A distributed algorithm is introduced for the analysis of large continuous time Markov chains (CTMCs) by combining in some sense numerical solution techniques and simulation. CTMCs are described as a set of processes communicating via message passing. The state of a process is described by a probability distribution over a set of reachable states rather than by a single state. simulation is used to determine event times and messages types to be exchanged, whereas transitions are realized by vector matrix products as in iterative numerical analysis techniques. In this way, the state space explosion of numerical analysis is avoided, but it is still possible to determine more detailed results than with simulation. parallelization of the algorithm is realized applying a conservative synchronization scheme, which exploits the possibility of precomputing event times as already proposed for parallel simulation of CTMCs. In contrast to a pure simulation approach, the amount of computation is increased, whereas the amount of communication keeps constant. Hence it is possible to achieve even on a workstation cluster a significant speedup.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrated scheduling of tasks and messages in distributed real-time systems

Integrated scheduling of tasks and messages in distributed r...

引用

workshop on parallel and distributed Real-Time Systems

作者： G. Manimaran M. Shashidhar A. Manikutty C.S.R. Murthy Indian Institute of Technology Madras Chennai Tamil Nadu IN Department of Computer Science and Engineering Indian Institute of Technology Chennai India

The scheduling of tasks in distributed real-time systems has attracted many researchers in the recent past. The distributed real-time system considered here consists of uniprocessor or multiprocessor nodes connected through a multihop network. Scheduling in such a system involves scheduling of dynamically arriving tasks within a node (local scheduling) and migration of tasks across the network (global scheduling) if it is not possible to schedule them locally. Most of the existing schemes on distributed real-time task scheduling ignore the underlying message scheduling required for global scheduling of tasks. These schemes consider the load on the processors at a node as the basis to migrate tasks from a heavily loaded node (sender) to a lightly loaded node (receiver). We believe that the identification of a receiver node should be based not only on the load on its processors, but also on the availability of a lightly loaded path from the sender to that receiver. In this paper we present an integrated framework for distributed real-time dynamic task scheduling (i) by proposing algorithms for transfer location, and information policies which take into account the states of both the processors and the links, and (ii) by proposing interactions among these policies and schedulers so that the guarantee ratio (ratio of number of tasks guaranteed to the number of tasks arrived) is improved as compared to algorithms where only local scheduling is done. For local scheduling, we use a variation of myopic algorithm. The effectiveness of the proposed framework has been evaluated through simulation.

关键词： Real time systems Processor scheduling Dynamic scheduling Spread spectrum communication Scheduling algorithm Computer science Telecommunication network reliability Message passing Delay

来源：评论

学校读者我要写书评

暂无评论

Stone axes and warhammers: a decade of distributed simulation in aviation research 02

Stone axes and warhammers: a decade of distributed simulatio...

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Frank M. Sogandares Center for Advanced Aviation System Development (CAASD) 7515 Colshire Drive McLean VA 22102-7508 Mailstop N420

ISBN: (纸本)9780769516080

Ten years ago, MITRE/CAASD built a realtime, Human-In-The-Loop (HITL) research laboratory. The focus of this lab is integration and human factors research for the air traffic control and aviation communities. The last ten years have been illuminating in terms of the evolution of laboratory capabilities, infrastructure, and corporate culture. This paper will describe the laboratory environment, its history and vision, and will also provide some examples of how distributed simulation technology has been applied, and continues to evolve, in a real-world HITL simulation environment serving a broad range of research needs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Critical causality in distributed virtual environments 02

Critical causality in distributed virtual environments

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Suiping Zhou Wentong Cai Stephen J. Turner Francis B. S. Lee Nanyang Technological University Singapore

ISBN: (纸本)9780769516080

We investigate the causality issue in distributed virtual environments. Causality has been widely studied in parallel and distributed systems. However, most of the work in causality detection and preservation are from a logical time system point of view, which are not generally suitable for distributed virtual environments due to the high cost of the proposed schemes to preserve causality. In this paper, first, critical causal order is defined, which is a relaxation of the "happened before"-based causal relation. Then, causal receive order delivery is proposed with the advantage that both the real-time property of distributed virtual environments and the critical causal order relationship among events are preserved. Finally, an algorithm to achieve causal receive order delivery is given. Our algorithm is easy to implement, and it results in little extra traffic on the network.

关键词： distributed simulation virtual environments causality

来源：评论

学校读者我要写书评

暂无评论

Reducing the size of routing tables for large-scale network simulation 03

Reducing the size of routing tables for large-scale network ...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： A. Hiromori H. Yamaguchi K. Yasumoto T. Higashino K. Taniguchi Graduate School of Engineering Science Osaka University Japan Graduate School of Information Science and Technology Osaka University Japan Graduate School of Information Science Nara Institute of Science and Technology Japan

ISBN: (纸本)9780769519708

In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted. Especially, routing tables, which indicate the directions to forward packets, are considered to consume memory space. A simple general routing table requires O(N/sup 2/) space where N is the number of nodes. An algorithmic routing approach recently proposed by Heung et al. only requires O(N) space for representing routing tables, however this can be applied in the case that all the routes between two nodes are contained in a spanning tree (i.e. very limited routing strategies are allowed). We propose a new method to reduce the size of routing tables under any routing strategy. Given a general simple routing table, our method represents a routing table as the combination of an algorithmic routing based table and a general routing table, by translating a part of the given general routing table into the algorithmic routing based one. In order to reduce the size of the routing table, we find a (near-optimal)algorithmic routing based table that represents most part of the given routing table. Our experimental results have shown that our method could reduce the size of the table to 10 % of the given routing table in hierarchical networks.

关键词： Large-scale systems Computational modeling Computer simulation Computer networks Information science Space technology Concurrent computing Routing protocols Network servers Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

Improving lookahead in parallel discrete event simulations o...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： E. Deelman R. Bargodia R. Sakellariou V. Adve ISI/USC UCLA USA Manchester University UK UIUC USA

ISBN: (纸本)076951104X

This paper addresses the issue of efficient and accurate performance prediction of large-scale message-passing applications on high performance architectures using simulation. Such simulators are often based on parallel discrete event simulation, typically using the conservative protocol to synchronize the simulation threads. The paper considers how a compiler can be used to automatically extract information about the lookahead present in the application and how this can be used to improve the performance of the null protocol used for synchronization. These techniques are implemented in the MPI-Sim simulator and dHPF compiler which had previous been extended to work together for optimizing the simulation of local computational components of an application. The results show that the availability of lookahead ranging improves the runtime of the simulator by factors ranging front 9% up to two orders of magnitude, with 30-60% improvements being typical for the real-world codes. The experiments also show that these improvements are directly correlated with reductions by the number of null messages required by the simulations.

关键词： Discrete event simulation Computational modeling Protocols Large-scale systems Predictive models Yarn Data mining Optimizing compilers Availability Runtime

来源：评论

学校读者我要写书评

暂无评论

A debugger for computational grid applications

A debugger for computational grid applications

引用

Heterogeneous Computing workshop

作者： R. Hood G. Jost MRJ Technology Solutions-Numerical Aerospace Simulation Division NASA Ames Research Center

The Portable parallel/distributed Debugger project at the NASA Ames Research Center has built a debugger for applications running on heterogeneous computational grids. It employs a client-server architecture to simplify the implementation, and its user interface has been designed to provide process control and state examination functions on computations with a large number of processes. The debugger can find processes participating in distributed computations even when those processes were not created under debugger control. In addition to working in a computational grid environment, these techniques also work on other distributed memory jobs, such as those initiated by "mpirun".

关键词： Computer applications Grid computing distributed computing NASA Concurrent computing Portable computers Computer architecture User interfaces Process design Process control

来源：评论

学校读者我要写书评

暂无评论

The effect of synchronization requirements on the performance of distributed simulations 93

The effect of synchronization requirements on the performanc...

引用

proceedings of the seventh workshop on parallel and distributed simulation

作者： Murali S. Shanker B. Eddy Patuwo

ISBN: (纸本)9781565550551

Recent experiments have shown that conservative methods can achieve good performance by exploiting the characteristics of the system being simulated. In this paper we focus on the interrelationship between run time and synchronization requirements of a distributed simulation. A metric that considers the effect of lookahead and the physical rate of transmission of messages, and an arrival approximation that models the effect of synchronization requirements on the run time are developed. It is shown that even when good lookahead is exploited in the system, poor run-time performance is achieved if an inefficient mapping of LPs to processors is used.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 101 102 103 104 105 106 107 108 109 110 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：