Results 261 to 270 of about 26,832 (297)
Some of the next articles are maybe not open access.
Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), 2002
In this paper we show how to obtain optimal speedup in a master-slave model for solving data-parallel problems. Given the number of homogeneous workstations, their computation time for solving a basic sub-task of the problem, network transmission bandwidth and data volume per basic sub-task, the per-distribution number of basic sub-tasks sent to a ...
Jung-Sing Jwo +2 more
openaire +2 more sources
In this paper we show how to obtain optimal speedup in a master-slave model for solving data-parallel problems. Given the number of homogeneous workstations, their computation time for solving a basic sub-task of the problem, network transmission bandwidth and data volume per basic sub-task, the per-distribution number of basic sub-tasks sent to a ...
Jung-Sing Jwo +2 more
openaire +2 more sources
Concurrency and Computation: Practice and Experience, 2014
SummaryThe aim of this paper is to show that the multidimensional Monte Carlo integration can be efficiently implemented on various distributed memory parallel computers and clusters of multicore nodes using recently developed parallel versions of linear congruential generator and lagged Fibonacci generator pseudorandom number generators.
Szałkowski, Dominik +1 more
openaire +1 more source
SummaryThe aim of this paper is to show that the multidimensional Monte Carlo integration can be efficiently implemented on various distributed memory parallel computers and clusters of multicore nodes using recently developed parallel versions of linear congruential generator and lagged Fibonacci generator pseudorandom number generators.
Szałkowski, Dominik +1 more
openaire +1 more source
Simulation of Black Oil Reservoir on Distributed Memory Parallel Computers and Workstation Cluster
Proceedings of International Meeting on Petroleum Engineering, 1995Abstract This paper describes parallel linear solvers of LSOR and preconditioned ORTHOMIN ( K ) on parallel computer based on T8OO Transputers and SUN workstation cluster ( with Ethernet network). Both Algorithms show a high degree of parallel efficiency on Transputers, whereas only full impliicit method and large ...
Ma Zhiyuan +3 more
openaire +1 more source
2009 International Forum on Information Technology and Applications, 2009
Against the low index speed of serial algorithm for Web page inverted indexes construction, according to a characteristic of merge-sort algorithm meets the theory of scheduling divisible loads in parallel and distributed system, the paper proposed a new parallel algorithm basing on the triple sort-merge for Web page inverted indexes construction.
Liang Zhengyou, Chen Tao
openaire +1 more source
Against the low index speed of serial algorithm for Web page inverted indexes construction, according to a characteristic of merge-sort algorithm meets the theory of scheduling divisible loads in parallel and distributed system, the paper proposed a new parallel algorithm basing on the triple sort-merge for Web page inverted indexes construction.
Liang Zhengyou, Chen Tao
openaire +1 more source
Proceedings Euromicro Workshop on Parallel and Distributed Processing, 2002
In the present paper, we present some experimental results about the parallel numerical simulation of a time dependent partial differential equation, the two dimensional nonlinear Schrodinger equation, on a message passing parallel machine and using PVM on a cluster of Sparc-stations.
Ignacio Martín Llorente +3 more
openaire +2 more sources
In the present paper, we present some experimental results about the parallel numerical simulation of a time dependent partial differential equation, the two dimensional nonlinear Schrodinger equation, on a message passing parallel machine and using PVM on a cluster of Sparc-stations.
Ignacio Martín Llorente +3 more
openaire +2 more sources
2019
Most commonly used clustering algorithms are those aimed at solving the well-known k-median problem. Their main advantage is that they are simple to implement and use, and they are flexible in choosing dissimilarity measures (not necessarily metrics). K-median algorithms are also known to be more robust to noise and outliers in comparison with k-means ...
Anton V. Ushakov, Igor Vasilyev
openaire +1 more source
Most commonly used clustering algorithms are those aimed at solving the well-known k-median problem. Their main advantage is that they are simple to implement and use, and they are flexible in choosing dissimilarity measures (not necessarily metrics). K-median algorithms are also known to be more robust to noise and outliers in comparison with k-means ...
Anton V. Ushakov, Igor Vasilyev
openaire +1 more source
Architecture of a Distributed Parallel Computing System Using Docker Cluster
2022 International Conference on Information, Control, and Communication Technologies (ICCT), 2022Aleksandr Sokolov +3 more
openaire +1 more source
SAE Technical Paper Series, 2015
<div class="section abstract"><div class="htmlview paragraph">In recent years, there has been an increase in the use of Unmanned Aerial Systems (UAS) in the civilian sector for various purposes. As these platforms are constrained in terms of payload and capacity, they are typically equipped with a minimal sensor suite and the use of ...
openaire +1 more source
<div class="section abstract"><div class="htmlview paragraph">In recent years, there has been an increase in the use of Unmanned Aerial Systems (UAS) in the civilian sector for various purposes. As these platforms are constrained in terms of payload and capacity, they are typically equipped with a minimal sensor suite and the use of ...
openaire +1 more source
SGP: A Parallel Computing Framework for Supporting Distributed Structural Graph Clustering
2022Xiufeng Xia +4 more
openaire +2 more sources
HY-DBSCAN: A hybrid parallel DBSCAN clustering algorithm scalable on distributed-memory computers
Journal of Parallel and Distributed Computing, 2022Guoqing Wu 0002 +3 more
openaire +2 more sources