Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation

摘要

This paper presents the computational analysis and simulation of the parallel Steiner tree problem on the client-sever model of computation. In particular, this work analyzes the time delays among server and clients, presents an algorithm for an event-driven simulation of Steiner tree problem on server-client model, and examines some consequences of time delays on the execution time. In addition, the paper calculates the expression for the optimal number of client processors required by the parallel algorithm for optimal efficiency. The compact mathematical expressions can be use confidently to simulate or implement parallel Steiner tree on the server-client model of computation.