An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet
Dear editor, In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（N...
Gespeichert in:
| Veröffentlicht in: | Science China. Information sciences 2018, Vol.61 (1), p.275-277, Article 019102 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 277 |
|---|---|
| container_issue | 1 |
| container_start_page | 275 |
| container_title | Science China. Information sciences |
| container_volume | 61 |
| creator | Zhang, Yingjing He, Feng Lu, Guangshan Xiong, Huagang |
| description | Dear editor,
In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem. |
| doi_str_mv | 10.1007/s11432-017-9121-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918585190</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>674282967</cqvip_id><sourcerecordid>2918585190</sourcerecordid><originalsourceid>FETCH-LOGICAL-c391t-63e791afd13fcd824ef90a6bdb7c7edde8a56c3ec20f3b8119d1c424b6ea7d5e3</originalsourceid><addsrcrecordid>eNp9kU9LxDAQxYsouOh-AG9Bz9FM0k2a4yL-A8GLgreYJtNuZNusSffgtzdS0ZtzmTn83jzmTVWdAbsExtRVBqgFpwwU1cCByoNqAY3UFDTowzJLVVMlxOtxtcz5nZUSgnHVLKq39UjCsIsp5jB9kgFztj2S7Dbo99sw9qS1GT2JIxmiD10oc48jTsERu-1jCtNmIF1MZAoD0imFvsdUoJtpg6lwp9VRZ7cZlz_9pHq5vXm-vqePT3cP1-tH6oSGiUqBSoPtPIjO-YbX2GlmZetb5RR6j41dSSfQcdaJtgHQHlzN61aiVX6F4qS6mPfuUvzYY57Me9ynsVgarqFZNSvQrFAwU64cnBN2ZpfCYNOnAWa-szRzlqZkab6zNLJo-KzJhR3LdX-b_xOd_xht4th_FN2vU3kGb7iWSnwBb3qELg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918585190</pqid></control><display><type>article</type><title>An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet</title><source>SpringerNature Journals</source><source>ProQuest Central UK/Ireland</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Zhang, Yingjing ; He, Feng ; Lu, Guangshan ; Xiong, Huagang</creator><creatorcontrib>Zhang, Yingjing ; He, Feng ; Lu, Guangshan ; Xiong, Huagang</creatorcontrib><description>Dear editor,
In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-017-9121-6</identifier><language>eng</language><publisher>Beijing: Science China Press</publisher><subject>Computer Science ; Ethernet ; Genetic algorithms ; Information Systems and Communication Service ; Letter</subject><ispartof>Science China. Information sciences, 2018, Vol.61 (1), p.275-277, Article 019102</ispartof><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017</rights><rights>Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c391t-63e791afd13fcd824ef90a6bdb7c7edde8a56c3ec20f3b8119d1c424b6ea7d5e3</citedby><cites>FETCH-LOGICAL-c391t-63e791afd13fcd824ef90a6bdb7c7edde8a56c3ec20f3b8119d1c424b6ea7d5e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11432-017-9121-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918585190?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,4024,21388,27923,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids></links><search><creatorcontrib>Zhang, Yingjing</creatorcontrib><creatorcontrib>He, Feng</creatorcontrib><creatorcontrib>Lu, Guangshan</creatorcontrib><creatorcontrib>Xiong, Huagang</creatorcontrib><title>An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>Dear editor,
In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem.</description><subject>Computer Science</subject><subject>Ethernet</subject><subject>Genetic algorithms</subject><subject>Information Systems and Communication Service</subject><subject>Letter</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kU9LxDAQxYsouOh-AG9Bz9FM0k2a4yL-A8GLgreYJtNuZNusSffgtzdS0ZtzmTn83jzmTVWdAbsExtRVBqgFpwwU1cCByoNqAY3UFDTowzJLVVMlxOtxtcz5nZUSgnHVLKq39UjCsIsp5jB9kgFztj2S7Dbo99sw9qS1GT2JIxmiD10oc48jTsERu-1jCtNmIF1MZAoD0imFvsdUoJtpg6lwp9VRZ7cZlz_9pHq5vXm-vqePT3cP1-tH6oSGiUqBSoPtPIjO-YbX2GlmZetb5RR6j41dSSfQcdaJtgHQHlzN61aiVX6F4qS6mPfuUvzYY57Me9ynsVgarqFZNSvQrFAwU64cnBN2ZpfCYNOnAWa-szRzlqZkab6zNLJo-KzJhR3LdX-b_xOd_xht4th_FN2vU3kGb7iWSnwBb3qELg</recordid><startdate>2018</startdate><enddate>2018</enddate><creator>Zhang, Yingjing</creator><creator>He, Feng</creator><creator>Lu, Guangshan</creator><creator>Xiong, Huagang</creator><general>Science China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>2018</creationdate><title>An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet</title><author>Zhang, Yingjing ; He, Feng ; Lu, Guangshan ; Xiong, Huagang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c391t-63e791afd13fcd824ef90a6bdb7c7edde8a56c3ec20f3b8119d1c424b6ea7d5e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science</topic><topic>Ethernet</topic><topic>Genetic algorithms</topic><topic>Information Systems and Communication Service</topic><topic>Letter</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Yingjing</creatorcontrib><creatorcontrib>He, Feng</creatorcontrib><creatorcontrib>Lu, Guangshan</creatorcontrib><creatorcontrib>Xiong, Huagang</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Yingjing</au><au>He, Feng</au><au>Lu, Guangshan</au><au>Xiong, Huagang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2018</date><risdate>2018</risdate><volume>61</volume><issue>1</issue><spage>275</spage><epage>277</epage><pages>275-277</pages><artnum>019102</artnum><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>Dear editor,
In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem.</abstract><cop>Beijing</cop><pub>Science China Press</pub><doi>10.1007/s11432-017-9121-6</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-733X |
| ispartof | Science China. Information sciences, 2018, Vol.61 (1), p.275-277, Article 019102 |
| issn | 1674-733X 1869-1919 |
| language | eng |
| recordid | cdi_proquest_journals_2918585190 |
| source | SpringerNature Journals; ProQuest Central UK/Ireland; Alma/SFX Local Collection; ProQuest Central |
| subjects | Computer Science Ethernet Genetic algorithms Information Systems and Communication Service Letter |
| title | An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T18%3A08%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20imporosity%20message%20scheduling%20based%20on%20modified%20genetic%20algorithm%20for%20time-triggered%20Ethernet&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Zhang,%20Yingjing&rft.date=2018&rft.volume=61&rft.issue=1&rft.spage=275&rft.epage=277&rft.pages=275-277&rft.artnum=019102&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-017-9121-6&rft_dat=%3Cproquest_cross%3E2918585190%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918585190&rft_id=info:pmid/&rft_cqvip_id=674282967&rfr_iscdi=true |