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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Using quad trees for parallelizing conflict detection in a sequential simulation 01

Using quad trees for parallelizing conflict detection in a s...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Frederick Wieland David Carnes Gregory Schultz Center for Advanced Aviation Systems Development The MITRE Corporation 1820 Dolley Madison Blvd. McLean VA

ISBN: (纸本)9780769511047

This paper describes a parallel proximity detection algorithm and illustrates its application to the problem of conflict detection in an aviation simulation. The algorithm invokes a previously designed sequential function in parallel, using spatial information acquired during the traversal of a quad tree, to keep the separate invocations of the function as independent as possible. The method is generally applicable to any function (not just conflict detection) whose arguments are spatially organized. Empirical results show that a single-threaded version of the algorithm sped up the simulation by 57%, while a four-threaded parallel version extracted 30% of the remaining additional speedup. These results are even more noteworthy given that the architecture of the simulation remains intact: we only replace the invocation mechanism for one function.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hierarchical federations: an architecture for information hiding 01

Hierarchical federations: an architecture for information hi...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Wentong Cai Stephen J. Turner Boon Ping Gan School of Computer Engineering Nanyang Technological University Nanyang Avenue Singapore 639798 Gintic Institute of Manufacturing Technology 71 Nanyang Drive Singapore 638075

ISBN: (纸本)9780769511047

In a distributed simulation, simulation components of various types are executed at geographically different locations, forming a simulation federation to create a common virtual environment. Under the High Level Architecture (HLA), information that will be produced and consumed by a simulation component is defined in its object model, and how that information is produced and consumed is well encapsulated inside the simulation component's implementation. However, in the current implementation of the HLA's Runtime Infrastructure (RTI), information hiding between groups of simulation components in a simulation federation is not addressed. In this paper, we discuss how hierarchical federations architectures can be used to tackle this problem. The hierarchical federations architecture adopted in this paper differs from the existing architectures in that it is based on a hybrid approach for inter-operability between simulation federations. To demonstrate the information hiding using the architecture, a distributed semiconductor supply-chain simulation is also described in the paper.

关键词： distributed simulation semiconductor supply-chain simulation information hiding hierarchical federations

来源：评论

学校读者我要写书评

暂无评论

Synchronous relaxation for parallel Ising spin simulations 01

Synchronous relaxation for parallel Ising spin simulations

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Boris Lubachevsky Alan Weiss Bell Labs 600 Mountain Avenue Murray Hill New Jersey

ISBN: (纸本)9780769511047

A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as “relaxation” [3]; hence it is named “synchronous relaxation.” We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N/ log N. All communication delays, processing time, and busy waits are taken into account.

关键词： Metropolis algorithm conservative simulation optimistic simulation computational physics

来源：评论

学校读者我要写书评

暂无评论

Optimistic simulation of parallel message-passing applications 01

Optimistic simulation of parallel message-passing applicatio...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Thomas Phan Rajive Bagrodia The University of California at Los Angeles Computer Science Department Los Angeles CA

ISBN: (纸本)9780769511047

Optimistic techniques can improve the performance of discrete-event simulations, but one area where optimistic simulators have been unable to show performance improvement is in the simulation of parallel programs. Unfortunately parallel program simulation using direct execution is difficult: the use of direct execution implies that the memory and computation requirements of the simulator are at least as large as that of the target application, which restricts the target systems and application problem sizes that can be studied. Memory usage is especially important for optimistic simulators due to the need for periodic state-saving and rollback. In our research we addressed this problem and have implemented a simulation library running a Time-Warp-based optimistic engine that uses direct execution to simulate and predict the performance of parallel MPI programs while attaining good simulation speedup. For programs with data sets too large to be directly executed with our optimistic simulator, we reduced the memory and computational needs of these programs by utilizing a static task graph and code-slicing methodology; an approach which also exhibited good performance speedup.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lock-free scheduling of logical processes in parallel simulation 01

Lock-free scheduling of logical processes in parallel simula...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Jason Liu David M. Nicol King Tan Department of Computer Science Dartmouth College Hanover New Hampshire

ISBN: (纸本)9780769511047

With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safely advance their local simulation clocks. Studies have shown that a good scheduling algorithm should preferentially schedule processes containing events on the critical path. This paper introduces a lock-free algorithm for scheduling logical processes in conservative parallel discrete-event simulation on shred-memory multiprocessor machines. The algorithm uses fetch & add operations that help avoid inefficiencies associated with using locks. The lock-free algorithm is robust. Experiments show that, compared with the scheduling algorithm using locks, the lock-free algorithm exhibits better performance when the number of logical processes assigned to each processor is small or when the workload becomes significant. In models with large number of logical processes, our algorithm shows only modest increase in execution time due to the overhead in the algorithm for extra bookkeeping.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SIMMT-II: implementation of network simulator for IP multicast using multiple MCSs on the ATM networks

SIMMT-II: implementation of network simulator for IP multica...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Taeyoung Byun School of Computer and Electronic Engineering Gyeongju University South Korea

ISBN: (纸本)0769511538

We implemented a network simulator for performance evaluation of various IP multicast schemes over ATM networks. We also described design details of the network simulator, in which necessary software modules can be added easily. This network simulator can generate various random networks, assigns multiple multicasting servers and many group members with various distribution patterns over random networks. In addition, we can apply various routing-related algorithms to the network simulator to acquire results of performance evaluation. We show the correct behavior of the implemented simulator by evaluating the performance of several recovery schemes for an impaired multicast tree in the case where some multicast servers fail.

关键词： Asynchronous transfer mode Computational modeling Network servers Mars Virtual colonoscopy Delay Robustness Electronic mail Computer networks Computer simulation

来源：评论

学校读者我要写书评

暂无评论

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

Improving lookahead in parallel discrete event simulations o...

引用

proceedings of the fifteenth workshop on parallel and distributed simulation

作者： Ewa Deelman Rajive Bagrodia Rizos Sakellariou Vikram Adve ISI/USC UCLA Manchester University UIUC

ISBN: (纸本)9780769511047

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 previously been extended to work together for optimizing the simulation of local computational components of an application. The results shows that the availability of lookahead information improves the runtime of the simulator by factors ranging from 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 in the number of null messages required by the simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel neurochip for neural networks implementing the reactive tabu search algorithm: application case studies

A parallel neurochip for neural networks implementing the re...

引用

Euromicro workshop on parallel and distributed Processing

作者： G. Danese I. De Lotto F. Leporati A. Quaglini S. Ramat G. Tecchioili INFM sez. Pavia Pavia Italia Dip. di Informatica e Sistemistica Università di Pavia Italy Neuricam S. p. A Via S. Maria Maddalena Trento Italia

ISBN: (纸本)0769509878

In this work we present two different applications implemented on the neurocomputer Totem Nc3001 from Neuricam Inc. The goal of the experimentation is to test, on real problems, the performance of this powerful parallel unit consisting of 32 Digital Signal Processors (DSPs) and to evaluate its suitability to neural network applications. The first problem implemented is a typical classification algorithm in which the network recognises which points belong to different regions inside a 2D space. The second problem is more computationally heavy and consists of a network able to reproduce the eye movements, if properly stimulated. A comparison is reported between Matlab implementations or handwritten code run on workstations and the performance obtained from the Totem chip.

关键词： Neural networks Artificial neural networks Signal processing algorithms Computational modeling Multilayer perceptrons Digital signal processors Digital signal processing Mathematical model Circuit simulation Testing

来源：评论

学校读者我要写书评

暂无评论

Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW

Semi-asynchronous checkpointing for optimistic simulation on...

引用

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

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 being done in the direction of improving 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 networks 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 that is distinct from the CPU, namely a DMA (direct memory access) 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 has 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 that 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.

关键词： Checkpointing Design optimization Application software Discrete event simulation Protocols Software architecture Software design Workstations Hardware Engines

来源：评论

学校读者我要写书评

暂无评论

distributed motion planning for modular robots with unit-compressible modules

Distributed motion planning for modular robots with unit-com...

引用

IEEE International workshop on Intelligent Robots and Systems (IROS)

作者： Z. Butler S. Byrnes D. Rus Department of Computer Science Dartmouth College USA

The ability of self-reconfigurable robots to solve a variety of robot tasks comes in part from their use of a large number of modules. Effective use of these systems requires parallel actuation and planning, both for efficiency and independence from a central controller. This paper presents the PacMan algorithm, a technique for distributed actuation and planning. This algorithm was developed for systems with unit-compressible modules, such as the crystalline robot. We also describe some analytical properties of the PacMan planning and actuation, and discuss simulation and hardware experiments.

关键词： Motion planning Centralized control Crystallization Control systems parallel robots Legged locomotion Robotics and automation Shape control Computer science Educational institutions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：