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

The ParaStation project: Using workstations as building blocks for parallel computing

INFORMATION SCIENCES 1998年第3-4期106卷 277-292页

作者： Warschko, TM Blum, JM Tichy, WF Univ Karlsruhe Dept Informat D-76128 Karlsruhe Germany

The ParaStation communication fabric provides a high-speed communication network with user-level access to enable efficient parallel computing on workstation clusters. The architecture, implemented on off-the-shelf workstations coupled by the ParaStation communication hardware, removes the kernel and common network protocols from the communication path while still providing full protection in a multiuser, multiprogramming environment. The programming interface presented by ParaStation consists of a UNIX socket emulation and widely used parallel programming environments such as PVM, P4, and MPI. This allows porting a wide range of client/server and parallel applications to the ParaStation architecture. Implementations of ParaStation using various platforms, such as Digital's AlphaGeneration workstations and Linux PCs, achieve end-to-end (process-to-process) latencies as low as 2 mu s and a sustained bandwidth of up to 15 Mbyte/s per channel with small packets. Benchmarks using PVM on ParaStation demonstrate real application performance of 1 GFLOP on an 8-node cluster. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： workstation cluster parallel and distributed computing user-level communication high-speed interconnects

来源：评论

学校读者我要写书评

暂无评论

Easy and efficient agent-based simulations with the OpenABL language and compiler

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2021年 116卷 61-75页

作者： Cosenza, Biagio Popov, Nikita Juurlink, Ben Richmond, Paul Chimeh, Mozhgan Kabiri Spagnuolo, Carmine Cordasco, Gennaro Scarano, Vittorio Univ Salerno Dipartimento Informat Fisciano Italy Tech Univ Berlin Embedded Syst Architecture Berlin Germany Univ Campania Dipartimento Psicol Caserta Italy Univ Sheffield Res Software Engn Grp Sheffield S Yorkshire England JetBrains PhpStorm Team Prague Czech Republic NVIDIA Santa Clara CA USA

Agent-based simulations represent an effective scientific tool, with numerous applications from social sciences to biology, which aims to emulate or predict complex phenomena through a set of simple rules performed by multiple agents. To simulate a large number of agents with complex models, practitioners have developed high-performance parallel implementations, often specialized for particular scenarios and target hardware. It is, however, difficult to obtain portable simulations, which achieve high performance and at the same time are easy to write and to reproduce on different hardware. This article gives a complete presentation of OpenABL, a domain-specific language and a compiler for agent-based simulations that enable users to achieve high-performance parallel and distributed agent simulations with a simple and portable programming environment. OpenABL is comprised of (1) an easy-to-program language, which relies on domain abstractions and explicitly exposes agent parallelism, synchronization and locality, (2) a source-to-source compiler, and (3) a set of pluggable compiler backends, which generate target code for multi-core CPUs, GPUs, and cloud-based systems. We evaluate OpenABL on simulations from different fields. In particular, our analysis includes predator-prey and keratinocyte, two complex simulations with multiple step functions, heterogeneous agent types, and dynamic creation and removal of agents. The results show that OpenABL-generated codes are portable to different platforms, perform similarly to manual target-specific implementations, and require significantly fewer lines of codes. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Agent-based simulation Domain specific language GPU parallel and distributed computing Compilers

来源：评论

学校读者我要写书评

暂无评论

A strong connectivity property of the generalized exchanged hypercube

引用

DISCRETE APPLIED MATHEMATICS 2017年第Part3期216卷 529-536页

作者： Cheng, Eddie Qiu, Ke Shen, Zhizhang Oakland Univ Dept Math & Stat Rochester MI 48309 USA Brock Univ Dept Comp Sci St Catharines ON L2S 3A1 Canada Plymouth State Univ Dept Comp Sci & Technol Plymouth NH 03264 USA

We show that, when a linear number of vertices are removed from a generalized exchanged hypercube, its surviving graph consists of a large connected component and smaller component(s) containing altogether a rather limited number of vertices. This result can be applied to obtain a number of fault tolerant properties of this interesting structure. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Hypercube Generalized exchanged hypercube Connectivity Fault-tolerance properties parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Direct extension of the density-matrix renormalization group method toward two-dimensional large quantum lattices and related high-performance computing

引用

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS 2011年第1期28卷 141-151页

作者： Yamada, Susumu Okumura, Masahiko Imamura, Toshiyuki Machida, Masahiko Japan Atom Energy Agcy CCSE Taito Ku Tokyo 1100015 Japan RIKEN Wako Saitama 3510198 Japan Univ Electrocommun Tokyo 1828585 Japan

The density-matrix renormalization group (DMRG) method is widely used by computational physicists as a high accuracy tool to explore the ground state in large quantum lattice models, e.g., Heisenberg and Hubbard models, which are well-known standard models describing interacting spins and electrons, respectively, in solid states. After the DMRG method was originally developed for 1-D lattice/chain models, some specific extensions toward 2-D lattice (n-leg ladder) models have been proposed. However, high accuracy as obtained in 1-D models is not always guaranteed in their extended versions because the original exquisite advantage of the algorithm is partly lost. Thus, we choose an alternative way. It is a direct 2-D extension of DMRG method which instead demands an enormously large memory space, but the memory explosion is resolved by parallelizing the DMRG code with performance tuning. The parallelized direct extended DMRG shows a good accuracy like 1-D models and an excellent parallel efficiency as the number of states kept increases. This success promises accurate analysis on large 2-D (n-leg ladder) quantum lattice models in the near future when peta-flops parallel supercomputers are available.

关键词： parallel and distributed computing DMRG method Matrix-vector multiplication Eigenvalue problems

来源：评论

学校读者我要写书评

暂无评论

On heuristics for optimal configuration of hierarchical distributed monitoring systems

引用

JOURNAL OF SYSTEMS AND SOFTWARE 1998年第3期43卷 197-206页

作者： Cao, JN Zhang, K de Vel, O Hong Kong Polytech Univ Dept Comp Hung Hom Kowloon Peoples R China Macquarie Univ Dept Comp N Ryde NSW 2109 Australia James Cook Univ N Queensland Dept Comp Sci Townsville Qld 4811 Australia

This paper considers the problem of optimal configuration of the monitoring units in a hierarchical distributed monitoring system-A hierarchical distributed monitoring system consists of a hierarchy of monitoring units which are grouped and distributed onto the physical network. The architecture lends itself to parallel processing, reducing the complexity of distributed monitoring caused by factors such as collection and processing of the large quantities of monitoring data. Furthermore, the topology-specific partitioning of the monitoring units allow complex, topology-specific events to be monitored and evaluated in a natural and efficient way. The optimal configuration problem is concerned with finding an optimal hierarchical partition of the monitoring units such that the total processing cost is the minimum. It is a NP-complete problem. In this paper, we study the heuristics for obtaining near-optimal grouping of monitoring units. Simulation of heuristic algorithms for mesh and hypercube networks are presented. The results suggest further system topology specific heuristics. Although the paper is targeted at distributed monitoring, we believe that the results can also be applied to other hierarchical control problems in distributed computing. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： parallel and distributed computing hierarchical distributed systems distributed monitoring optimization

来源：评论

学校读者我要写书评

暂无评论

Low Complexity SLP: An Inversion-Free, parallelizable ADMM Approach

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2024年第9期23卷 12424-12439页

作者： Yang, Junwen Li, Ang Liao, Xuewen Masouros, Christos Xi An Jiao Tong Univ Fac Elect & Informat Engn Sch Informat & Commun Engn Xian 710049 Shaanxi Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Xi An Jiao Tong Univ Fac Elect & Informat Engn Sch Informat & Commun Engn Shaanxi Key Lab Deep Space Explorat Intelligent In Xian 710049 Shaanxi Peoples R China UCL Dept Elect & Elect Engn London WC1E 7JE England

We propose a parallel constructive interference (CI)-based symbol-level precoding (SLP) approach for massive connectivity in the downlink of multiuser multiple-input single-output (MU-MISO) systems, with only local channel state information (CSI) used at each processor unit and limited information exchange between processor units. We explore and reveal the separability of the SLP model. By reformulating the power minimization (PM) SLP problem and exploiting the separability of the corresponding reformulation, the original problem is decomposed into several parallel subproblems via the ADMM framework with closed-form solutions, leading to a substantial reduction in computational complexity. The sufficient condition for guaranteeing the convergence of the proposed approach is derived, based on which an adaptive parameter tuning strategy is proposed to accelerate the convergence rate. To avoid the large-dimension matrix inverse operation, an efficient algorithm is proposed by employing the standard proximal term and by leveraging the singular value decomposition (SVD). Furthermore, a prox-linear proximal term is adopted to fully eliminate the matrix inversion, and a parallel inverse-free SLP (PIF-SLP) algorithm is finally obtained. Numerical results validate our derivations above, and demonstrate that the proposed PIF-SLP algorithm can significantly reduce the computational complexity compared to the state-of-the-arts.

关键词： Precoding Interference Convergence Vectors Signal to noise ratio Optimization Computational complexity Massive MU-MISO constructive interference symbol-level precoding power minimization ADMM parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

An improved task assignment scheme for Hadoop running in the clouds

引用

JOURNAL OF CLOUD computing-ADVANCES SYSTEMS AND APPLICATIONS 2013年第1期2卷 1-16页

作者： Dai, Wei Bassiouni, Mostafa Univ Cent Florida Sch Elect Engn & Comp Sci 4000 Cent Florida Blvd Orlando FL 32816 USA

Nowadays, data-intensive problems are so prevalent that numerous organizations in various industries have to face them in their business operation. It is often crucial for enterprises to have the capability of analyzing large volumes of data in an effective and timely manner. MapReduce and its open-source implementation Hadoop dramatically simplified the development of parallel data-intensive computing applications for ordinary users, and the combination of Hadoop and cloud computing made large-scale parallel data-intensive computing much more accessible to all potential users than ever before. Although Hadoop has become the most popular data management framework for parallel data-intensive computing in the clouds, the Hadoop scheduler is not a perfect match for the cloud environments. In this paper, we discuss the issues with the Hadoop task assignment scheme, and present an improved scheme for heterogeneous computing environments, such as the public clouds. The proposed scheme is based on an optimal minimum makespan algorithm. It projects and compares the completion times of all task slots' next data block, and explicitly strives to shorten the completion time of the map phase of MapReduce jobs. We conducted extensive simulation to evaluate the performance of the proposed scheme compared with the Hadoop scheme in two types of heterogeneous computing environments that are typical on the public cloud platforms. The simulation results showed that the proposed scheme could remarkably reduce the map phase completion time, and it could reduce the amount of remote processing employed to a more significant extent which makes the data processing less vulnerable to both network congestion and disk contention.

关键词： Cloud computing Hadoop MapReduce Task assignment Data-intensive computing parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Bourbaki's structure theory in the problem of complex systems simulation models synthesis and model-oriented programming

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2015年第1期55卷 148-159页

作者： Brodsky, Yu. I. Russian Acad Sci Dorodnicyn Comp Ctr Moscow 119333 Russia

The work is devoted to the application of Bourbaki's structure theory to substantiate the synthesis of simulation models of complex multicomponent systems, where every component may be a complex system itself. An application of the Bourbaki's structure theory offers a new approach to the design and computer implementation of simulation models of complex multicomponent systems-model synthesis and model-oriented programming. It differs from the traditional object-oriented approach. The central concept of this new approach and at the same time, the basic building block for the construction of more complex structures is the concept of models-components. A model-component endowed with a more complicated structure than, for example, the object in the object-oriented analysis. This structure provides to the model-component an independent behavior-the ability of standard responds to standard requests of its internal and external environment. At the same time, the computer implementation of model-component's behavior is invariant under the integration of models-components into complexes. This fact allows one firstly to construct fractal models of any complexity, and secondly to implement a computational process of such constructions uniformly-by a single universal program. In addition, the proposed paradigm allows one to exclude imperative programming and to generate computer code with a high degree of parallelism.

关键词： simulation complex multi-component systems model synthesis model-oriented programming parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Dependable parallel Canonical Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

引用

IFAC-PapersOnLine 2018年第28期51卷 167-172页

作者： Yoshida, Hotaka Azuma, Daich Fukuyama, Yoshikazu Meiji University Tokyo Japan

This paper proposes dependable parallel canonical differential evolutionary particle swarm optimization (C-DEEPSO) for voltage and reactive power control (Volt/Var Control: VVC). Since the problem can be formulated as a mixed integer nonlinear optimization problem (MINLP), various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Considering large penetration of renewable energies and deregulated environments of power systems, VVC requires fast computation for larger-scale VVC problems. One of the solutions to speed-up the computation is to utilize parallel and distributed computing. Since power system is one of the infrastructures of social community, not only fast computation, but also sustainable control (dependability) is strongly required for VVC. The simulation results with with IEEE 14, 30, 57, and 118 bus systems indicate that parallel C-DEEPSO is superior to the conventional parallel DEEPSO from the dependability point of view. © 2018

关键词： Particle swarm optimization (PSO) Computational efficiency distributed computer systems Integer programming Nonlinear programming Power control Reactive power Voltage control Differential evolutionary Evolutionary computation techniques Heuristic search Mixed integer nonlinear optimization problems Optimization problems parallel and distributed computing parallel Computation Voltage and reactive power control

来源：评论

学校读者我要写书评

暂无评论

parallel Newton two-stage methods based on ILU factorizations for nonlinear systems

引用

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS 2006年第7期13卷 553-572页

作者： Arnal, J. Migallon, H. Migallon, V. Penades, J. Univ Alicante Dept Ciencia Computac & Inteligencia Artificial E-03071 Alicante Spain Univ Miguel Hernandez Dept Fis & Arquitectura Comp Alicante 03202 Spain

parallel iterative algorithms based on the Newton method and on two of its variants, the Shamanskii method and the Chord method, for solving nonlinear systems are proposed. These algorithms are based on two-stage multisplitting methods where incomplete LU factorizations are considered as a mean of constructing the inner splittings. Convergence properties of these parallel methods are studied for H-matrices. Computational results of these methods on two parallel computing systems are discussed. The reported experiments show the effectiveness of these methods. Copyright (C) 2006 John Wiley & Sons, Ltd.

关键词： parallel and distributed computing nonlinear systems ILU factorizations two-stage methods Newton method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：