Optimal image partitioning in heterogeneous computing systems

Optimal image partitioning in heterogeneous computing systems

A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters 2002-08, Vol.38 (18), p.1023-1023
Hauptverfasser: Zhiyong, Zeng, Xinda, Lu
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1023
container_issue 18
container_start_page 1023
container_title Electronics letters
container_volume 38
creator Zhiyong, Zeng
Xinda, Lu
description A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has considered the communication overhead.
doi_str_mv 10.1049/el:20020725
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27640320</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>27640320</sourcerecordid><originalsourceid>FETCH-LOGICAL-c220t-19e27906441790623bc4830d111a114987ea945b0db73944f6759585a21155423</originalsourceid><addsrcrecordid>eNo1kEtLxEAQhAdRcF09-Qdy8iLR7nlkMoIHWXzBwl4UvA2TbCdG8nJmcth_b9bVSxdNfTRdxdglwg2CNLfU3nEADpqrI7ZAoSA1iB_HbAGAIlVo5Ck7C-FrXrkxesHuN2NsOtcm86gpGZ2PTWyGvunrpOmTT4rkh5p6GqaQlEM3TnFvhV2I1IVzdlK5NtDFny7Z-9Pj2-olXW-eX1cP67TkHGKKhrg2kEmJe-GiKGUuYIuIDlGaXJMzUhWwLbQwUlaZVkblynFEpSQXS3Z1uDv64XuiEG3XhJLa1v0-ZrnOJAgOM3h9AEs_hOCpsqOfk_mdRbD7iiy19r8i8QOrs1eU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27640320</pqid></control><display><type>article</type><title>Optimal image partitioning in heterogeneous computing systems</title><source>Alma/SFX Local Collection</source><creator>Zhiyong, Zeng ; Xinda, Lu</creator><creatorcontrib>Zhiyong, Zeng ; Xinda, Lu</creatorcontrib><description>A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has considered the communication overhead.</description><identifier>ISSN: 0013-5194</identifier><identifier>EISSN: 1350-911X</identifier><identifier>DOI: 10.1049/el:20020725</identifier><language>eng</language><ispartof>Electronics letters, 2002-08, Vol.38 (18), p.1023-1023</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c220t-19e27906441790623bc4830d111a114987ea945b0db73944f6759585a21155423</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Zhiyong, Zeng</creatorcontrib><creatorcontrib>Xinda, Lu</creatorcontrib><title>Optimal image partitioning in heterogeneous computing systems</title><title>Electronics letters</title><description>A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has considered the communication overhead.</description><issn>0013-5194</issn><issn>1350-911X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><recordid>eNo1kEtLxEAQhAdRcF09-Qdy8iLR7nlkMoIHWXzBwl4UvA2TbCdG8nJmcth_b9bVSxdNfTRdxdglwg2CNLfU3nEADpqrI7ZAoSA1iB_HbAGAIlVo5Ck7C-FrXrkxesHuN2NsOtcm86gpGZ2PTWyGvunrpOmTT4rkh5p6GqaQlEM3TnFvhV2I1IVzdlK5NtDFny7Z-9Pj2-olXW-eX1cP67TkHGKKhrg2kEmJe-GiKGUuYIuIDlGaXJMzUhWwLbQwUlaZVkblynFEpSQXS3Z1uDv64XuiEG3XhJLa1v0-ZrnOJAgOM3h9AEs_hOCpsqOfk_mdRbD7iiy19r8i8QOrs1eU</recordid><startdate>20020829</startdate><enddate>20020829</enddate><creator>Zhiyong, Zeng</creator><creator>Xinda, Lu</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20020829</creationdate><title>Optimal image partitioning in heterogeneous computing systems</title><author>Zhiyong, Zeng ; Xinda, Lu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c220t-19e27906441790623bc4830d111a114987ea945b0db73944f6759585a21155423</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhiyong, Zeng</creatorcontrib><creatorcontrib>Xinda, Lu</creatorcontrib><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Electronics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhiyong, Zeng</au><au>Xinda, Lu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal image partitioning in heterogeneous computing systems</atitle><jtitle>Electronics letters</jtitle><date>2002-08-29</date><risdate>2002</risdate><volume>38</volume><issue>18</issue><spage>1023</spage><epage>1023</epage><pages>1023-1023</pages><issn>0013-5194</issn><eissn>1350-911X</eissn><abstract>A large and useful subset of image processing applications can be characterised using data parallel iterative synchronous algorithms. A partitioning and co-scheduling algorithm with minimum task's finish time is presented. One important rational characteristic of this algorithm is that it has considered the communication overhead.</abstract><doi>10.1049/el:20020725</doi><tpages>1</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0013-5194
ispartof Electronics letters, 2002-08, Vol.38 (18), p.1023-1023
issn 0013-5194
1350-911X
language eng
recordid cdi_proquest_miscellaneous_27640320
source Alma/SFX Local Collection
title Optimal image partitioning in heterogeneous computing systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T03%3A00%3A05IST&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=Optimal%20image%20partitioning%20in%20heterogeneous%20computing%20systems&rft.jtitle=Electronics%20letters&rft.au=Zhiyong,%20Zeng&rft.date=2002-08-29&rft.volume=38&rft.issue=18&rft.spage=1023&rft.epage=1023&rft.pages=1023-1023&rft.issn=0013-5194&rft.eissn=1350-911X&rft_id=info:doi/10.1049/el:20020725&rft_dat=%3Cproquest_cross%3E27640320%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=27640320&rft_id=info:pmid/&rfr_iscdi=true