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

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Benmounah, Zakaria Batouche, Mohamed Computer Science Department College of NTIC Constantine University 2 25000 Constantin Algeria

ISBN: (纸本)9783319038582

With the development of microarray technology, it is possible now to study and measure the expression profiles of thousands of genes simultaneously which can lead to identify subgroup of specific disease or extract hidden relationships between genes. One computational method often used to this end is clustering. In this paper, we propose a parallel distributed system for gene expression profiling (PDS-GEF) which provides a useful basis for individualized treatment of a certain disease such as Cancer. the proposed approach is based on two major techniques: the GIM (Generalized Island Model) and clustering ensemble. GIMs are used to generate good quality clusterings which are refined by a consensus function to get a high quality clustering. PDS-GEF system is implemented using Matlab®'s PCT (parallel Computing Toolbox™) which runs on a desktop computer, and tested on 34 different publicly available gene expression data sets. the obtained results compete with and even outperform existing methods. © Springer international Publishing Switzerland 2013.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Layer-based scheduling of parallel tasks for heterogeneous cluster platforms

Layer-based scheduling of parallel tasks for heterogeneous c...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Dümmler, Jörg Rünger, Gudula Technische Universität Chemnitz Department of Computer Science 09107 Chemnitz Germany

ISBN: (纸本)9783319038582

the programming model of parallel tasks is a suitable programming abstraction for parallel applications running on heterogeneous clusters, which are clusters composed of multiple subclusters. In this model, an application is decomposed into parallel tasks, each of which can be executed on an arbitrary number of processors. the advantage of this programming approach is that each task only needs to be implemented for a homogeneous environment while the complete application can still benefit fromthe entire performance of the heterogeneous cluster by a concurrent execution of independent parallel tasks on different subclusters. the execution of such an application on a specific platform is controlled by a schedule that maps each parallel task onto a set of processors. In this article, we propose an algorithm for the scheduling of parallel tasks with precedence constraints on heterogeneous clusters. this algorithm is an extension of a layer-based scheduling approach for homogeneous platforms with an additional phase that assigns the parallel tasks to appropriate subclusters. three different versions of this additional phase are considered. An experimental evaluation, based on simulation results as well as on measurements with different application benchmarks, shows that the proposed scheduling approach outperforms existing scheduling algorithms in most situations. © Springer international Publishing Switzerland 2013.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A massively parallel hardware for modular exponentiations using the m-ary method

A massively parallel hardware for modular exponentiations us...

引用

10th international conference algorithms and architectures for parallel processing, ica3pp 2010

作者： Farias, Marcos Santana De Souza Raposo, S. Nedjah, Nadia De Macedo Mourelle, L. Department of Electronics Engineering and Telecommunications Engineering Faculty State University of Rio de Janeiro Brazil Department of System Engineering and Computation Engineering Faculty State University of Rio de Janeiro Brazil

ISBN: (纸本)3642131352

Most of cryptographic systems are based on modular exponentiation. It is performed using successive modular multiplications. One way of improving the throughput of a cryptographic system implementation is reducing the number of the required modular multiplications. Existing methods attempt to reduce this number by partitioning the exponent in constant or variable size windows. In this paper, in the purpose of further accelerating the computation of modular exponentiation, a concurrent novel approach is proposed along with hardware implementation of the concurrent m-ary method. We compare the proposed method to the sequential implementation. © Springer-Verlag Berlin Heidelberg 2010.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

parallel implementations of Gusfield's cut tree algorithm

Parallel implementations of Gusfield's cut tree algorithm

引用

11th international conference on algorithms and architectures for parallel processing, ica3pp 2011

作者： Cohen, Jaime Rodrigues, Luiz A. Silva, Fabiano Carmo, Renato Guedes, André L. P. Duarte Jr., Elias P. Federal University of Paraná Department of Informatics Curitiba Brazil Paraná State University at Ponta Grossa Department of Informatics Ponta Grossa Brazil Western Paraná State University Department of Computer Science Cascavel Brazil

ISBN: (纸本)9783642246494

this paper presents parallel versions of Gusfield's cut tree algorithm. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have many applications in combinatorial optimization and in the analysis of networks originated in many applied fields. However, surprisingly few works have been published on the practical performance of cut tree algorithms. this paper describes two parallel versions of Gusfield's cut tree algorithm and presents extensive experimental results which show a significant speedup on most real and synthetic graphs in our dataset. © 2011 Springer-Verlag.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

BIDE-based parallel mining of frequent closed sequences with MapReduce

BIDE-based parallel mining of frequent closed sequences with...

引用

12th international conference on algorithms and architectures for parallel processing, ica3pp 2012

作者： Yu, Dongjin Wu, Wei Zheng, Suhang Zhu, Zhixiang School of Computer Hangzhou Dianzi University Hangzhou China Zhejiang Provincial Key Laboratory of Network Technology and Information Security Hangzhou China

ISBN: (纸本)9783642330643

parallel processing is essential to mining frequent closed sequences from massive volume of data in a timely manner. On the other hand, MapReduce is an ideal software framework to support distributed computing on large data sets on clusters of computers. In this paper, we develop a parallel implementation of BIDE algorithm on MapReduce, called BIDE-MR. It iteratively assigns the tasks of closure checking and pruning to different nodes in cluster. After one round of map-combine-partition-reduce, the closed frequent sequences with round-specific length and the candidates for the next round of computation are generated. Since the candidates and their pseudo project databases are independent with each other, BIDE-MR achieves high speed-ups. We implement BIDE-MR on an Apache Hadoop cluster and use BIDE-MR to mine the vehicles which frequently appear together from massive records collected at different monitoring sites. the results show that BIDE-MR attains good parallelization. © 2012 Springer-Verlag.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Visuel: A novel performance monitoring and analysis toolkit for cluster and grid environments

引用

6th international conference on algorithms and architectures for parallel processing, ica3pp

作者： Li, Kuan-Ching Cheng, Hsiang-Yao Yang, Chao-Tung Hsu, Ching-Hsien Wang, Hsiao-Hsi Hsu, Chia-Wen Hung, Sheng-Shiang Chang, Chia-Fu Liu, Chun-Chieh Pan, Yu-Hwa Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung 43301 Taiwan High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung 40704 Taiwan Department of Computer Science and Information Engineering Chung Hua University Hsinchu 300 Taiwan

ISBN: (纸本)3540292357

the computing power provided by high performance low-cost PC-based Cluster and Grid platforms are attractive, and they are equal or superior to supercomputers and mainframes widely available. In this research paper, we present the design rationale and implementation of Visuel, a toolkit for performance measurement and analysis of MPI parallel programs and real time resources monitoring in cluster and grid computing environments. the proposed toolkit is web-based interface to show performance activities of all computing nodes involved in the execution of a MPI parallel program, such as CPU and memory usage levels of each computing node, and monitors all computing nodes of a computing platform by displaying real time performance data. In addition, this toolkit is able to display comparative performance data charts of multiple executions of MPI parallel application under investigation, which facilitates the "what-if" analysis. the usage of this toolkit shows that it outperforms in easing the process of investigation of parallel applications. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

algorithms and architectures for parallel processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Xian-he Sun Wenyu Qu Ivan Stojmenovic Wanlei Zhou Zhiyang Li Tingting Yang Hua Guo Geyong Min Yulei Wu Lei Liu

ISBN: (数字)9783319111971

ISBN: (纸本)9783319111964

this two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th international conference on algorithms and architectures for parallel processing, ica3pp 2014, held in Dalian, China, in August 2014. the 70 revised papers presented in the two volumes were selected from 285 submissions. the first volume comprises selected papers of the main conference and papers of the 1st international Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th international Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th international Workshop on Wireless Networks and Multimedia, WNM 2014. the second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.

关键词： Algorithm Analysis and Problem Complexity Software Engineering Computer Communication Networks Database Management

来源：评论

学校读者我要写书评

暂无评论

algorithms and architectures for parallel processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Xian-he Sun Wenyu Qu Ivan Stojmenovic Wanlei Zhou Zhiyang Li Hua Guo Geyong Min Tingting Yang Yulei Wu Lei Liu

ISBN: (数字)9783319111940

ISBN: (纸本)9783319111933

关键词： Algorithm Analysis and Problem Complexity Software Engineering Computer Communication Networks Database Management

来源：评论

学校读者我要写书评

暂无评论

Efficient representations of row-sorted 1-variant matrices for parallel string applications

Efficient representations of row-sorted 1-variant matrices f...

引用

7th international conference on algorithms and architectures for parallel processing, ica3pp 2007

作者： Alves, Carlos Eduardo Rodrigues Cáceres, Edson Norberto Song, Siang Wun Universidade São Judas Tadeu Brazil Universidade Federal de Mato Grosso do Sul Brazil Universidade de São Paulo Brazil

ISBN: (纸本)9783540729044

We investigate the efficient storage of row-sorted 1-variant (m + 1) X (n + 1) matrices, m > n, that have the following properties: the rows are sorted in strictly increasing order and the set of elements of each row differs only by one single element from the set of elements of the next row. It has been shown that row-sorted 1-variant matrices are important in several parallel string comparison applications. Due to the large amount of redundancy in the row elements, we investigate efficient data structures to store such matrices. In this paper we propose a representation that stores a row-sorted 1-variant matrix in O(m log m) space and access time of O(log m) and can be constructed in O(m log m) time. We thus seek a representation that constitutes a nice balance between access time, representation construction time, and space requirement. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Message from the ica3pp 2012 general chairs

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年第PART 1期7439 LNCS卷 IV页

作者： Nakano, Koji Zomaya, Albert Xiang, Yang Hiroshima University Higashi-Hiroshima Japan University of Sydney NSW Australia Deakin University Burwood VIC Australia

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：