Modcling Distributed Tcrnlination wit11 Pre-Dofincd Partinl Tcrnlination Ordcring

Distributed Termination Convention (DTC), adopted by most nf the concurrent programming languages such as CSP, Ada, Concurrent4 C, is attractive because the programmer is relieved of the control details to achieve termination of distributed progranls. This model, however, is not very convincing from the implementation point of view as the communication overhead involved in achieving termination is enormous, especially in a distributed system. This paper provides 3 new approach for distributed process termination. DTC is modeled with 104 termination control and termination ordering relation rep resented by Directed Acyclic Graph (DAG). This approach adheres IC. the programming language deaign principle - "Preservation of Information" which says that a language should allow the representation of information that the user might know and that the compiler might need. The termination information required by this technique may be entered with the source code (new syntax) to the compiler for analysis. Alternatively, most languages, such as CSP and ADA, contain enough information in the source code to allow for automatic analysis provided termination ordering information is supplied in a suitable form (e.g., DAG). Thm can be done with an intelligent preprocessor to the source code or with modification to the compiler itself. The execution uf a specific program then becomes more efficient with this distributed termination. We recommend that DTC with semantic termination dependencies should be provided as an option in the supporting envi-, ronment for a concurrent language.