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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是41-50 订阅

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

详细简洁

排序：

Re-running Large-scale parallel Programs Using Two Nodes 16

Re-running Large-scale Parallel Programs Using Two Nodes

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Guo, Yayu Lin, Fang Liu, Yi Qian, Depei Beihang Univ Sch Comp Sci & Engn Beijing Peoples R China

ISBN: (纸本)9781728111414

With the increasing of scale and complexity of high performance computing (HPC) systems, the programming, debugging, and tuning of large-scale parallel programs face a series of challenges, one of which is that programmers often need to repeatedly run their programs with large number of processes on HPC systems to identify sources of errors and performance bottlenecks in their programs, which means large amounts of resource consumptions. Furthermore, since most HPC systems use job scheduling system to manage their resources and schedule multiple jobs from different users, programmers cannot interact with their programs during the execution of programs, which further increases complexities of debugging and tuning. To address this challenge, this paper proposes a system that reruns large-scale MPI parallel programs using two nodes. According to an approach of one real-execution + multiple emulation-executions, the parallel program is firstly executed with desired number of processes on an HPC system, which is referred as real-execution, and during the execution, our system records MPI messages transmitted among processes as well as control information of processes;after that, one or more processes can be re-run on a two-node local system under the scale the same with the real-execution. In the meantime, programmers can interact with their programs by attaching the GDB, a commonly used debugger, to the re-running process. therefore, not only can our system reduce resource-consumptions in debugging and tuning of large-scale parallel programs significantly, but also support interactions between developers and their programs during the execution of the programs, which makes programmers easier to identify sources of the errors and performance bottlenecks in their parallel programs.

关键词： high performance computing HPC debugging tool performance tool large-scale parallel programs

来源：评论

学校读者我要写书评

暂无评论

Index-shuffle graphs

Index-shuffle graphs

引用

8th ieee symposium on parallel and distributed processing

作者： Baumslag, M Obrenic, B Bear Stearns & Co Inc New York United States

ISBN: (纸本)0818676833

Index-shuffle graphs are introduced as candidate interconnection networks for parallel computers. the comparative advantages of index-shuffle graphs over the standard bounded-degree ''approximations'' of the hypercube, namely butterfly-like and shuffle-like graphs, are demonstrated in the theoretical framework of graph embedding and network emulations. An N-node index-shuffle graph emulates: (1) an N-node shuffle-exchange graph with no slowdown, while the currently best emulations of shuffle-like graphs by hypercubes and butterflies incur a slowdown of Omega(log N). (2) its like-sized buttelfly graph with a slowdown O(log log log N), while the currently best emulations of butterfly-like graphs by shuffle-like graphs incur a slow-down of Omega (log log N). (3) an N-node hypercube that executes an on-line leveled algorithm with a slowdown O(log log N) and without data circulation, while the slowdown of currently best such emulations of the hypercube by its bounded-degree shuffle-like and butterfly-like derivatives remains Omega(log N), and only if the entire local data set of every processor is allowed to circulate through the network.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Accelerating Lattice QCD on Sunway Many-core Processor 16

Accelerating Lattice QCD on Sunway Many-core Processor

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Zhang Zengxiao Luan Zhongzhi Xu Chongyang Gong Ming Xu Shun Beihang Univ Sch Comp Sci & Engn Beijing Peoples R China Chinese Acad Sci Inst High Energy Phys Beijing Peoples R China Chinese Acad Sci Comp Network Informat Ctr Beijing Peoples R China

ISBN: (纸本)9781728111414

Lattice quantum chromodynamics (lattice QCD) is a mainstream non-perturbative theoretical calculation method. It's for studying quantum chromodynamics (QCD) using lattice quantum field theory, by defining field variables at discrete time-space points and large-scale Monte Carlo numerical simulation calculation. It's computing results can directly compare with the experimental results, but the conventional computing platform is difficult to meet the large-scale and high-precision lattice QCD computational simulation demand. Sunway TaihuLight is the first supercomputer with peak performance over 100Pflops in the world, which provides a new platform for the calculation of lattice QCD. But the efficient large-scale parallel lattice QCD computing faces many difficult problems in implement. In order to realize the efficient calculation of the lattice QCD in Sunway many-core processor, we designs a parallel acceleration calculation method of lattice QCD on Sunway Architecture in this paper. A new parallel computing method is put forward, and the method of data segmentation, data transmission and parallel computing is improved and optimized. Finally, the test data is used to test the optimized parallelization computing method proposed in this paper and the original serial computing method. Experiments show that the parallel optimized computing method can achieve 63 times performance improvement compared with the original serial computing method.

关键词： Sunway many-core processor lattice QCD parallel computing Super computer

来源：评论

学校读者我要写书评

暂无评论

parallel software Testing Sequence Generation Method Based on State Pruning 16

Parallel software Testing Sequence Generation Method Based o...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Sun, Tao Zhang, Ting Guo, Xin Inner Mongolia Univ Coll Comp Sci Hohhot Peoples R China

ISBN: (纸本)9781728111414

Testing for parallel software system is very difficult, because the number of states and execution sequences expands significantly caused by parallel behaviors. In this paper, a test sequences generation method based on Coloured Petri Net (CPN) is proposed, target at full coverage of occurrences in different orders to all behaviors under testing, and generating non-redundant test sequences. Firstly, test objective is described as segments of behaviors under testing, and the coverage criterion is defined as occurrences in different orders to all behavior under testing should be covered. Secondly, the Projection operation is defined to get the state space subgraph for each segment of behavior under testing, and all occurrences of behaviors in the segment are in the subgraph, so that test sequences could be got in the state space subgraph but not the full state space of the system model, the efficiency has improved to some extent. However, the state space subgraph is always big caused by complex parallel behaviors including behaviors under testing and other behaviors. then State Node Pruning operation and Arc Pruning operation are performed in the subgraph to greatly reduce the scale of subgraph, and all states caused by other behaviors are pruned. the simplified subgraph still covers the occurrences in different orders to all behaviors under testing. So test sequences can be generated in the simplified subgraph. Finally, the FullPath operation defines the generation of all test sequences in the subgraph after simplification. By acquiring all sequences of each simplified subgraph and any sequence between adjacent subgraphs, the test sequence that covers all behaviors under testing is generated, and these test sequences do not include any redundant sequences. the experimental results show that this method is effective and efficient.

关键词： parallel Software Coloured Petri Net (CPN) Behavior Under Test Testing Sequence

来源：评论

学校读者我要写书评

暂无评论

distributed list coloring: How to dynamically allocate frequencies to mobile base stations

Distributed list coloring: How to dynamically allocate frequ...

引用

8th ieee symposium on parallel and distributed processing

作者： Garg, N Papatriantafilou, M Tsigas, P Max-Planck Inst for Computer Science Saarbruecken Germany

ISBN: (纸本)0818676833

To avoid signal interference in mobile communication it is necessary that the channels used by base stations for broadcast communication within their cells are chosen so that the same channel is never concurrently used by two neighboring stations. We model this channel allocation problem as a generalized list coloring problem and we provide two distributed solutions which are also able to cope with crash failures by limiting the size of the network affected by a faulty station in terms of the distance from that station. Our first solution uses a powerful synchronization mechanism to achieve a response time that depends only on Delta, the maximum degree of the signal interference graph, and a failure locality of 4. Our second solution is a simple randomized solution in which each node can expect to pick f/(4 Delta) colors where f is the size of the list at the node;the response time of this solution is a constant and the failure locality 1. Besides being efficient (their complexity measures involve only small constants), the protocols presented in this work are simple and easy to apply in practice, provided the existence of distributed infrastructure in networks that are in use.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Performance of parallel algorithms for a Fingerprint Image Comparison system

Performance of parallel algorithms for a Fingerprint Image C...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Ammar, Hany H. Miao, Zhouhui West Virginia Univ Morgantown United States

this paper addresses the problem of analyzing the performance of parallel algorithms for the training procedure of a neural network based Fingerprint Image Comparison (FIC) system. the target architecture is assumed to be a coarse-grain distributed memory parallel architecture. Two types of parallelism: node parallelism and training set parallelism (TSP) are investigated. these algorithms are implemented on a 32 node CM-5. theoretical analysis and experimental results comparing the performance of these algorithms are presented.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Bmad-tree: An efficient data structure for parallel processing

Bmad-tree: An efficient data structure for parallel processi...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Das, Sajal K. Demuynck, Marie-Anne Univ of North Texas Denton United States

B-trees are used for accessing large database files, stored in lexicographic order on the secondary storage devices. Algorithms for concurrent B-tree data structures achieve only limited speedup when implemented on a parallel computer. To improve the performance, a variant of Blink-tree, called Bmad-tree, which allows insertion without node splits, with multiple access in its leaf nodes, and dilation in both the index and the leaf nodes is proposed.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal and efficient parallel algorithms for summing and prefix summing

Optimal and efficient parallel algorithms for summing and pr...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Santos, Eunice E. Lehigh Univ Bethlehem United States

We consider the problem of designing efficient parallel algorithms for summing and prefix summing. In this paper, we present optimal algorithms for summing on a latency-dependent distributed-memory model and show that any optimal summing algorithm must have an inherent structure. Moreover, we present optimal or near-optimal algorithms for prefix summing for both non-commutative and commutative binary operators. Furthermore, we show that the optimal algorithms for prefix summing for these two types of operators are not equivalent.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Adaptive Beamforming Algorithm for Planar Array System

Efficient Parallel Adaptive Beamforming Algorithm for Planar...

引用

8th International symposium on Antennas, Propagation and EM theory

作者： Huang, Fei Sheng, Wei-xing Ma, Xiao-feng Nanjing Univ Sci & Technol Dept Commun Engn Nanjing 210094 Peoples R China

ISBN: (纸本)9781424421923

For large planar adaptive arrays, the computational load and the terabyte data transmission are two challenging problems in the implementation of adaptive beamforming system. this paper considers the problem of designing an efficient parallel adaptive algorithm using the two dimensional(2D) planar array. this paper extends the efficient parallel adaptive beamforming algorithm based on LCMV to adaptive 2D sensor array processing. the proposed 2D parallel adaptive algorithm can be easily implemented in distributed-parallel-processing system due to its parallel structure. It can save the data transmission as well as computing cost.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Fisher Discriminant Analysis Random Forest for Online Class Incremental Learning 16

Fisher Discriminant Analysis Random Forest for Online Class ...

引用

16th ieee ISPA / 17th ieee IUCC / 8th ieee BDCloud / 11th ieee SocialCom / 8th ieee SustainCom

作者： Xiong, Wang Wang, Yijie Cheng, Li Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781728111414

Class incremental learning needs to deal with a dynamic environment where data class appears incrementally, it is a challenge to learn new knowledge while preserving what has already been learned. On the other hand, due to the limited storage of the online scenario, algorithm is usually obstructed to frequently scan or simply store all historical data, it is another challenge to reduce the historical data storage for algorithm. Few existing work have addressed above challenges simultaneously. In this paper, we propose Fisher Discriminant Analysis Random Forest (FDARF), which consists of two parts, GHS (Generate Hierarchical Split) and RRS (Random Reform Subtree), that cooperatively operate. GHS combines FDA (Fisher Discriminant Analysis) with tree hierarchy to learn a hierarchical split of data space that provides strong ability for classification. the statistics in leaves (i.e. historical data) can be described by covariance matrix and further optimized by matrix sketching algorithm to reduce storage;for every tree initialized by GHS, RRS randomly reforms certain state subtree, which creates diversity that can be ensemble for ensuring effectiveness of class incremental learning. Extensive experiments on diverse datasets validate that FDARF can well adapt to the online class incremental learning.

关键词： Fisher Discriminant Analysis Matrix Sketching Random Forest Online Class Incremental Learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：