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

Thread-oriented online load balancing

Journal of Shanghai University 1998年第3期2卷 218-220页

作者： Tong, Weiqin Zhou, Qinghua Gu, Zhikui School of Computer Engineering and Science Shanghai University Shanghai

Dynamic task assignment and migration are the key technique to load balancing which plays an important role in the achievement of high performance in distributed computing system. In this paper, we describe the design and implementation of an online thread scheduling and migration system (S&M) based on a previous work of LWP_MPI. Experimental results show that performance is enhanced.

关键词： workstation cluster parallel and distributed computing load balancing scheduling thread migration

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithms for Dynamic Shortest Path Problems

引用

International Transactions in Operational Research 2002年第3期9卷 279-302页

作者： Chabini, Ismail Ganugapati, Sridevi Department of Civil and Environmental Engineering Massachusetts Institute of Technology United States

The development of intelligent transportation systems (ITS) and the resulting need for the solution of a variety of dynamic traffic network models and management problems require faster-than-real-time computation of shortest path problems in dynamic networks. Recently, a sequential algorithm was developed to compute shortest paths in discrete time dynamic networks from all nodes and all departure times to one destination node. The algorithm is known as algorithm DOT and has an optimal worst-case running-time complexity. This implies that no algorithm with a better worst-case computational complexity can be discovered. Consequently, in order to derive algorithms to solve all-to-one shortest path problems in dynamic networks, one would need to explore avenues other than the design of sequential solution algorithms only. The use of commercially-available high-performance computing platforms to develop parallel implementations of sequential algorithms is an example of such avenue. This paper reports on the design, implementation, and computational testing of parallel dynamic shortest path algorithms. We develop two shared-memory and two message-passing dynamic shortest path algorithm implementations, which are derived from algorithm DOT using the following parallelization strategies: decomposition by destination and decomposition by transportation network topology. The algorithms are coded using two types of parallel computing environments: a message-passing environment based on the parallel virtual machine (PVM) library and a multi-threading environment based on the SUN Microsystems Multi-Threads (MT) library. We also develop a time-based parallel version of algorithm DOT for the case of minimum time paths in FIFO networks, and a theoretical parallelization of algorithm DOT on an ‘ideal’ theoretical parallel machine. Performances of the implementations are analyzed and evaluated using large transportation networks, and two types of parallel computing platforms: a distr

关键词： Computer algorithms Dynamic networks Dynamic shortest paths Intelligent transportation systems parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Exploration of de Bruijn graph filtering for de novo assembly using GraphLab 31

Exploration of de Bruijn graph filtering for <i>de novo</i> ...

引用

31st IEEE International parallel and distributed Processing Symposium Workshops (IPDPS)

作者： Collet, Julien Sassolas, Tanguy Lhuillier, Yves Sirdey, Renaud Carlier, Jacques CEA LIST F-91191 Gif Sur Yvette France Univ Technol Compiegne Heudiasyc F-60203 Compiegne France

ISBN: (纸本)9780769561493

The emergence of next generation DNA sequencers has raised interest in short read de novo assembly of whole genomes. Though numerous frameworks were developed in the field, the presence of errors in reads as well as the increasing size of datasets call for scalable preprocessing methods for noise filtering. In this paper we present a filtering algorithm that targets determination of valid k-mers in a de Bruijn graph built from short reads. Such preprocessing will help increase accuracy and reduce memory footprint in further assembly procedures by removing erroneous k-mers from the datasets at an early stage. The algorithm leverages GraphLab, a scalable graph processing framework not previously used in traditional assembly toolchains. The accuracy of the algorithm was evaluated with synthetic datasets exhibiting various error rates and proven to be able to determine large parts of de Bruijn graphs on datasets with error level greater than real-life datasets. The implementation is executed on a distributed cluster and a study of its scalability and operating performances is conducted and exhibits interesting scaling properties, hence demonstrating the relevance of GraphLab in such a context.

关键词： De novo assembly De Bruijn Graphs Libraries and Programming Environments parallel and distributed computing Big Data and Data Analytics GraphLab

来源：评论

学校读者我要写书评

暂无评论

LuNA Fragmented Programming System, Main Functions and Peculiarities of Run-Time Subsystem

LuNA Fragmented Programming System, Main Functions and Pecul...

引用

11th International Conference on parallel computing Technologies

作者： Malyshkin, Victor E. Perepelkin, Vladislav A. Russian Acad Sci Inst Computat Math & Math Geophys Novosibirsk Russia

The peculiarities of the LuNA run-time subsystem implementation are considered. LuNA is the language and system of fragmented programming. The peculiarities are conditioned by the properties of numerical algorithms, t... 详细信息

ISBN: (纸本)9783642231773

关键词： run-time parallel and distributed computing parallel programming language and system model of parallel program

来源：评论

学校读者我要写书评

暂无评论

Programming Problems with a Large Number of Objective Functions

Programming Problems with a Large Number of Objective Functi...

引用

International Conference on Numerical Methods and Applications

作者： Resteanu, Cornel Trandafir, Romica Natl Inst Res & Dev Informat 8-10 Averescu Ave Bucharest 011455 1 Romania Tech Univ Civil Engn Bucharest 020396 Romania

ISBN: (纸本)9783642184659

The paper treats the Multi-Objective Programming problem with a large composite set of (linear and nonlinear) objective functions, the domain of feasible solutions being defined by a set of linear equalities/inequalities representing a large scale problem. One constructs a preferred solution i.e. a non-dominated solution chosen via extending the decision-making framework. A feasible approach, for this class of problems, is to use a solver for the Linear Programming problems and a solver for Multiple Attribute Decision Making problems in combination with parallel and distributed computing techniques based on a GRID configuration.

关键词： Multi-Objective Programming Large Scale Problems Multiple Attribute Decision Making parallel and distributed computing GRID Nets

来源：评论

学校读者我要写书评

暂无评论

The Sixth International Workshop on Automatic Performance Tuning (iWAPT2011)

The Sixth International Workshop on Automatic Performance Tu...

引用

International Conference on Computational Science (ICCS) on the Ascent of Computational Excellence

作者： Katagiri, Takahiro Vuduc, Richard Univ Tokyo Ctr Informat Technol Bunkyo Ku 2-11-16 Yayoi Tokyo 1138658 Japan Georgia Inst Technol Sch Comp Sci & Engn Atlanta GA 30332 USA

This preface summarizes The Sixth International Workshop on Automatic Performance Tuning (iWAPT2011).

关键词： Performance modeling Adaptive algorithms Numerical algorithms and libraries Scientific applications parallel and distributed computing computing with GPGPU and accelerators Database management system Numerical precision and stability Resource restrictions (real-time, memory etc.) Empirical Compilation Automatically-tuned Code Generation Frameworks and theories of automatic tuning and software optimization Autonomic computing and context-aware computing Low-power computing and green computing Position papers

来源：评论

学校读者我要写书评

暂无评论

What Are the Limits of Evolutionary Induction of Decision Trees? 15th

What Are the Limits of Evolutionary Induction of Decision Tr...

引用

15th International Conference on parallel Problem Solving from Nature (PPSN)

作者： Jurczuk, Krzysztof Reska, Daniel Kretowski, Marek Bialystok Tech Univ Fac Comp Sci Wiejska 45a PL-15351 Bialystok Poland

ISBN: (纸本)9783319992594;9783319992587

For typical assessment of applying machine learning or data mining techniques, accuracy and interpretability are usually the most important elements. However, when the analyst is faced with real contemporary big data problems, scalability and efficiency become crucial factors. parallel and distributed processing support is often an indispensable component of operational solutions. In the paper, we investigate the applicability of evolutionary induction of decision trees to large-scale data. We focus on the existing Global Decision Tree system, which searches the tree structure and tests in one run of an evolutionary algorithm. Evolved individuals are not encoded, so the specialized genetic operators and their application schemes are used. As in most evolutionary data mining systems, every fitness evaluation needs processing the whole training dataset. For high-dimensional datasets, this operation is very time consuming and to overcome this deficiency, two acceleration solutions, based on the most promising, latest approaches (NVIDIA CUDA and Apache Spark) are presented. The fitness calculations are delegated, while the core evolution is unchanged. In the experimental part, among others, we identify what are dataset dimensions which can be efficiently processed in the fixed time interval.

关键词： Evolutionary data mining Decision trees parallel and distributed computing Spark GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

ABET Accreditation: A Way Forward for PDC Education

ABET Accreditation: A Way Forward for PDC Education

引用

35th IEEE International parallel and distributed Processing Symposium (IPDPS)

作者： Aly, Sherif G. Harmanani, Haidar Raj, Rajendra K. Sharafeddine, Sanaa Amer Univ Cairo Dept Comp Sci & Engn Cairo Egypt Lebanese Amer Univ Dept Comp Sci & Math Beirut Lebanon Rochester Inst Technol Dept Comp Sci Rochester NY 14623 USA

ISBN: (纸本)9781665435772

With parallel and distributed computing (PDC) now wide-spread, modern computing programs must incorporate PDC within the curriculum. ACM and IEEE Computer Society's Computer Science curricular guidelines have recommended exposure to PDC concepts since 2013. More recently, a variety of initiatives have made PDC curricular content, lectures, and labs freely available for undergraduate computer science programs. Despite these efforts, progress in ensuring computer science students graduate with sufficient PDC exposure has been uneven. This paper discusses the impact of ABET's revised criteria that have required exposure to PDC to achieve accreditation for computer science programs since 2018. The authors reviewed 20 top ABET-accredited computer science programs and analyzed how they covered the required PDC components in their curricula. Using their own institutions as case studies, the authors examine in detail how three different ABET-accredited computer science programs covered PDC using different approaches, yet meeting the PDC requirements of these ABET criteria. The paper also shows how ACM/IEEE Computer Society curricular guidelines for computer engineering and software engineering programs, along with ABET accreditation criteria, can cover PDC.

关键词： parallel and distributed computing computing programs curricular guidelines ABET accreditation

来源：评论

学校读者我要写书评

暂无评论

Big Data Processing in the ATLAS Experiment: Use Cases and Experience 4th

Big Data Processing in the ATLAS Experiment: Use Cases and E...

引用

4th International Young Scientists Conference on Computational Science (YSC)

作者： Borodin, Mikhail De, Kaushik Garcia Navarro, Jose Golubkov, Dmitry Klimentov, Alexei Maeno, Tadashi South, David Vaniachine, Alexandre IV Kurchatov Atom Energy Inst Big Data Lab Natl Res Ctr Moscow 123182 Russia Natl Res Nucl Univ MEPhI Moscow Russia Univ Texas Arlington Arlington TX USA Univ Valencia Inst Fis Corpuscular E-46003 Valencia Spain Inst High Energy Phys Protvino Russia Brookhaven Natl Lab Upton NY 11973 USA DESY Hamburg Germany Argonne Natl Lab Argonne IL 60439 USA

The physics goals of the next Large Hadron Collider run include high precision tests of the Standard Model and searches for new physics. These goals require detailed comparison of data with computational models simulating the expected data behavior. To highlight the role which modeling and simulation plays in future scientific discovery, we report on use cases and experience with a unified system built to process both real and simulated data of growing volume and variety.

关键词： Big Data Grid-based Simulation and computing parallel and distributed computing Large Scale Scientific Instruments

来源：评论

学校读者我要写书评

暂无评论

Dependability Verification of parallel Differential Evolutionary Particle Swarm Optimization Based Voltage and Reactive Power Control

Dependability Verification of Parallel Differential Evolutio...

引用

IEEE International Conference on Power System Technology (POWERCON)

作者： Iwata, Sohei Fukuyama, Yoshikazu Meiji Univ Sch Interdisciplinary Math Sci Tokyo 101 Japan

ISBN: (纸本)9781467388481

This paper evaluates dependability of parallel differential evolutionary particle swarm optimization (DEEPSO) based voltage and reactive power control (Volt/Var Control: VVC). Considering large penetration of renewable energies and deregulated environment of power systems, VVC is required to realize faster computation to larger-scale problems and one of the solutions for the problem is applications of 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 IEEE 118 bus systems indicate that parallel DEEPSO is superior to parallel PSO and parallel differential evolution (DE) from the dependability point of view.

关键词： Dependability parallel and distributed computing parallel differential evolutionary particle swarm optimization Voltage and reactive power control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：