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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

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

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
86 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,674 篇 英文
33 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是401-410 订阅

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

详细简洁

排序：

A Cooperative Replica Placement Strategy for MP2P-CDN 15

A Cooperative Replica Placement Strategy for MP2P-CDN

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Tang, Yayuan Guo, Kehua Liang, Zhonghe Liu, Dengchao Cent S Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Hunan Univ Sci & Engn Sch Elect & Informat Engn Yongzhou 425199 Peoples R China Minjiang Univ Key Lab Informat Proc & Intelligent Control Fujia Fuzhou 350108 Fujian Peoples R China

ISBN: (纸本)9781538637906

Recent years, the content delivery service has been grown up widely. There are large amounts of providers for media content via CDN, MP2P network or MP2P-CDN system. In this paper, we present a new cooperation solution for MP2P-CDN to place the resource replicas: cooperative replica placement strategy. Different from others, our solution brings on effective management of placing replicas at CDN edge severs and mobile peers. By dividing replicas placement problem into 2 parts, we can profit all the advantages of CDN edge servers and MP2P network: the performance of CDN edge servers and the cheap cost of using mobile peers to distribute resources.

关键词： resources replica placement strategy MP2P-CDN load balance time delay

来源：评论

学校读者我要写书评

暂无评论

A Novel N-Retry Transactional Memory Model for Multi-thread Programming 15

A Novel <i>N</i>-Retry Transactional Memory Model for Multi-...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Lu, Kun Yan, Changhao Zhou, Hai Zhou, Dian Zeng, Xuan Fudan Univ State Key Lab ASIC & Syst Shanghai Peoples R China Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL 60208 USA Univ Texas Dallas Dept Elect Engn Richardson TX 75083 USA

ISBN: (纸本)9781538637906

Transaction memory (TM) is a programming friendly technology for thread synchronization in parallel programming paradigm. Transaction memory maintains Atomicity, Consistency, Isolation and Durability (ACID) characters of transactions. When data conflicts in multi-thread paradigm, the transaction has to be aborted, rolled back, and executed again and again until the transaction commits successfully. Although such infinitely retrying strategy of TM has only one exit and the programming flow of applications is very simple, its parallel efficiency is not high enough. In this paper, we proposed a new transaction memory model for parallel programming. When the transaction aborts N times for the reason of data conflict, we will append this transaction to the tail of task queue. We implement this N-retry TM model in software and hardware transaction memory platform. The experimental results show that the proposed TM model can reduce 40% of transaction aborts, and improve the parallel performance 25% on software TM platform and 11% on hardware TM platform.

关键词： multi-thread programming transaction memory intel Transactional Synchronization Extensions (TSX) transactional locking 2

来源：评论

学校读者我要写书评

暂无评论

A Memory Heterogeneity-Aware Runtime System for bandwidth-sensitive HPC applications 31

A Memory Heterogeneity-Aware Runtime System for bandwidth-se...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Chandrasekar, Kavitha Ni, Xiang Kale, Laxmikant V. Univ Illinois Urbana IL 61801 USA IBM TJ Watson Ctr New York NY USA

ISBN: (纸本)9780769561493

Today's supercomputers are moving towards deployment of many-core processors like Intel Xeon Phi Knights Landing (KNL), to deliver high compute and memory capacity. applications executing on such many-core platforms with improved vectorization require high memory bandwidth. To improve performance, architectures like Knights Landing include a high bandwidth and low capacity in-package high bandwidth memory (HBM) in addition to the high capacity but low bandwidth DDR4. Other architectures like Nvidia's Pascal GPU also expose similar stacked DRAM. In architectures with heterogeneity in memory types within a node, efficient allocation and data movement can result in improved performance and energy savings in future systems if all the data requests are served from the high bandwidth memory. In this paper, we propose a memory-heterogeneity aware runtime system which guides data prefetch and eviction such that data can be accessed at high bandwidth for applications whose entire working set does not fit within the high bandwidth memory and data needs to be moved among different memory types. We implement a data movement mechanism managed by the runtime system which allows applications to run efficiently on architectures with heterogeneous memory hierarchy, with trivial code changes. We show upto 2X improvement in execution time for Stencil3D and Matrix Multiplication which are important HPC kernels.

关键词： HPC Memory Heterogeneity Runtime System Scheduling

来源：评论

学校读者我要写书评

暂无评论

A Channel-Aware Expected Energy Consumption Minimization Strategy in Wireless Networks 15

A Channel-Aware Expected Energy Consumption Minimization Str...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Wang, Nao Wang, Gaocai Xie, Tianxiao Wang, Fangsu Guangxi Univ Sch Comp & Elect Informat Nanning Guangxi Peoples R China Guangxi Univ Guangxi Coll & Univ Key Lab Parallel & Distribute Nanning Guangxi Peoples R China

ISBN: (纸本)9781538637906

With the rapid development of wireless network technology, saving energy consumption has become a very important topic to build a green network in wireless networks. Due to the time-varying characteristics of the channel, it is possible to obtain a higher utilization for energy by using the channel with good state in wireless communication. From the view of the data transmission energy consumption of the whole wireless network, we proposed the Expected Energy Consumption Minimization Strategy (E2CMS) for data transmission based on the optimal stopping theory. The E2CMS delays the transmission of data until the best desired channel state is found, taking into account the maximum transmission delay and the given receiver power. In this paper, we first construct an energy consumption minimization problem with quality of service constraints. Then we prove that the E2CMS is a pure threshold strategy by the optimal stopping theory, and obtain the power threshold by solving a fixed-point equation using backward induction. Finally, simulations are carried out in a typical small-scale fading channel model. The E2CMS is compared with a variety of different transmission scheduling strategies. The results show that the E2CMS has smaller average energy consumption per unit of data and significantly improves the network performance

关键词： wireless networks channel awareness optimal stopping theory data transmission energy consumption optimization

来源：评论

学校读者我要写书评

暂无评论

Redesigning OP2 Compiler to Use HPX Runtime Asynchronous Techniques 31

Redesigning OP2 Compiler to Use HPX Runtime Asynchronous Tec...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Khatami, Zahra Kaiser, Hartmut Ramanujam, J. Louisiana State Univ Ctr Computat & Technol Baton Rouge LA 70803 USA STE AR Grp Noida India

ISBN: (纸本)9780769561493

Maximizing parallelism level in applications can be achieved by minimizing overheads due to load imbalances and waiting time due to memory latencies. Compiler optimization is one of the most effective solutions to tackle this problem. The compiler is able to detect the data dependencies in an application and is able to analyze the specific sections of code for parallelization potential. However, all of these techniques provided with a compiler are usually applied at compile time, so they rely on static analysis, which is insufficient for achieving maximum parallelism and producing desired application scalability. One solution to address this challenge is the use of runtime methods. This strategy can be implemented by delaying certain amount of code analysis to be done at runtime. In this research, we improve the parallel application performance generated by the OP2 compiler by leveraging HPX, a C++ runtime system, to provide runtime optimizations. These optimizations include asynchronous tasking, loop interleaving, dynamic chunk sizing, and data prefetching. The results of the research were evaluated using an Airfoil application which showed a 40-50% improvement in parallel performance.

关键词： HPX OP2 Asynchronous Task Execution Interleaving Loops Controlling Chunk Sizes Prefetching Data

来源：评论

学校读者我要写书评

暂无评论

CuSNMF: A Sparse Non-negative Matrix Factorization Approach for Large-Scale Collaborative Filtering Recommender Systems on Multi-GPU 15

CuSNMF: A Sparse Non-negative Matrix Factorization Approach ...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Li, Hao Li, Kenli Peng, Jiwu Li, Keqin Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China Natl Supercomputing Ctr Changsha Changsha 410082 Hunan Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

ISBN: (纸本)9781538637906

Matrix factorization (MF), as one of the most accurate and scalable approaches in dimension reduction techniques, has become popular in the collaborative filtering (CF) recommender systems communities. Currently, Non-negative Matrix Factorization (NMF) is one of the most famous approaches for MF, due to its representative non-negativity feature for CF model. However, it is non-trivial to obtain high performance of sparse NMF (SNMF) on Graphic processing Units (GPU) for large-scale problems, due to the redundant large-scale intermediate data, frequent matrices manipulation, and access on the sparse rating matrix with irregular distribution non-zero entries. In this work, we propose single-thread-based SNMF, which depends on the involved feature tuples multiplication and summation, and then, we present L-2 norm regularized single-thread-based SNMF. On that basis, a novel CUDA parallelization NMF approach (CuSNMF) is presented for GPU computing. Furthermore, to process large-scale CF data sets and make advantages of GPU computation power, we propose multi-GPU CuSNMF (MCuSNMF). Compared with state-of-the-art parallel algorithms, CCD++, and CUMF, MCuSNMF obtains the highest performance.

关键词： Collaborative filtering (CF) CUDA parallelization approach Multi-GPU Non-negative Matrix Factorization (NMF) Recommender systems L-2-norm regularization

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Full-Duplex D2D Communications in Multi-tier Heterogeneous Wireless Networks 15

Performance Analysis of Full-Duplex D2D Communications in Mu...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Xia, Shaoqi Chen, Bing Zhu, Kun Zhai, Xiangping Gong, Shimin Nanjing Univ Aeronaut & Astronaut Nanjing Jiangsu Peoples R China Shenzhen Inst Adv Technol Shenzhen Peoples R China

ISBN: (纸本)9781538637906

Full-duplex (FD) has been considered as a promising technology to significantly improve the spectrum efficiency in 5G networks. Considering the current self-interference cancellation (SIC) techniques, full-duplex is more suitable for device-to-device (D2D) and small cell communications which have small transmission range and low transmit power. However, the interference induced by full-duplex could reduce the performance gain, especially in high density multi-tier HetNets. Naturally, the performance analysis of full-duplex D2D communications in such environment is required. In this work, we present a tractable analytical model based on stochastic geometry. Specifically, the coverage probability and spectrum efficiency of D2D operations in different modes are analyzed considering both perfect SIC and imperfect SIC. And analytical expressions are obtained which are further evaluated by extensive simulations. The results indicate that in high-dense multi-tier HetNets, the increasing number of users transmitting in FD-D2D mode could impair the entire network throughput due to the interference incurred. However, with appropriate choice of proportions of users in different transmission modes, the performance gain of full-duplex D2D communications can be achieved. The results obtained can be helpful for optimal network deployment and operations.

关键词： Full-duplex device-to-device communications HetNets power control stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

Algorithmic Performance-Accuracy Trade-off in 3D Vision applications Using HyperMapper 31

Algorithmic Performance-Accuracy Trade-off in 3D Vision Appl...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Nardi, Luigi Bodin, Bruno Saeedi, Sajad Vespa, Emanuele Davison, Andrew J. Kelly, Paul H. J. Imperial Coll London Dept Comp London England Univ Edinburgh Inst Comp Syst Architecture Edinburgh Midlothian Scotland

ISBN: (纸本)9780769561493

In this paper we investigate an emerging application, 3D scene understanding, likely to be significant in the mobile space in the near future. The goal of this exploration is to reduce execution time while meeting our quality of result objectives. In previous work, we showed for the first time that it is possible to map this application to power constrained embedded systems, highlighting that decision choices made at the algorithmic design-level have the most significant impact. As the algorithmic design space is too large to be exhaustively evaluated, we use a previously introduced multi-objective random forest active learning prediction framework dubbed HyperMapper, to find good algorithmic designs. We show that HyperMapper generalizes on a recent cutting edge 3D scene understanding algorithm and on a modern GPU-based computer architecture. HyperMapper is able to beat an expert human hand-tuning the algorithmic parameters of the class of computer vision applications taken under consideration in this paper automatically. In addition, we use crowd-sourcing using a 3D scene understanding Android app to show that the Pareto front obtained on an embedded system can be used to accelerate the same application on all the 83 smart-phones and tablets with speedups ranging from 2x to over 12x.

关键词： design space exploration machine learning computer vision SLAM embedded systems GPU crowd-sourcing

来源：评论

学校读者我要写书评

暂无评论

An Efficient parallelization Approach for Large-scale Sparse Non-negative Matrix Factorization Using Kullback-Leibler Divergence on Multi-GPU 15

An Efficient Parallelization Approach for Large-scale Sparse...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Li, Hao Li, Kenli Peng, Jiwu Hu, Junyan Li, Keqin Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China Natl Supercomp Ctr Changsha Changsha 410082 Hunan Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

ISBN: (纸本)9781538637906

Matrix factorization (MF), as one of the most accurate and scalable approaches in dimension reduction techniques, has become popular in the collaborative filtering (CF) recommender systems, social network and graph communities. Currently, Kullback-Lerbler Non-negative Matrix Factorization (KL-NMF) is one of the most famous approaches for MF, due to its representative non-negativity feature of the CF model. However, it is non-trivial to obtain high performance KL-NMF on Graphic processing Units (GPU) for large-scale problems, due to the redundant large-scale intermediate data, frequent matrices manipulation, and access of sparse and irregular entries characteristic of KL-NMF. In this work, we propose single-thread-based KL-NMF, which depends on the involved feature tuples multiplication and summation, and then, we present L-2 norm regularized single-thread-based KL-NMF. On that basis, a novel CUDA parallelization KL-NMF approach (CuKL-NMF) is presented for GPU computing. Furthermore, to process large-scale CF data sets and make advantages of GPU computation power, we propose multi-GPU CuKL-NMF (MCuKL-NMF). Compared with state-of-the-art parallel algorithms, e.g., CUMF, CCD++, MCuKL-NMF obtains the highest performance.

关键词： Collaborative filtering (CF) CUDA parallelization approach Multi-GPU Non-negative Matrix Factorization (NMF) Recommender systems L-2-norm regularization

来源：评论

学校读者我要写书评

暂无评论

E²MC: Entropy Encoding Based Memory Compression for GPUs 31

E<SUP>2</SUP>MC: Entropy Encoding Based Memory Compression f...

引用

31st IEEE international parallel and distributed processing symposium (IPDPS)

作者： Lal, Sohan Lucas, Jan Juurlink, Ben Tech Univ Berlin Berlin Germany

ISBN: (纸本)9781538639146

Modern Graphics processing Units (GPUs) provide much higher off-chip memory bandwidth than CPUs, but many GPU applications are still limited by memory bandwidth. Unfortunately, off-chip memory bandwidth is growing slower than the number of cores and has become a performance bottleneck. Thus, optimizations of effective memory bandwidth play a significant role for scaling the performance of GPUs. Memory compression is a promising approach for improving memory bandwidth which can translate into higher performance and energy efficiency. However, compression is not free and its challenges need to be addressed, otherwise the benefits of compression may be offset by its overhead. We propose an entropy encoding based memory compression ((EMC)-M-2) technique for GPUs, which is based on the well-known Huffman encoding. We study the feasibility of entropy encoding for GPUs and show that it achieves higher compression ratios than state-of-the-art GPU compression techniques. Furthermore, we address the key challenges of probability estimation, choosing an appropriate symbol length for encoding, and decompression with low latency. The average compression ratio of (EMC)-M-2 is 53% higher than the state of the art. This translates into an average speedup of 20% compared to no compression and 8% higher compared to the state of the art. Energy consumption and energy-delayproduct are reduced by 13% and 27%, respectively. Moreover, the compression ratio achieved by (EMC)-M-2 is close to the optimal compression ratio given by Shannon's source coding theorem.

关键词： Energy Efficiency GPUs Huffman Compression Memory Bandwidth Memory Compression

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：