loading...
Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation
May 14-May 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIS.2008.91Seventh IEEE/ACIS International Confe ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Rashid Bin Muhammad, "Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation," Computer and Information Science, ACIS International Conference on, pp. 415-420, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/ICIS.2008.91,
author = {Rashid Bin Muhammad},
title = {Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation},
journal ={Computer and Information Science, ACIS International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3131-1},
pages = {415-420},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICIS.2008.91},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Science, ACIS International Conference on
TI - Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation
SN - 978-0-7695-3131-1
SP415
EP420
A1 - Rashid Bin Muhammad,
PY - 2008
KW - null
VL - 0
JA - Computer and Information Science, ACIS International Conference on
ER -
 
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.
Citation:
Rashid Bin Muhammad, "Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation," icis, pp.415-420, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.