Kay Crowley

Learn More
In this paper, we study run-time methods to automatically parallelize and schedule iterations of a do loop in certain cases, where compile-time information is inadequate. The methods we present in this paper involve execution time prcprocessing of the loop. At compile-time, these methods set up the framework for performing a loop dependency analysis. At(More)
There exists substantial data level parallelism in scientific problems. The PARTY runtime system is an attempt to obtain efficient parallel implementations for scientific computations, particularly those where the data dependencies are manifest only at runtime. This can preclude compiler based detection of certain types of parallelism. The automated system(More)
High performance multiprocessor architectures differ both in the number of processors, and in the delay costs for synchronization and communication. In order to obtain good performance on a given architecture for a given problem, adequate parallelization, good balance of load and an appropriate choice of granularity are essential. We discuss the(More)
Regular meshes are frequently used for modeling physical phenomena on both serial and parallel computers. One advantage of regular meshes is that efficient discretization schemes can be implemented in a straightforward manner. However, geometrically-complex objects, such as aircraft, cannot be easily described using a single regular mesh. Multiple(More)
! zero coarse grid right forcing function vlist(:)%f = 0.0 ! loop over fine grid vertices !HPF$ INDEPENDENT , ON (HOME(fine vlist(v)), NEW (va,vb,vc), REDUCTION (vlist(:) %res) !HPF+ GATHER (fine vlist::s(lv)), GATHER (vlist::g(lv)), SCATTER (vlist::g(lv)) DO v = 1, fine nvert va = fine vlist(v)%par a; vb = fine vlist(v)%par b; vc = fine vlist(v)%par c !(More)
  • 1