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

11th IEEE International Symposium on High Performance distributed computing (HPDC-11)

作者： McCombs, JR Stathopoulos, A Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA

ISBN: (纸本)0769516866

Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in networks of clusters and Grids can impede the performance of applications not specifically tailored for use in such environments. A typical example is the traditional fine grain implementations of Krylov-like iterative methods, a central component in many scientific applications. To exploit the potential of these environments, advances in networking technology must be complemented by advances in parallel algorithmic design. In this paper we present an algorithmic technique that increases the granularity of parallel, block iterative methods by inducing additional work during the preconditioning (inexact solution) phase of the iteration. During this phase, each vector in the block is preconditioned by a different subgroup of processors, yielding a much coarser granularity The rest of the method comprises a small portion of the total time and is still implemented in fine grain. We call this combination of fine an coarse grain parallelism multigrain. We apply this idea to the block Jacobi-Davidson eigensolver and present experimental data that shows the significant reduction of latency effects on networks of clusters of roughly equal capacity and size. We conclude with a discussion on how multigrain can be applied dynamically based on runtime network performance monitoring.

关键词： Computer networks Concurrent computing Delay Eigenvalues and eigenfunctions Impedance Iterative algorithms Iterative methods parallel processing Resource management Workstations

来源：评论

学校读者我要写书评

暂无评论

Design, Analysis, Implementation and Deployment of a High-Performance, Out-of-Core, parallel, Dense Direct Linear Solver

Design, Analysis, Implementation and Deployment of a High-Pe...

引用

2nd International Conference on parallel, distributed, Grid and Cloud computing for Engineering

作者： Lize, B. Sylvand, G. EADS Innovat Works Appl Math Suresnes France EADS Innovat Works Appl Math Toulouse France

ISBN: (纸本)9781905088423

We present the design, implementation and deployment of SPIDO2, a massively parallel out-Of-Core direct dense linear solver used by Boundary Element Method (BEM) codes developed at EADS InnovationWorks, and currently in production in all EADS business units. It is designed as a high performance drop-in replacement for a legacy solver, uniformly achieves very good scalability up to several hundreds cores (>= 80% of peak performance), is portable and takes into account the new context of HPC, leveraging OpenMP and MPI for intra/inter-node parallelism. We provide here a detailed analysis of the algorithms and data structures used to achieve a very efficient out-of-core parallel decomposition (LU and LDLt), including run-time complexity validating the design choices. We then describe the implementation, benchmarks and validation methodology that led to the deployment of this solver in the BEM codes, and we finally provide insights on how we expect this design to be well-suited to the current and future advances in HPC technology.

关键词： boundary elements integral equations direct solver out-of-core parallel solver scalability scientific software architecture high performance computing

来源：评论

学校读者我要写书评

暂无评论

Improved parallel algorithm for delaunay triangulation on distributed memory parallel computers

Improved parallel algorithm for delaunay triangulation on di...

引用

proceedings of the 1997 Conference on advances in parallel and distributed computing

作者： Lee, Sangyoon Park, Chan-Ik Park, Chan-Mo POSTECH Pohang Korea Republic of

Delaunay triangulation has been much used in such applications as volume rendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulation is large computation time required to obtain the triangulation on an input points set. This time can be reduced by using more than one processors, and several parallel algorithms for Delaunay triangulation have been proposed. In this paper, we propose an improved parallel algorithm for Delaunay triangulation, which partitions the bounding convex region of the input points set into a number of regions by using Delaunay edges and generates Delaunay triangles in each region by applying an incremental construction approach. Partitioning by Delaunay edges makes it possible to eliminate merging step required for integrating subresults. It is shown from the experiments that the proposed algorithm has good load balance and is more efficient than Cignoni et al.'s algorithm[8] and our previous algorithm[9].

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Join Operations to Enhance Performance in Hadoop MapReduce Environment 5th

Join Operations to Enhance Performance in Hadoop MapReduce E...

引用

5th International Conference on Frontiers in Intelligent computing - Theory and Applications (FICTA)

作者： Pagadala, Pavan Kumar Vikram, M. Eswarawaka, Rajesh Reddy, P. Srinivasa JNTUH Bharat Inst Engn Technol Hyderabad India JNTUA Sri Venkateswara Coll Engn Anantapur Andhra Pradesh India Dayananda Sagar Univ Bangalore Karnataka India

ISBN: (纸本)9789811031564;9789811031557

Analyzing large data sets is gaining more importance because of its wide variety of applications in parallel and distributed environment. Hadoop environment gives more flexibility to programmers in parallel computing. One of the advantages of Hadoop is query evaluation over large datasets. Join operations in query evaluation plays a major role over the large data. This paper Ferret outs the earlier solutions, prolongs them and recommends a new approach for the implementation of joins in Hadoop.

关键词： Hadoop Query evaluation distributed environment Performance analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

Modeling and identifying bottlenecks in EOSDIS

Modeling and identifying bottlenecks in EOSDIS

引用

proceedings of the 1996 6th Symposium on the Frontiers of Massively parallel computing, Frontiers'96

作者： Demmel, J. Ivory, M.Y. Smith, Sh.L.

Many parallel application areas that exploit massive parallelism, such as climate modeling, require massive storage systems for the archival and retrieval of data sets. As such, advances in massively parallel computation must be coupled with advances in mass storage technology in order to satisfy I/O constraints of these applications. We demonstrate the effects of such I/O-computation disparity for a representative distributed information system, NASA's Earth Observing System distributed Information System (EOSDIS). We use performance modeling to identify bottlenecks in EOSDIS for two representative user scenarios from climate change research.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of an efficient algorithm for coordinated checkpointing in distributed systems

Design and analysis of an efficient algorithm for coordinate...

引用

proceedings of the 1997 Conference on advances in parallel and distributed computing

作者： Cao, Jiannong Jia, Weijia Jia, Xiaohua Cheung, To-yat City Univ of Hong Kong Kowloon Hong Kong

A synchronous checkpointing algorithm coordinates a set of processes in taking checkpoints in such a way that the set of local checkpoints always forms part of a consistent global system state. Whenever a process p requests to take a checkpoint, a set of processes, called the cohorts set of p, must be checked and some of them may also have to take their checkpoints in order to preserve system consistency. Although several synchronous checkpointing algorithms have been proposed in the literature, most of them do not address the performance issue. In this paper we propose an efficient distributed algorithm for synchronous checkpointing. Proof of correctness and analysis of efficiency of the algorithm are presented. It is shown that the algorithm has a better message and time complexity than the existing algorithms. The method proposed in this paper can also be applied to enhance the performance of rollback operation which always require synchronization of the inter-dependent processes.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Implementation of efficient and reliable multicast servers

Implementation of efficient and reliable multicast servers

引用

proceedings of the 1997 Conference on advances in parallel and distributed computing

作者： Jia, Weijia Lee, Chan H. Jia, Xiaohua Cao, Jiannong City Univ of Hong Kong Hong Kong Hong Kong

Reliable multicast services in a group of autonomous distributed processes/sites are desirable to maintain the consistent state of shared information accessed by transactions in distributed systems. Many existing protocols are complicated and thus quite expensive and not efficient for availability of distributed systems. This paper discusses the design and implementations of a new logical token ring based multicast communications services. It provides total ordering, atomicity of multicast messages, membership and fault-tolerant services in the presence of sites fail stop and network partitioning. An unique feature of the protocol is that all members, knowing exactly, in the group, who holds the token, are able to detect right order of a multicast message, thereby, reducing the synchronous overhead, preventing possible token lose problem and minimizing control messages. The services are implemented by using finite state machine approach and they are highly efficient comparing with related services in the same network settings.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Multithreaded processor designed for distributed shared memory systems

Multithreaded processor designed for distributed shared memo...

引用

proceedings of the 1997 Conference on advances in parallel and distributed computing

作者： Gruenewald, Winfried Ungerer, Theo Univ of Karlsruhe Karlsruhe Germany

The multithreaded processor - called Rhamma - uses a fast context switch to bridge latencies caused by memory accesses or by synchronization operations. Load/store, synchronization, and execution operations of different threads of control are executed simultaneously by appropriate functional units. A fast context switch is performed whenever a functional unit comes across an operation that is destined for another unit. The overall performance depends on the speed of the context switch. We present two techniques to reduce the context switch cost to at most one processor cycle: A context switch is explicitly coded in the opcode, and a context switch buffer is used. The load/store unit shows up as the principal bottleneck. We evaluate four implementation alternatives of the load/store unit to increase processor performance.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

distributed Deep Learning for Remote Sensing Data Interpretation

引用

proceedings OF THE IEEE 2021年第8期109卷 1320-1349页

作者： Haut, Juan M. Paoletti, Mercedes E. Moreno-Alvarez, Sergio Plaza, Javier Rico-Gallego, Juan-Antonio Plaza, Antonio Natl Distance Educ Univ Higher Sch Comp Engn Dept Commun & Control Syst Madrid 28015 Spain Univ Malaga Sch Comp Sci & Engn E-29071 Malaga Spain Univ Extremadura Dept Comp Syst Engn & Telemat Caceres 10003 Spain Univ Extremadura Dept Technol Comp & Commun Hyperspectral Comp Lab Escuela Politecn Caceres 10003 Spain

As a newly emerging technology, deep learning (DL) is a very promising field in big data applications. Remote sensing often involves huge data volumes obtained daily by numerous in-orbit satellites. This makes it a perfect target area for data-driven applications. Nowadays, technological advances in terms of software and hardware have a noticeable impact on Earth observation applications, more specifically in remote sensing techniques and procedures, allowing for the acquisition of data sets with greater quality at higher acquisition ratios. This results in the collection of huge amounts of remotely sensed data, characterized by their large spatial resolution (in terms of the number of pixels per scene), and very high spectral dimensionality, with hundreds or even thousands of spectral bands. As a result, remote sensing instruments on spaceborne and airborne platforms are now generating data cubes with extremely high dimensionality, imposing several restrictions in terms of both processing runtimes and storage capacity. In this article, we provide a comprehensive review of the state of the art in DL for remote sensing data interpretation, analyzing the strengths and weaknesses of the most widely used techniques in the literature, as well as an exhaustive description of their parallel and distributed implementations (with a particular focus on those conducted using cloud computing systems). We also provide quantitative results, offering an assessment of a DL technique in a specific case study (source code available: https://***/mhaut/cloud-dnn-HSI). This article concludes with some remarks and hints about future challenges in the application of DL techniques to distributed remote sensing data interpretation problems. We emphasize the role of the cloud in providing a powerful architecture that is now able to manage vast amounts of remotely sensed data due to its implementation simplicity, low cost, and high efficiency compared to other parallel and distributed

关键词： Remote sensing Cloud computing distributed databases Earth Data processing Big Data Computer architecture Big data cloud computing deep learning (DL) parallel and distributed architectures remote sensing

来源：评论

学校读者我要写书评

暂无评论

Definition of control variables for automatic performance modeling

Definition of control variables for automatic performance mo...

引用

International Conference on advances in parallel and distributed computing

作者： Mierendorff, H Schwamborn, H GMD - German Natl Research Cent for Information Technology Sankt Augustin Germany

ISBN: (纸本)0818678763

Automatic model generation is studied as part of a hybrid modeling strategy using simulation for performance analysis. Two major steps have to be carried out in this context. The program which is being investigated has to be translated into a model. During the translation, runtime has to be estimated for numerous computational blocks of statements which are replaced by simple delays. For performance estimation, the model has finally to be analyzed by an evaluation teal. Model evaluation as well as runtime estimation of computational blocks requires values of some variables, the control variables. We discuss the problem of automatic definition of control variables in general and consider some important cases. For the implementation of a model generating tool, we concentrate on parallel Fortran programs using message passing primitives for processes communication.

关键词： automatic performance modeling control variable definition parallel program

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：