This paper presents the design and implementation of a mechanism aimed at enhancing the performance of distributed object-based applications. This goal as achieved by means of a new algorithm implementing placement of method executions that adapts to processors' load and to objects' characteristics, the latter allowing to approximate the cost of methods' remote execution. The behavior of the proposed placement algorithm is examined by providing performance measures obtained from its integration within a customizable distributed object-based runtime system. In particular, the cost of method executions using our algorithm is compared with the cost resulting from the standard placement technique that consists of executing any method on the storing node of its embedding object.

This paper sketches our experience with the design and implementation of a parallel object-oriented language and it distributed run-time system. The language integrates two original mechanisms for concurrency control: a synchronization mechanism that does not interfere with inheritance nor with subtyping, and a mechanism that serves for managing object groups. Because of the increasing power of interconnection networks, the language's run-time system has been designed for a distributed architecture instead of a single multiprocessor machine. Furthermore, in order to ease the development of correct applications, we have chosen to rely on the run-time system to provide the required efficiency instead of offering the programmer low level primitives to be used for producing efficient code.>

article Free Access Share on A Multiprocessing Approach to Compile-Time Symbol Resolution Authors: F. André Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile , J. P. Banatre Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile , J. P. Routeau Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, FranceView Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 3Issue 1Jan. 1981 pp 11–23https://doi.org/10.1145/357121.357123Online:01 January 1981Publication History 4citation215DownloadsMetricsTotal Citations4Total Downloads215Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The project KENSUR aiming in breaking down a compiler into a set of concurrent processes and in having them executed onto a network of processors is currently developed at I.R.I.S.A.