A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm

This paper presents the computational analysis of the Steiner tree problem on the server-client model of computation. In particular, this work analyzes the time delays among server and clients for the parallel Steiner tree algorithm and examines some consequences of time delays on the execution time by considering constant and variable delays. The paper also calculates the expression for the optimal number of client processors required by the parallel algorithm for optimal efficiency. The compact mathematical expressions can be used confidently to implement parallel Steiner tree on the server-client model of computation.