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

Author

Muhammad, Rashid Bin

Author_Institution

Dept. of Comput. Sci., Kent State Univ., Kent, OH

fYear

2008

Firstpage

415

Lastpage

420

Abstract

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.

Keywords

client-server systems; delays; trees (mathematics); Steiner tree problem; client processors; execution time analysis; parallel Steiner tree algorithm; parallel algorithm; server client model computation; time delays; Algorithm design and analysis; Analytical models; Computational modeling; Concurrent computing; Delay effects; Discrete event simulation; Information analysis; Mathematical model; Parallel algorithms; Steiner trees;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Science, 2008. ICIS 08. Seventh IEEE/ACIS International Conference on

Conference_Location

Portland, OR

Print_ISBN

978-0-7695-3131-1

Type

conf

DOI

10.1109/ICIS.2008.91

Filename

4529855