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

第十届电子商务、工程及科学领域的分布式计算和应用（DCABES）国际学术研讨会

作者： Cdric Venet Frdric Magoulès Applied Mathematics and Systems Laboratory Ecole Centrale Paris Chtenay-Malabry France

In this paper,an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers.A hybrid method between the ray-tracing and the beamtracing method is first ***,a new parallel method based on domain decomposition principles is *** method allows to handle large scale open domains for parallel computing purpose,better than other existing *** numerical experiments,carried out on a real world problem—namely the acoustic pollution analysis within a large city—illustrate the performance of this new domain decomposition method.

关键词： Domain decomposition methods parallel and distributed computing Acoustics Ray-tracing methods Beamtracing methods

来源：评论

学校读者我要写书评

暂无评论

Coupling the Parareal algorithm with the Waveform Relaxation method for the solution of Differential Algebraic Equations

Coupling the Parareal algorithm with the Waveform Relaxation...

引用

第十届电子商务、工程及科学领域的分布式计算和应用（DCABES）国际学术研讨会

作者： Thomas Cadeau Frédéric Magoulès Applied Mathematics and Systems Laboratory Ecole Centrale Paris Chtenay-Malabry France

In this paper,a coupling strategy of the Parareal algorithm with the Waveform Relaxation method is presented for the parallel solution of differential algebraic *** classical Waveform Relaxation(in space) method and the Parareal(in time) method are first recalled,followed by the introduction of a coupled Parareal-Waveform Relaxation method recently introduced for the solution of partial differential ***,this coupled method is extended to the solution of differential algebraic *** experiments,performed on parallel multicores architectures,illustrate the impressive performances of this new method.

关键词： Differential Algebraic Equations Domain decomposition method Waveform Relaxation method Parareal algorithm parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Method for Predicting a Penalty of Contentions by Considering Priorities of Routing among Packets on Direct Interconnection Network

A Method for Predicting a Penalty of Contentions by Consider...

引用

The Fourth International Joint Conference on Computational Science and Optimization(第四届计算科学与优化国际大会 CSO 2011)

作者： Takeshi Nanri Yoshiyuki Morie Ryutaro Susukita Research Institute for Information Technology Kyushu University Fkuoka Japan Institute of Systems Information Technologies and Nanotechnologies Fkuoka Japan

Contentions can degrade the performance of communication significantly on network topology like 3D-Mesh/Torus. On these topologies, it is important to establish a method for predicting penalty of contentions to enable precise and fast tuning on communications. For example, techniques of tuning such as choosing dynamically faster algorithm of collective communications or finding appropriate task-allocation depends on the preciseness of the performance prediction. This research proposes a method for predicting a penalty of contentions by using detailed analysis of packet priority on direct interconnection network. Usually, the penalty of contentions is predicted by counting the number of communications issued on the same link at the same time. However, the actual amount of delay caused by contentions depends on the way of arbitrating messages. The message is divided into the packets and transmitted. Then, the contentions between those packets are arbitrated by applying the priority to each packet Therefore, when the contentions occur, the message which has a lower priority is blocked. By considering these priorities, the method proposed in this research becomes to predict the penalty of contentions more accurately and faster. In the evaluation experiment, the penalty of contentions predicted without considering packet priority is the twice or more than it predicted by simulation. On the other hand, the proposed method of predicting the penalty of contentions is predictable in the accuracy within 20％ against simulation. Moreover, the prediction by proposed method is possible to execute it enough at short time.

关键词： parallel and distributed computing Prediction Contentions Direct Interconnection Network Routing of Packet

来源：评论

学校读者我要写书评

暂无评论

Dynamic slack allocation algorithms for energy minimization on parallel machines

引用

JOURNAL OF parallel and distributed computing 2010年第5期70卷 417-430页

作者： Kang, Jaeyeon Ranka, Sanjay Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

We explore novel algorithms for DVS (Dynamic Voltage Scaling) based energy minimization of DAG (Directed Acyclic Graph) based applications on parallel and distributed machines in dynamic environments. Static DVS algorithms for DAG execution use the estimated execution time. The estimated time in practice is overestimated or underestimated. Therefore, many tasks may be completed earlier or later than expected during the actual execution. For overestimation, the extra available slack can be added to future tasks so that energy requirements can be reduced. For underestimation, the increased time may cause the application to miss the deadline. Slack can be reduced for future tasks to reduce the possibility of not missing the deadline. In this paper, we present novel dynamic scheduling algorithms for reallocating the slack for future tasks to reduce energy and/or satisfy deadline constraints. Experimental results show that our algorithms are comparable to static algorithms applied at runtime in terms of energy minimization and deadline satisfaction, but require considerably smaller computational overhead. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Energy-aware dynamic scheduling Dynamic voltage scaling Real time and embedded systems parallel and distributed computing Multiprocessor systems

来源：评论

学校读者我要写书评

暂无评论

Medical Images Indexing and Retrieval in a distributed computing Environment

引用

JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2010年第5期42卷 61-71页

作者： Kurochka, K. S. Safonau, I. V. Gomel State PO Sukhoi Tech Univ Belarus Gomel BELARUS Natl Acad Sci Belarus State Sci Org United Inst Informat Problems Gomel BELARUS

The problem of indexing and retrieval of medical of images in computer networks is considered. The technique and technology of organization of distributed search of images, using Grid resources, is described. The data... 详细信息

关键词： distributed computing environment medical images indexing and retrieval Grid computing segment local area network organization of the Grid environment parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Slack allocation algorithm for parallel machines

引用

JOURNAL OF parallel and distributed computing 2010年第1期70卷 23-34页

作者： Kang, Jaeyeon Ranka, Sanjay Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

Energy consumption is a critical issue in parallel and distributed embedded systems. We present a novel algorithm for energy efficient scheduling of Directed Acyclic Graph (DAG) based applications on Dynamic Voltage Scaling (DVS) enabled systems. Experimental results show that our algorithm provides near optimal solutions for energy minimization with considerably smaller computational time and memory requirements compared to an existing algorithm that provides near optimal solutions. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Energy-aware scheduling Dynamic Voltage Scaling Real time and embedded systems parallel and distributed computing Multiprocessor systems

来源：评论

学校读者我要写书评

暂无评论

Sync/Async parallel search for the efficient design and construction of web search engines

引用

parallel computing 2010年第4期36卷 153-168页

作者： Marin, Mauricio Gil-Costa, Veronica Bonacic, Carolina Baeza-Yates, Ricardo Scherson, Isaac D. Yahoo Res Latin Amer Santiago Chile Univ Santiago Chile Dept Informat Engn Santiago Chile Natl Univ San Luis Dept Informat San Luis Argentina Univ Complutense Madrid Comp Architecture Dept E-28040 Madrid Spain Univ Calif Irvine Dept Comp Sci Irvine CA 92697 USA

A parallel query processing method is proposed for the design and construction of web search engines to efficiently deal with dynamic variations in query traffic. The method allows for the efficient use of different distributed indexing and query processing strategies in server clusters consisting of multiple computational/storage nodes. It also enables a better utilization of local and distributed hardware resources as it automatically re-organizes parallel computations to benefit from the advantages of two mixed modes of operation, namely: a newly proposed synchronous mode and the standard asynchronous computing mode. Switching between modes is facilitated by a round-robin strategy devised to grant each query a fair share of the hardware resources and properly predict query throughput. Performance is evaluated by experimental methods and two case studies serve to show how to develop efficient parallel query processing algorithms for large-scale search engines based on the proposed paradigm. (C) 2010 Elsevier B.V. All rights reserved.

关键词： distributed indexing and parallel query processing Information retrieval Web search engines 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

来源：评论

学校读者我要写书评

暂无评论

GPGPU-Aided Ensemble Empirical-Mode Decomposition for EEG Analysis During Anesthesia

引用

IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE 2010年第6期14卷 1417-1427页

作者： Chen, Dan Li, Duan Xiong, Muzhou Bao, Hong Li, Xiaoli Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Peoples R China Yanshan Univ Inst Informat Sci & Engn Qinhuangdao 066004 Peoples R China China Univ Geosci Sch Comp Sci Wuhan 430074 Peoples R China Univ Sci & Technol Beijing Sch Informat Engn Beijing 100083 Peoples R China Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England

Ensemble empirical-mode decomposition (EEMD) is a novel adaptive time-frequency analysis method, which is particularly suitable for extracting useful information from noisy non-linear or nonstationary data. Unfortunately, since the EEMD is highly compute-intensive, the method does not apply in real-time applications on top of commercial-off-the-shelf computers. Aiming at this problem, a parallelized EEMD method has been developed using general-purpose computing on the graphics processing unit (GPGPU), namely, G-EEMD. A spectral entropy facilitated by G-EEMD was, therefore, proposed to analyze the EEG data for estimating the depth of anesthesia (DoA) in a real-time manner. In terms of EEG data analysis, G-EEMD has dramatically improved the run-time performance by more than 140 times compared to the original serial EEMD implementation. G-EEMD also performs far better than another parallelized implementation of EEMD bases on conventional CPU-based distributed computing technology despite the latter utilizes 16 high-end computing nodes for the same computing task. Furthermore, the results obtained from a pharmacokinetics/pharmacodynamic (PK/PD) model analysis indicate that the EEMD method is slightly more effective than its precedent alternative method (EMD) in estimating DoA, the coefficient of determination R(2) by EEMD is significantly higher than that by EMD(p < 0.05, paired t-test) and the prediction probability P(k) by EEMD is also slighter higher than that by EMD (p < 0.2, paired t-test).

关键词： Depth of anesthesia (DoA) electroencephalogram (EEG) ensemble empirical-mode decomposition (EEMD) general-purpose computing on the graphics processing unit (GPGPU) parallel and distributed computing spectral entropy

来源：评论

学校读者我要写书评

暂无评论

Charge transfer in deoxyribonucleic acid (DNA): Static disorder, dynamic fluctuations and complex kinetic

Charge transfer in deoxyribonucleic acid (DNA): Static disor...

引用

作者： Edirisinghe Pathirannehelage, Neranjan S. Georgia State University

学位级别：Ph.D.

The fact that loosely bonded DNA bases could tolerate large structural fluctuations, form a dissipative environment for a charge traveling through the DNA. Nonlinear stochastic nature of structural fluctuations facilitates rich charge dynamics in DNA. We study the complex charge dynamics by solving a nonlinear, stochastic, coupled system of differential equations. Charge transfer between donor and acceptor in DNA occurs via different mechanisms depending on the distance between donor and acceptor. It changes from tunneling regime to a polaron assisted hopping regime depending on the donor-acceptor separation. Also we found that charge transport strongly depends on the feasibility of polaron formation. Hence it has complex dependence on temperature and charge-vibrations coupling strength. Mismatched base pairs, such as different conformations of the G·A mispair, cause only minor structural changes in the host DNA molecule, thereby making mispair recognition an arduous task. Electron transport in DNA that depends strongly on the hopping transfer integrals between the nearest base pairs, which in turn are affected by the presence of a mispair, might be an attractive approach in this regard. I report here on our investigations, via the I-V characteristics, of the effect of a mispair on the electrical properties of homogeneous and generic DNA molecules. The I-V characteristics of DNA were studied numerically within the double-stranded tight-binding model. The parameters of the tight-binding model, such as the transfer integrals and on-site energies, are determined from first-principles calculations. The changes in electrical current through the DNA chain due to the presence of a mispair depend on the conformation of the G·A mispair and are appreciable for DNA consisting of up to 90 base pairs. For homogeneous DNA sequences the current through DNA is suppressed and the strongest suppression is realized for the G(anti)·A(syn) conformation of the G·A mispair. For inhomogene

关键词： Deoxyribonucleic acid Non equilibrium Greens' function Model hamiltonian Stochastic differential equations Polaron parallel and distributed computing Tight binding model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：