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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

605 篇 工学
- 570 篇 计算机科学与技术...
- 352 篇 软件工程
- 77 篇 信息与通信工程
- 75 篇 控制科学与工程
- 61 篇 电气工程
- 45 篇 电子科学与技术（可...
- 10 篇 化学工程与技术
- 7 篇 力学（可授工学、理...
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 6 篇 动力工程及工程热...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 生物医学工程（可授...
- 4 篇 网络空间安全
189 篇 理学
- 146 篇 数学
- 43 篇 统计学（可授理学、...
- 41 篇 系统科学
- 19 篇 物理学
- 13 篇 化学
- 9 篇 生物学
40 篇 管理学
- 32 篇 管理科学与工程(可...
- 20 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 军事学
2 篇 医学
1 篇 农学

主题

253 篇 computational mo...
223 篇 computer simulat...
210 篇 discrete event s...
115 篇 concurrent compu...
89 篇 distributed comp...
85 篇 computer science
76 篇 parallel process...
70 篇 protocols
56 篇 analytical model...
54 篇 time warp simula...
53 篇 computer archite...
50 篇 computer network...
50 篇 large-scale syst...
48 篇 costs
43 篇 circuit simulati...
43 篇 parallel process...
40 篇 delay
39 篇 hardware
38 篇 predictive model...
37 篇 application soft...

机构

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
8 篇 ayani rassul
7 篇 p.a. wilsey
7 篇 shell ying huang
7 篇 boukerche azzedi...
7 篇 quaglia f
7 篇 richard m. fujim...

语言

1,212 篇 英文
7 篇 俄文
4 篇 中文
2 篇 其他

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

共 1225 条记录，以下是431-440 订阅

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

详细简洁

排序：

Conservative simulation using distributed-shared memory 02

Conservative simulation using distributed-shared memory

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Y. M. Teo Y. K. Ng B. S. S. Onggo National University of Singapore Singapore

ISBN: (纸本)9780769516080

This paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message communication among processors. Two benchmark programs written using our SPaDES/Java parallel simulation library are used. The first program is a linear pipeline system representing a loosely-coupled open system. The PHOLD program represents a strongly-connected closed system. Experiments are carried out using a cluster of Pentium II PCs. We used a combination of Wood Turner carrier null, flushing and demand-driven algorithms for null message synchronization. To optimize message communication, we replace SPaDES/Java inter-processor communication implemented using Java's Remote Method Invocation (RMI) with one JavaSpace. For PHOLD (16x16, 16) running on eight processors, this change reduces simulation runtime by more than half, null message overhead reduces by a further 15%, and event rate more than doubled. Based on our memory analysis methodology, the memory cost of null message synchronization for PHOLD is less than 9% of the total memory needed by the simulation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An architecture of decentralized control for multi-degrees of freedom parallel manipulator

An architecture of decentralized control for multi-degrees o...

引用

International workshop on Advanced Motion Control (AMC)

作者： T. Kageyama K. Ohnishi Department of System Design Engineering Keio University Yokohama Japan

Decentralized control is composed of more than two subsystems. Subsystems communicate each other to control the whole system. In this paper, information of mechanical constraint for a parallel manipulator is analyzed. When some joints of multi-degrees of freedom parallel manipulators are set to be passive, excessive interference force can be reduced. A case where one joint of 3-linked arms is set to be passive is treated. The influence of a passive joint to the tip of the arm is derived by the configuration and the calculated reference torque. In the active joints, the interference force information from other joints are used to compensate the effect of passive joint. Such information is also used for switching passive joints. As a result, the avoidance of singular point is realized. Taking advantage of a parallel manipulator which has redundant drive joints, fault compensation is achieved by extending the communication of subsystems. Comparison with centralized control represents the availability of the decentralized control system by simulation.

关键词： distributed control Control systems Manipulators parallel robots Interference Mechanical variables control Torque Control system synthesis Availability Orbital robotics

来源：评论

学校读者我要写书评

暂无评论

Adaptive checkpointing for time warp technique with a limited number of checkpoints

Adaptive checkpointing for time warp technique with a limite...

引用

International Conference on distributed Computing Systems workshop

作者： R. Suzuki S. Fukurnoto K. Iwasaki Graduate School of Engineering Tokyo Metropolitan University Tokyo Japan Shuto Daigaku Tokyo Hachioji Tokyo JP Graduate Sch. of Eng. Tokyo Metropolitan Univ. Japan

This paper discusses distributed checkpointing with "Time Warp techniques", a typical uncoordinated checkpointing technique that is often used in the parallel and distributed simulations. Relaxing the assumption of the previous model of Soliman et al., we show a discrete time model where the number of available checkpoints each process can hold is finite. In addition, we propose an adaptive distributed checkpointing technique, that gives an effective time arrangement of checkpoints for a recovery point distribution, and we give numerical examples.

关键词： Checkpointing Clocks Time warp simulation Analytical models distributed computing Conferences

来源：评论

学校读者我要写书评

暂无评论

Addressing blocking and scalability in critical channel traversing 02

Addressing blocking and scalability in critical channel trav...

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Rob Simmonds Cameron Kiddle Brian Unger University of Calgary Alberta Canada

ISBN: (纸本)9780769516080

This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator. The first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy *** second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.

关键词： conservative algorithms performance parallel discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

XSim: real-time analytic parallel simulations 02

XSim: real-time analytic parallel simulations

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Christopher D. Carothers Rensselaer Polytechnic Institute Troy NY

ISBN: (纸本)9780769516080

Of critical importance to any real-time system is the issue of predictability. We divide overall system predictability into two parts: algorithmic and systemic. Algorithmic predictability is concerned with ensuring that the parallel simulation engine and model from a complexity point of view are able to consistently yield results within a real-time deadline. Systemic predictability is concerned with ensuring that OS scheduling, interrupts and virtual memory overheads are consistent over a real-time period. To provide a framework for investigating systemic predictability, we define a new class of parallel simulation called Extreme simulation or XSim. An XSim is any analytic parallel simulation that is able to generate a statistically valid result by a real-time deadline. Typically, this deadline is between 10 and 100 milliseconds. XSims are expected to provide decision support to existing complex, real-time systems. As a new design and implementation methodology for realizing XSims, we embed a state-of-the-art optimistic simulator into the Linux operating system. In this operating environment, OS scheduling and interrupts are disabled. Given a 50 millisecond model completion deadline, we observe that the XSim has a systemic predictability, measure of 98% compared with only 56% for the same Time Warp system operating in user-level.

关键词： predictability real-time xsim parallel simulation time warp

来源：评论

学校读者我要写书评

暂无评论

Early cancellation: an active NIC optimization for time-warp 02

Early cancellation: an active NIC optimization for time-warp

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Ranjit Noronha Nael B. Abu-Ghazaleh State University of New York Binghamton NY

ISBN: (纸本)9780769516080

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/0 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-Warp 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.

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

来源：评论

学校读者我要写书评

暂无评论

Experiment scheduling in faster-than-real-time simulation 02

Experiment scheduling in faster-than-real-time simulation

引用

proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Dimosthenis Anagnostopoulos University of Athens Panepistimiopolis Athens Greece

ISBN: (纸本)9780769516080

Faster-than-real-time simulation (FRTS) can be used for performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables model validation through comparing simulation results with the corresponding system observations. However, experimentation proves to be rather demanding, as both delivering output results and ensuring their reliability must be accomplished within a predetermined time frame. Output analysis of system observations and model results and relevant timing issues are discussed. A method is introduced that determines whether it is possible to execute the "optimal" faster-than-real-time experiment, in which case multiple replications are scheduled for execution, or a compromise has to be made between the ability to predict for the long future and the degree of reliability achieved for predictions. FRTS experimental are also presented to support the effectiveness of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of cellular algorithms on reconfigurable hardware

Efficient implementation of cellular algorithms on reconfigu...

引用

Euromicro Conference on parallel, distributed and Network-Based Processing

作者： P. Corsonello G. Spezzano G. Staino D. Talia DIMET University of Reggio Calabria Italy ISI-CNR Rende Italy DEIS University of Calabria Italy

ISBN: (纸本)0769514448

Reconfigurable architectures represent an innovative approach to the computer system design paradigm, which tries to cope with a problem of inefficiency of conventional computing systems, due to their general purpose nature. On the other hand, cellular automata are attractive computing models due to their fine grain parallelism, simple computational structures and local communication patterns. The inherently parallel cellular automata model is well suited to be implemented on reconfigurable hardware architectures such as field programmable gate arrays (FPGA) that can provide significant speedup. This paper describes the CAREM system that provides an efficient implementation of cellular automata algorithms on FPGA systems exploiting their reconfigurable features for executing different cellular automata rules. Its application to an image processing application and a forest fire simulation are presented and discussed. Performance evaluation and comparison with different implementations of cellular automata are presented.

关键词： Hardware Field programmable gate arrays Automata Logic devices Reconfigurable logic Application software Computer architecture Programmable logic arrays Concurrent computing parallel processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：