Transformations for optimizing interprocess communication and synchronization mechanisms |
| |
Authors: | Carole M McNamee Ronald A Olsson |
| |
Affiliation: | (1) Division of Computer Science, University of California, Davis, 95616 Davis, California |
| |
Abstract: | This paper presents source-level transformations that improve the performance of programs using synchronous and asynchronous message passing primitives, including remote call to an active process (rendezvous). It also discusses the applicability of these transformations to shared memory and distributed environments. The transformations presented reduce the need for context switching, simplify the specific form of communication, and/or reduce the complexity of the given form of communication. One additional transformation actually increases the number of processes as well as the number of context switches to improve program performance. These transformations are shown to be generalizable. Results of hand-applying the transformations to SR programs indicate reductions in execution time exceeding 90% in many cases. The transformations also apply to many commonly occurring synchronization patterns and to other concurrent programming languages such as Ada and Concurrent C. The long term goal of this effort is to include such transformations as an otpimization step, performed automatically by a compiler.This work was supported by NSF under Grant Number CCR88-10617. |
| |
Keywords: | Parallel programming interprocess communication synchronization mechanism program transformation compiler optimization |
本文献已被 SpringerLink 等数据库收录! |