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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,263 篇 英文
7 篇 俄文
4 篇 中文
2 篇 其他

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

共 1276 条记录，以下是421-430 订阅

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

详细简洁

排序：

Early cancellation: An active NIC optimization for Time-Warp 16

Early cancellation: An active NIC optimization for Time-Warp

引用

16th workshop on parallel and distributed simulation

作者： Noronha, R Abu-Ghazaleh, NB SUNY Binghamton Dept Comp Sci Binghamton NY 13902 USA

ISBN: (纸本)0769516084

parallel Discrete Event simulation (PDES) on a cluster of workstations is a fine grained application where the communication performance can dictate the effiency of the simulation. The high performance Local/System Area Networks used in high-end clusters are capable of delivering data with high bandwidth and low latency. Unfortunately, the communication rate far out-paces the capabilities of workstation nodes to handle it (I/O bus, memory bus, CPU resources). For this reason, many vendors are offering a programmable processor on the NIC to allow application specific optimization of the communication path. This invites a new implementation model for distributed applications where: (i) application specific communication optimizations can be implemented on the NIC;(ii) portions of the application that are most heavily communicating can be migrated to the NIC;(iii) some messages can be filtered out at the NIC without burdening the primary processor resources;and (iv) critical events are detected and handled early. The aim of our research is to investigate the utility of this model for PDES and to gain initial experiences in the implementation challenges and potential performance improvement. In this paper, we present our experiences with Early Cancellation - an optimization for Time- Varp that cancels messages in place upon early discovery of a rollback. We believe that there is a large scope for additional optimizations using this model.

关键词： clusters global virtual time programmable NIC Time Warp event simulation

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of composite events 22

Parallel implementation of composite events

引用

22nd International Conference on distributed Computing Systems

作者： Shmueli, M Etzion, O Technion Israel Inst Technol IL-32000 Haifa Israel

ISBN: (纸本)0769515886

Composite events are required for many applications that require obtaining events from various sources, correlating them, and activating appropriate actions. One of the major issues in composite event system is scalability. This paper reports on a research that follows the situation concept of the Amit system, and proposes a parallel execution model for the event composition. The paper describes the model and its difficulties, and shows its usefulness using simulation results.

关键词： active technology parallel processing scalability

来源：评论

学校读者我要写书评

暂无评论

An implementation of a distributed algorithm for detection of local knots and cycles in directed graphs based on the CSP model and Java 6

An implementation of a distributed algorithm for detection o...

引用

6th IEEE International workshop on distributed simulation and Real-Time Applications (DS-RT 2002)

作者： de Souza, GP Pfitscher, GH Univ Brasilia Dept Comp Sci BR-70910900 Brasilia DF Brazil

ISBN: (纸本)0769518532

Cycles and knots in directed graphs are problems that can be associated with deadlocks in database and communication systems. Many algorithms to detect cycles and knots in directed graphs were proposed. Boukerche and Tropper have proposed a distributed algorithm that solve the problem in a efficient away. Their algorithm has a message complexity of 2m vs. (at least) 4m for the Chandy and Misra algorithm, where in is the number of links in the graph, and requires 0 (n log n) bits of memory, where n is the number of nodes. We have implemented Boukerche and Tropper's algorithm according to the construction of processes of the CSP model. Our implementation was done. using JCSP, an implementation of CSP for Java, and the results are presented.

关键词： Algorithm design and analysis Communication systems Computer aided software engineering Database systems distributed algorithms Fault tolerant systems Frequency IP networks Java System recovery

来源：评论

学校读者我要写书评

暂无评论

The design of the distributed ABELS brokering system

The design of the distributed ABELS brokering system

引用

6th IEEE International workshop on distributed simulation and Real-Time Applications (DS-RT 2002)

作者： Wilson, LF Xie, B Kimpel, JM Mills-Tettey, GA Johnston, G Dartmouth Coll Thayer Sch Engn Hanover NH 03755 USA

ISBN: (纸本)0769518532

Many simulations and other applications need to interact seamlessly with distributed data resources. The Agent-Based Environment for Linking simulations (ABELS) allows the formation of a dynamic "data and simulation cloud" that links a heterogeneous collection of networked resources. ABELS consists of three major types of components: user entities that serve as data producers and/or consumers, a brokering system for organizing and linking the various participants, and generic local agents that connect simulations and data resources to the cloud of participants. This paper presents the design of the distributed brokering system, which is implemented using Java and Sun Microsystems' Jini technology.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Automatic construction of hierarchical federations architecture 6

Automatic construction of hierarchical federations architect...

引用

6th IEEE International workshop on distributed simulation and Real-Time Applications (DS-RT 2002)

作者： Cai, WT Li, GG Turner, SJ Lee, BS Liu, L Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)0769518532

The High Level Architecture allows simulation components Of various hypes to be joined together into a federation to create a common virtual environment. However with the increased complexity of simulations, not all user requirements can be satisfied by a flat federation. The requirement of selective information hiding naturally suggests a Hierarchical Federations Architecture (HFA) where federations are organized into hierarchies so that a federation appears as a federate in an upper level federation. In order to provide reusability and interoperability at the federation level, a federation should be able to participate in different super-federations without requiring code modification. In this paper we present an approach to automatically construct the HFA. We describe the information that must be provided by the participating user federations and how this is used to construct the Universal Object Model (UOM) used by the super-FOMs (the FOMs of super-federations). We show how the structure for selective information hiding is generated from the user information and how gateway federates are automatically constructed to support super-FOM independence.

关键词： distributed simulations HLA federation community hierarchical federations HLA bridge (Proxy federate or gateway federate) reusability interoperability and selective information hiding

来源：评论

学校读者我要写书评

暂无评论

A simulation environment for ad hoc networks using sector subdivision

A simulation environment for ad hoc networks using sector su...

引用

10th Euromicro workshop on parallel, distributed and Network-based Processing (PDP 2002)

作者： Volbert, K Univ Paderborn Heinz Nixdorf Inst Paderborn Germany

ISBN: (纸本)0769514448

In this paper a not, model for communication in MANETs will be presented. Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different directions (sector subdivision) and to adjust the transmission power in each sector separately. A simulation environment (simulation Environment for Ad Hoc Networks, SAHNE) will be presented that allows simulation of communication strategies in MANETs that use sector subdivision, and simulation results will be shown where communication paths are selected via hop-minimization or geometric spanner properties. SAHNE is based on C++ and common libraries, which ensures that it can be used on many different platforms. The experiments show the influence of different parameters in realistic scenarios, and using geometric routing seemed to be better than using hop-minimization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Updateable simulation of communication networks 16

Updateable simulation of communication networks

引用

16th workshop on parallel and distributed simulation, PADS 2002

作者： Ferenci, S.L. Fujimoto, R.M. Ammar, M.H. Perumalla, K. Riley, George F. College of Computing Georgia Institute of Technology AtlantaGA United States Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA United States

ISBN: (纸本)0769516084

A technique called updateable simulations is proposed to reduce the time to complete multiple executions of a discrete event simulation program. This technique updates the results of a prior simulation run rather than re-execute the entire simulation to take into account variations in the underlying simulation model. A framework for creating updateable simulations is presented. This framework is applied to the problem of simulating a set of cascaded ATM multiplexers and a network of ATM switches. Performance measurements of sequential and parallel implementations of these simulations on a shared memory multiprocessor are presented, demonstrating that updateable simulations can yield substantial reductions in the time required to complete multiple simulation runs if there is much similarity among the runs. © 2002 IEEE.

关键词： event composition event reuse incremental simulation shared computation

来源：评论

学校读者我要写书评

暂无评论

Genesis: A system for large-scale parallel network simulation 16

Genesis: A system for large-scale parallel network simulatio...

引用

16th workshop on parallel and distributed simulation, PADS 2002

作者： Szymanski, B.K. Saifee, A. Sastry, A. Liu, Yu Madnani, K. Department of Computer Science RPI TroyNY United States

ISBN: (纸本)0769516084

We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and concurrently with the others over the same simulation time interval. At the end of each interval, packet delays and drop rates for each inter-domain flow are exchanged between domain simulators. The simulators iterate over the same time interval until the exchanged information converges to a constant value within the prescribed precision. After convergence, all the domain simulators progress to the next time interval. This approach allows the parallelization with infrequent synchronization. The biggest challenge for this method is to ensure iteration convergence for protocols, such as TCP, that adjust source rate to the current network conditions. The main contribution of this paper is to demonstrate that by judicious design of the domain processing and information exchange, the proposed approach efficiently parallelizes network simulation with TCP flows. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A scalable architecture for supporting interactive games on the internet 16

A scalable architecture for supporting interactive games on ...

引用

16th workshop on parallel and distributed simulation, PADS 2002

作者： Cai, Wentong Xavier, P. Turner, S.J. Lee, Bu-Sung Parallel and Distributed Processing Laboratory School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)0769516084

This paper presents a scalable architecture for supporting large-scale interactive Internet games. In order to support a large number of participants and to divide the workload, the virtual world is divided into partitions. Each partition is then assigned to a server. A client (i.e., a player or a participant) will join a server according to the position of the avatar it controls. Compared to a centralized architecture, this distributed client-server architecture is more scalable. In addition, compared to a fully distributed, peer-to-peer architecture, it also provides a means for detecting cheating in distributed games. Since interactions and accounting information must be forwarded directly to one of the servers for qualification and verification, cheating amongst distributed players of the game will be minimized. To support secured communication for interactions and accounting information as well as to speedup periodic update messages (e.g., position updates), a hybrid communication scheme using both TCP and IP multicast is used between clients and the associated server. The communication among servers is enabled by the Run-Time Infrastructure (RTI) services. The High Level Architecture (HLA) Data Distribution Management (DDM) is employed to limit the amount of communication between the servers. In addition, the Ownership Management (OM) is also employed to implement the need for transferring the avatars between servers. In this paper, the design detail of the architecture will be presented. An experimental interactive Internet game realized using the architecture will be also described in the paper. © 2002 IEEE.

关键词： distributed Client-Server Architecture High Level Architecture (HLA) Large-scale Interactiv eGames Ownership and Data Distribution Management Run-Time Infrastructure (RTI) Scalability

来源：评论

学校读者我要写书评

暂无评论

Site-based mapping for parallel proxy servers with fewer TCP connections 22

Site-based mapping for parallel proxy servers with fewer TCP...

引用

22nd International Conference on distributed Computing Systems

作者： Wong, KY Law, KF Yeung, KH City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)0769515886

There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly, URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. In this paper, we propose a site-based mapping scheme that forwards all requests targeting on the same web site to the same proxy server. The scheme then allows the proxy to use a single persistent connection to serve many client requests. The major advantage of the scheme is the reduction in the number of connection establish in en is. This reduction can save network bandwidth and reduce the user-experienced latency. simulation results show that the proposed site-based scheme reduces 40%-70% of the connection setups and teardowns when compared to a traditional URL-based mapping scheme.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共128页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：