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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

427 篇 工学
- 323 篇 计算机科学与技术...
- 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...

作者

27 篇 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
15 篇 ding bo
15 篇 yin gang
14 篇 yuxing peng
14 篇 wang ji
12 篇 xiang zhang
12 篇 liu jie
12 篇 wang huai-min
12 篇 jie liu
11 篇 jia jia
11 篇 fu yongquan

语言

617 篇 英文
40 篇 中文
2 篇 其他

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

共 659 条记录，以下是81-90 订阅

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

详细简洁

排序：

Power-efficientwork distribution method for CPU-GPU heterogeneous system

Power-efficientwork distribution method for CPU-GPU heteroge...

引用

IEEE International Symposium on parallel and distributed processing With Applications

作者： Wang, Guibin Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769541907

As the system scales up continuously, the problem of power consumption for high performance computing (HPC) system becomes more severe. Heterogeneous system integrating two or more kinds of processors, could be better adapted to heterogeneity in applications and provide much higher energy efficiency in theory. Many studies have shown heterogeneous system is preferable on energy consumption to homogeneous system in a multi-programmed computing environment. However, how to exploit energy efficiency (Flops/Watt) of heterogeneous system for a single application or even for a single phase in an application has not been well studied. This paper proposes a power-efficient work distribution method for single application on a CPU-GPU heterogeneous system. The proposed method could coordinate inter-processor work distribution and per-processor's frequency scaling to minimize energy consumption under a given scheduling length constraint. We conduct our experiment on a real system, which equips with a multi-core CPU and a multi-threaded GPU. Experimental results show that, with reasonably distributing work over CPU and GPU, the method achieves 14% reduction in energy consumption than static mappings for several typical benchmarks. We also demonstrate that our method could adapt to changes in scheduling length constraint and hardware configurations. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Communication time models on fat-tree networks

Communication time models on fat-tree networks

引用

2010 3rd International Conference on Advanced computer Theory and Engineering, ICACTE 2010

作者： Lin, Yufei Xu, Xinhai Lin, Yisong National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424465408

With the growth of supercomputer's scale, the communication time during executing is increasing. This phenomenon arouses the architecture researchers' interests. In this paper, based on the fat-tree topology, which is widely used in Infiniband, we present an one-to-all broadcast communication time model. After classifying applications into two kinds, we establish the ideal model and the bandwidth-limited model on the exponential-capacity binary fat-trees for the two kinds of applications. Through analyzing the models, we get the curves which describe the relationship between the communication time and the processor number. The conclusions we get in this paper can help system designers make better system design. © 2010 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Towards online application cache behaviors identification in CMPs

Towards online application cache behaviors identification in...

引用

IEEE International Conference on High Performance Computing and Communication

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

ISBN: (纸本)9780769542140

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. © 2010 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A programming language approach to internet-based virtual environment computing

A programming language approach to internet-based virtual en...

引用

作者： Ji, Wang Shen, Rui Wang, Huai-Min National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

There is an increasing need to build scalable distributed systems over the Internet infrastructure. However, the development of distributed scalable applications suffers from lack of a wide accepted virtual computing environment. Users have to take great efforts on the management and sharing of the involved resources over Internet, whose characteristics are intrinsic growth, autonomy and diversity. To deal with this challenge, Internet-based Virtual Computing Environment (iVCE) is proposed and developed to serve as a platform for distributed scalable applications over the open infrastructure, whose kernel mechanisms are on-demand aggregation and autonomic collaboration of resources. In this paper, we present a programming language for iVCE named Owlet. Owlet conforms with the conceptual model of iVCE, and exposes the iVCE to application developers. As an interaction language based on peer-to-peer content-based publish/subscribe scheme, Owlet abstracts the Internet as an environment for the roles to interact, and uses roles to build a relatively stable view of resources for the on-demand resource aggregation. It provides language constructs to use 1) distributed event driven rules to describe interaction protocols among different roles, 2) conversations to correlate events and rules into a common context, and 3) resource pooling to do fault tolerance and load balancing among networked nodes. We have implemented an Owlet compiler and its runtime environment according to the architecture of iVCE, and built several Owlet applications, including a peer-to-peer file sharing application. Experimental results show that, with iVCE, the separation of resource aggregation logic and business logic significantly eases the process of building scalable distributed applications. © 2011 Springer Science+Business Media, LLC & Science Press, China.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Communication delay analysis based on network calculus

Communication delay analysis based on network calculus

引用

2010 2nd International Conference on Software Technology and Engineering, ICSTE 2010

作者： Lin, Yufei Xu, Xinhai Lin, Yisong National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424486656

Network calculus is a promising theory for analyzing and modeling networks based on min-plus algebra. Using network calculus theory, we propose formulas of arrival curve and service curve for end-to-end communication, build the corresponding time model, and derive the communication delay formulas for two scenarios of the model respectively. Then we take fat tree topology, which is widely used in Infiniband interconnection, as an example to analyze the delay of one-to-all broadcast. This paper, as a groundwork, provides a new approach for the network researchers to delve communication delay in future researches. © 2010 IEEE.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

SemanticCast: Content-based data distribution over self-organizing semantic overlay networks

SemanticCast: Content-based data distribution over self-orga...

引用

11th International Conference on parallel and distributed Computing, Applications and Technologies, PDCAT 2010

作者： Zheng, Zhong Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769542874

Many applications demand distributing data with different contents efficiently in the network environment with unreliable links and a high node churn. Existing approaches mostly focus on optimizing either efficiency or robustness of data distribution, and fail to ensure both of them simultaneously. In this paper, we propose SemanticCast - a content-based data distribution approach over self-organizing semantic overlay networks. SemanticCast maintains a self-organizing semantic overlay based on view exchange (called Crowd). In Crowd, each node seeks neighbors with more similar interests by periodically exchanging its neighbor list (called view) with a chosen neighbor. Through these nodes' self-organizing behavior, various interest communities emerge in the overlay. For data distribution over Crowd, SemanticCast adopts random walk to route data between interest communities, and adopts flooding to disseminate data inside the interested communities. The experimental results show that compared to existing approaches, SemanticCast can support efficient content-based data distribution in the unreliable and highly dynamic network environment. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A task-mapping algorithm for performance simulation based on simulated annealing

A task-mapping algorithm for performance simulation based on...

引用

2011 International Conference on Computational and Information Sciences, ICCIS 2011

作者： Guo, Xiaowei Lin, Yufei Xu, Xinhai Zhang, Xin National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769545011

Nowadays, the scale of parallel computer systems is increasing, and simulation technology has become an important tool for performance prediction in the system development process. Task mapping approach is an important aspect affecting the performance of simulation. In this paper, in order to solve the task mapping problem in performance simulation, a task mapping algorithm based on simulated annealing is proposed, and we verified the correctness and effectiveness of the algorithm by experiments. Experimental results show that the algorithm has high efficiency, and can solve the large-scale problem with lower time cost. © 2011 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Detecting null dereference with a game

Detecting null dereference with a game

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Chen, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9783642345302

As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and bug" game. The purpose of the game is to utilize the rich distributed human resource to do the complex science work in a simple and pleasant way. Programs are transformed into visual puzzles first, and then the server collects information from the people playing the game. Finally the recorded metadata is translated back into the positions in the programs where null dereference may happen. The game has shown to be effective. © 2013 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Kernel fusion: An effective method for better power efficiency on multithreaded GPU

Kernel fusion: An effective method for better power efficien...

引用

2010 IEEE/ACM International Conference on Green Computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social Computing, CPSCom 2010

作者： Wang, Guibin Lin, YiSong Yi, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769543314

As one of the most popular accelerators, Graphics processing Unit (GPU) has demonstrated high computing power in several application fields. On the other hand, GPU also produces high power consumption and has been one of the most largest power consumers in desktop and supercomputer systems. However, software power optimization method targeted for GPU has not been well studied. In this work, we propose kernel fusion method to reduce energy consumption and improve power efficiency on GPU architecture. Through fusing two or more independent kernels, kernel fusion method achieves higher utilization and much more balanced demand for hardware resources, which provides much more potential for power optimization, such as dynamic voltage and frequency scaling (DVFS). Basing on the CUDA programming model, this paper also gives several different fusion methods targeted for different situations. In order to make judicious fusion strategy, we deduce the process of fusing multiple independent kernels as a dynamic programming problem, which could be well solved with many existing tools and be simply embedded into compiler or runtime system. To reduce the overhead introduced by kernel fusion, we also propose effective method to reduce the usage of shared memory and coordinate the thread space of the kernels to be fused. Detailed experimental evaluation validates that the proposed kernel fusion method could reduce energy consumption without performance loss for several typical kernels. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Checkpoint selection in fault recovery based on byzantine fault model 4th

Checkpoint selection in fault recovery based on byzantine fa...

引用

4th International Conference on Computational Intelligence and Communication Networks, CICN 2012

作者： Xu, Xinhai Lin, Yufei National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467329811

Nowadays, with the growth of the performance, the reliability problem of supercomputers becomes more and more serious. In order to complete an application with small fault recovery overhead, Checkpoint/Restart(C/R) methods are widely used. So far, the mainstream C/R methods are either based on Fail-Stop fault model or making the system(or program) do error detection before storing checkpoints, so they can ensure the correctness of every checkpoint. However, the faults occurring in the systems in real world are more accordant with the Byzantine fault model, and in order to pursue the higher practical performance, neither the system nor the program implements any fault detection mechanism. Consequently, there may be errors in the checkpoints. This paper studies the checkpoint selection problem that which checkpoint should be selected as the object of rolling back after system occurring failure, based on Byzantine fault model. We design a framework of checkpoint selection, and then, based on it, propose three checkpoint selection strategies: conservative strategy, aggressive strategy and statistical strategy. The simulation results show that: the conservative strategy shows its superiority when the error latent period is long, while the aggressive strategy behaves oppositely, the statistical strategy has a stable efficiency, only 50% more overhead compared to the ideal checkpoint selection when the checkpoint period is the half of mean time between faults. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：