We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
In this paper, we generalize the test. The generalized test can be applied towards determining whether there exist data dependences for coupled arrays with both constant and var...
We propose a new parallel performance visualization scheme, based on a simple moment analysis of processor utilization data. This method combines the scalability advantages of sta...
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...