DocumentCode
3218334
Title
A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm
Author
Muhammad, Rashid Bin
Author_Institution
Kent State Univ., Kent
fYear
2008
fDate
25-28 March 2008
Firstpage
276
Lastpage
280
Abstract
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.
Keywords
client-server systems; parallel algorithms; trees (mathematics); Steiner tree algorithm; client processors; parallel computation; server-client paradigm; time delays; Algorithm design and analysis; Application software; Computational geometry; Computational modeling; Computer networks; Concurrent computing; Costs; Delay effects; Euclidean distance; Mathematical model;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications - Workshops, 2008. AINAW 2008. 22nd International Conference on
Conference_Location
Okinawa
Print_ISBN
978-0-7695-3096-3
Type
conf
DOI
10.1109/WAINA.2008.64
Filename
4482926
Link To Document