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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

4 篇 会议

馆藏范围

4 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3 篇 工学
- 3 篇 计算机科学与技术...

主题

4 篇 sort-based algor...
3 篇 grid-based algor...
2 篇 high level archi...
2 篇 data distributio...
2 篇 brute force algo...
2 篇 runtime infrastr...
1 篇 binary search
1 篇 ddm
1 篇 layer partition-...
1 篇 region-based alg...
1 篇 interest matchin...
1 篇 binary partition...
1 篇 hla

机构

1 篇 natl univ def te...
1 篇 natl univ singap...
1 篇 thein university...
1 篇 national univers...
1 篇 computer univers...

作者

1 篇 yao yiping
1 篇 nay min tun
1 篇 tan g
1 篇 come raczy
1 篇 tang wenjie
1 篇 raczy c
1 篇 yu jun
1 篇 zhu feng
1 篇 nwe nwe myint th...
1 篇 gary tan
1 篇 li tianlin
1 篇 jun y

语言

4 篇 英文

检索条件"主题词=sort-based algorithm"

共 4 条记录，以下是1-10 订阅

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

详细简洁

排序：

Evaluation of a sort-based matching algorithm for DDM 16

Evaluation of a sort-based matching algorithm for DDM

引用

16th Workshop on Parallel and Distributed Simulation

作者： Jun, Y Raczy, C Tan, G Natl Univ Singapore Sch Comp Singapore 119260 Singapore

ISBN: (纸本)0769516084

The High Level Architecture (HLA) provides several Data Distribution Management (DDM) services to reduce the transmission and reception of irrelevant data. These services rely on the computation of the intersection between "update" and "subscription" regions. As the brute force approach does not scale well, the current implementations of DDM usually use a grid partitioning of the routing space to efficiently compute the intersection. Since this approach still has some shortcomings, we have focused our recent research on the design and the evaluation of different intersection algorithms for the DDV. In this paper, we introduce a new intersection algorithm in which regions are sorted before computing the intersections. The strong points of this algorithm are (1) the sort suppresses many useless checks, (2) the algorithm allows many optimizations at the implementation level. An experimental comparison of this algorithm with brute force and grid-based approach provides additional information about the good points and weak points of each of the three approaches.

关键词： high level architecture runtime infrastructure data distribution management brute force algorithm grid-based algorithm sort-based algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a sort-based matching algorithm for DDM 02

Evaluation of a sort-based matching algorithm for DDM

引用

Proceedings of the sixteenth workshop on Parallel and distributed simulation

作者： Yu Jun Come Raczy Gary Tan National University of Singapore Singapore

ISBN: (纸本)9780769516080

The High Level Architecture (HLA) provides several Data Distribution Management (DDM) services to reduce the transmission and reception of irrelevant data. These services rely on the computation of the intersection between "update" and "subscription" regions. As the brute force approach does not scale well, the current implementations of DDM usually use a grid partitioning of the routing space to efficiently compute the intersection. Since this approach still has some shortcomings, we have focused our recent research on the design and the evaluation of different intersection algorithms for the *** this paper, we introduce a new intersection algorithm in which regions are sorted before computing the intersections. The strong points of this algorithm are (1) the sort suppresses many useless checks, (2) the algorithm allows many optimizations at the implementation level. An experimental comparison of this algorithm with brute force and grid-based approach provides additional information about the good points and weak points of each of the three approaches.

关键词： runtime infrastructure data distribution management grid-based algorithm sort-based algorithm brute force algorithm high level architecture

来源：评论

学校读者我要写书评

暂无评论

A Binary Search Enhanced sort-based Interest Matching algorithm 18

A Binary Search Enhanced Sort-based Interest Matching Algori...

引用

32nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS)

作者： Li, Tianlin Tang, Wenjie Yao, Yiping Zhu, Feng Natl Univ Def Technol Coll Syst Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781450350921

In distributed simulation, communication based on publish/subscribe will generate large amount of irrelevant data transmissions, and thereby degrading the performance. To solve the problem, HLA standard defines data distribution management to filter unnecessary communication. Among several famous interest matching algorithms, the sort-based algorithm has been proven to be the most efficient method in most scenarios. However, the potential of existing sort-based algorithm has not been fully exploited, due to the overhead of sorting the bounds can be further reduced and a portion of unnecessary bit operations can be eliminated. In this paper, we propose a binary search enhanced sort-based interest matching algorithm (BSSIM). based on a different sufficient and necessary condition to judge interval overlapping, the size of list to be sorted can be remarkably reduced. Moreover, unnecessary bit operations can be eliminated by binary searches. Experimental results show that BSSIM algorithm outperforms the sort-based algorithm, and approximately 64%-159% performance improvement can be achieved at different scenarios.

关键词： Interest matching sort-based algorithm binary search

来源：评论

学校读者我要写书评

暂无评论

Layer Partition-based Matching algorithm of DDM

Layer Partition-based Matching Algorithm of DDM

引用

3rd International Conference on Computational Techniques and Artificial Intelligence(ICCTAI’2014)

作者： Nwe Nwe Myint Thein Nay Min Tun Thein University of Technology(Yatanarpon Cyber City) Computer University(Kyaing Tong)

High Level Architecture（HLA） is architecture for reuse and interoperation of *** HLA paradigm,the Runtime Infrastructure（RTI） provides a set of *** Distribution Management（DDM） service reduces message traffic over the *** aims to control and limit the data exchanged between federates during *** federate may inform the RTI about its intention to publish some data or it may subscribe to receive a subset of the published *** services are used to reduce the transmission and receiving of irrelevant data and aimed at reducing the communication over the *** services rely on the computation of the intersection between "update" and "subscription" *** calculating the intersection between update regions and subscription regions,the higher computation overhead can ***,there are several main DDM filtering *** paper proposes the layer partition-based matching algorithm for DDM in the HLA-based large-scale distributed *** new algorithm chooses the dynamic pivot based on regions distribution in the routing *** binary partition-based algorithm is fundamentally based on a divide and conquers *** algorithm always chooses the midpoint as the pivot point of routing *** approach promises low computational overhead,since it does not require unnecessary comparisons within regions in different *** proposed algorithm firstly calculates the regions ***,the partitioning among regions performs based on the result of choosing pivot based on region detection and defines the matching area that entirely covers all regions which need to match with regions at pivot *** proposed algorithm provides the more definite matching area between update region and subscription region during matching *** algorithm guarantees low computational overheads for matching process based on the overlapping degree between the regions and reduce the irrelevant m

关键词： HLA DDM Region-based algorithm Grid-based algorithm sort-based algorithm Binary Partition-based algorithm Layer Partition-based algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：