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

Remote class prefetching: Improving performance of Java applications on grid platforms 4th

4th international Symposium on parallel and distributed processing and applications

作者： Cardinale, Yudith De Oliveira, Jesus Figueira, Carlos Univ Simon Bolivar Dept Computac & Tecnol Informac Apartado 89000 Caracas 1080A Venezuela

ISBN: (纸本)9783540680673

In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid. These techniques are experimentally evaluated on two grid environments, by running test applications on two different grid deployment configurations. Our testbed is SUMA/G, a grid platform specifically targeted at executing Java bytecode on Globus grids. The experimental results show that these techniques can be effective on improving the performance of applications run on the grid, especially for compute intensive scientific applications.

关键词： Java applications class prefetching computational grids distributed applications collaborative platforms

来源：评论

学校读者我要写书评

暂无评论

Associativity-Aware Transaction processing Optimization for Web applications 28

Associativity-Aware Transaction Processing Optimization for ...

引用

IEEE 28th international conference on parallel and distributed Systems (IEEE ICPADS)

作者： Yu, Qianmian Zhou, Jing Shanghai Jiao Tong Univ Sch Software Shanghai Peoples R China

ISBN: (纸本)9781665473156

Web applications rely on database systems to store and manage data. Existing major databases use lock-based concurrency control to coordinate transactions. However, lock-based transaction processing can be expensive and result in unnecessary deadlocks because the database systems are oblivious to the application semantics, such as access patterns. This paper examines an issue commonly seen in web applications: inefficient associated accesses. They are problematic because they cause database systems to abort concurrent transactions frequently, degrading application performance. To address this issue, we build Railyzer, a tool that automatically analyzes web applications' database access patterns and provides possible optimization strategies. First, we establish a criterion to differentiate associated accesses from other accesses. Then, based on a language-agnostic analysis of the application, we create a method for identifying associated accesses. Finally, we use heuristics to locate inefficient ones and suggest fixes. We discovered 83 potential optimizations among the six open source applications. Some of these optimizations improve the application throughput by up to 70%.

关键词： Database Systems Concurrency Control Web applications

来源：评论

学校读者我要写书评

暂无评论

parallel data cube construction for high performance on-line analytical processing

Parallel data cube construction for high performance on-line...

引用

4th international conference on High-Performance Computing (HiPC 97)

作者： Goil, S Choudhary, A NORTHWESTERN UNIV DEPT ELECT & COMP ENGNEVANSTONIL 60201

ISBN: (纸本)0818680679

Decision support systems use On-Line Analytical processing (OLAP) to analyze data by posing complex queries that require different views of data. Traditionally, a relational approach (ROLAP) has been taken to build such systems. More recently, multi-dimensional database techniques (MOLAP) have been applied to decision-support applications. Data is stored in multidimensional arrays which is a natural way to express the multi-dimensionality of the enterprise and is more suited for analysis. Precomputed aggregate calculations in a Data cube can provide efficient query processing for OLAP applications. In this paper we present algorithms and results for in-memory data cube construction on distributed memory machines.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimising data movement rates for parallel processing applications on graphics processors

Optimising data movement rates for parallel processing appli...

引用

international conference on parallel and distributed Computing and Networks

作者： Harrison, Owen Waldron, John Trinity Coll Dublin Comp Architecture Grp Dublin 2 Ireland

ISBN: (纸本)9780889866379

Graphics processing units(GPUs) are starting to play an increasingly important role in non-graphical applications which are highly parallelisable. With the latest graphics cards boasting a theoretical 165GFlops and 54GB/s memory bandwidth spread across 48 ALUs it is easy to see why. The GPU architecture is particularly suited to the parallel stream processing paradigm of low levels of data dependency, high data to instruction ratio and predictable memory access patterns. One largely ignored, yet key, bottleneck for this type of processing on GPUs is both download and readback transfer performance to and from the graphics card. Existing tools provide great developer assistance in many areas of GPU application development, though provide very limited assistance in gaining the best bi-directional data transfer performance. In this paper, we discuss these limitations and present new investigative tools which allow general purpose processing GPU developers to explore the complex array of configuration states which affect both the download and readback performance.

关键词： parallel processing high performance computing graphics processors transfer rates

来源：评论

学校读者我要写书评

暂无评论

Towards the Reproducibility of Using DLS techniques in Scientific applications 16

Towards the Reproducibility of Using DLS Techniques in Scien...

引用

16th international Symposium on parallel and distributed Computing (ISPDC)

作者： Hoffeins, Franziska Ciorba, Florina M. Banicescu, Ioana Tech Univ Dresden Ctr Informat Serv & High Performance Comp D-01062 Dresden Germany Univ Basel Dept Math & Comp Sci CH-4051 Basel Switzerland Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA

ISBN: (纸本)9781538608623

Reproducibility of the execution of scientific applications on parallel and distributed systems is a growing interest, underlying the trustworthiness of the experiments and the conclusions derived from experiments. Dynamic loop scheduling (DLS) techniques are an effective approach towards performance improvement of scientific applications via load balancing. These techniques address algorithmic and systemic sources of load imbalance by dynamically assigning tasks to processing elements. The DLS techniques have demonstrated their effectiveness when applied in real applications. Complementing native experiments, simulation is a powerful tool for studying the behavior of parallel and distributed applications. This work is a comprehensive reproducibility study of experiments using DLS techniques published in earlier literature to verify their implementations into SimGrid-MSG. In earlier work, it was shown that having a detailed degree of information regarding the experiments to be reproduced is essential for a successful reproduction. This work concentrates on the reproduction of experiments with variable application behaviour and high degree of parallelism of applications and systems. It is shown that reproducing measurements of applications with high variance in task execution times is challenging, albeit feasible and useful. The success of the present reproducibility study signifies the fact that the implementation of the DLS techniques in SimGrid-MSG is verified for the considered applications and systems. Thus, it enables well-founded future research using the DLS techniques in simulation.

关键词： Verification via Reproducibility Simulation Scheduling Dynamic Loop Scheduling Scientific applications SimGrid-MSG High Variance of Task Execution Times

来源：评论

学校读者我要写书评

暂无评论

A survey and a taxonomy of approaches for testing parallel and distributed programs

A survey and a taxonomy of approaches for testing parallel a...

引用

1st ACS/IEEE international conference on Computer Systems and applications

作者： Al-Ladan, M Beirut Arab Univ Dept Elect & Comp Engn Beirut Lebanon

ISBN: (纸本)0769511651

Testing is a difficult and time-consuming part of the software development cycle. This is because an error may happen in an unexpected way at an unexpected spot. Testing and debugging parallel and distributed software are much more difficult than testing and debugging sequential software. This is due to the fact that errors are usually reproducible in sequential programs while they may not be reproducible in parallel and distributed programs. In addition, parallel and distributed programs introduce new types of errors and anomalies, race conditions and deadlocks, that do not exist in sequential software. In this paper I present a survey and a taxonomy of existing approaches for detecting race conditions and deadlocks in parallel and distributed programs. These approaches can be classified into two main classes. Static analysis techniques, and dynamic analysis techniques. I have subdivided further the static analysis techniques into three different subgroups: The concurrency analysis methods, The data-flow analysis methods, and the formal proof methods. A brief discussion and highlighting of main problems in most known approaches is given. The paper is concluded with tables summarizing the comparison between the surveyed approaches.

关键词： Software Engineering deadlock race conditions parallel and distributed programming

来源：评论

学校读者我要写书评

暂无评论

parallel calculation of accurate path lines using multi-block CFD datasets with changing geometry

Parallel calculation of accurate path lines using multi-bloc...

引用

international conference on parallel and distributed processing techniques and applications

作者： Gerndt, A Schirski, M Kuhlen, T Bischof, C Rhein Westfal TH Aachen Ctr Comp & Commun Aachen Germany

ISBN: (纸本)1892512459

In many cases, an elliptical system of partial differential equations (PDEs) has to be solved in order to compute a given flow problem. For domain decomposition, mainly the multi-block grid approach is used. A variety of flows are unsteady, thus the calculation of path lines is a common way of exploring the flow field. However, computing path lines is more complicated if the underlying grid geometry changes over time. We make use of a fragmented multi-block dataset for a parallelization approach to compute path lines. We describe our enhancements of VTK, the used basic toolkit for scientific visualization, which neither supports multi-block nor time-dependent datasets. Our extensions include the handling of unsteady datasets as well as adaptive step-size control and time-position-interpolation. Finally, we depict the results of our efforts in order to speed-up Computational Fluid Dynamics (CFD) explorations in Virtual Environments.

关键词： computational fluid dynamics multi grid interpolation parallel algorithms high-performance computing virtual reality

来源：评论

学校读者我要写书评

暂无评论

Special issue on parallel architectures and bioinspired algorithm: guest editors message

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2013年第8期25卷 1013-1014页

作者： Ignacio Hidalgo, J. Fernandez-de-Vega, Francisco UCM Parallel Architectures & Bioinspired Algortithms Madrid Spain Univ Extremadura Artificial Evolut Grp Merida Spain

This special issue includes the extended version of selected papers presented at the fourth parallel Architectures and Bioinspired Algorithms Workshop held in Galveston Island (TX, USA) on October 14, 2011 in conjunction with parallel Architectures and Compilation techniques (PACT). This workshop follows the success of the three previous workshops held in conjunction with PACT 2008 in Toronto, Canada [1], PACT 2009 in Raleigh, USA [2], and PACT 2010 in Vienna [3], Austria and the two previous Workshops on parallel Bioinspired Algorithms [4] held in Oslo, 2005, (together with IEEE international conference on parallel processing (ICPP)) [5] and London, 2007 (together with Association for Computing Machinery (ACM) Genetic and Evolutionary Computation conference (Gecco) 2007) [6]. These series of workshops has shown that knowledge fields such as parallel computer architectures and parallel and distributed Computing and Bioinspired Algorithms, which could seem quite different in a first approach, are able to find transversal elements that enrich them.

关键词： Computer Architecture parallel architectures Editors distributed computing algorithms Workshops CONJUNCTION parallel Lines workshops international conference AT-Rich Interactive Domain-Containing Protein 1A

来源：评论

学校读者我要写书评

暂无评论

Twenty Years of Automated Methods for Mapping applications on CGRA 36

Twenty Years of Automated Methods for Mapping Applications o...

引用

36th IEEE international parallel and distributed processing Symposium (IEEE IPDPS)

作者： Martin, Kevin J. M. Univ Bretagne Sud Lab STICC UMR CNRS 6285 Lorient France

ISBN: (纸本)9781665497473

Coarse-Grained Reconfigurable Architectures (CGRAs) emerged about 30 years ago. The very first CGRAs were programmed manually. Fortunately, some compilation approaches appeared rapidly to automate the mapping process. Numerous surveys on these architectures exist. Other surveys also gather the tools and methods, but none of them focuses on the mapping process only. This paper focuses solely on automated methods and techniques for mapping applications on CGRA and covers the last two decades of research. This paper aims at providing the terminology, the problem formulation, and a classification of existing methods. The paper ends with research challenges and trends for the future.

关键词： CGRA Mapping Compilation

来源：评论

学校读者我要写书评

暂无评论

Two parallel algorithms to solve the 2D knapsack problem using GPUs

Two parallel algorithms to solve the 2D knapsack problem usi...

引用

2008 international conference on parallel and distributed processing techniques and applications, PDPTA 2008

作者： Scherger, Michael Department of Computing Sciences Texas AandM University - Corpus Christi Corpus Christi TX United States

ISBN: (纸本)1601320841

This paper describes two parallel algorithms for the 2D knapsack (or cutting-stock) problem which is the optimal packing of multiples of n rectangular objects into a knapsack of size L ×;W and are only obtainable with guillotine-type (side to side) cuts. Here, we describe and analyze this problem for parallel computing with GPUs. These algorithms solve this NP class problem with a parallel algorithm that runs in O(W(n+L + W)) time using L processors, where LW for a 2D knapsack problem with a capacity of L × W. The new multiple IS version using LW processors and max(L,M) ISs runs in O(n+L + W) given practical hardware considerations. Both of these results are cost optimal with respect to the best sequential implementation. Moreover, an efficient GPGPU algorithm for this well-known problem should give insight to how the parallel computing using graphics processing units compares to other parallel models such as PRAM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：