702,532 Hits in 5.4 sec


Sampath S .
2013 International Journal of Research in Engineering and Technology  
The results show that the row per slave method gives the optimal computation time in PVM based parallel matrix multiplication.  ...  First is, dividing the rows of one of the input matrices into set of rows based on the number of slaves and assigning one rows set for each slave for computation.  ...  Using the capacity of underlying nodes, the processes perform the parallel computation. One of the processes acts as master and remaining processes acts as slaves.  ... 
doi:10.15623/ijret.2013.0212043 fatcat:d2v3dzqe3nfe3bs6ai225u23zm

Decoupled load balancing

Olga Pearce, Todd Gamblin, Bronis R. de Supinski, Martin Schulz, Nancy M. Amato
2015 Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP 2015  
A balanced assignment of the computational load is critical for parallel performance.  ...  If the computation per element changes over the simulation time, simulations can use dynamic load balance algorithms to evenly redistribute work to processes.  ...  We have presented an approach to load balancing based on decoupling the load balance algorithm from the application and offloading the load balance computation to overlap it with application execution.  ... 
doi:10.1145/2688500.2688539 dblp:conf/ppopp/PearceGSSA15 fatcat:4qvqndcxjzbc5mf24svxcbkkwi

Parallel Processing for Range Assignment Problem in Wireless Sensor Networks [chapter]

M. Prasanna Lakshmi, D. Pushparaj Shetty
2020 Intelligent System and Computing  
So, we propose algorithms for the range assignment problem in wireless sensor networks using the parallel processing techniques.  ...  We also discuss the complexity of the proposed algorithms and significance of the parallel processing techniques in detail.  ...  11 Parallel Processing for Range Assignment Problem in Wireless Sensor Networks DOI: /10.5772/intechopen.89368  ... 
doi:10.5772/intechopen.89368 fatcat:evriyeh3t5dbrdm3vwipkwvd5q

Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm

R. Mohan, N.P. Gopalan
2014 International Journal of Computer Network and Information Security  
to internal processors (i.e. parallel processing) to hasten the computation.  ...  Significant research has also been carried out in solving the Task Assignment Problem in a parallel environment.  ...  Initiating parallel processing in the problem.  ... 
doi:10.5815/ijcnis.2014.07.07 fatcat:3aqeogxm5netpom5ixtjadvkoy

Scheduling In Cloud Computing

Lipsa Tripathy, Rasmi Ranjan Patra
2014 International Journal on Cloud Computing Services and Architecture  
Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanism works as a vital role in the cloud computing.  ...  This method or protocol is based on scheduling the jobs in the cloud and to solve the drawbacks in the existing protocols.  ...  [Describing the parallel Processing] In the above figure one processor creates 3 queue which having own scheduling mechanism algorithm to process the jobs.  ... 
doi:10.5121/ijccsa.2014.4503 fatcat:rezrbgy735g47oxswwnhyymm74

What Influences Students' Understanding of Scalability Issues in Parallel Computing?

Juan Chen, Brett A. Becker, Youwen Ouyang, Li Shen
2021 The Journal of Computational Science Education  
The increased demand for processing large-scale scientific computing data makes more essential the importance of mastering parallelism, with scalability often being a crucial factor.  ...  design explores this similarity in an effort to improve students' understanding of scalability issues in parallel computing.  ...  Analyze why different assignments of processes to compute nodes will bring about different actual memory bandwidth on one node.  ... 
doi:10.22369/issn.2153-4136/12/2/12 fatcat:bibxyrqq3jdbjakashwkyiszt4

Multiscale, Multidomain Modeling and Parallel Computation: Application to Crystal Shape Evolution in Crystallization

Joseph Sang-Il Kwon, Michael Nayhouse, Panagiotis D. Christofides
2015 Industrial & Engineering Chemistry Research  
Specifically, creating a parallel computation program from a sequential one consists of three steps: (1) decomposition of the original problem into tasks or domains, (2) assignment of tasks to processors  ...  In this work, we applied a parallelized multiscale modeling strategy according to the above three steps to a multiscale model of a batch crystallization process.  ...  The process of creating a parallel program from a serial one consists of three steps: (1) decomposition of the original serial computation problem into small tasks, (2) assignment of tasks to processors  ... 
doi:10.1021/acs.iecr.5b02942 fatcat:lpzwqawv7zdinghkiyxacfdaa4

Automatic subject indexing using an associative neural network

Yi-Ming Chung, William M. Pottenger, Bruce R. Schatz
1998 Proceedings of the third ACM conference on Digital libraries - DL '98  
consistent in subject assignment from controlled vocabulary lists.  ...  The global growth in popularity of the World Wide Web has been enabled in part by the availability of browser based search tools which in turn have led to an increased demand for indexing techniques and  ...  : In this paper we describe the major techniques for parallelizing Fortran 90 array assignment statements for the execution on distributed memory parallel computers.  ... 
doi:10.1145/276675.276682 dblp:conf/dl/ChungPS98 fatcat:inszgby2grfq5j34vaalesf6f4

Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations

Jaspal Subhlok, Gary Vondran
2000 Journal of Parallel and Distributed Computing  
This computation structure, also referred to as a data parallel pipeline, is common in several application domains, including digital signal processing, image processing, and computer vision.  ...  These two criteria are distinct since multiple data sets can be pipelined or processed in parallel.  ...  used in our implementation.  ... 
doi:10.1006/jpdc.1999.1596 fatcat:rhvrm2ad5jgb5mbs7snabhiwqa

Parallel Data Mining Algorithms for Association Rules and Clustering [chapter]

Ying Liu, Wei-keng Liao, Alok Choudhary, Jianwei Li
2007 Handbook of Parallel Computing  
The three processes proceed in parallel and each one counts the candidate itemsets locally from its assigned transactions.  ...  One process computes on the objects in gray color, and the other is in charge of those in black. Cluster centroids, marked by '+', are maintained on both processes.  ... 
doi:10.1201/9781420011296.ch32 fatcat:ghvd35jnpfgfzaavgpzc5ijece

Parallel mesh generation based on a new label-driven subdivision technique [chapter]

K. T. Miura, F. Cheng
1995 IFIP Advances in Information and Communication Technology  
Parallel processing is achieved by performing label-driven subdivision on all the faces simultaneously.  ...  Each face (patch) of the quadrilateral network has to be assigned a subdivision level (mesh density) first, which is in tern used to assign labels to the vertices of the quadrilateral network.  ...  His research interests include finite-element mesh generation, geometric /solid modeling, computer graphics, and parallel computing in geometric modeling and computer graphics.  ... 
doi:10.1007/978-0-387-34879-7_13 fatcat:rlqpfpvxzbegjpaa4lzlzzwyji

Integrating Parallel and Distributed Computing Topics into an Undergraduate CS Curriculum at UESTC

Guoming Lu, Jie Xu, Jieyan Liu, Bo Dai, Shenglin Gui, Siyu Zhan
2015 2015 IEEE International Parallel and Distributed Processing Symposium Workshop  
This paper presents our efforts to incorporate parallel and distributed computing topics into our undergraduate computer science and engineering curriculum with the guide of the IEEE-TCPP model Curriculum  ...  Evaluation also shows that practices such as lab/homework assignment effective improve students' conception, and contest club is a necessary complementarity of in-class courses.  ...  In order to show students the benefits of parallel computing, we enhanced the assignments (one homework and one lab assignment) by requiring students accelerating sequential algorithms with OpenMP.  ... 
doi:10.1109/ipdpsw.2015.66 dblp:conf/ipps/LuXLDGZ15 fatcat:7iankmu3bfgbbgaajbsh4tgkfa

Inter-Pixel Filtrering of Digital Images with CUDA from NVIDIA

José Valero
2020 Journal of WSCG  
The time reduction strategy based on a parallel computing scheme on the number of available central processing units (CPUs) does not consider additional computing resources such as those offered by general  ...  The NVIDIA multicore GPU significantly improves the parallelism, which can be used in conjunction with the available multicore CPU computing capacity, balancing the workload between these two computing  ...  In this way, the processing that is currently assigned to each CPU can be performed in parallel including also the processing cores available on the GPU.  ... 
doi:10.24132/csrn.2020.3001.3 fatcat:pnudjd2sjreddes5hm6dpg35zu

Implementation and performance analysis of parallel assignment algorithms on a hypercube computer

B. A. Carpenter, N. J. Davis
1988 Proceedings of the third conference on Hypercube concurrent computers and applications -  
. * either one or several of these processes can be assigned to separate nodes or processors in a parallel computer for concurrent processing.  ...  However in most cases, the advantage in processing time allows many sub-optimal assignments to be computed in the time required to compute only one optimal solution.  ...  Additional Results This appendix lists all of the remaining results of the implementat ions described in this report.  ... 
doi:10.1145/63047.63077 fatcat:wjluoizfnzhlfitgl2dpwezsde

Parallel conversion of satellite image information for a wind energy generation forecasting model

Juan Souteras, Andrés Flevaris, Germán Gadea, Sergio Nesmachnow, Alejandro Guitiérrez, Gabriel Cazes
2012 CLEI Electronic Journal  
This paper presents an efficient parallel algorithm for the problem of converting satellite imagery in binary files.  ...  The performance analysis shows that the implemented parallel algorithm improves substantially against the sequential algorithm that solves the problem, obtaining a linear speedup.  ...  After that, in each execution step, while the master process has cells to generate and one of the slave processes finish its work, the master dynamically assigns to that slave another cell.  ... 
doi:10.19153/cleiej.15.3.2 fatcat:e2knesq7vfb6hjzl7hgdg2fvnq
« Previous Showing results 1 — 15 out of 702,532 results