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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

661 篇 工学
- 620 篇 计算机科学与技术...
- 359 篇 软件工程
- 84 篇 信息与通信工程
- 79 篇 控制科学与工程
- 72 篇 电气工程
- 47 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 力学（可授工学、理...
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 7 篇 土木工程
- 6 篇 仪器科学与技术
- 6 篇 动力工程及工程热...
- 6 篇 建筑学
- 6 篇 生物医学工程（可授...
- 6 篇 生物工程
- 5 篇 网络空间安全
- 4 篇 交通运输工程
192 篇 理学
- 145 篇 数学
- 43 篇 系统科学
- 40 篇 统计学（可授理学、...
- 20 篇 物理学
- 13 篇 化学
- 10 篇 生物学
41 篇 管理学
- 35 篇 管理科学与工程(可...
- 23 篇 工商管理
- 8 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
8 篇 教育学
- 8 篇 教育学
4 篇 法学
- 4 篇 社会学
4 篇 医学
4 篇 军事学
1 篇 农学

主题

279 篇 computational mo...
238 篇 computer simulat...
220 篇 discrete event s...
135 篇 concurrent compu...
106 篇 distributed comp...
94 篇 computer science
85 篇 parallel process...
74 篇 protocols
67 篇 computer archite...
62 篇 analytical model...
62 篇 computer network...
57 篇 costs
56 篇 large-scale syst...
54 篇 application soft...
54 篇 time warp simula...
48 篇 hardware
46 篇 delay
43 篇 parallel process...
42 篇 predictive model...
41 篇 circuit simulati...

机构

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...
7 篇 univ roma la sap...
7 篇 computer science...
6 篇 coll of william ...
6 篇 school of comput...
6 篇 department of co...
6 篇 georgia inst of ...
6 篇 georgia institut...
5 篇 gintic institute...
5 篇 rensselaer polyt...
5 篇 school of applie...
4 篇 mitre corporatio...
4 篇 georgia inst of ...
4 篇 department of el...

作者

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

语言

1,346 篇 英文
7 篇 俄文
5 篇 中文
2 篇 其他

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

共 1360 条记录，以下是381-390 订阅

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

详细简洁

排序：

CCL v3.0: multiprogrammed semi-asynchronous checkpoints 03

CCL v3.0: multiprogrammed semi-asynchronous checkpoints

引用

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: (纸本)9780769519708

CCL (Checkpointing and Communication Library) is a recently developed software in support of optimistic parallel simulation on myrinet based clusters. Beyond classical low latency message delivery functionalities, this library implements CPU offloaded, semiasynchronous checkpointing functionalities based on data transfer capabilities provided by a programmable DMA engine on board myrinet network cards. The latest version of CCL (v2.4), designed for M2M-PCI32C myrinet cards, only supports monoprogrammed semiasynchronous checkpoints. This forces resynchronization between CPU and DMA activities each time a new checkpoint request must be issued at the simulation application level while the last issued one is still being carried out by the DMA engine. We present CCL v3.0 that, exploiting hardware features of more advanced M3M-PCI64C myrinet cards, supports multiprogrammed semiasynchronous checkpoints. The multiprogrammed approach allows higher degree of concurrency between checkpointing and other simulation specific operations carried out by the CPU, with obvious benefits on performance. We also report the results of the evaluation of those benefits for the case of a personal communication system simulation application.

关键词： Checkpointing Software libraries Delay Hardware Engines Discrete event simulation Costs Reduced instruction set computing Remuneration Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Hybrid packet/fluid flow network simulation 03

Hybrid packet/fluid flow network simulation

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： C. Kiddle R. Simmonds C. Williamson B. Unger Department of Computer Science University of Calgary Calgary AB Canada

ISBN: (纸本)9780769519708

Packet level discrete event network simulators use an event to model the movement of each packet in the network. This results in accurate models, but requires that many events are executed to simulate large, high bandwidth networks. Fluid-based network simulators abstract the model to consider only changes in rates of traffic flows. This can result in large performance advantages, though information about the individual packets is lost making this approach inappropriate for many simulation and emulation studies. We present a hybrid model in which packet flows and fluid flows coexist and interact. This enables studies to be performed with background traffic modelled using fluid flows and foreground traffic modelled at the packet level. Results presented show up to 20 times speedup using this technique. Accuracy is within 4% for latency and 15% for jitter in many cases.

关键词： Fluid flow Telecommunication traffic Traffic control Computational modeling Discrete event simulation Emulation Bandwidth Costs Protocols Computer science

来源：评论

学校读者我要写书评

暂无评论

Importance of communication influences on a highly collaborative task 03

Importance of communication influences on a highly collabora...

引用

International workshop/Symposium on distributed simulation and Real-Time Applications (DS-RT)

作者： O. Otto D. Roberts Department of Computer Science University of Reading UK

ISBN: (纸本)9780769520360

Social interaction is a key driving force behind any team activity. Real time closely coupled interaction, where we quickly see the effect of our actions on others, is an important feature of social interaction. For example, smiling and returning a smile, shaking hands and passing a gift or business card are some of the most important interactions in the real world. Collaborative virtual environments (CVE) offer the potential for social interaction between geographically distributed groups. Closely coupled interaction is, however, very difficult in present CVE systems. This is because this medium lags behind real world communication in terms of representation, consistency and responsiveness. This paper takes a psychological perspective, describing how the primary forms of human communication in the real world map to those in the virtual. We discuss how each form of communication relates to the feeling of co-presence, giving real examples of behaviour observed in an example application, the virtual gazebo. We present detailed results from user evaluation, focusing on the perceived importance of these influences on collaboration.

关键词： Collaboration Telephony Computer science Virtual reality Computational modeling Computer simulation Application software Speech Tracking Psychology

来源：评论

学校读者我要写书评

暂无评论

A novel forwarding paradigm for position-based routing (with implicit addressing) 18

A novel forwarding paradigm for position-based routing (with...

引用

2003 18th IEEE Annual workshop on Computer Communications, CCW 2003

作者： Füßler, H. Widmer, J. Mauve, M. Hartenstein, H. Lehrstuhl für Praktische Informatik IV Mannheim Univ. Germany Switzerland University of Düsseldorf Germany NEC Network Labs. Europe Heidelberg Germany

ISBN: (纸本)0780382390

Existing position-based unicast routing algorithms, which forward packets in the geographic direction of the destination, require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases. We describe a mechanism to perform position-based unicast forwarding without the help of beacons. In our contention-based forwarding (CBF) scheme, the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. Since the basic scheme can lead to packet duplication, we describe alternative ways of suppressing those. In addition to that, we compare the CBF schemes and standard greedy forwarding by means of simulation with ns-2. © 2003 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Enabling large-scale multicast simulation by reducing memory requirements 03

Enabling large-scale multicast simulation by reducing memory...

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： Donghua Xu G.F. Riley M.H. Ammar R. Fujimoto Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta GA USA Georgia Institute of Technology School of ECE College of Engineering Atlanta GA USA

ISBN: (纸本)9780769519708

The simulation of large-scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inherently large amount of state necessary to simulate message routing and because of design oversights in the multicast portion of existing simulators. We describe three approaches to substantially reduce the memory required by multicast simulations: 1) We introduce a novel technique called "negative forwarding table" to compress multicast routing state. 2) We aggregate the routing state objects from one replicator per router per group per source to one replicator per router. 3) We employ the NIx-Vector technique to replace the original unicast IP routing table. We implemented these techniques in the ns2 simulator to demonstrate their effectiveness. Our experiments show that these techniques enable packet level multicast simulations on a scale that was previously unachievable on modern workstations using ns2.

关键词： Large-scale systems Computational modeling Computer simulation Routing Computer networks Educational institutions Unicast Bandwidth Scalability Design engineering

来源：评论

学校读者我要写书评

暂无评论

Resource co-allocation for parallel tasks in computational grids

Resource co-allocation for parallel tasks in computational g...

引用

International workshop on Challenges of Large Applications in distributed Environments

作者： Lizhe Wang Wentong Cai Bu-Sung Lee Simon See Wei Jie School of Computer Engineering Nanyang Technological University Singapore Sun Microsystems Inc. Singapore Institute of High Performance Computing Singapore

ISBN: (纸本)0769519849

Tasks running in computational Grids may require multiple types of resources simultaneously. Thus, co-allocation of multiple types of resources is needed when scheduling tasks. Traditional list scheduling heuristics cannot address the problem of resource co-allocation in computational Grids. This paper presents models for computational Grids and parallel tasks running in computational Grids. Based on these models, a parallel task scheduling algorithm for resource co-allocation in computational Grids is proposed. The algorithm identifies the critical resource of parallel tasks and tries to schedule a task as early as possible when all the resources required by the task are available. simulation results show that the algorithm can gain performance improvement, especially in the resource competitive computational Grid.

关键词： Concurrent computing Grid computing Processor scheduling Scheduling algorithm Computational modeling High performance computing distributed computing Sun Performance gain Resource management

来源：评论

学校读者我要写书评

暂无评论

Large-scale TCP models using optimistic parallel simulation 03

Large-scale TCP models using optimistic parallel simulation

引用

workshop on Principles of Advanced and distributed simulation (PADS)

作者： G. Yaun C.D. Carothers Shivkumar Kalyanaraman Department of Computer Science Rensselaer Polytechnic Institute Troy NY USA Department of Electrical and Computer Systems Engineering Rensselaer Polytechnic Institute Troy NY USA

ISBN: (纸本)9780769519708

Internet data traffic is doubling each year, yet bandwidth does not appear to be growing as fast as expected and thus short falls in available bandwidth, particularly at the "last mile" may result. To address these bandwidth allocation and congestion problems, researchers are proposing new overlay networks that provide a high quality of service and a near lossless guarantee. However, the central question raised by these new services is what impact will they have in the large? To address these and other network engineering research questions, high performance simulation tools are required. However, to date, optimistic techniques have been viewed as operating outside of the performance envelope for Internet protocols, such as TCP, OSPF and BGP. We dispel those views and demonstrate that optimistic protocols are able to efficiently simulate large scale TCP scenarios for realistic, network topologies using a single Hyper-Threaded computing system costing less than $7000 USD. For our real world topology, we use the core AT&T US network. Our optimistic simulator yields extremely high efficiency and many of our performance runs produce zero rollbacks. Our compact modelling framework reduces the amount of memory required per TCP connection and thus our memory overhead per connection for one of our largest experimental network topologies was 2.6 KB. That value was comprised of all events used to model TCP packets, TCP connection state and routing information.

关键词： Large-scale systems Network topology Internet Bandwidth Protocols Computational modeling Telecommunication traffic Traffic control Channel allocation Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Time Warp Cancellation Optimisations on High Latency Networks 03

Time Warp Cancellation Optimisations on High Latency Network...

引用

proceedings of the seventh IEEE International Symposium on distributed simulation and Real-Time Applications

作者： K. A. Iskra G. D. van Albada P. M. A. Sloot

ISBN: (纸本)9780769520360

We investigate the performance of the Time Warp kernel APSIS when running on various communication layers, in particular on a wide-area Grid. Several cancellation strategies are tried, among them the lazy cancellation and a little known bulk anti-messages optimisation. Our experiments with an Ising spin simulation indicate that the slowdown caused by high latency networks, while ***, is not catastrophic, and that it can be significantly reduced using the lazy cancellation. Experiments suggest that further improvements can be expected if a more elaborate communication infrastructure is put in place.

关键词： lazy cancellation high latency networks bulk anti-messages Time Warp parallel discrete event simulation Grid

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel downloading for large file distribution

Analysis of parallel downloading for large file distribution

引用

IEEE workshop on Future Trends of distributed Computing Systems

作者： S.G.M. Koo C. Rosenberg Dongyan Xu School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Science Purdue University West Lafayette IN USA

Recently, the scheme of parallel downloading (PD) has been adopted by a number of Internet file downloading applications. With the wide deployment of content distribution networks and peer-to-peer networks, PD is expected to be more commonly used for file distribution. There have been experiments showing that PD results in higher aggregated downloading throughput and therefore shorter downloading time experienced by clients. However, these experimental studies focused on the performance experienced by a particular user and did not consider the impact of PD on the network when it is largely deployed. In this paper we present our efforts toward an in-depth understanding of large-scale deployment of PD through simulation and analysis. Our results suggest that while PD may achieve a shorter downloading time, its impact on the network and server is significant. Our analysis is also used for network dimensioning and content distribution service provisioning. We show that with proper admission control and dimensioning, single-server downloading can perform just as well as PD, without the complexity and overhead incurred by PD.

关键词： Network servers Analytical models Peer to peer computing Intelligent networks Throughput Tornadoes Concurrent computing Computer science Internet Application software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共136页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：