COMPLETE BINARY TREE BASED SYSTEM FOR ACTIVATION OF CONCURRENT PROCESSES. Conference

Chen, W, Iyengar, SS. (1985). COMPLETE BINARY TREE BASED SYSTEM FOR ACTIVATION OF CONCURRENT PROCESSES. . 418.

cited authors

  • Chen, W; Iyengar, SS

authors

abstract

  • The main purpose of this paper is to create a complete binary tree (CBT) system to activate processes concurrently. Users are not provided any commands from the 4. 2 BSD UNIX system to activate processes simultaneously. However, by using the result of this project, users are able to activate several processes at the same time by issuing the command of CBT. The CBT is an executable program which contains two routines. One of the routines is called nrouter. c which is a recursive program used to create a complete binary tree structure to activate user processes simultaneously. The advantages of using complete binary tree structure to activate user processes are that the user processes can be activated almost simultaneously and the redundant leaves will not be created.

publication date

  • December 1, 1985

International Standard Book Number (ISBN) 10

start page

  • 418