In this paper, we propose a parallel algorithm to solve a class of nonlinear network optimization problems. the proposed parallel algorithm is a combination of the successive quadratic programming and the dual method,...
详细信息
this paper concerns mainly withparallel and distributed implementations of molecular dynamics simulations of the Lennard-Jones potential model. the reported research work studies and experiments different algorithms ...
详细信息
this paper concerns mainly withparallel and distributed implementations of molecular dynamics simulations of the Lennard-Jones potential model. the reported research work studies and experiments different algorithms and parallelization techniques for shared memory and message passing architectures, and the programs are executed on single-core processors, multi-core processors, GPU, and GPU cluster. the solution based on efficient versions of the neighbor list algorithm and space division technique is further discussed. the obtained speedups for multi-core processor, GPU, and GPU cluster, relative to the single-core processor implementation of the program, are analyzed, and the advantages of the algorithms are highlighted.
In the literature various two level interconnection networks are proposed using hypercubes or star graphs. In this paper, a new two level interconnection network topology called the Metastar denoted as Mstar(k,m) is i...
详细信息
ISBN:
(纸本)9783642280726;9783642280733
In the literature various two level interconnection networks are proposed using hypercubes or star graphs. In this paper, a new two level interconnection network topology called the Metastar denoted as Mstar(k,m) is introduced. the proposed network takes the star graph as basic building blocks. Here, the network at the lower level is a star but at the higher level the network is a cube. Its various topological parameters such as packing density, degree, diameter, cost, average distance and hamiltonicity are investigated. Message routing and broadcasting algorithms are also proposed. Performance analysis in terms of topological parameters is done and the proposed network is proved to be a suitable candidate for large scale computing.
this paper describes the creation process of an Indonesian-English parallel corpus (IDENTIC). the corpus contains 45,000 sentences collected from different sources in different genres. Several manual text preprocessin...
详细信息
ISBN:
(纸本)9782951740877
this paper describes the creation process of an Indonesian-English parallel corpus (IDENTIC). the corpus contains 45,000 sentences collected from different sources in different genres. Several manual text preprocessing tasks, such as alignment and spelling correction, are applied to the corpus to assure its quality. We also apply language specific text processing such as tokenization on both sides and clitic normalization on the Indonesian side. the corpus is available in two different formats: 'plain', stored in text format and 'morphologically enriched', stored in CoNLL format. Some parts of the corpus are publicly available at the IDENTIC homepage.
Based on the analysis of logic optimization and task parallel allocation algorithm, combining with logic optimization features, we propose a new parallelprocessing algorithm for logic optimization scheduling and allo...
详细信息
In this paper parallel implementation of stochastic inversion of seismic tomography data was presented. Classical approach to travel time tomography assumes straight line of seismic rays between sources and receives p...
详细信息
ISBN:
(纸本)9783642314995;9783642315008
In this paper parallel implementation of stochastic inversion of seismic tomography data was presented. Classical approach to travel time tomography assumes straight line of seismic rays between sources and receives points and isotropy of geological medium. Such simplifications are potential sources of inaccuracy of the obtained results of travel time tomography. Stochastic methods can be free from these simplifications. On the other hand, this kind of algorithms requires huge number of time consuming calculations. In this work parallelization of two stochastic methods is presented. Different parallelalgorithms was applied to presented inversion problems. Obtained results show significant differences in parallel performance of presented inversion algorithms.
In this paper, we present HunOr, the first multi-domain Hungarian-Russian parallel corpus. Some of the corpus texts have been manually aligned and split into sentences, besides, named entities also have been annotated...
详细信息
ISBN:
(纸本)9782951740877
In this paper, we present HunOr, the first multi-domain Hungarian-Russian parallel corpus. Some of the corpus texts have been manually aligned and split into sentences, besides, named entities also have been annotated while the other parts are automatically aligned at the sentence level and they are POS-tagged as well. the corpus contains texts from the domains literature, official language use and science, however, we would like to add texts from the news domain to the corpus. In the future, we are planning to carry out a syntactic annotation of the HunOr corpus, which will further enhance the usability of the corpus in various NLP fields such as transfer-based machine translation or cross lingual information retrieval.
Recommender systems are mechanisms that filter information and predict a user's preference to an item. parallel implementations of recommender systems improve scalability issues and can be applied to internet-base...
详细信息
In order to parallelism, generally, compiler considers the nodes which they want them to work in parallel. thus, the communication volume (CV) between variables is ignored. In this paper, we will make a variable affin...
详细信息
In this paper we explore the effectiveness of solution of computationally intensive problems in FPGA (Field-Programmable Gate Array) on an example of Sudoku game. three different Sudoku solvers have been fully impleme...
详细信息
In this paper we explore the effectiveness of solution of computationally intensive problems in FPGA (Field-Programmable Gate Array) on an example of Sudoku game. three different Sudoku solvers have been fully implemented and tested on a low-cost FPGA of Xilinx Spartan-3E family. the first solver is only able to deal with simple puzzles with reasoning, i.e. without search. the second solver applies breadth-first search algorithm and therefore has virtually no limitation on the type of puzzles which are solvable. We prove that despite the serial nature of implemented backtracking search algorithms, parallelism can be used efficiently. thus, the suggested third solver explores the possibility of parallelprocessing of search tree branches and boosts the performance of the second solver. the trade-offs of the designed solvers are analyzed, the results are compared to software and to other known implementations, and conclusions are drawn on how to improve the suggested architectures.
暂无评论