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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

36 篇 会议
2 册 图书

馆藏范围

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

日期分布

学科分类号

33 篇 工学
- 33 篇 计算机科学与技术...
- 20 篇 软件工程
- 5 篇 信息与通信工程
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 生物医学工程（可授...
- 1 篇 化学工程与技术
- 1 篇 生物工程
10 篇 理学
- 8 篇 数学
- 2 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
2 篇 经济学
- 2 篇 应用经济学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

3 篇 parallel computi...
2 篇 software enginee...
2 篇 computer communi...
2 篇 parallel program...
2 篇 cuda
2 篇 database managem...
2 篇 mapreduce
2 篇 high performance...
2 篇 algorithm analys...
2 篇 gpu
1 篇 datalog
1 篇 co-design
1 篇 physiological si...
1 篇 parallel process...
1 篇 scalability
1 篇 snp
1 篇 parallelism
1 篇 distributed envi...
1 篇 stock market sim...
1 篇 gpgpu

机构

2 篇 computer network...
2 篇 beihang universi...
2 篇 school of comput...
2 篇 deakin universit...
2 篇 university of br...
2 篇 department of co...
1 篇 dalian maritime ...
1 篇 huizhou univ hui...
1 篇 univ s carolina ...
1 篇 school of data s...
1 篇 college of compu...
1 篇 univ valladolid ...
1 篇 hunan univ sci &...
1 篇 univ warsaw inte...
1 篇 dalian maritime ...
1 篇 charles univ pra...
1 篇 heilongjiang uni...
1 篇 chongqing instit...
1 篇 univ paris 08 ch...
1 篇 univ warwick dep...

作者

4 篇 huang zhen
3 篇 wang changjian
3 篇 peng yuxing
3 篇 you pengfei
2 篇 zhiyang li
2 篇 geyong min
2 篇 li dongsheng
2 篇 wanlei zhou
2 篇 hu minghao
2 篇 wenyu qu
2 篇 ivan stojmenovic
2 篇 xian-he sun
2 篇 tingting yang
2 篇 yulei wu
2 篇 lei liu
2 篇 hua guo
1 篇 fedak gilles
1 篇 garcia ana-barba...
1 篇 chen xinhai
1 篇 zhang jianlei

语言

38 篇 英文

检索条件"任意字段=14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014"

共 38 条记录，以下是11-20 订阅

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

详细简洁

排序：

thread Mapping and parallel Optimization for MIC Heterogeneous parallel Systems

Thread Mapping and Parallel Optimization for MIC Heterogeneo...

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ju, Tao Zhu, Zhengdong Wang, Yinfeng Li, Liang Dong, Xiaoshe Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Shenzhen Inst Informat Technol Shenzhen 518172 Peoples R China

ISBN: (纸本)9783319111940;9783319111933

there is no dedicated thread mapping method for Many Integrated Core (MIC) heterogeneous system in the traditional multithread programming model. the unreasonable thread mapping will lead the promising computing power of MIC coprocessor not to be fully exploited. In order to fully exploit the computing potential of MIC coprocessor, this paper discussed effective multi threads mapping strategies through comparing the computing performance and analyzing the performance differences between various mapping methods. Meanwhile, for the further exploiting the high computing power of MIC heterogeneous system, the specific program porting and performance optimization strategies were explored by using the k-means application program. Experimental results show that the proposed mapping and parallel optimization strategies are effective, which can be guide the programmer to port and optimize applications effectively to MIC heterogeneous parallel system.

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

A Platform for Stock Market Simulation with Distributed Agent-Based Modeling 1

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Wang, Chunyu Yu, Ce Wu, Hutong Chen, Xiang Li, Yuelei Zhang, Xiaotao Tianjin Univ Sch Comp Sci & Technol Tianjin 300072 Peoples R China Tianjin Univ Sch Econ & Management Tianjin Peoples R China

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111940;9783319111933

Agent-based modeling (ABM) has been widely used in stock market simulation. However, traditional simulations of stock markets with ABM on single computers are limited by the computing capability as breakthroughs in financial research need much larger amount of agents. this paper introduces a platform for stock market simulation with ABM focusing on large scale parallel agents in a distributed computing environment such as Cluster and Mpp. With the customized trade strategies inside the agents, the runtime system of the platform can distribute the massive amount of agents to multiple computing nodes automatically during the execution of the simulation. And agents exchange information with each other and the market through a uniform communication system. With this platform financial researchers can design their own financial model without caring about the complexity of parallelization and related problems. the sample simulation on the platform is verified to be compatible with the data from Euronext-NYSE and the platform shows fair scalability and performance under different parallelism configurations.

关键词： stock market simulation agent-based modeling parallel distributed environment

来源：评论

学校读者我要写书评

暂无评论

algorithms and architectures for parallel processing: ica3pp 2016 collocated workshops: SCDT, TAPEMS, BigTrust, UCER, DLMCS Granada, Spain, December 14-16, 2016 proceedings 16th

Algorithms and architectures for parallel processing: ICA3PP...

引用

16th international conference on algorithms and architectures for parallel processing - ica3pp 2016 Collocated Workshops: 1st Workshop on Supercomputing Co-Design Technology, SCDT-2016, 1st international Workshop on theoretical Approaches to Performance Evaluation, Modeling and Simulation, TAPEMS 2016, 1st international Workshop on Trust, Security and Privacy for Big Data, BigTrust 2016, 1st edition of the workshop on Ultrascale Computing for Early Researchers, UCER 2016 and 1st international Workshop on Data Locality in Modern Computing Systems, DLMCS 2016

作者： Carretero, Jesus

来源：评论

学校读者我要写书评

暂无评论

Generalized Approach to Scalability Analysis of parallel Applications 16th

Generalized Approach to Scalability Analysis of Parallel App...

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Antonov, Alexander Teplov, Alexey Moscow MV Lomonosov State Univ Moscow Russia

ISBN: (纸本)9783319499567;9783319499550

this article describes an approach to scalability analysis of parallel applications, which is a major part of the algorithm description used in AlgoWiki, the Open Encyclopedia of parallel Algorithmic Features. the proposed approach is based on the suggested definition of generalized scalability of a parallel application. this study uses joined and structured data on an application's execution and supercomputing co-design technologies. parallel application properties are studied by analyzing data collected from all available sources of its dynamic characteristics and information about the hardware and software platforms corresponding with the features of an algorithm and its implementation. this allows reasonable conclusion to be drawn regarding potential reasons of changes in the execution quality for any parallel applications and to compare the scalability of various programs.

关键词： Scalability Dynamic characteristics Efficiency parallel computing Supercomputing co-design

来源：评论

学校读者我要写书评

暂无评论

Repairing Multiple Data Losses by parallel Max-min Trees Based on Regenerating Codes in Distributed Storage Systems

Repairing Multiple Data Losses by Parallel Max-min Trees Bas...

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： You, Pengfei Peng, Yuxing Huang, Zhen Wang, Changjian Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783319111940;9783319111933

Due to high storage efficiency, erasure codes are recently used to provide high data reliability in distributed storage systems. When multiple data loses in system, regeneration time for them demands to be as short as possible so as to keep data availbility and reliability. Common way is to repair them one by one, which prolongs the regeneration time. Tree-structured regeneration may reduce regeneration time when regenerating one single node failure by relaying the network traffic, and is also extended to regenerate multiple data losses. In this paper, based on regenerating codes which achieve minimal network traffic during the regeneration, we consider reducing regeneration time by using multiple max-min trees to parallel regenerate multiple data losses. And we proposed an algorithm: bandwidth-sharing max-min algorithm (BSM2RC) to construct multiple parallel max-min trees. It realizes efficient bandwidth utilization by maximizing the minimal bottleneck edge weight of multiple regeneration trees, thus improve regeneration efficiency. Our simulation experiment shows that multiple parallel max-min trees reduce total regeneration time for multiple data losses significantly, and thus enhance system reliability, compared with existing regeneration scheme.

关键词： Distributed storage System Data regeneration Regenerating codes Regeneration tree Max-min tree Maximum spanning tree

来源：评论

学校读者我要写书评

暂无评论

PruX: Communication Pruning of parallel BFS in the Graph 500 Benchmark 18th

PruX: Communication Pruning of Parallel BFS in the Graph 500...

引用

18th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Jia, Menghan Zhang, Yiming Li, Dongsheng Mei, Songzhu Natl Univ Def Technol Changsha Peoples R China

ISBN: (纸本)9783030050511;9783030050504

parallel Breadth First Search (BFS) is a representative algorithm in Graph 500, the well-known benchmark for evaluating supercomputers for data-intensive applications. However, the specific storage model of Graph 500 brings severe challenge to efficient communication when computing parallel BFS in large-scale graphs. In this paper, we propose an effective method PruX for optimizing the communication of parallel BFS in two aspects. First, we adopt a scalable structure to record the access information of the vertices on each machine. Second, we prune unnecessary inter-machine communication for previously accessed vertices by checking the records. Evaluation results show that the performance of our method is at least six times higher than that of the original implementation of parallel BFS.

关键词： Breadth First Search Graph 500 Communication pruning

来源：评论

学校读者我要写书评

暂无评论

parallel Data processing in Dynamic Hybrid Computing Environment Using MapReduce 1

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Tang, Bing He, Haiwu Fedak, Gilles Hunan Univ Sci & Technol Sch Comp Sci & Engn Xiangtan 411201 Peoples R China Univ Lyon INRIA UCB Lyon 5668 UMR CNRS ENS Lyon LIP Lab Lyon France

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111940;9783319111933

A novel MapReduce computation model in hybrid computing environment called HybridMR is proposed in the paper. Using this model, high performance cluster nodes and heterogeneous desktop PCs in Internet or Intranet can be integrated to form a hybrid computing environment. In this way, the computation and storage capability of large-scale desktop PCs can be fully utilized to process large-scale datasets. HybridMR relies on a hybrid distributed file system called HybridDFS, and a time-out method has been used in HybridDFS to prevent volatility of desktop PCs, and file replication mechanism is used to realize reliable storage. A new node priority-based fair scheduling (NPBFS) algorithm has been developed in HybridMR to achieve both data storage balance and job assignment balance by assigning each node a priority through quantifying CPU speed, memory size and I/O bandwidth. Performance evaluation results show that the proposed hybrid computation model not only achieves reliable MapReduce computation, reduces task response time and improves the performance of MapReduce, but also reduces the computation cost and achieves a greener computing mode.

关键词： Hybrid Computing Environment Distributed File System MapReduce Volunteer Computing Fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

Creating Distributed Execution Plans with BobolangNG 16th

Creating Distributed Execution Plans with BobolangNG

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Bednarek, David Krulis, Martin Yaghob, Jakub Zavoral, Filip Charles Univ Prague Fac Math & Phys Parallel Architectures Algorithms Applicat Res Gr Malostranske Nam 25 Prague Czech Republic

ISBN: (纸本)9783319495835;9783319495828

Execution plans constitute the traditional interface between DBMS front-ends and back-ends;similar networks of interconnected operators are found also outside database systems. Tasks like adapting execution plans for distributed or heterogeneous runtime environments require a plan transformation mechanism which is simple enough to produce predictable results while general enough to express advanced communication schemes required for instance in skew-resistant partitioning. In this paper, we describe the BobolangNG language designed to express execution plans as well as their transformations, based on hierarchical models known from many environments but enhanced with a novel compile-time mechanism of component multiplication. Compared to approaches based on general graph rewriting, the plan transformation in BobolangNG is not iterative;therefore the consequences and limitations of the process are easier to understand and the development of distribution strategies and experimenting with distributed plans are easier and safer.

关键词： Execution plan Distributed computing Partitioning Distributed database Datalog Modeling language

来源：评论

学校读者我要写书评

暂无评论

GPU Acceleration of Finding Maximum Eigenvalue of Positive Matrices 1

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Tian, Ning Guo, Longjiang Ai, Chunyu Ren, Meirui Li, Jinbao Heilongjiang Univ Sch Comp Sci & Technol Harbin Peoples R China Key Lab Database & Parallel Comp Heilongjiang Peoples R China Univ S Carolina Upstate Div Math & Comp Sci Upstate Peoples R China

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111940;9783319111933

Matrix eigenvalue theory has become an important analysis tool in scientific computing. Sometimes, people do not need to find all eigenvalues but only the maximum eigenvalue. Existing algorithms of finding the maximum eigenvalue of matrices are implemented sequentially. With the increasing of the orders of matrices, the workload of calculation is getting heavier. therefore, traditional sequential methods are unable to meet the need of fast calculation for large matrices. this paper proposes a parallel algorithm named PA-ST to find the maximum eigenvalue of positive matrices by using similarity transformation which is implemented by CUDA (Computer Unified Device Architecture) on GPU (Graphic Process Unit). To the best of our knowledge, this is the first CUDA based parallel algorithm of calculating maximum eigenvalue of matrices. In order to improve the performance, optimization techniques are applied in this paper such as using the shared memory rather than the global memory to improve the speed of computation, avoiding bank conflicts by setting the span index, satisfying the principle of coalesced memory access, and by using single-precision floating-point arithmetic and the pinned memory to reduce the copy operation and obtain higher data transfer bandwidth between the host and the GPU device. the experimental results show that the similarity transformation technique can significantly shorten the running time compared to the sequential algorithm and the speedup ratio is nearly stable when the number of iterations increases. As the matrix order increases, the running time of the sequential algorithm and PA-ST increases correspondingly. Experiments also show that the speedup ratio of the PA-ST is between 2.85 and 35.028.

关键词： Maximum Eigenvalue Positive Matrix Similarity Transformation GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of OpenACC Compilers 16th

Comparative Analysis of OpenACC Compilers

引用

16th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Barba, Daniel Gonzalez-Escribano, Arturo Llanos, Diego R. Univ Valladolid Dept Informat Valladolid Spain

ISBN: (纸本)9783319499567;9783319499550

OpenACC has been on development for a few years now. the OpenACC 2.5 specification was recently made public and there are some initiatives for developing full implementations of the standard to make use of accelerator capabilities. there is much to be done yet, but currently, OpenACC for GPUs is reaching a good maturity level in various implementations of the standard, using CUDA and OpenCL as backends. Nvidia is investing in this project and they have released an OpenACC Toolkit, including the PGI Compiler. there are, however, more developments out there. In this work, we analyze different available OpenACC compilers that have been developed by companies or universities during the last years. We check their performance and maturity, keeping in mind that OpenACC is designed to be used without extensive knowledge about parallel programming. Our results show that the compilers are on their way to a reasonable maturity, presenting different strengths and weaknesses.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：