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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

478 篇 会议
178 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

426 篇 工学
- 322 篇 计算机科学与技术...
- 233 篇 软件工程
- 78 篇 信息与通信工程
- 51 篇 电子科学与技术（可...
- 43 篇 控制科学与工程
- 32 篇 生物工程
- 29 篇 机械工程
- 27 篇 电气工程
- 20 篇 仪器科学与技术
- 15 篇 动力工程及工程热...
- 11 篇 材料科学与工程（可...
- 9 篇 环境科学与工程（可...
- 9 篇 网络空间安全
- 8 篇 土木工程
- 7 篇 农业工程
- 6 篇 力学（可授工学、理...
- 6 篇 建筑学
- 6 篇 化学工程与技术
165 篇 理学
- 103 篇 数学
- 33 篇 生物学
- 30 篇 系统科学
- 25 篇 物理学
- 24 篇 统计学（可授理学、...
- 10 篇 化学
113 篇 管理学
- 75 篇 管理科学与工程(可...
- 42 篇 图书情报与档案管...
- 21 篇 工商管理
14 篇 法学
- 12 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
8 篇 农学
- 7 篇 作物学
4 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 医学
1 篇 艺术学

主题

32 篇 computational mo...
24 篇 concurrent compu...
21 篇 distributed proc...
20 篇 fault tolerance
20 篇 benchmark testin...
18 篇 laboratories
16 篇 application soft...
15 篇 algorithm design...
15 篇 feature extracti...
15 篇 kernel
15 篇 distributed comp...
14 篇 computer archite...
14 篇 servers
14 篇 cloud computing
14 篇 training
13 篇 parallel process...
13 篇 deep learning
13 篇 protocols
13 篇 hardware
13 篇 delay

机构

94 篇 college of compu...
81 篇 national laborat...
78 篇 science and tech...
45 篇 national laborat...
39 篇 school of comput...
31 篇 national laborat...
22 篇 science and tech...
22 篇 national key lab...
19 篇 national key lab...
18 篇 national laborat...
16 篇 national laborat...
15 篇 school of comput...
14 篇 national laborat...
12 篇 national key lab...
11 篇 national laborat...
10 篇 national key lab...
9 篇 national laborat...
8 篇 national key lab...
7 篇 department of co...
7 篇 national laborat...

作者

26 篇 wang huaimin
24 篇 wang yijie
21 篇 dongsheng li
21 篇 yijie wang
20 篇 zhigang luo
20 篇 huaimin wang
18 篇 peng yuxing
17 篇 naiyang guan
17 篇 ji wang
15 篇 li dongsheng
14 篇 yuxing peng
14 篇 wang ji
14 篇 ding bo
14 篇 yin gang
12 篇 xiang zhang
12 篇 liu jie
12 篇 jie liu
11 篇 jia jia
11 篇 wang huai-min
10 篇 xuejun yang

语言

615 篇 英文
41 篇 中文
2 篇 其他

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

共 658 条记录，以下是521-530 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Personalized reputation model in cooperative distributed systems

Personalized reputation model in cooperative distributed sys...

引用

16th IEEE International Conference on parallel and distributed Systems, ICPADS 2010

作者： Liu, Wei Tang, Yang-Bin Wang, Huai-Min School of Computer National Univ. of Defense Technology Changsha Hunan China Institute of Science National Univ. of Defense Technology Changsha Hunan China National Laboratory for Parallel and Distributed Processing Changsha Hunan China

ISBN: (纸本)9780769543079

Reputation systems provide a promising way to build trust relationships between users in distributed cooperation systems, such as file sharing, streaming, distributed computing and social network, through which a user can distinguish good services or users from malicious ones and cooperate with them. However, most reputation models mainly focus on evaluating the quality of services in one dimension, but care less about the preferences of different users. This paper proposes a personalized reputation model which provides each user a personalized trust view on others according to his preferences. In our approach, we aggregate the users' preferences with collaborative filtering method and qualify it with user similarity which is integrated into the computing of reputation value. The experimental results suggest that our model can resist possible kinds of malicious behaviors efficiently. © 2010 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Simulation research of communication networks based on prim algorithm

Simulation research of communication networks based on prim ...

引用

International Forum on Information Technology and Applications

作者： Yang, Chenghui Ren, ChuanJun College of Electrical Engineering Northwest University for Nationalities Lanzhou 730030 China National Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769541150

In order to improve the efficiency of the communication networks, we used the Kruskal algorithm and the Prim algorithm through algorithm comparison and analysis methods of data structure. A dynamic framework for the communication network installed system is built. Moreover, according to the actual framework of the communication network specific issues, the module chooses the Minimum Cost Spanning Tree Prim algorithm ultimately. The assumptions process and outcomes simulation have proper analysis and certification by C language. Experimental results show that the Minimum Cost Spanning Tree of Prim algorithm on the installed system for communication networks dynamic planning process have the advantage of speed and effectively reduce the waste of resources, which not only can ensure efficiency but also can effectively improve communication networks installed cost. © 2010 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance and Accuracy Impact of Trace Generation to the BigSim Emulator

Evaluating the Performance and Accuracy Impact of Trace Gene...

引用

International Conference on computer and Information Technology (CIT)

作者： Yonggang Che Chuanfu Xu Pingjing Lu National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

This paper quantitatively studies the trace effects to the performance and accuracy of the BigSim Emulator, a scalable parallel emulator for large-scale computers. To assess the accuracy effect we modify the emulator code to collect the predicted computation time. Four MPI programs with different computation to communication ratios are used as benchmarks. The emulation time and the predicted computation time, both when trace generation are enabled and disabled, are collected on two parallel host machines. The results show that although the BigSim Emulator only traces communication events and dependencies, trace generation still evidently degrades the emulation performance for programs with high communication to computation ratios. Trace generation also significantly affects the accuracy of the predicted computation time for communication intensive programs, which is an issue that can not be overlooked.

关键词： Emulation Accuracy Runtime Benchmark testing Program processors Predictive models Jacobian matrices

来源：评论

学校读者我要写书评

暂无评论

A Case Study of SWIM: Optimization of Memory Intensive Application on GPGPU

A Case Study of SWIM: Optimization of Memory Intensive Appli...

引用

International Symposium on parallel Architectures, Algorithms and Programming (PAAP)

作者： Wei Yi Yuhua Tang Guibin Wang Xudong Fang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

Recently, GPGPU has been adopted well in the High Performance Computing (HPC) field. The limited global memory bandwidth poses a great challenge to many GPGPU programmers trying to exploit parallelism within the CPU-GPU heterogeneous platform. In this paper, we choose SWIM, a typical memory intensive application from the SPEC OMP 2001 benchmark suite, for case study. We attempt to optimize the performance and energy consumption of the application utilizing different memory access mechanisms and present optimization methods including matrix transposition and kernel fusion. The experimental results on the Intel Core TM i920 CPU plus GeForce GTX 295 platform shows that, the proposed optimizing methods achieve a speedup of 8.7X over the original OpenMP program and reduce the energy consumption by 83% for the problem size of 2048*2048.

关键词： Instruction sets Kernel Bandwidth Graphics processing unit Memory management Energy consumption Central processing Unit

来源：评论

学校读者我要写书评

暂无评论

Optimizing Adaptive Synchronization in parallel Simulators for Large-scale parallel Systems and Applications

Optimizing Adaptive Synchronization in Parallel Simulators f...

引用

International Conference on computer and Information Technology (CIT)

作者： Chuanfu Xu Yonggang Che Jianbin Fang Zhenghua Wang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

This paper addresses the optimization of parallel simulators for large-scale parallel systems and applications. Such simulators are often based on parallel discrete event simulation with conservative or optimistic protocols to synchronize the simulating processes. The paper considers how available future information about events and application behaviors can be efficiently extracted and further exploited to improve the performance of adaptive optimistic protocols. First, we extract information about future events and their dependencies in application traces to guide adaptive adjustments of time window in trace-driven parallel simulation. Second, we use information about application behaviors, specifically the iterative behavior found in many applications, to avoid the unnecessary adjustments of time window. These techniques are implemented in the BigSim simulator and tested by real-world and standard benchmark applications including Jacobi3D and HPL. The results show that our optimization approaches can reduce the execution times of simulation ranging from 11% up to 32%. Moreover, our methods are easy to implement and don't need to augment compilers or even modify the core codes of parallel simulators.

关键词： Adaptation model Computational modeling Schedules Optimization Protocols Synchronization Analytical models

来源：评论

学校读者我要写书评

暂无评论

Towards Online Application Cache Behaviors Identification in CMPs

Towards Online Application Cache Behaviors Identification in...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Xiaomin Jia Jiang Jiang Tianlei Zhao Shubo Qi Minxuan Zhang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

On chip multiprocessors (CMPs) platforms, multiple co-scheduled applications can severely degrade performance and quality of service (QoS) when they contend for last-level cache (LLC) resources. Whether an application will impose destructive interference on co-scheduled applications is largely dependent on its own inherent cache access behavior characteristics. In this work, we first present case studies that show how inter-application interferences result in undesirable performance in both shared and private cache based LLC designs. We then propose a new online approach for application cache behavior identification on the basis of detailed simulation and analysis with SPEC CPU2006 benchmarks. We demonstrate that our approach can more concisely identify application cache behaviors. Moreover, the proposed approach can be implemented directly in hardware to dynamically identify the application cache behaviors at runtime. Finally, we show with two case studies that how the proposed approach can be adopted by both shared and private based cache sharing mechanisms, i.e. cache partitioning algorithms (CPAs) and cache spilling techniques, for more concise cache resource management.

关键词： Benchmark testing Measurement Throughput Servers Interference Aerospace electronics Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：