loading...
A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm
March 25-March 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WAINA.2008.6422nd International Conference on Adva ...
 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, "A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm," Advanced Information Networking and Applications Workshops, International Conference on, pp. 276-280, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/WAINA.2008.64,
author = {Rashid Bin Muhammad},
title = {A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm},
journal ={Advanced Information Networking and Applications Workshops, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3096-3},
pages = {276-280},
doi = {http://doi.ieeecomputersociety.org/10.1109/WAINA.2008.64},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications Workshops, International Conference on
TI - A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm
SN - 978-0-7695-3096-3
SP276
EP280
A1 - Rashid Bin Muhammad,
PY - 2008
KW - null
VL - 0
JA - Advanced Information Networking and Applications Workshops, International Conference on
ER -
 
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 algorithmand 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.
Citation:
Rashid Bin Muhammad, "A Parallel Computation of the Steiner Tree Algorithm on Server-Client Paradigm," ainaw, pp.276-280, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.