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

Accurate Parallel Algorithm for Adini Nonconforming Finite Element

Tsinghua science and Technology 2003年第2期8卷 145-150页

作者： LUO Ping(罗平) ZHOU Aihui(周爱辉) Department of Computer Science and Technology Tsinghua University Beijing 100084 China Institute of Computational Mathematics and Scientific Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100080 China

The solution of the biharmonic equation using Adini nonconforming finite elements are considered and results for the multi-parameter asymptotic expansions and extrapolation are reported. The Adini nonconforming finite element solution of the biharmonic equation is shown and it have a multi-parameter asymptotic error expansion and extrapolation. This expansion and a multi-parameter extrapolation technique are used to develop an accurate approximation parallel algorithm for the biharmonic equation. Finally, numerical results have verified the extrapolation theory.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

A (radical) proposal addressing the non-scalability of the irregular MPI collective interfaces

A (radical) proposal addressing the non-scalability of the i...

引用

25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Träff, Jesper Larsson Department of Scientific Computing Faculty of Computer Science University of Vienna Nordbergstrasse 15/3C A-1090 Vienna Austria

ISBN: (纸本)9780769543857

In both the regular and the irregular MPI collectives there is a correspondence between the argument lists and certain MPI derived datatypes. As a means to address and alleviate well-known memory and performance scalability problems in the irregular (or vector) collective interface definitions of MPI we propose to push this correspondence to its natural limit, and replace the interfaces of the MPI collectives with a new set of interfaces that specify all data sizes and displacements solely by means of derived datatypes. This reduces the number of collective (communication and reduction) interfaces from 16 to 10 (in the extreme to only 7), significantly generalizes the operations, unifies regular and irregular collective interfaces, makes it possible to decouple certain algorithmic decisions from the collective operation, and moves the interface scalability issue from the collective interfaces to the MPI derived datatypes. To complete the proposal we discuss the memory scalability of the derived datatypes and suggest a number of new datatypes for MPI, some of which may be of independent interest. Finally, we introduce additional, new functionality for scalable construction of datatypes as needed for the new collective interfaces. We give examples throughout of the benefits of this alternative set of collective interfaces. It is argued that an implementation can straightforwardly be undertaken within any reasonable MPI implementation. © 2011 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

An extended work-stealing Framework for mixed-mode parallel applications

An extended work-stealing Framework for mixed-mode parallel ...

引用

25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Wimmer, Martin Träff, Jesper Larsson Department of Scientific Computing Faculty of Computer Science University of Vienna Nordbergstrasse 15/3C A-1090 Vienna Austria

ISBN: (纸本)9780769543857

Parallelizing complex applications even for well-behaved parallel systems often calls for different parallelization approaches within the same application. In this paper we discuss three applications from the literature that for both reasons of efficiency and expressive convenience benefit from a mixture of task and more tightly coupled data parallelism. These three applications, namely Quicksort, list ranking, and LU factorization with partial pivoting, are paradigms for recursive, mixed-mode parallel algorithms that can neither easily nor efficiently be expressed in either a purely data-parallel or a purely task-parallel fashion. As a solution we present a shared-memory programming framework that allows tasks to dynamically spawn subtasks with a given degree of parallelism for implementing tightly coupled parallel parts of the algorithm. All three paradigmatic applications can naturally be expressed in this framework, which in turn can be supported by an extended, non-conventional work-stealing scheduler, which we also briefly sketch. Using our new algorithm for work-stealing with deterministic team-building we are able to show, beyond the improved, more natural implementability, in many cases better scalability and sometimes absolute performance than with less natural implementations based on pure task-parallelism executed with conventional work-stealing. Detailed performance results using an Intel 32-core system substantiate our claims. © 2011 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Accessing and steering the elastic OLAP cloud

Accessing and steering the elastic OLAP cloud

引用

35th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2012

作者： Ye, Sicen Chen, Peng Janciak, Ivan Brezany, Peter Research Group of Scientific Computing Faculty of Computer Science University of Vienna Nordbergstrasse 15/C/3 1090 Vienna Austria

ISBN: (纸本)9789532330724

A typical cloud platform provides capability of scalability, elasticity and fault tolerance. Moreover, it is designed to deal with high volumes of data on nearly unlimited number of machines. On-Line Analytical Processing (OLAP), a kernel part of modern decision support systems, allows interactive analysis of multidimensional data of varied granularity. A combination of the Cloud computing and OLAP technologies brings challenges in providing OLAP analysis services in distributed environments. This paper first presents an overview of our on-going research of Elastic OLAP Cloud Platform. Then it introduces our design and implementation of a multi-tier client system, which on one hand interacts with the Elastic OLAP Cloud platform, provides Web based Graphical User Interfaces for administration of virtual OLAP cubes and performing OLAP analysis queries, and on the other hand, interacts with the OGSA-DAI middleware to access heterogeneous data sources and load integrated data into the Elastic OLAP Cloud platform. The communication between the client and the platform is based on our home-grown OLAP Modeling Markup Language (OMML), which is also presented in this paper. © 2012 MIPRO.

关键词： Markup languages

来源：评论

学校读者我要写书评

暂无评论

Benchmarking and Extending SYCL Hierarchical Parallelism 2

Benchmarking and Extending SYCL Hierarchical Parallelism

引用

2nd Workshop on Hierarchical Parallelism for Exascale computing, HiPar 2021

作者： Deakin, Tom McIntosh-Smith, Simon Alpay, Aksel Heuveline, Vincent University of Bristol Department of Computer Science Bristol United Kingdom Universität Heidelberg Engineering Mathematics and Computing Lab and Interdisciplinary Center for Scientific Computing Heidelberg Germany

ISBN: (纸本)9781665411325

SYCL is an open-standard, parallel programming model for programming heterogeneous devices from Khronos. It allows single-source programming of diverse attached devices in a cross-platform manner in modern C++. SYCL provides different layers of parallel abstractions, including Same Instruction Multiple Thread (SIMT) kernels, data-parallel loop concurrency and hierarchical parallelism. We discuss Scoped Parallelism as an extension to the existing Hierarchical Parallelism in SYCL, and highlight the advantages and disadvantages of these models from the perspective of the programmer and an implementer of SYCL. In this paper, we compare writing benchmark programs using SIMT kernel, hierarchical parallelism and scoped parallelism paradigms, and present results running on a high-performance CPU and GPU. © 2021 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A novel mobile-cloud based healthcare framework for diabetes

A novel mobile-cloud based healthcare framework for diabetes

引用

7th International Conference on Health Informatics, HEALTHINF 2014 - Part of 7th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2014

作者： Salama, Maria Shawish, Ahmed Department of Computer Science British University in Egypt Cairo Egypt Department of Scientific Computing Ain Shams University Cairo Egypt

ISBN: (纸本)9789897580109

Healthcare is one of the most important sectors in all countries;consuming an average of 9.5% of their domestic product. Among the widely spread endemic diseases, Diabetes is particularly a non-cured one that consumes medical resources, follow-up efforts, regular set of diverse checkups, continual needs for physicians and medical supplies. The current advanced healthcare systems succeeded to be a reservoir of healthcare records focussing on emergency and medical imaging only. At the same time, most of the currently deployed systems cannot provide a daily follow up to patients as well as not being able to help governments to smartly allocate their medical resources. In this paper, we propose a comprehensive framework that incorporates Mobile and Cloud computing with data mining techniques to efficiently provide a real-time smart healthcare framework for Diabetes. Mobile application is emerged as a widely deployed communication tool between the patients and the proposed system hosted on the Cloud. The Cloud is incorporated to accommodate the system due to its known features that makes it possible to acquire continually fresh data from the field. The data is then processed through smart data mining techniques to extract knowledge and draw conclusions for governments. As discussed in the paper, the proposed framework promises a significant enhancement in the resources allocation and utilization, as well as provides a faster emergency response. The proposed architecture has been simulated using Junosphere, a cloud simulator, and it could represent a significant step towards future smart healthcare systems specialized to cover other endemic diseases. Copyright © 2014 SCITEPRESS - science and Technology Publications. All rights reserved.

关键词： Mobile cloud computing

来源：评论

学校读者我要写书评

暂无评论

A file search method based on intertask relationships derived from access frequency and RMC operations on files

引用

Lecture Notes in computer science

作者： Wu, Yi Otagiri, Kenichi Watanabe, Yousuke Yokota, Haruo Department of Computer Science Tokyo Institute of Technology Japan Global Scientific Information and Computing Center Tokyo Institute of Technology Japan

ISBN: (纸本)9783642230875

The tremendous growth in the number of files stored in filesystems makes it increasingly difficult to find desired files. Traditional keyword-based search engines are incapable of retrieving files that do not include keywords. To tackle this problem, we use file-access logs to derive intertask relationships for file search. Our observations are that 1) files related to the same task are frequently used together, and 2) a set of Rename, Move, and Copy (RMC) operations tends to initiate a new task. We have implemented a system named SUGOI, which detects two types of task, FI tasks and RMC tasks, from file-access logs. An FI task corresponds to a group of files frequently accessed together. An RMC task is generated by RMC operations and then constructs a graph of intertask relationships based on the influence of RMC operations and the similarity between tasks. In utilizing detected tasks and intertask relationships, our system expands the search results of a keyword-based search engine. Experiments using actual file-access logs indicate that the proposed approach significantly improves search results. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Online particle size estimation on one-pass edge detection and particle shape

Online particle size estimation on one-pass edge detection a...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Wang, Wei-Xing Bergholm, Fredrik Department of Computer Science and Technology Chongqing University of Posts and Telecommunications 400065 China Department of Scientific Computing Uppsala University Sweden

ISBN: (纸本)078039092X

In order to quickly and accurately estimate average size of densely packed aggregate particles on a moving conveyor belt, a new image processing method is studied, the method consists of the two major algorithms, the one is one-pass edge detection algorithm, and the other is the average size estimation based on image edge density. The method calculates average particle size without explicit delineating complicated aggregates. To prove the new method, two different aggregate samples were taken for testing, the testing result is satisfactory. The new method is much fast than ordinary particle segmentation algorithm, and is applicable for the image sequence of the densely packed complicated particles. ©2005 IEEE.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

High performance C++

High performance C++

引用

International Conference and Exhibition on High-Performance computing and Networking

作者： Wolf, K Holtz, A Lang, M Institute for Algorithms and Scientific Computing (SCAI) German National Research Center for Computer Science (GMD) Schloss Birlinghoven Sankt Augustin D-53754 Germany

ISBN: (纸本)3540593934

HPC++ is a object-oriented programming environment dedicated to distributed memory parallel computers. It is based on a process model and integrates various parallel programming paradigms. Modularisation, interfaces and dynamic configuration are basic features. Parallel prototypes may be encapsulated in subnets. In the context of an existing commercial CASE tool HPC++ will be used as target language for the translation from graphical design method into code. Within one year, exploitation of HPC++ will be started offering an object-oriented library on top of standard parallel runtime systems.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Integrable discretization of soliton equations via bilinear method and Backlund transformation

引用

science China Mathematics 2015年第2期58卷 279-296页

作者： ZHANG Ying Nan CHANG Xiang Ke HU Juan HU Xing Biao TAM Hon-Wah Institute of Computational Mathematics and Scientific Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Department of Applied Mathematics Zhejiang University of Technology Department of Computer Science Hong Kong Baptist University

We present a systematic procedure to derive discrete analogues of integrable PDEs via Hirota’s bilinear *** approach is mainly based on the compatibility between an integrable system and its B¨acklund *** apply this procedure to several equations,including the extended Korteweg-deVries(Kd V)equation,the extended Kadomtsev-Petviashvili(KP)equation,the extended Boussinesq equation,the extended Sawada-Kotera(SK)equation and the extended Ito equation,and obtain their associated semidiscrete *** the continuum limit,these differential-difference systems converge to their corresponding smooth *** these new integrable systems,their B¨acklund transformations and Lax pairs are derived.

关键词： integrable discretization bilinear method Backlund transformation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：