A parallel computing engine for a class of time critical processes
This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engi...
Uložené v:
| Vydané v: | IEEE transactions on systems, man and cybernetics. Part B, Cybernetics Ročník 27; číslo 5; s. 774 - 786 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
United States
IEEE
01.10.1997
|
| Predmet: | |
| ISSN: | 1083-4419, 1941-0492 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by two case studies with good results. |
|---|---|
| AbstractList | This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by two case studies with good results. This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by two case studies with good results This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by two case studies with good results.This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. Moreover, the proposed technique is simple, flexible, and computationally viable. The efficiency of the algorithm is demonstrated by two case studies with good results. This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These analytical models are of significant importance to many real-time systems that have to meet severe time constants. A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer. First, the analytical system is efficiently coded in its general form. The model is then simplified by using any available information. A task graph representing the interconnections among the different components (or equations) is generated. The graph can then be compressed to control the computation/communication requirements. The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities. (Author) |
| Author | Nabhan, T.M. Zomaya, A.Y. |
| Author_xml | – sequence: 1 givenname: T.M. surname: Nabhan fullname: Nabhan, T.M. email: zomaya@ee.uwa.edu.au organization: Dept. of Electr. & Electron. Eng., Western Australia Univ., Perth, WA, Australia – sequence: 2 givenname: A.Y. surname: Zomaya fullname: Zomaya, A.Y. |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/18263088$$D View this record in MEDLINE/PubMed |
| BookMark | eNqF0ctLJDEQB-Agyo6PPXnzIDntHpbWPDvJcVb2IQhe9NxUpytDlnT3mPQc9r-3hxlXEFYhUIH6qgL5nZDDYRyQkHPOrjhn7loqY65qIYXkB-SYO8Urppw4nO_Mykop7hbkpJQ_jDHHnPlEFtyKWjJrj8n3JV1DhpQwUT_2680UhxXFYRUHpGHMFKhPUAodA51ij9TnOEUPia7z6LEULGfkKEAq-HlfT8njzx8PN7-ru_tftzfLu8pLZ6eqVQChs6DrjqM0WnPXmuA77bnnWKPi2KG08wkQWhmYcZ1upRAQoJXg5Cn5uts7v_y0wTI1fSweU4IBx01pjFRCa6vqWX55VwrHmHXSfgytFkbX5mNohNPOqRle7uGm7bFr1jn2kP82Lz8-g2874PNYSsbwSlizzbPZ5tns8pw1f6N9nGCK4zBliOk_Mxe7mYiI_7bvm89gg6kN |
| CODEN | ITSCFI |
| CitedBy_id | crossref_primary_10_1109_71_476165 crossref_primary_10_1006_jpdc_2002_1856 crossref_primary_10_1006_jpdc_1997_1391 crossref_primary_10_1109_MCISE_2001_963434 crossref_primary_10_1109_71_790598 |
| Cites_doi | 10.1109/71.210815 10.1109/TCAD.1987.1270265 10.1109/TC.1985.1676563 10.1109/TC.1983.1676321 10.1109/JRA.1985.1087004 10.1109/21.57271 10.1109/TC.1987.1676925 10.1126/science.220.4598.671 10.1109/71.476165 10.1007/BF01582166 10.1109/21.21600 10.1109/21.44032 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION NPM 8FD H8D L7M 7SC 7SP 7TB FR3 JQ2 L~C L~D 7X8 |
| DOI | 10.1109/3477.623231 |
| DatabaseName | CrossRef PubMed Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Engineering Research Database ProQuest Computer Science Collection Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional MEDLINE - Academic |
| DatabaseTitle | CrossRef PubMed Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Computer and Information Systems Abstracts Professional MEDLINE - Academic |
| DatabaseTitleList | Technology Research Database MEDLINE - Academic Technology Research Database Technology Research Database PubMed |
| 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 | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 1941-0492 |
| EndPage | 786 |
| ExternalDocumentID | 18263088 10_1109_3477_623231 623231 |
| Genre | orig-research Journal Article |
| GroupedDBID | --- -~X 0R~ 29I 4.4 53G 5VS 6IK 85S 97E AAJGR AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFS AETIX AGQYO AGSQL AHBIQ AI. AIBXA ALLEH ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD F5P HZ~ IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL PZZ RIA RIE RNS RXW TAE TAF VH1 VJK AAYXX CITATION NPM 8FD H8D L7M 7SC 7SP 7TB FR3 JQ2 L~C L~D 7X8 |
| ID | FETCH-LOGICAL-c398t-b4aafd8a56d1e375519b7fcd5c1c1e6e41ede38e38fafb3f079d5b322afab3a93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_3477_623231&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1083-4419 |
| IngestDate | Fri Jul 11 10:37:27 EDT 2025 Fri Jul 11 13:02:30 EDT 2025 Fri Jul 11 11:43:04 EDT 2025 Fri Jul 11 07:13:36 EDT 2025 Mon Jul 21 05:53:41 EDT 2025 Tue Nov 18 21:38:17 EST 2025 Sat Nov 29 02:08:25 EST 2025 Wed Aug 27 02:29:44 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c398t-b4aafd8a56d1e375519b7fcd5c1c1e6e41ede38e38fafb3f079d5b322afab3a93 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| PMID | 18263088 |
| PQID | 27295994 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_29008938 proquest_miscellaneous_27295994 proquest_miscellaneous_28527567 crossref_citationtrail_10_1109_3477_623231 proquest_miscellaneous_734255846 ieee_primary_623231 crossref_primary_10_1109_3477_623231 pubmed_primary_18263088 |
| PublicationCentury | 1900 |
| PublicationDate | 1997-10-01 |
| PublicationDateYYYYMMDD | 1997-10-01 |
| PublicationDate_xml | – month: 10 year: 1997 text: 1997-10-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | IEEE transactions on systems, man and cybernetics. Part B, Cybernetics |
| PublicationTitleAbbrev | TSMCB |
| PublicationTitleAlternate | IEEE Trans Syst Man Cybern B Cybern |
| PublicationYear | 1997 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | lawson (ref13) 1992 ref15 ref14 paul (ref20) 1981 ref11 ref22 inmos ltd (ref10) 1988 ref21 ref1 ref17 ref19 lewis (ref16) 1992 ref7 nabhan (ref18) 1994 barhen (ref3) 1987; 2 erwin (ref8) 1993 ref4 gabor (ref9) 1961; 108 ref6 kirkpatrick (ref12) 1983; 220 barhen (ref2) 1987 bertsekas (ref5) 1989 |
| References_xml | – ident: ref6 doi: 10.1109/71.210815 – ident: ref21 doi: 10.1109/TCAD.1987.1270265 – volume: 2 start-page: 84 year: 1987 ident: ref3 article-title: advances in concurrent computation for machine intelligence and robotics publication-title: Proc 2nd Int Conf Supercomputing – ident: ref22 doi: 10.1109/TC.1985.1676563 – ident: ref4 doi: 10.1109/TC.1983.1676321 – year: 1989 ident: ref5 publication-title: Parallel and Distributed Computation Numerical Methods – ident: ref11 doi: 10.1109/JRA.1985.1087004 – volume: 108 start-page: 422 year: 1961 ident: ref9 article-title: a universal non-linear filter predictor and simulator which optimizes itself by a learning process publication-title: IEEE Proceedings – ident: ref14 doi: 10.1109/21.57271 – ident: ref15 doi: 10.1109/TC.1987.1676925 – start-page: 195 year: 1987 ident: ref2 article-title: hypercube ensembles: an architecture for intelligent robots publication-title: Computer Architectures for Robotics and Automation – year: 1992 ident: ref16 publication-title: Introduction to Parallel Computing – volume: 220 start-page: 671 year: 1983 ident: ref12 article-title: optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – year: 1994 ident: ref18 publication-title: Parallel computations for a class of time critical processes – year: 1992 ident: ref13 publication-title: Parallel Processing in Industrial Real-Time Applications – year: 1993 ident: ref8 publication-title: Advanced Engineering Mathematics – ident: ref19 doi: 10.1109/71.476165 – year: 1988 ident: ref10 publication-title: Transputer Reference Manual – ident: ref17 doi: 10.1007/BF01582166 – ident: ref7 doi: 10.1109/21.21600 – ident: ref1 doi: 10.1109/21.44032 – year: 1981 ident: ref20 publication-title: Robot Manipulators Mathematics Programming and Control |
| SSID | ssj0009097 |
| Score | 1.2698864 |
| Snippet | This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures. These... |
| SourceID | proquest pubmed crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 774 |
| SubjectTerms | Analytical models Computer architecture Concurrent computing Differential equations Engines Iterative algorithms Numerical models Optimal scheduling Parallel processing Real time systems |
| Title | A parallel computing engine for a class of time critical processes |
| URI | https://ieeexplore.ieee.org/document/623231 https://www.ncbi.nlm.nih.gov/pubmed/18263088 https://www.proquest.com/docview/27295994 https://www.proquest.com/docview/28527567 https://www.proquest.com/docview/29008938 https://www.proquest.com/docview/734255846 |
| Volume | 27 |
| WOSCitedRecordID | wos10_1109_3477_623231&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1941-0492 dateEnd: 20121231 omitProxy: false ssIdentifier: ssj0009097 issn: 1083-4419 databaseCode: RIE dateStart: 19960101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT-MwEB4B4rAceJRdKK_1gQO7UsCpk9o-AgJxWCEOgHqL_BhLK1Utoi2_n7HjUg6AhJRDlIylZDzOfI493wdw3NPc9so-LwgshILydVlY4XnhKl8FtJXxaTPm4z95e6sGA32XebZTLQwips1neBpP01q-H7tZ_FV2Rqm6F2uml6Xst6VaC35d3uqoEKIoKMPrXIpXcn0mKilP26aRIpTwtOBJaGWRh5KwyucYM-Wa641vPeUmrGdIyc7bGNiCJRx1YO0d0WAHtvIQnrCTzDP9Zxsuzlkk_h4OcchcEncgW4apHSMsywxzEVuzcWBRgp65LIvAntrqApz8hIfrq_vLmyJLKhROaDUtyPkmeGXqvi9RSIJL2srgfO1KV2IfqxI9CkVHMMGKwKX2taVBb4KxwmjxC1ZG4xHuAlPWca2cFwQhKs-dJazDbaBZqUFP97rwd-7gxmW-8Sh7MWzSvIPrJnZM03qrC8dvxk8tzcbHZp3o7zeT-dXf845raHDEFQ8zwvFs0vRo6lBrXX1hoepIgC-_sNAEk7RQXWCfWEhBH74I5Lqw04bN4h1ytO19-OD78COx4aa9gQewMn2e4SGsupfp_8nzEYX5QB2lMH8FsKX4Mg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT-MwEB2tYCXYA7sUWMp-4AMHQEpxYqeJj-xqEYhutQdA3CJ_jCWkqkW05fczdly6B0BCyiFKxlIyHmeeY897AAeF4qbI-zwjsOAzytd5ZoTjmZVOejRSu7gZ82ZQDYf17a36l3i2Yy0MIsbNZ9gLp3Et303sPPwqO6FUXYSa6dVSyoK3xVpLhl3eKqkQpsgox6tUjJdzdSJkVfXaxoEklBC14FFqZZmJorTK6ygzZpuzz-96zi-wkUAlO22jYBM-4LgDn_6jGuzAZhrEU3aYmKaPtuDXKQvU36MRjpiN8g5kyzC2Y4RmmWY2oGs28SyI0DObhBHYfVtfgNNtuD77c_X7PEuiCpkVqp5l5H7tXa3LvstRVASYlKm8daXNbY59lDk6FDUdXnsjPK-UKw0Ne-21EVqJHVgZT8a4C6w2lqvaOkEgQjpuDaEdbjzNSzU6uteF44WDG5sYx4PwxaiJMw-umtAxTeutLhw8G9-3RBsvm3WCv59NFlf3Fx3X0PAIax56jJP5tClo8lAqJd-wqMtAgV-9YaEIKClRd4G9YlEJ-vQFKNeFr23YLN8hRdveiw--D2vnV38HzeBiePkN1iM3btwp-B1WZg9z_AEf7ePsbvrwMwb7E99W-pE |
| 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=A+parallel+computing+engine+for+a+class+of+time+critical+processes&rft.jtitle=IEEE+transactions+on+systems%2C+man+and+cybernetics.+Part+B%2C+Cybernetics&rft.au=Nabhan%2C+T+M&rft.au=Zomaya%2C+A+Y&rft.date=1997-10-01&rft.issn=1083-4419&rft.volume=27&rft.issue=5&rft.spage=774&rft.epage=786&rft_id=info:doi/10.1109%2F3477.623231&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1083-4419&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1083-4419&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1083-4419&client=summon |