schliessen

Filtern

 

Bibliotheken

Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism

Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulat... Full description

Journal Title: Journal of computational biology 1996, Vol.3 (4), p.503-528
Main Author: Bhandarkar, S M
Other Authors: Chirravuri, S , Arnold, J
Format: Electronic Article Electronic Article
Language: English
Subjects:
Quelle: Alma/SFX Local Collection
Publisher: United States
ID: ISSN: 1066-5277
Link: https://www.ncbi.nlm.nih.gov/pubmed/9018601
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_proquest_miscellaneous_78690951
title: Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism
format: Article
creator:
  • Bhandarkar, S M
  • Chirravuri, S
  • Arnold, J
subjects:
  • Algorithms
  • Chromosome Mapping - methods
  • Computer Simulation
  • Markov Chains
ispartof: Journal of computational biology, 1996, Vol.3 (4), p.503-528
description: Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
language: eng
source: Alma/SFX Local Collection
identifier: ISSN: 1066-5277
fulltext: fulltext
issn:
  • 1066-5277
  • 1557-8666
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.6721152
LOCALfalse
PrimoNMBib
record
control
sourceidproquest_cross
recordidTN_cdi_proquest_miscellaneous_78690951
sourceformatXML
sourcesystemPC
sourcerecordid16463364
originalsourceidFETCH-LOGICAL-c267t-b588e220eafb7141c5c2ea149c7c4ad261328a4e794649ee69b70d643c02fabc3
addsrcrecordideNqFkDtPwzAQgC0EKqWwsiF5YkvwK2d7ROVVqRVI0NlyHAeC8iJOkPrvSWnEynQn3Xff8CF0SUlMidI3rkpjqjXEPE4IP0JzmiQyUgBwPO4EIEqYlKfoLIRPQigHImdopglVQOgcbV9sZ8vSl9g1VTv0Rf2Omxy3H7tQOFviyrYhiuzvdST74tvj0A_ZDhc1fl1t7rCtM7zZL-1kKkJ1jk5yWwZ_Mc0F2j7cvy2fovXz42p5u44cA9lHaaKUZ4x4m6eSCuoSx7ylQjvphM0YUM6UFV5qAUJ7DzqVJAPBHWG5TR1foOuDt-2ar8GH3lRFcL4sbe2bIRipQBOd0H9BCgI4H80LFB9A1zUhdD43bVdUttsZSsw-uBmDm31ww80YfHy4msxDWvnsD58K8x_bXntb
sourcetypeAggregation Database
isCDItrue
recordtypearticle
pqid16463364
display
typearticle
titleParallel computing of physical maps--a comparative study in SIMD and MIMD parallelism
sourceAlma/SFX Local Collection
creatorBhandarkar, S M ; Chirravuri, S ; Arnold, J
creatorcontribBhandarkar, S M ; Chirravuri, S ; Arnold, J
descriptionOrdering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
identifier
0ISSN: 1066-5277
1EISSN: 1557-8666
2DOI: 10.1089/cmb.1996.3.503
3PMID: 9018601
languageeng
publisherUnited States
subjectAlgorithms ; Chromosome Mapping - methods ; Computer Simulation ; Markov Chains
ispartofJournal of computational biology, 1996, Vol.3 (4), p.503-528
lds50peer_reviewed
citesFETCH-LOGICAL-c267t-b588e220eafb7141c5c2ea149c7c4ad261328a4e794649ee69b70d643c02fabc3
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/9018601$$D View this record in MEDLINE/PubMed
search
creatorcontrib
0Bhandarkar, S M
1Chirravuri, S
2Arnold, J
title
0Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism
1Journal of computational biology
addtitleJ Comput Biol
descriptionOrdering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
subject
0Algorithms
1Chromosome Mapping - methods
2Computer Simulation
3Markov Chains
issn
01066-5277
11557-8666
fulltexttrue
rsrctypearticle
creationdate1996
recordtypearticle
recordideNqFkDtPwzAQgC0EKqWwsiF5YkvwK2d7ROVVqRVI0NlyHAeC8iJOkPrvSWnEynQn3Xff8CF0SUlMidI3rkpjqjXEPE4IP0JzmiQyUgBwPO4EIEqYlKfoLIRPQigHImdopglVQOgcbV9sZ8vSl9g1VTv0Rf2Omxy3H7tQOFviyrYhiuzvdST74tvj0A_ZDhc1fl1t7rCtM7zZL-1kKkJ1jk5yWwZ_Mc0F2j7cvy2fovXz42p5u44cA9lHaaKUZ4x4m6eSCuoSx7ylQjvphM0YUM6UFV5qAUJ7DzqVJAPBHWG5TR1foOuDt-2ar8GH3lRFcL4sbe2bIRipQBOd0H9BCgI4H80LFB9A1zUhdD43bVdUttsZSsw-uBmDm31ww80YfHy4msxDWvnsD58K8x_bXntb
startdate1996
enddate1996
creator
0Bhandarkar, S M
1Chirravuri, S
2Arnold, J
scope
0CGR
1CUY
2CVF
3ECM
4EIF
5NPM
6AAYXX
7CITATION
88FD
9FR3
10P64
11RC3
127X8
sort
creationdate1996
titleParallel computing of physical maps--a comparative study in SIMD and MIMD parallelism
authorBhandarkar, S M ; Chirravuri, S ; Arnold, J
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-c267t-b588e220eafb7141c5c2ea149c7c4ad261328a4e794649ee69b70d643c02fabc3
rsrctypearticles
prefilterarticles
languageeng
creationdate1996
topic
0Algorithms
1Chromosome Mapping - methods
2Computer Simulation
3Markov Chains
toplevel
0peer_reviewed
1online_resources
creatorcontrib
0Bhandarkar, S M
1Chirravuri, S
2Arnold, J
collection
0Medline
1MEDLINE
2MEDLINE (Ovid)
3MEDLINE
4MEDLINE
5PubMed
6CrossRef
7Technology Research Database
8Engineering Research Database
9Biotechnology and BioEngineering Abstracts
10Genetics Abstracts
11MEDLINE - Academic
jtitleJournal of computational biology
delivery
delcategoryRemote Search Resource
fulltextfulltext
addata
au
0Bhandarkar, S M
1Chirravuri, S
2Arnold, J
formatjournal
genrearticle
ristypeJOUR
atitleParallel computing of physical maps--a comparative study in SIMD and MIMD parallelism
jtitleJournal of computational biology
addtitleJ Comput Biol
date1996
risdate1996
volume3
issue4
spage503
epage528
pages503-528
issn1066-5277
eissn1557-8666
abstractOrdering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
copUnited States
pmid9018601
doi10.1089/cmb.1996.3.503