Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
The complexity of verifying memory coherence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
TSOtool: A Program for Verifying Memory Systems Using the Memory Consistency Model
Proceedings of the 31st annual international symposium on Computer architecture
Efficient algorithms for verifying memory consistency
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast and generalized polynomial time memory consistency verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) memory consistency model. They also devised an algorithm based on this procedure with time complexity O(n5), where nis the total number of instructions in the program. Roy et. al. [6] have improved the implementation of the procedure and achieved O(n4) time complexity.We have identified the bottleneck in these algorithms as a graph problem of independent interest, called implied-set closure(ISC) problem. In this paper we propose an algorithm for ISC problem and show that using this algorithm, Hangal's consistency checking procedure can be implemented with O(n3) time complexity. We also experimentally show that the new algorithm is significantly faster than Roy's algorithm.