pram model
Recently Published Documents


TOTAL DOCUMENTS

69
(FIVE YEARS 2)

H-INDEX

9
(FIVE YEARS 0)

2021 ◽  
Vol 11 (17) ◽  
pp. 8204
Author(s):  
Jarosław Rudy

In this paper, a flow shop scheduling problem with minimal and maximal machine idle time with the goal of minimizing makespan is considered. The mathematical model of the problem is presented. A generalization of the prefix sum, called the job shift scan, for computing required shifts for overlapping jobs is proposed. A work-efficient algorithm for computing the job shift scan in parallel for the PRAM model with n processors is proposed and its time complexity of O(logn) is proven. Then, an algorithm for computing the makespan in time O(mlogn) in parallel using the prefix sum and job shift scan is proposed. Computer experiments on GPU were conducted using the CUDA platform. The results indicate multi-thread GPU vs. single-thread GPU speedups of up to 350 and 1000 for job shift scan and makespan calculation algorithms, respectively. Multi-thread GPU vs. single-thread CPU speedups up to 4.5 and 14.7, respectively, were observed as well. The experiments on the Taillard-based problem instances using a simulated annealing solving method and employing the parallel makespan calculation show that the method is able to perform many more iterations in the given time limit and obtain better results than the non-parallel version.



Author(s):  
Yijie Han ◽  
Sreevalli Tata

We study linked list sorting and merging on the PRAM model. In this paper we show that n real numbers can be sorted into a linked list in constant time with n2+e processors or in ) time with n2 processors. We also show that two sorted linked lists of n integers in {0, 1, …, m}  can be merged into one sorted linked list in O(log(c)n(loglogm)1/2) time using n/(log(c)n(loglogm)1/2)  processors, where c is an arbitrarily large constant.



2020 ◽  
Vol 13 (1) ◽  
pp. 51
Author(s):  
Yijie Han ◽  
Hemasree Koganti ◽  
Nikita Goyal

We show that n integers in {0, 1, …, m-1} can be sorted into a linked list in constant time using nlogm processors on the Priority CRCW PRAM model, and they can be sorted into a linked list in O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.



2020 ◽  
Author(s):  
Sandeep Kumar Gill ◽  
Anju Sharma
Keyword(s):  


2018 ◽  
Vol 37 (1) ◽  
pp. 229-243 ◽  
Author(s):  
Andrej Brodnik ◽  
Marko Grgurovič
Keyword(s):  


2016 ◽  
Vol 2016 (2) ◽  
pp. 186-192
Author(s):  
Александр Колпаков ◽  
Aleksandr Kolpakov ◽  
Юрий Кропотов ◽  
Yuriy Kropotov

In the paper there is considered an algorithm developed on the basis of modified PRAM-model for efficiency increase of parallel computations on specialized computer modules. By means of the efficiency assessment method there were carried out comparative experimental inves-tigations of the algorithm developed. The assessment results of the algorithm for the parallel computation efficiency increase on special computer modules show efficiency increase not less than 2-4 times depending on the number of flows under investigation.



2015 ◽  
Vol 25 (04) ◽  
pp. 1550010 ◽  
Author(s):  
Surabhi Jain ◽  
N. Sadagopan

For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G with vertex connectivity [Formula: see text], the connectivity augmentation refers to a set S of edges whose augmentation to G increases its vertex connectivity by one. A minimum connectivity augmentation of G is the one in which S is minimum. In this paper, we focus our attention on biconnectivity augmentation for trees. Towards this end, we present a new sequential algorithm for biconnectivity augmentation in trees by simplifying the algorithm reported in [1]. The simplicity is achieved with the help of edge contraction tool. This tool helps us in getting a recursive subproblem preserving all connectivity information. Subsequently, we present a parallel algorithm to obtain a minimum biconnectivity augmentation set in trees. Our parallel algorithm essentially follows the overall structure of sequential algorithm. Our implementation is based on CREW PRAM model with [Formula: see text] processors, where [Formula: see text] refers to the maximum degree of a tree. We also show that our parallel algorithm is optimal with a processor-time product of [Formula: see text] where n is the number of vertices of a tree.



2015 ◽  
Vol 118 (6) ◽  
pp. 12-18
Author(s):  
Madiha KhurramPasha ◽  
Maryam Feroze ◽  
Khurram Ahmad Pasha


2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Madhushi Verma ◽  
K. K. Shukla

This paper deals with the orienteering problem (OP) which is a combination of two well-known problems (i.e., travelling salesman problem and the knapsack problem). OP is an NP-hard problem and is useful in appropriately modeling several challenging applications. As the parameters involved in these applications cannot be measured precisely, depicting them using crisp numbers is unrealistic. Further, the decision maker may be satisfied with graded satisfaction levels of solutions, which cannot be formulated using a crisp program. To deal with the above-stated two issues, we formulate thefuzzyorienteering problem (FOP) and provide a method to solve it. Here we state the two necessary conditions of OP of maximizing the total collected score and minimizing the time taken to traverse a path (within the specified time bound) as fuzzy goals and the remaining necessary conditions as crisp constraints. Using the max-min formulation of the fuzzy sets obtained from the fuzzy goals, we calculate the fuzzy decision sets (ZandZ∗) that contain the feasible paths and the desirable paths, respectively, along with the degrees to which they are acceptable. To efficiently solve large instances of FOP, we also present a parallel algorithm on CREW PRAM model.



2014 ◽  
Vol 24 (01) ◽  
pp. 1450004 ◽  
Author(s):  
Andrew Lucas ◽  
Mark Stalzer ◽  
John Feo

We analyze the parallel performance of randomized interpolative decomposition by decomposing low rank complex-valued Gaussian random matrices of about 100 GB. We chose a Cray XMT supercomputer as it provides an almost ideal PRAM model permitting quick investigation of parallel algorithms without obfuscation from hardware idiosyncrasies. We obtain that on non-square matrices performance scales almost linearly with runtime about 100 times faster on 128 processors. We also verify that numerically discovered error bounds still hold on matrices two orders of magnitude larger than those previously tested.



Sign in / Sign up

Export Citation Format

Share Document