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

Data distribution *** for domain decomposition applications in Grid environments

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

作者： Otero, Beatriz Cela, José M. Badia, Rosa M. Labarta, Jesús Dpt. d'Arquitectura de Computadors Universitat Politècnica de Catalunya Campus Nord C/ Jordi Girona 1-3 Modul D6 109 08034 Barcelona Spain

ISBN: (纸本)3540292357

In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balanced and unbalanced one. the balanced strategy is commonly strategy used in homogenous computing environment. this strategy presents some problems related with the larger communication latency in Grid environments. We propose an unbalanced domain decomposition strategy in order to overlap communication latency with useful computation. this idea consists in assigning less workload to processors responsible for sending updates outside the host. We compare the results obtained with the classical balanced strategy. We show that the unbalanced distribution pattern improves the execution times of domain decomposition applications in Grid environments. We considered two kinds of meshes, which define the most typical cases. We show that the expected execution time can be reduced up to 53%. We also analyze the influence of the communication patterns on execution times using the Dimemas simulator. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for DNA matching

A parallel architecture for DNA matching

引用

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

作者： Segundo, Edgar J. Garcia Neto Nedjah, Nadia De Macedo Mourelle, Luiza Department of Electronics Engineering and Telecommunications Faculty of Engineering State University of Do Rio de Janeiro Brazil Department of Systems Engineering and Computation Faculty of Engineering State University of Do Rio de Janeiro Brazil

ISBN: (纸本)9783642246685

DNA sequences can be often showed in fragments, little pieces, found at crime scene or in a hair sample for paternity exam. In order to compare that fragments with a subject or target sequence of a suspect, we need an efficient tool to analyze the DNA sequence alignment and matching. So DNA matching is a bioinformatics field that could find relationships functions between sequences, alignments and them try to understand it. Usually done by software through databases clusters analysis, DNA matching requires a lot of computational resources, what may increase the bioinformatics project budget. We propose the approach of a hardware parallel architecture, based on heuristic method, capable of reducing time spent on matching process. © 2011 Springer-Verlag.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Message from the ica3pp 2012 program 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 2期7440 LNCS卷 V页

作者： Stojmenovic, Ivan Apduhan, Bernady O. Wang, Guojun University of Ottawa SEECS Ottawa ON Canada Kyushu Sangyo University Fukuoka Japan Central South University Changsha Hunan Province China

来源：评论

学校读者我要写书评

暂无评论

A parallel simulated annealing approach for floorplanning in VLSI

引用

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

作者： Fang, Jyh-Perng Chang, Yang-Lang Chen, Chih-Chia Liang, Wen-Yew Hsieh, Tung-Ju Satria, Muhammad T. Han, Chin-Chuan Dept. of Elec. Eng. National Taipei Univ. of Tech. Taiwan Dept. of Comp. Sci. and Info. Eng. National Taipei Univ. of Tech. Taiwan Dept. of Comp. Sci. and Info. Eng. National United Univ.

ISBN: (纸本)3642030947

One of the critical issues in floorplanning is to minimize area and/or wire length of a given design with millions of transistors while considering other factors which may influence the success of design flow or even manufacturing. To deal with the floorplan design with enormous amount of interconnections and design blocks, we adopt a parallel computing environment to increase the throughput of solution space searching. Also, we include the fractional factorial analysis to further reduce the time needed to search the acceptable solution. the experimental results indicate that our approach can obtain better space utility rate and it takes less time than the traditional method and parallel method do. © 2009 Springer Berlin Heidelberg.

关键词： Utility rates

来源：评论

学校读者我要写书评

暂无评论

Message from the ica3pp 2011 program 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) 2011年第PART 1期7016 LNCS卷 VII页

作者： Xiang, Yang Cuzzocrea, Alfredo Hobbs, Michael Deakin University School of Information Technology Melbourne Burwood Campus 221 Burwood Highway Burwood VIC 3125 Australia Italy Deakin University School of Information Technology GeelongWaurn Ponds Campus Pigdons Road Geelong VIC 3217 Australia

来源：评论

学校读者我要写书评

暂无评论

parallel column subset selection of kernel matrix for scaling up support vector machines 15th

Parallel column subset selection of kernel matrix for scalin...

引用

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

作者： Wu, Jiangang Feng, Chang Gao, Peihuan Liao, Shizhong School of Computer Science and Technology Tianjin University Tianjin300072 China

Nystr6;m method and low-rank linearized Support Vector Machines (SVMs) are two widely used methods for scaling up kernel SVMs, both of which need to sample part of columns of the kernel matrix to reduce the size. ... 详细信息

ISBN: (纸本)9783319271361

Nyström method and low-rank linearized Support Vector Machines (SVMs) are two widely used methods for scaling up kernel SVMs, both of which need to sample part of columns of the kernel matrix to reduce the size. However, existing non-uniform sampling methods suffer from at least quadratic time complexity in the number of training data, limiting the scalability of kernel SVMs. In this paper, we pro- pose a parallel sampling method called parallel column subset selection (PCSS) based on the divide-and-conquer strategy, which divides the kernel matrix into several small submatrices and then selects columns in parallel. We prove that PCSS has a (1+ϵ) relative-error upper bound with respect to the kernel matrix. Further, we present two approaches to scaling up kernel SVMs by combining PCSS with Nyström method and lowrank linearized SVMs. the results of comparison experiments demonstrate the effectiveness, efficiency and scalability of our approaches. © Springer international Publishing Switzerland 2015.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Beyond Data parallelism: Identifying parallel tasks in sequential programs 15th

Beyond Data Parallelism: Identifying parallel tasks in seque...

引用

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

作者： Li, Zhen Zhao, Bo Jannesari, Ali Wolf, Felix Technische Universität Darmstadt Darmstadt64289 Germany Xi’an Jiaotong University Xi’an710049 China

ISBN: (纸本)9783319271392

Today, millions of legacy programs are awaiting their parallelization. For this reason, the automatic discovery of parallelism in sequential programs is now receiving considerable attention. However, past efforts mainly concentrated on data parallelism hidden inside loops. As programming models begin to support more irregular types of parallelism, centered around the notion of tasks in various forms, methods are needed to identify code sections that could potentially represent parallel tasks. In this paper, we present a novel approach to automatically finding parallel tasks in sequential programs. We first created a dynamic dependence graph, then isolated tasks, and finally produced a task graph according to the dependences we find. With the help of a source-to-source code translator, parallel code is automatically generated. We conducted a range of experiments to cover both tasks executing the same code and tasks executing different code. Results showed that our method achieved reasonable speedups on the test cases. © Springer international Publishing Switzerland 2015.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

iPLAR: Towards interactive programming with parallel linear algebra in R 15th

iPLAR: Towards interactive programming with parallel linear ...

引用

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

作者： Wang, Zhaokang Fan, Shiqing Gu, Rong Yuan, Chunfeng Huang, Yihua National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing University Nanjing210023 China

ISBN: (纸本)9783319271392

R is a widely-used statistical programming language in the data science community. However, in the big data era, R faces the challenges from large scale data analysis tasks. It lacks the ability of distributed linear algebra computation in its local interactive shell. In this paper, we propose iPLAR, a system that runs in the interactive R environment, wraps the high performance parallel linear algebra library, and provides a group of easy-to-use interfaces. iPLAR adopts the client-server model to uncouple the interactive shell from the ScaLAPACK/MPI distributed computing backend. In addition, it provides R users with a group of parallel-detail-transparent interfaces that are similar to the native R linear algebra interfaces. We evaluate the efficiency of iPLAR with representative basic matrix operations and two widely-used machine learning algorithms. Experimental results show that iPLAR achieves the near- linear data scalability and enhances the interactive processing capability of R to large problem scales. © 2015 Springer international Publishing Switzerland.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Automated Binary Analysis: A Survey 22nd

Automated Binary Analysis: A Survey

引用

22nd international conference on algorithms and architectures for parallel processing, ica3pp 2022

作者： Liu, Zian Chen, Chao Ejaz, Ahmed Liu, Dongxi Zhang, Jun Swinburne University of Technology Melbourne Australia Data6 61 CSIRO Clayton Australia Royal Melbourne Institute of Technology Melbourne Australia

ISBN: (纸本)9783031226762

Binary code analysis is a process of analyzing the software or operating system when source code is inaccessible. this scenario occurs when one needs to analyze malware, a compiled software, or a closed-sourced operating system such as Windows, IOS, etc. In these scenarios, the source codes are deliberately made inaccessible by the vendor or programmer for various reasons. Binary analysis contains a wide range of analysis aims, techniques and methodologies. We concluded the methodologies into two categories: data-driven analysis and software-engineering-based analysis. Each category has a similar process in their methodology. We also concluded their limitation and summaries the challenges and future work. © 2023, Springer Nature Switzerland AG.

关键词： Windows operating system

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for job scheduling in hierarchical HPC systems: A coloured petri nets method 15th

Performance analysis for job scheduling in hierarchical HPC ...

引用

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

作者： Li, Zhijia Jiao, Li Hu, Xiang State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783319271392

Distributed computing technology has been widely used to solve complex problems appearing in parallel processing systems. Job scheduling is very important in many distributed computing systems, like grid systems and high performance computers. their performance is directly related to the efficiency of the distributed computing systems. Modeling them and analyzing their performance can provide quantitative performance metrics and predictions, which are helpful to guide capacity planning and scheduling optimization. In this paper, we study job scheduling systems widespread in high performance computing systems and propose a coloured Petri net method for analyzing their performance, which can be easily implemented in CPN software by potential users. We also propose an approximative modeling technique so as to reduce the model size. As a model-based performance analysis method, our method is low cost and highly flexible. Experimental results show that our method is feasible and can be applied to more complex and large-scale systems. © Springer international Publishing Switzerland 2015.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：