5005 search results - page 82 / 1001 » The Design and Analysis of Parallel Algorithms |
119
click to vote
ISPAN
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we study a synchronous execution strategy f o r parallel join computation in multiprocessor systems. Through a further comprehensive investigation of the processor ...
108
Voted
ICPP
1998
IEEE
15 years 4 months ago
1998
IEEE
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
111
click to vote
CONPAR
1992
15 years 4 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
116
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
100
click to vote
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The high-level synthesis process involves three interdependent and NP-complete optimization problems: (i) the operation scheduling, (ii) the resource allocation, and (iii) the ...