We present a scheduling technique that guarantees asymptotically a performance within a factor of four of the optimum for a subclass of parallel programs even if communication is expensive on the target machine. This class includes programs for FFT and matrixmultiplication for which we give practical results on a Parsytec Power-Xplorer and on a workstation-cluster.