5005 search results - page 49 / 1001 » The Design and Analysis of Parallel Algorithms |
84
Voted
CAV
1994
Springer
15 years 4 months ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
86
Voted
ICFEM
2009
Springer
14 years 10 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
111
Voted
VLSID
2001
IEEE
16 years 26 days ago
2001
IEEE
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
82
Voted
TPDS
1998
15 years 3 days ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
118
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...