Two graph algorithms on an associative computing model

Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms have been developed for this model and some have been implemented using its associative programming language. In this paper, we present two graph algorithms for the restricted MASC model with one IS (called the ASC model). These are an ASC version of Kruskal algorithm for the minimum spanning tree (MST) problem and an ASC version of Dijsktra algorithm for the single source shortest path (SSSP) problem. Both of our algorithms have worst case time of O(n) which provide speedups of at least n over their sequential versions. Also, our second algorithm is cost optimal. These algorithms have advantages of being easy to program, highly scalable and having small overhead costs. They provide a better understanding about the power of the ASC/MASC model in terms of effectiveness of algorithms it supports