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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

762 篇 会议
239 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

642 篇 工学
- 506 篇 计算机科学与技术...
- 363 篇 软件工程
- 112 篇 信息与通信工程
- 66 篇 电子科学与技术（可...
- 63 篇 控制科学与工程
- 45 篇 生物工程
- 43 篇 机械工程
- 32 篇 电气工程
- 23 篇 仪器科学与技术
- 21 篇 动力工程及工程热...
- 15 篇 材料科学与工程（可...
- 15 篇 化学工程与技术
- 14 篇 网络空间安全
- 13 篇 土木工程
- 11 篇 力学（可授工学、理...
- 11 篇 农业工程
- 11 篇 环境科学与工程（可...
- 10 篇 建筑学
- 10 篇 交通运输工程
246 篇 理学
- 161 篇 数学
- 48 篇 生物学
- 36 篇 系统科学
- 35 篇 统计学（可授理学、...
- 34 篇 物理学
- 17 篇 化学
158 篇 管理学
- 106 篇 管理科学与工程(可...
- 55 篇 图书情报与档案管...
- 29 篇 工商管理
18 篇 法学
- 15 篇 社会学
12 篇 农学
11 篇 经济学
- 11 篇 应用经济学
8 篇 教育学
4 篇 医学
3 篇 文学
3 篇 军事学
2 篇 艺术学

主题

42 篇 distributed proc...
41 篇 laboratories
37 篇 computational mo...
29 篇 kernel
28 篇 concurrent compu...
28 篇 algorithm design...
27 篇 benchmark testin...
25 篇 fault tolerance
25 篇 computer archite...
25 篇 graphics process...
24 篇 hardware
22 篇 feature extracti...
22 篇 cloud computing
21 篇 servers
21 篇 protocols
20 篇 parallel process...
20 篇 throughput
20 篇 semantics
19 篇 distributed comp...
18 篇 bandwidth

机构

169 篇 national laborat...
134 篇 science and tech...
93 篇 college of compu...
88 篇 national laborat...
81 篇 national laborat...
38 篇 national laborat...
35 篇 school of comput...
29 篇 national key lab...
22 篇 science and tech...
22 篇 national key lab...
18 篇 national laborat...
16 篇 national laborat...
14 篇 national laborat...
13 篇 national key lab...
13 篇 school of comput...
12 篇 national laborat...
12 篇 national key lab...
10 篇 national laborat...
10 篇 national key lab...
10 篇 national univers...

作者

40 篇 wang huaimin
37 篇 wang ji
37 篇 yong dou
35 篇 liu jie
35 篇 ji wang
31 篇 jie liu
29 篇 huaimin wang
28 篇 dou yong
27 篇 dongsheng li
27 篇 xiaodong wang
26 篇 peng yuxing
26 篇 yin gang
25 篇 yuxing peng
24 篇 li dongsheng
24 篇 yijie wang
23 篇 wang yijie
21 篇 xicheng lu
21 篇 xingming zhou
20 篇 gang yin
20 篇 zhigang luo

语言

935 篇 英文
62 篇 中文
7 篇 其他

检索条件"机构=Parallel and Distributed Processing for National Laboratory"

共 1004 条记录，以下是751-760 订阅

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

详细简洁

排序：

Design and Practice on iVCE for Memory System

Design and Practice on iVCE for Memory System

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Rui Chu Tian Tian Zhenli Lin National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

As one of the components in iVCE software platform, iVCE/M devotes to the performance improvement of the I/O-intensive and memory-intensive applications with efficient aggregation of distributed memory resources. To facilitate the deployment of iVCE/M, the data locating algorithm with balanced time and space cost, as well as the transparent interface for the legacy applications without code modification, are both significant in the implementation of iVCE/M. We propose the logarithmic search tree based client-side metadata structure to accelerate the data locating using moderate memory consumption, the implicit I/O redirection mechanism, and the implementation of iVCE/M based disk cache system. The experiments with cross domain emulation prove that the scheme is applicable to exploit the distributed memory resources for applications with small granularity I/O accesses.

关键词： Servers Internet Memory management Kernel Driver circuits Prototypes

来源：评论

学校读者我要写书评

暂无评论

Mapping OpenMP Concepts to the Stream Programming Model

Mapping OpenMP Concepts to the Stream Programming Model

引用

The 5th International Conference on Computer Science & Education(第五届国际计算机新技术与教育学术研讨会 ICCSE'10)

作者： Tao Tang Yisong Lin Xiaoguang Ren National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

OpenMP is a widely used parallel programming model on traditional multi-core processors. Generally, OpenMP is used to develop fine-grained parallelism through a multithread model. Stream programming model is a new kind of parallel programming model for stream architectures. OpenMP bears a resemblance to the stream programming model at some level. The transformation between the two models has attracted much attention from the research community, since it is the foundation of porting programs between the two architectures. Most related researches focus on the efficiency of porting existing parallel programs to the new architectures such as GPUs. Very few of these studies, however, focus on the portative problem systematically, namely, what kind of parallel programs can be or should be transplanted into stream programs and mapped to run on the stream processors. In this paper, we study the mapping relationship of parallel mechanism in OpenMP to the stream programming model, and point out those parallel mechanisms in OpenMP that are infeasible or undesirable for stream programs. By analyzing two typical benchmarks, we draw the conclusion that a majority of scientific applications are suitable to be mapped to the stream programming model. Our conclusion effectively validates the idea of accelerating scientific applications with the stream processors.

关键词： OpenMP:stream programming model:parallel mechanism:mapping

来源：评论

学校读者我要写书评

暂无评论

Using redundant threads for fault tolerance of OpenMP programs

Using redundant threads for fault tolerance of OpenMP progra...

引用

2010 International Conference in Information Science and Applications, ICISA 2010

作者： Fu, Hongyi Ding, Yan Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defence Tech. Changsha Hunan 410073 China School of Computer National University of Defence Tech. Changsha Hunan 410073 China

ISBN: (纸本)9781424459438

As the wide application of multi-core processor architecture in the domain of high performance computing, fault tolerance for shared memory parallel programs becomes a hot spot of research. For years, checkpointing has been the dominant fault tolerance technology in this field, and recently, many research works have been engaged with it. However, to those programs which deal with large amount of data, checkpointing may induce massive I/O transfer, which will adversely affect scalability. To deal with such a problem, this paper proposes a fault tolerance approach, making use of redundancy, for shared memory parallel programs. Our scheme avoids saving and restoring computational state during the program's execution, hence does not involve I/O operations, so presents explicit advantage over checkpointing in scalability. In this paper, we introduce our approach and the related compiler tool in detail, and give the experimental evaluation result. ©2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Data Communication Scheduler for Stream Programs on CPU-GPU Platform

A Data Communication Scheduler for Stream Programs on CPU-GP...

引用

International Conference on Computer and Information Technology (CIT)

作者： Tao Tang Xinhai Xu Yisong Lin National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

In recent years, heterogeneous parallel system have become a focus research area in high performance computing field. Generally, in a heterogeneous parallel system, CPU provides the basic computing environment and special purpose accelerator (GPU in this paper) provides high computing performance. However, the overall performance of the system is prone to be limited by the data communication between the CPU and the GPU. Data communication is typically used to synchronize the array on the CPU and the stream (in AMD's terminology) on the GPU. In many cases, programmers just add data synchronization for each GPU invoking independently. It is easy to program in this manner but much redundant communication may be introduced, which will dramatically degrade the overall performance. To alleviate this problem, based on the stream programming model, we propose a heuristic data communication schedule approach in this paper. By analyzing the state transition of stream/array data pair, relaxing the synchronization strategy conditionally and considering optimization for branch and loop control structure, our approach can significantly reduce the redundant data communication in most cases.

关键词： Graphics processing unit Data communication Arrays Kernel Streaming media Schedules

来源：评论

学校读者我要写书评

暂无评论

The Composability Problem of Events and Threads in distributed Systems

The Composability Problem of Events and Threads in Distribut...

引用

2010 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

作者： Huiba Li Yuxing Peng Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China 410073

ISBN: (纸本)9781424463671;9781424463688;9781424463701

Event-driven programming has been a relatively hot topic in distributed systems development. Having worked on these systems for years, we now believe that it is not the best choice. Besides the wellknown "stack ripping" problem, we argue that it greatly influences the composability of software modules. Preemptive threads are also short of composability because of data-races and locks. Lacking of composability can result in systems with little vitality. Cooperative threading (or coroutine), on the contrary, is almost free of this problem, so we advocate it as the primary concurrency model for most distributed systems.

关键词： distributed systems thread event composability

来源：评论

学校读者我要写书评

暂无评论

A simulated annealing technique for optimizing timewarp simulation

A simulated annealing technique for optimizing timewarp simu...

引用

2010 International Conference on Computer Modeling and Simulation, ICCMS 2010

作者： Zhang, Wei Meraji, Sina Wang, Jun Tropper, Carl National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology ChangSha 410073 China School of Computer Science McGill University Montreal H3A 2A7 Canada

ISBN: (纸本)9780769539416

According to Moore's law the complexity of VLSI circuits has doubled approximately every two years, resulting in simulation becoming the major bottleneck in the circuit design process. parallel and distributed simulations can be applied as fast, cost effective approaches to the simulation of large, complex circuits. In this paper, a simple yet effective simulated annealing-based approach is proposed to optimize the choice of a time window for optimistic parallel simulation. We chose gate level circuits simulations as our experimental vehicle. Our results show up to a 52% improvement in the simulation time using our simulated annealing algorithm. To the best of our knowledge, this is the first time that SA has been applied to optimize the performance of Time Warp simulations. © 2010 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Link Scheduling in Wireless Networks with Successive Interference Cancellation

Link Scheduling in Wireless Networks with Successive Interfe...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Shaohe Lv Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

Successive interference cancellation (SIC) is an effective technique of multipacket reception to combat interference. As not all collision are resolvable, careful transmission coordination is required. We study link scheduling in wireless networks with SIC at the physical layer. A new model, simultaneity graph (SG), is proposed to characterize the link correlation introduced by SIC. Then two new scheduling schemes are presented: 1) a slot-oriented scheme which assigns a maximal feasible link set to a time slot and 2) a link-oriented scheme which assigns each link a sufficient number of slots. The performance is evaluated by simulations and the results demonstrate that the throughput gain is on average 50% and up to 110% over IEEE 802.11. The complexity of SG is only a bit higher than that of the available widely-used models (e.g., conflict graph).

关键词： Interference Optimal scheduling Silicon carbide Schedules Scheduling Receivers Measurement

来源：评论

学校读者我要写书评

暂无评论

Scheduling under SINR Model in Ad Hoc Networks with Successive Interference Cancellation

Scheduling under SINR Model in Ad Hoc Networks with Successi...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Shaohe Lv Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

Successive interference cancellation (SIC) is an effective way of multipacket reception to combat interference. We study link scheduling under SINR (Signal to Interference Noise Ratio) model in ad hoc networks with SIC at physical layer. The facts that interference is accumulated and the links decoded sequentially by SIC are correlated pose key technical challenges. We propose conflict set graph (CSG) to characterize the interference and define interference degree to measure the interference of a link. As scheduling over CSG is NP-hard, independent set based greedy scheme is explored to efficiently construct maximal feasible schedule. The performance is evaluated by simulations. As compared to the simple greedy method, the throughput gain is on average 30% and up to 60%.

关键词： Interference Silicon carbide Peer to peer computing Throughput Signal to noise ratio Wireless networks Transmitters

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

2010 IEEE 18th International Workshop on Quality of Service, IWQoS 2010

作者： Chen, Fajun Liu, Jiangchuan Li, Zongpeng Wang, Yijie Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer National University of Defense Technology China School of Computing Science Simon Fraser University Canada Department of Computer Science University of Caglary Canada

ISBN: (纸本)9781424459889

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Optimization and Implementation of LBM Benchmark on Multithreaded GPU

Optimization and Implementation of LBM Benchmark on Multithr...

引用

International Conference on Data Storage and Data Engineering (DSDE)

作者： Xiaoguang Ren Yuhua Tang Guibin Wang Tao Tang Xudong Fang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424456789;9780769539584

With fast development of transistor technology, Graphic processing Unit(GPU) is increasingly used in the non-graphics applications, and major GPU hardware vendors have introduced software stacks for their own GPUs, such as Brook+ for AMD GPU. Compared with the traditional parallel systems, heterogeneous systems integerating stream-based multi-threaded GPUs provide higher parallel computing capabilities with lower cost. However, porting traditional applications to the heterogeneous systems makes new demand of application optimization on GPU. Based on the AMD's Brook+ platform, we explored application optimization features on AMD GPU by optimizing and implementing the benchmark LBM from SPEC2006. To improve the program locality, we optimized the original data layout of LBM. Using the short vector data types mechanism provided by Brook+, we also optimized the GPU's bandwidth utilization and its thread processors' efficiency. Through the branch elimination technique, we reduced the performance lose caused by branch divergences in the kernel, which is due to the GPU's SIMD executing mode. The experiment results show that data layout, memory bandwidth, branch paths and other factors have a close effect on the performance of program execution on the GPU. Through all the optimizations, we finally got a speedup of 22x (single-precision) and 19x (double-precision) over the original serial benchmark code on a Quad-core CPU, and a speedup of 4x (single-precision) and 8.7x (double-precision) over the original OMP benchmark code on a 8-core CPU.

关键词： Application software Graphics processing unit parallel processing Computer architecture Biomedical computing Computational fluid dynamics Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共101页 << < 72 73 74 75 76 77 78 79 80 81 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：