Parallelism studies programs that execute simultaneously on multiple processors
3
votes
2answers
40 views
Parallel Computing: Past Vs Present
Parallel computing is not new but it is becoming common now a days. This is essentially driven by the need of the users (they need to process more data now) and also because of physical limitations on ...
1
vote
0answers
57 views
What is Pointer Jumping ?
Studying parallel algorithms for CLRS, old edition Chapter 30. Can some one explain with a simple example what is pointer jumping and how exactly it works ?
4
votes
1answer
17 views
Parallel merge sort using hypercube connection template
I've been reading about hypercube connection template for parallel algorithms. The general scheme is explained in Designing and Building Parallel Programs by Ian Foster and it's pretty clear.
What I ...
3
votes
1answer
54 views
How to enumerate combinations in parallel
I have $n\times k$ matrix with $k<n$ and I would like to find all its $n\choose k$ submatrices which are $k\times k$ matrices that are the concatenations of all possible $k$ rows. Actually I tried ...
4
votes
1answer
47 views
Perfect shuffle in parallel processing
How is Perfect shuffle a better interconnect scheme for parallel processing? For example if we consider a problem of sum reduction, I want to understand how this scheme is useful when implementing sum ...
5
votes
1answer
79 views
Problem Solving in MapReduce Framework
I am looking for good resources which have classified and solved typical large scale data processing in MapReduce framework (like graph algorithms, statistics, numerical algorithms ...). Any help is ...
1
vote
0answers
35 views
Vectorizing and Array Notation?
I'm really trying to wrap my head around vectorization but I can't seem to understand it. I don't know if I don't understand how to vectorize, or if I don't understand the array notation that's being ...
1
vote
1answer
40 views
Studies of file access patterns in embedded systems
I am considering what elements an operating system for Network On Chip systems might have and the issue of file systems looms large. NoCs have an embedded heritage, and their domain of use (at least ...
5
votes
1answer
60 views
An online parallel algorithm for finding top K elements
Suppose we have a function on GPU which calculates elements of array from which we need to select top K elements. The number of elements can be quite big so we can't store them in memory and our ...
0
votes
1answer
84 views
A question about parallel algorithm complexity
When in a Parallel algorithm we say:
"This algorithm is done in $O(1)$ time using $O(n\log n)$ work, with $n$-exponential probability, or alternatively, in $O(\log n)$ time using $O(n)$ work, with ...
0
votes
0answers
31 views
a question about parallel algorithm complexity [duplicate]
Possible Duplicate:
A question about parallel algorithm complexity
when in a Parallel algorithm we say:
"This algorith is done in O(1) time using O(nlogn) work, with n-exponential ...
-1
votes
1answer
50 views
How to repeat a mapreduce process? [closed]
How can I repeat the map and reduce process and feed the output of reduce into map function (in the next round)?
My second question is how to define a global variable with is accessible among all map ...
4
votes
1answer
59 views
How partitioning in map-reduce work?
Assume a map-reduce program has $m$ mappers and $n$ reducers ($m > n$). The output of each mapper is partitioned according to the key value and all records having the same key value go into the ...
0
votes
0answers
73 views
Bitonic sort on 2D hypercube of input 12
I'm not sure how I would perform a bitonic sort on a two-dimensional hypercube with 12 numbers.
Suppose I had the input 2 28 6 34 9 7 15 23 4 10 12 25.
Since it's ...
3
votes
0answers
137 views
how does the parallel radix sort work?
I'm currently learning computer science, and there is a slide of notes brief described the parallel radix sort under data parallelism.
...
