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

Minimizing synchronization in IDR(s)

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS 2011年第5期18卷 805-825页

作者： Collignon, Tijmen P. van Gijzen, Martin B. Delft Univ Technol Fac Elect Engn Math & Comp Sci NL-2628 CD Delft Netherlands

IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems. With cluster computing and in particular with grid computing, the inner product is a bottleneck operation. In this paper, three techniques are investigated for alleviating this bottleneck. First, a recently proposed IDR(s) algorithm that is highly efficient and stable is reformulated in such a way that it has a single global synchronization point per iteration step. Second, the so-called test matrix is chosen so that the work, communication, and storage involving this matrix is minimized in multi-cluster environments. Finally, a methodology is presented for a-priori estimation of the optimal value of s using only problem and machine-based parameters. Numerical experiments applied to a 3D convection-diffusion problem are performed on the DAS-3 grid computer, demonstrating the effectiveness of our approach. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： iterative methods numerical linear algebra nonsymmetric linear systems IDR(s) cluster and grid computing performance model

来源：评论

学校读者我要写书评

暂无评论

An on-line algorithm for fair-share node allocations in a cluster 07

An on-line algorithm for fair-share node allocations in a cl...

引用

7th IEEE International Symposium on cluster computing and the grid

作者： Amar, Lior Barak, Amnon Levy, Ely Okun, Michael Hebrew Univ Jerusalem Dept Comp Sci IL-91904 Jerusalem Israel Weizmann Inst Sci Dept Neurobiol IL-76100 Rehovot Israel

ISBN: (纸本)9780769528335

Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an on-line algorithm for proportional share allocations of nodes in a cluster in a fashion that-resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper presents the algorithm and its performance on a MOSIX organizational grid with 60 nodes. W show that proportional share allocations can be achieved in a relatively short time (minutes).

关键词： cluster and grid computing grid management fair-share allocations proportional share algorithms

来源：评论

学校读者我要写书评

暂无评论

Wireless grid enables ubiquitous computing 16

Wireless grid enables ubiquitous computing

引用

16th International Conference on Parallel and Distributed computing Systems (PDCS 2003)

作者： Kurkovsky, S Bhagyavati Columbus State Univ Columbus GA 31907 USA

ISBN: (纸本)188084348X

In order to realize the goal of pervasive computing, we present a distributed mobile agent-based architecture for wireless computational grids in cellular networks. In this paper, we propose an architecture for a wireless grid that facilitates mobile devices to solve resource-intensive tasks by harnessing the power of other such devices. In a cellular network, this distribution is easily accomplished by the base station that can provide mediation and facilitation services. The resulting wireless grid will enable resource-weak mobile devices to accomplish computationally-intensive tasks faster and at less power cost to individual devices, thus enabling a truly ubiquitous computing environment [16]. We model the grid as a flexible, self-configuring dynamic network of independent, mobile, intelligent agents using each other's resources in order to solve a shared computational task. We also discuss several aspects of the architecture including agent roles, mobility issues, network configuration, parallel task distribution, and agent communication protocols. We conclude with implementation details of the proposed architecture that facilitates ubiquitous computing.

关键词： ubiquitous computing cluster and grid computing wireless networks and mobile computing algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel fuzzy c-means cluster analysis

Parallel fuzzy c-means cluster analysis

引用

7th International Conference on High Performance computing for Computational Science

作者： Modenesi, Marta V. Costa, Myrian C. A. Evsukoff, Alexandre G. Ebecken, Nelson F. F. Univ Fed Rio de Janeiro COPPE POB 68506 BR-21945970 Rio De Janeiro Brazil

ISBN: (纸本)9783540713500

This work presents an implementation of a parallel Fuzzy c-means cluster analysis tool, which implements both aspects of cluster investigation: the calculation of clusters' centers with the degrees of membership of records to clusters, and the determination of the optimal number of clusters for the data, by using the PBM validity index to evaluate the quality of the partition. The work's main contributions are the implementation of the entire cluster's analysis process, which is a new approach in literature, integrating to clusters calculation the finding of the best natural pattern present in data, and also, the parallel processing implementation of this tool, which enables this approach to be used with vary large volumes of data, a increasing need for data analysis in nowadays industries and business databases, making the cluster analysis a feasible tool to support specialist's decision in all fields of knowledge. The results presented in the paper show that this approach is scalable and brings processing time reduction as an benefit that parallel processing can bring to the matter of cluster analysis.

关键词： unsupervised classification fuzzy c-means cluster and grid computing

来源：评论

学校读者我要写书评

暂无评论

A service oriented system for on demand dynamic structural analysis over computational grids

A service oriented system for on demand dynamic structural a...

引用

7th International Conference on High Performance computing for Computational Science

作者： Alonso, J. M. Hernandez, V. Lopez, R. Molto, G. Univ Politecn Valencia Dept Sist Informat & Computac Camino Vera S-N Valencia 46022 Spain

ISBN: (纸本)9783540713500

In this paper we describe the implementation of a service oriented environment that enables to couple a parallel application, which performs the 3D linear dynamic structural analysis of high-rise buildings, to a grid computing infrastructure. The grid service, developed under Globus Toolkit 4, exposes the dynamic simulation as a service to the structural scientific community. It employs the GMarte middleware, a metascheduler that enables to perform the computationally intensive simulations on the distributed resources of a grid-based infrastructure.

关键词： parallel and distributed computing cluster and grid computing large scale simulations in all areas of engineering and science

来源：评论

学校读者我要写书评

暂无评论

Maintaining cache coherency for B⁺ tree indexes in a shared disks cluster

引用

6th International Conference on High Performance computing for Computational Science (VECPAR 2005)

作者： Ohn, K Cho, H Yeungnam Univ Dept Comp Engn Kyongsan 712749 South Korea

ISBN: (纸本)3540254242

A shared disks (SD) cluster couples multiple computing nodes for high performance transaction processing, and all nodes share a common database at the disk level. To reduce the number of disk access, the node may cache both data pages and index pages in its local memory buffer. In general, index pages are accessed more often and thus cached at more nodes than their corresponding data pages. Furthermore, tree-based indexes such as B+ trees require complicated operations, e.g., root-to-leaf traversal and structure modification operation due to a page split or a page concatenation. This means that it is strongly required to devise a dedicated cache coherency scheme for index pages that takes advantage of the semantics of their access. In this paper, we propose a new cache coherency scheme for B+ tree indexes in the SD cluster. The proposed scheme can reduce the message traffic between nodes and the number of tree re-traversals. Using a simulation model of the SD cluster, we show that the proposed scheme exhibits substantial performance improvement over the previous schemes.

关键词： cluster and grid computing data processing parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Minimizing paging tradeoffs applying coscheduling techniques in a Linux cluster

引用

5th International Conference on High Performance computing for Computational Science (VECPAR 2002)

作者： Giné, F Solsona, F Hernández, P Luque, E Univ Lleida Dept Informat & Ingn Ind Lleida 25001 Spain Univ Autonoma Barcelona Dept Informat E-08193 Barcelona Spain

ISBN: (纸本)3540008527

Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms.

关键词： cluster and grid computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：