Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Biological Sequence Comparison Application in Heterogeneous Environments with Dynamic Programming Algorithms
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 4643/2007
Book
Advances in Bioinformatics and Computational Biology
DOI
10.1007/978-3-540-73731-5
Copyright
2007
ISBN
978-3-540-73730-8
DOI
10.1007/978-3-540-73731-5_5
Pages
46-56
Subject Collection
Computer Science
SpringerLink Date
Tuesday, August 14, 2007
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (243.0 KB)
Free Preview
Biological Sequence Comparison Application in Heterogeneous Environments with Dynamic Programming Algorithms
Marcelo N. P. Santana
1
and Alba Cristina M. A. Melo
1
(1)
Department of Computer Science, Campus Universitario - Asa Norte, Caixa Postal 4466, University of Brasilia, Brasilia – DF, CEP 70910-900, Brazil
Abstract
This paper presents the design and evaluation of a task allocation framework for Biological Sequence Comparison applications that use dynamic programming and run in heterogeneous environments. The framework is composed by four modules and either task allocation policies or applications can be integrated to it. The results obtained with four different task allocation policies in a 10-machine heterogeneous environment show that, for some sequence sizes, we were able to reduce the execution time of the parallel application in 54.2%, with the appropriate allocation policy.
Marcelo
N.
P.
Santana
Email:
marcelo@cic.unb.br
Alba
Cristina
M.
A.
Melo
Email:
albamm@cic.unb.br
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.110 • Server: mpweb05
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)