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...
Saved in:
| Published in: | Journal of computational biology Vol. 3; no. 4; p. 503 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
1996
|
| Subjects: | |
| ISSN: | 1066-5277 |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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.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. 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. |
| Author | Chirravuri, S Arnold, J Bhandarkar, S M |
| Author_xml | – sequence: 1 givenname: S M surname: Bhandarkar fullname: Bhandarkar, S M organization: Department of Computer Science, University of Georgia, Athens 30602-7404, USA – sequence: 2 givenname: S surname: Chirravuri fullname: Chirravuri, S – sequence: 3 givenname: J surname: Arnold fullname: Arnold, J |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/9018601$$D View this record in MEDLINE/PubMed |
| BookMark | eNotkDtPwzAUhT0UlbawsiF5Ykuw8_BjRIVCpVYgQefoJrkGIzsJcYLUfw-FTOdI59M3nCWZNW2DhFxxFnOm9G3ly5hrLeI0zlk6IwvOhIjyRMpzsgzhkzGeCibnZK4ZV4LxBTm8QA_OoaNV67txsM07bQ3tPo7BVuCohy5EEfytv-Rgv5GGYayP1Db0dbu_p9DUdH8q3WSywV-QMwMu4OWUK3LYPLytn6Ld8-N2fbeLqjSXQ1QaRBBSSiEQFHClQGR5JpnWZZ0lUkuQZQa5SpFLg2AgEcYYLirOWc14siI3_96ub79GDEPhbajQOWiwHUMhldBM5yfwegLH0mNddL310B-L6YfkB_UfXug |
| CitedBy_id | crossref_primary_10_1016_j_trc_2024_104873 crossref_primary_10_1017_S0953756297005443 crossref_primary_10_1093_genetics_157_3_1021 crossref_primary_10_1145_568522_568523 |
| ContentType | Journal Article |
| DBID | CGR CUY CVF ECM EIF NPM 7X8 |
| DOI | 10.1089/cmb.1996.3.503 |
| DatabaseName | Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed MEDLINE - Academic |
| DatabaseTitle | MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Biology Mathematics |
| ExternalDocumentID | 9018601 |
| Genre | Research Support, U.S. Gov't, Non-P.H.S Comparative Study Research Support, Non-U.S. Gov't Journal Article |
| GroupedDBID | --- 0R~ 1-M 29K 34G 39C 4.4 53G 5GY ABBKN ABEFU ACGFO ADBBV AENEX AFOSN AI. ALMA_UNASSIGNED_HOLDINGS BAWUL BNQNF CAG CGR COF CS3 CUY CVF D-I DIK DU5 EBS ECM EIF EJD F5P IAO IER IGS IHR IM4 ISR ITC MV1 NPM NQHIM O9- OK1 P2P R.V RIG RML RMSOB RNS TN5 TR2 UE5 VH1 7X8 SCNPE |
| ID | FETCH-LOGICAL-c357t-bfeea677766ea8a188a64547099bd42797a7b4a583e17feafa26fff16c110d012 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10.1089_cmb.1996.3.503&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1066-5277 |
| IngestDate | Thu Oct 02 05:33:40 EDT 2025 Sat Sep 28 07:38:23 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c357t-bfeea677766ea8a188a64547099bd42797a7b4a583e17feafa26fff16c110d012 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PMID | 9018601 |
| PQID | 78690951 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_78690951 pubmed_primary_9018601 |
| PublicationCentury | 1900 |
| PublicationDate | 1996-00-00 |
| PublicationDateYYYYMMDD | 1996-01-01 |
| PublicationDate_xml | – year: 1996 text: 1996-00-00 |
| PublicationDecade | 1990 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Journal of computational biology |
| PublicationTitleAlternate | J Comput Biol |
| PublicationYear | 1996 |
| SSID | ssj0013607 |
| Score | 1.4776746 |
| Snippet | Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 503 |
| SubjectTerms | Algorithms Chromosome Mapping - methods Computer Simulation Markov Chains |
| Title | Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/9018601 https://www.proquest.com/docview/78690951 |
| Volume | 3 |
| WOSCitedRecordID | wos10.1089_cmb.1996.3.503&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH5Mp6AHf0yH82cOXrOta5q0IIioQw8dAx3sNpI0gYFr6zoF_3uTtFUv4sFL6aWhvLzkfS8v7_sALj3BtSARwQkdaEwS0sdhwAn2DHhWMnLNkU5sgo1G4XQajRtwVffC2GuV9Z7oNuokk_aMvMesdJKBA9f5K7aaUba2WglorEHTN0DGLks2_VFDoK5Z2uQ81KRbjNWUjWHUkwth2_Ro1-8GTi7rF3Dpgsxw93-_twc7FbhEN6U37ENDpS3YLOUmP1qwHX9xtBYHMBnzpRVSeUHSKTuYGIYyjfJq4tCC5wXGHMlvfnDkyGjRPEVPj_Ed4mmCYvuSVyPNi8UhTIb3z7cPuBJZwNIP2AoLrRSnjDFKFQ-5F4bckXwZ5CgSMmAR40wQHoS-8phWXPMB1Vp7VBrgkJjw1ob1NEvVESBfkcRXgiVCRsTrm5kWkogoUJESVPikAxe17WbGiW1lgqcqeytmtfU60C7NP8tLro2ZgSuhyRmP__z0BLbKC9X2dOQUmtqsXnUGG_J9NS-W5841zHM0jj8BXJjDdA |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+computing+of+physical+maps--a+comparative+study+in+SIMD+and+MIMD+parallelism&rft.jtitle=Journal+of+computational+biology&rft.au=Bhandarkar%2C+S+M&rft.au=Chirravuri%2C+S&rft.au=Arnold%2C+J&rft.date=1996-01-01&rft.issn=1066-5277&rft.volume=3&rft.issue=4&rft.spage=503&rft_id=info:doi/10.1089%2Fcmb.1996.3.503&rft_id=info%3Apmid%2F9018601&rft_id=info%3Apmid%2F9018601&rft.externalDocID=9018601 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1066-5277&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1066-5277&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1066-5277&client=summon |