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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

575 篇 工学
- 540 篇 计算机科学与技术...
- 343 篇 软件工程
- 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 篇 中文
1 篇 其他

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

共 1174 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

A static partitioning and mapping algorithm for conservative parallel simulations 94

A static partitioning and mapping algorithm for conservative...

引用

proceedings of the eighth workshop on parallel and distributed simulation

作者： Azzedine Boukerche Carl Tropper School of Computer Science McGill University Montreal Canada

ISBN: (纸本)9781565550278

In this paper, we consider the problem of partitioning a conservative parallel simulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithm, its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on iPSC/860 hypercube. The results obtained are compared with a random partitioning. They show that a partitioning which makes use of our simulated annealing algorithm results in a reduction of 25-35% of the running time of the simulations when compared to the running time of a random partition of the model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The use of the national information infrastructure and high performance computers in industry

The use of the national information infrastructure and high ...

引用

International Conference on Massively parallel Processing Using Optical Interconnections

作者： G.C. Fox W. Furmanski Northeast Parallel Architectures Center Syracuse University Syracuse NY USA

We divide potential NII (National Information Infrastructure) services into five broad areas: Collaboration and televirtuality; InfoVISiON (Information, Video, Imagery, and simulation on Demand), and digital libraries; commerce; metacomputing; WebTop productivity services. The latter denotes the broad suite of tools we expect to be offered on the Web in a general environment we term WebWindous. We review current and future World Wide Web technologies, which could underlie these services. In particular we suggest an integration framework WebWork for high performance (parallel and distributed) computing and the NII. We point out that pervasive WebWork and WebWindows technologies will enable, facilitate and substantially accelerate such complex software processes on the NII. We briefly analyze seven broad application areas: society; business enterprises; health care; defense command and control, and crisis management; education; collaboratory; manufacturing. We contrast their use of NII services with a more detailed examination of the manufacture of complex systems, such as aircraft and automobiles. This application stresses the NII but there is a remarkable opportunity to develop new manufacturing practices that offer cost savings and reduced time to market.

关键词： Automobile manufacture Collaboration Video on demand Software libraries Business Metacomputing Productivity Web sites Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on distributed Computing Systems workshop

作者： K.Y. Wong K.F. Law K.H. Yeung Department of Electrical Engineering City University of Engineering Hong Kong China

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. 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 establishments. 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.

关键词： distributed computing Conferences

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing cell-size in grid-based DDM 00

Optimizing cell-size in grid-based DDM

引用

proceedings of the fourteenth workshop on parallel and distributed simulation

作者： Rassul Ayani Farshad Moradi Gary Tan School of Computing National University of Singapore Singapore 119260

ISBN: (纸本)9780769506678

In a large-scale distributed simulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the distributed Interactive simulation (DIS) standards is not suitable for large scale distributed *** the High Level Architecture (HLA) paradigm, the Runtime Infrastructure (RTI) provides a set of services, such as data distribution management (DDM) among federates. The goal of the DDM module in RTI is to make the data communication more efficient by sending the data only to those federates that need the data, as opposed to the broadcasting mechanism employed by *** DDM schemes have appeared in the literature. In this paper, we discuss grid-based DDM and develop a DDM model that uses grids for matching the publishing/subscription regions, and for data filtering. We show that appropriate choice of the grid-cell size is crucial in obtaining good performance. We develop an analytical model and derive a formula for identifying the optimal cell size in grid-based DDM.

关键词： HLA group communication distributed simulation data filtering data communication

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automatic selection of loop scheduling algorithms using reinforcement learning

Automatic selection of loop scheduling algorithms using rein...

引用

International workshop on Challenges of Large Applications in distributed Environments

作者： S. Dhandayuthapani I. Banicescu R.L. Carino E. Hansen J.R. Pabico M. Rashid Department of Computer Science and Engineering Mississippi State University USA Mississippi State University Mississippi State MS US Dept. of Comput. Sci. & Eng. Mississippi State Univ. USA Center for Computational Sciences-ERC Mississippi State University MS USA

This paper presents the design and implementation of a reinforcement learning agent that automatically selects appropriate loop scheduling algorithms for parallel loops embedded in time-stepping scientific applications executing on clusters. There may be a number of such loops in an application, and the loops may have different load balancing requirements. Further, loop characteristics may also change as the application progresses. Following a model-free learning approach, the learning agent assigned to a loop selects from a library the best scheduling algorithm for the loop during the lifetime of the application. The utility of the learning agent is demonstrated by its successful integration into the simulation of wave packets - an application arising from quantum mechanics. Results of statistical analysis using pairwise comparison of means on the running time of the simulation with and without the learning agent validate the effectiveness of the agent in improving the parallel performance of the simulation.

关键词： Scheduling algorithm Learning Load management Dynamic scheduling Concurrent computing Algorithm design and analysis Analytical models parallel processing Runtime Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：