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

parallel query processing on distributed clustering indexes

JOURNAL OF DISCRETE ALGORITHMS 2009年第1期7卷 3-17页

作者： Gil-Costa, Veronica Marin, Mauricio Reyes, Nora Univ Nacl San Luis San Luis Argentina Univ Santiago Chile Yahoo! Res Latin Amer Santiago Chile

Similarity search has been proved suitable for searching in large collections of unstructured data objects. A number of practical index data structures for this purpose have been proposed. All of them have been devised to process single queries sequentially. However, in large-scale systems such as Web Search Engines indexing multi-media content, it is critical to deal efficiently with streams of queries rather than with single queries. In this paper we show how to achieve efficient and scalable performance in this context. To this end we transform a sequential index based on clustering into a distributed one and devise algorithms and optimizations specially tailored to support high-performance parallel query processing. (C) 2008 Elsevier B. V. All rights reserved.

关键词： Metric space databases Query processing and indexing parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Big data: From beginning to future

引用

INTERNATIONAL JOURNAL OF INFORMATION MANAGEMENT 2016年第6期36卷 1231-1247页

作者： Yaqoob, Ibrar Hashem, Ibrahim Abaker Targio Gani, Abdullah Mokhtar, Salimah Ahmed, Ejaz Anuar, Nor Badrul Vasilakos, Athanasios V. Univ Malaya Fac Comp Sci & Informat Technol Ctr Mobile Cloud Comp Res C4MCCR Kuala Lumpur 50603 Malaysia Lulea Univ Technol Lulea Sweden

Big data is a potential research area receiving considerable attention from academia and IT communities. In the digital world, the amounts of data generated and stored have expanded within a short period of time. Consequently, this fast growing rate of data has created many challenges. In this paper, we use structuralism and functionalism paradigms to analyze the origins of big data applications and its current trends. This paper presents a comprehensive discussion on state-of-the-art big data technologies based on batch and stream data processing. Moreover, strengths and weaknesses of these technologies are analyzed. This study also discusses big data analytics techniques, processing methods, some reported case studies from different vendors, several open research challenges, and the opportunities brought about by big data. The similarities and differences of these techniques and technologies based on important parameters are also investigated. Emerging technologies are recommended as a solution for big data problems. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Big data parallel and distributed computing Cloud computing Internet of things Social media Analytics

来源：评论

学校读者我要写书评

暂无评论

The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm

引用

JOURNAL OF BIG DATA 2018年第1期5卷 1页

作者： Adoni, Wilfried Yves Hamilton Nahhal, Tarik Aghezzaf, Brahim Elbyed, Abdeltif Hassan II Univ Casablanca Fac Sci Lab Informat Modelisat Syst & Aide Decis Km 8 Route El JadidaBP 5366 Casablanca Morocco

This paper deals with an efficient parallel and distributed framework for intensive computation with A* algorithm based on MapReduce concept. The A* algorithm is one of the most popular graph traversal algorithm used in route guidance. It requires exponential time computation and very costly hardware to compute the shortest path on large-scale networks. Thus, it is necessary to reduce the time complexity while exploiting a low cost commodity hardwares. To cope with this situation, we propose a novel approach that reduces the A* algorithm into a set of Map and Reduce tasks for running the path computation on Hadoop MapReduce framework. An application on real road networks illustrates the feasibility and reliability of the proposed framework. The experiments performed on a 6-node Hadoop cluster proves that the proposed approach outperforms A* algorithm and achieves significant gain in terms of computation time.

关键词： Path-finding Large-scale network A(*) algorithm Big Data Hadoop MapReduce HDFS parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Two Physics-Based Schwarz Preconditioners for Three-Temperature Radiation Diffusion Equations in High Dimensions

引用

Communications in Computational Physics 2022年第8期32卷 829-849页

作者： Xiaoqiang Yue Jianmeng He Xiaowen Xu Shi Shu Libo Wang National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationHunan Key Laboratory for Computation and Simulation in Science and EngineeringXiangtan UniversityXiangtan 411105P.R.China Laboratory of Computational Physics Institute of Applied Physics and ComputationalMathematicsBeijing 100094P.R.China College of Information Science and Technology JinanUniversityGuangzhou 510632P.R.China

We concentrate on the parallel,fully coupled and fully implicit solution of the sequence of 3-by-3 block-structured linear systems arising from the symmetrypreserving finite volume element discretization of the unsteady three-temperature radiation diffusion equations in high *** this article,motivated by[***,***,***,SIAM *** ***.33(2012)653–680]and[***,***,***,***.442(2021)110513],we aim to develop the additive and multiplicative Schwarz preconditioners subdividing the physical quantities rather than the underlying domain,and consider their sequential and parallel implementations using a simplified explicit decoupling factor approximation and algebraic multigrid subsolves to address such linear ***,computational efficiencies and parallel scalabilities of the proposed approaches are numerically tested in a number of representative real-world capsule implosion benchmarks.

关键词： Radiation diffusion equations Schwarz methods algebraic multigrid parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Comparative study of the server-initiated lowest algorithm using a load balancing index based on the process behavior for heterogeneous environment

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2006年第3期9卷 313-319页

作者： de Mello, R. F. Trevelin, L. C. de Paiva, M. S. V. Yang, Laurence T. Univ Sao Paulo Inst Math Sci & Comp BR-13560 Sao Carlos Brazil Univ Fed Sao Carlos Dept Comp Sci BR-13560 Sao Carlos Brazil St Francis Xavier Univ Antigonish NS Canada

The availability of low cost microcomputers and the evolution of computer networks have increased the development of distributed systems. In order to get a better process allocation on distributed environments, several load balancing algorithms have been proposed. Generally, these algorithms consider as the information policy's load index the length of the CPU's process waiting queue. This paper modifies the Server-Initiated Lowest algorithm by using a load index based on the resource occupation. Using this load index the Server-Initiated Lowest algorithm is compared to the Stable symmetrically initiated, which nowadays is defined as the best choice. The comparisons are made by using simulations. The simulations showed that the modified Server-Initiated Lowest algorithm had better results than the Symmetrically Initiated one.

关键词： load balancing algorithm high performance parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Grid computing with parallel Routes Transmission

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2008年第12期E91B卷 3882-3885页

作者： Miyagi, Hiroyuki Okazaki, Yusuke Usui, Ryota Arakawa, Yutaka Okamoto, Satoru Yamanaka, Naoaki Keio Univ Dept Informat & Comp Sci Yokohama Kanagawa 2238522 Japan

In a grid computing environment, the network characteristics such as bandwidth and latency affect the task performance. The demands for bandwidth of wide-area networks become large and it reaches more than 100Gbps. In this article, we focus on parallel routes transmission, such as link aggregation, to realize large bandwidth network. The performance of grid computing with parallel routes transmission is evaluated on the emulated wide-area network.

关键词： grid computing parallel routes transmission link aggregation optical network parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Shelterbelts and windbreaks: Mathematical modeling and computer simulations of turbulent flows

引用

ANNUAL REVIEW OF FLUID MECHANICS 2001年第1期33卷 549-586页

作者： Wang, H Takle, ES Shen, JM Iowa State Univ Dept Comp Sci Ames IA 50011 USA Iowa State Univ Dept Agron Ames IA 50011 USA

Shelterbelts or windbreaks were used for centuries to reduce wind speed, to control heat and moisture transfer and pollutant diffusion, to improve climate and environment, and to increase crop yields;but only within the last few decades have systematic studies considered the aerodynamics and shelter mechanisms of shelterbelts and windbreaks. This review examines recent modeling and numerical simulation studies as well as the mechanisms that control flow and turbulence around shelterbelts and windbreaks. We compare numerical simulations with experimental data and explain the relationships between sheltering effects and the structure of shelterbelts and windbreaks. We discuss how and why the desired effects are achieved by using numerical analysis. This chapter begins with the derivation of a general equation set for porous shelterbelts and windbreaks;the numerical model and simulation procedure are developed;unseparated and separated flows are predicted and characterized;the momentum budget and shelter mechanisms are analyzed;the effects of wind direction, density, width, and three dimensionality of shelterbelt structure on flow and turbulence are systematically described. Recent modeling and simulation of heat flux and evapotranspiration are also summarized. Finally, we discuss the use of highperformance distributed and parallel computing as well as clusters of networked workstations to enhance performance of the model applied to simulations of shelterbelts and windbreaks.

关键词： turbulent flows aerodynamics wind engineering environmental fluid dynamics porous media flows heat and moisture transfer parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

All-to-all personalized exchange in generalized shuffle-exchange networks

引用

THEORETICAL COMPUTER SCIENCE 2010年第16-18期411卷 1669-1684页

作者： Chou, Well Y. Chen, Chiuyuan Natl Chiao Tung Univ Dept Appl Math Hsinchu 300 Taiwan

An all-to-all communication algorithm is said to be optimal if it has the smallest communication delay. Previous all-to-all personalized exchange algorithms are mainly for hypercube, mesh, and torus. In Yang and Wang (2000) [13], Yang and Wang proved that a multistage interconnection network (MIN) is a better choice for implementing all-to-all personalized exchange and they proposed optimal all-to-all personalized exchange algorithms for MINs. In Massini (2003)[9], Massini proposed a new optimal algorithm for MINs, which is independent of the network topology. Do notice that the algorithms in [9] and [13] work only for MINs with the unique path property (meaning that there is a unique path between each pair of source and destination) and satisfying N = 2(n), in which N is the number of processors, 2 means all the switches are of size 2 x 2, and n is the number of stages. In Padmanabhan (1991) [10], Padmanabhan proposed the generalized shuffle-exchange network (GSEN), which is a generalization of the shuffle-exchange network. Since a GSEN does not have the unique path property, the algorithms in [9] and [13] cannot be used. The purpose of this paper is to consider the all-to-all personalized exchange problem in GSENs. An optimal algorithm and several bounds will be proposed. (C) 2010 Published by Elsevier B.V.

关键词： Multistage interconnection networks Shuffle-exchange networks Omega network parallel and distributed computing All-to-all communication All-to-all personalized exchange

来源：评论

学校读者我要写书评

暂无评论

Dual of a complete graph as an interconnection network

引用

JOURNAL OF parallel and distributed computing 2000年第8期60卷 1028-1046页

作者： Zheng, SQ Wu, J Univ Texas Dept Comp Sci Richardson TX 75083 USA Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA

A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with Feint-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. In this paper, we propose a scheme for deriving new hypernetworks using hypergraph duals. As an example, we investigate the dual, K-n*, of the n-vertex complete graph K-n and show that it has many desirable properties. We also present a set of fundamental data communication algorithms for K-n*. Our results indicate that the K-n* hypernetwork is a useful and promising interconnection structure for high-performance parallel and distributed computing systems. (C) 2000 Academic Press.

关键词： algorithm communication hypernetwork interconnection network optical interconnect parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

A NEW CLASS OF AMG INTERPOLATION METHODS BASED ON MATRIX-MATRIX MULTIPLICATIONS

引用

SIAM JOURNAL ON SCIENTIFIC computing 2021年第5期43卷 S540-S564页

作者： LI, Ruipeng Sjogreen, Bjorn Yang, Ulrike Meier Ctr Appl Sci Comp Lawrence Livermore Natl Lab Livermore CA 94551 USA

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators [H. De Sterck et al., Numer. Linear Algebra Appl., 15 (2008), pp. 115-139], the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre [R. D. Falgout and U. M. Yang, hypre: A library of high performance preconditioners, in Computational Science - ICCS 2002, P. M. A. Sloot et al., eds., Springer, Berlin, Heidelberg, 2002, pp. 632-641], a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

关键词： AMG interpolation sparse matrix computation parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：