We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we combine aspects of the PRAM and mesh models to achieve the benefits of each. Many fast algorithms are known for the PRAM, but it is unrealistic to build. Another well-known model is the 2-dimensional mesh, of which many have been built, but the algorithms are constrained by the mesh's diameter and bisection bandwidth, forcing algorithms for(More)
We give efficient algorithms to solve fundamental data movement problems on mesh-connected computers augmented with limited global bandwidth. Adding a small amount of global bandwidth makes a practical design that combines aspects of mesh and fully connected models to achieve the benefits of each. We give algorithms for sorting, finding the median, finding(More)
We show the testing results of Kruskal, Prim-Dijkstra for finding a low-stretch spanning tree for both unweighted graphs and weighted graphs transformed from benchmark circuits [1]. On unweighted graph, our implementation can get an average stretch of about 7 for all benchmark circuits. Kruskal’s algorithm gives good edge selection for finding short stretch(More)
  • 1