loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 International Conference on Parallel Processing (ICPP 2007)
Scaling up Genome Similarity Search Services through Content Distribution
Xi'an, China
September 10-September 14
ISBN: 0-7695-2933-X
Chen Wang, University of Sydney, Australia
Bing Bing Zhou, University of Sydney, Australia
Albert Y. Zomaya, University of Sydney, Australia
As the increase of genome database size, there are increasing number of methods for detecting sequence similarity and increasing demands for genome sequence search and alignment services. It is a challenge to scale up the computer systems for serving these demands in a timely manner. This paper tackles this problem from a novel perspective, which treats the sequence search requests as content requests to both genome databases and similarity detection methods; therefore, scaling up the computer systems that serve these contents is a process of constructing content distribution network. The paper gives a decentralized method to construct content distribution network for a variety of genome sequence similarity detection services. It also gives a scheduling algorithm for efficiently using content nodes. Our simulation results show that scalability and high content node utilization can be achieved in such a system while the costs of achieving these are controllable.
Citation:
Chen Wang, Bing Bing Zhou, Albert Y. Zomaya, "Scaling up Genome Similarity Search Services through Content Distribution," icpp, pp.33, 2007 International Conference on Parallel Processing (ICPP 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.