Chandra, SatishLarus, James R.2013-12-232013-12-232013-12-23199710.1007/BFb0017269https://infoscience.epfl.ch/handle/20.500.14299/98736This paper examines the performance of a suite of HPF applications on a network of workstations using two different compilation approaches: generating explicit message-passing code, and generating code for a shared address space provided by a finegrain distributed shared memory system (DSM). Preliminary experiments indicate that the DSM approach performs with usually a small slowdown compared to the message passing approach on regular programs, yet enables efficient execution of non-regular programstext::conference output::conference proceedings::conference paper