Task scheduling in multiprocessing systems using duplication
Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG)...
Gespeichert in:
| Veröffentlicht in: | Journal of systems architecture 2008-05, Vol.54 (5), p.519-529 |
|---|---|
| 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 | 529 |
|---|---|
| container_issue | 5 |
| container_start_page | 519 |
| container_title | Journal of systems architecture |
| container_volume | 54 |
| creator | Chaudhuri, Pranay Elcock, Jeffrey |
| description | Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of
O
(
d
|
V
|
3
)
, where ∣
V∣ represents the number of tasks and
d the maximum indegree of tasks. |
| doi_str_mv | 10.1016/j.sysarc.2007.09.004 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_218914114</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1383762107001245</els_id><sourcerecordid>1484057331</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-ed75c3ebebeec82d2152349090d0fbc4f22ec5e20b7f8cedeba6158851bab1033</originalsourceid><addsrcrecordid>eNp9UE1LxDAQDaLguvoPPBTvrTNJ0w8QQRZXhQUv6zmk6VRTu-2atML-e7PWs8xhPnjz5s1j7BohQcDstk38wWtnEg6QJ1AmAOkJW2CRizjDTJ6GWhQizjOO5-zC-xYApES-YHdb7T8jbz6onjrbv0e2j3ZTN9q9Gwx5fxwF8pF2Ppp-u3rad9bo0Q79JTtrdOfp6i8v2dv6cbt6jjevTy-rh01shBBjTHUujaAqBJmC1xwlF2kJJdTQVCZtOCcjiUOVN4WhmiqdoSwKiZWuEIRYspuZN4j6msiPqh0m14eTimNRYoqYBlA6g4wbvHfUqL2zO-0OCkEdbVKtmm1SR5sUlCrYFNbu5zUKD3xbcsobS32QYR2ZUdWD_Z_gB_PidDk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218914114</pqid></control><display><type>article</type><title>Task scheduling in multiprocessing systems using duplication</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Chaudhuri, Pranay ; Elcock, Jeffrey</creator><creatorcontrib>Chaudhuri, Pranay ; Elcock, Jeffrey</creatorcontrib><description>Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of
O
(
d
|
V
|
3
)
, where ∣
V∣ represents the number of tasks and
d the maximum indegree of tasks.</description><identifier>ISSN: 1383-7621</identifier><identifier>EISSN: 1873-6165</identifier><identifier>DOI: 10.1016/j.sysarc.2007.09.004</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Distributed algorithm ; Distributed computing environment ; Distributed processing ; Microprocessors ; Optimal schedule ; Optimization ; Scheduling algorithms ; Studies ; Task scheduling ; Time complexity</subject><ispartof>Journal of systems architecture, 2008-05, Vol.54 (5), p.519-529</ispartof><rights>2007 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. May 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-ed75c3ebebeec82d2152349090d0fbc4f22ec5e20b7f8cedeba6158851bab1033</citedby><cites>FETCH-LOGICAL-c333t-ed75c3ebebeec82d2152349090d0fbc4f22ec5e20b7f8cedeba6158851bab1033</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.sysarc.2007.09.004$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,778,782,3539,27911,27912,45982</link.rule.ids></links><search><creatorcontrib>Chaudhuri, Pranay</creatorcontrib><creatorcontrib>Elcock, Jeffrey</creatorcontrib><title>Task scheduling in multiprocessing systems using duplication</title><title>Journal of systems architecture</title><description>Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of
O
(
d
|
V
|
3
)
, where ∣
V∣ represents the number of tasks and
d the maximum indegree of tasks.</description><subject>Distributed algorithm</subject><subject>Distributed computing environment</subject><subject>Distributed processing</subject><subject>Microprocessors</subject><subject>Optimal schedule</subject><subject>Optimization</subject><subject>Scheduling algorithms</subject><subject>Studies</subject><subject>Task scheduling</subject><subject>Time complexity</subject><issn>1383-7621</issn><issn>1873-6165</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LxDAQDaLguvoPPBTvrTNJ0w8QQRZXhQUv6zmk6VRTu-2atML-e7PWs8xhPnjz5s1j7BohQcDstk38wWtnEg6QJ1AmAOkJW2CRizjDTJ6GWhQizjOO5-zC-xYApES-YHdb7T8jbz6onjrbv0e2j3ZTN9q9Gwx5fxwF8pF2Ppp-u3rad9bo0Q79JTtrdOfp6i8v2dv6cbt6jjevTy-rh01shBBjTHUujaAqBJmC1xwlF2kJJdTQVCZtOCcjiUOVN4WhmiqdoSwKiZWuEIRYspuZN4j6msiPqh0m14eTimNRYoqYBlA6g4wbvHfUqL2zO-0OCkEdbVKtmm1SR5sUlCrYFNbu5zUKD3xbcsobS32QYR2ZUdWD_Z_gB_PidDk</recordid><startdate>20080501</startdate><enddate>20080501</enddate><creator>Chaudhuri, Pranay</creator><creator>Elcock, Jeffrey</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080501</creationdate><title>Task scheduling in multiprocessing systems using duplication</title><author>Chaudhuri, Pranay ; Elcock, Jeffrey</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-ed75c3ebebeec82d2152349090d0fbc4f22ec5e20b7f8cedeba6158851bab1033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Distributed algorithm</topic><topic>Distributed computing environment</topic><topic>Distributed processing</topic><topic>Microprocessors</topic><topic>Optimal schedule</topic><topic>Optimization</topic><topic>Scheduling algorithms</topic><topic>Studies</topic><topic>Task scheduling</topic><topic>Time complexity</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chaudhuri, Pranay</creatorcontrib><creatorcontrib>Elcock, Jeffrey</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of systems architecture</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chaudhuri, Pranay</au><au>Elcock, Jeffrey</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Task scheduling in multiprocessing systems using duplication</atitle><jtitle>Journal of systems architecture</jtitle><date>2008-05-01</date><risdate>2008</risdate><volume>54</volume><issue>5</issue><spage>519</spage><epage>529</epage><pages>519-529</pages><issn>1383-7621</issn><eissn>1873-6165</eissn><abstract>Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of
O
(
d
|
V
|
3
)
, where ∣
V∣ represents the number of tasks and
d the maximum indegree of tasks.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.sysarc.2007.09.004</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1383-7621 |
| ispartof | Journal of systems architecture, 2008-05, Vol.54 (5), p.519-529 |
| issn | 1383-7621 1873-6165 |
| language | eng |
| recordid | cdi_proquest_journals_218914114 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Distributed algorithm Distributed computing environment Distributed processing Microprocessors Optimal schedule Optimization Scheduling algorithms Studies Task scheduling Time complexity |
| title | Task scheduling in multiprocessing systems using duplication |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T17%3A25%3A08IST&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=Task%20scheduling%20in%20multiprocessing%20systems%20using%20duplication&rft.jtitle=Journal%20of%20systems%20architecture&rft.au=Chaudhuri,%20Pranay&rft.date=2008-05-01&rft.volume=54&rft.issue=5&rft.spage=519&rft.epage=529&rft.pages=519-529&rft.issn=1383-7621&rft.eissn=1873-6165&rft_id=info:doi/10.1016/j.sysarc.2007.09.004&rft_dat=%3Cproquest_cross%3E1484057331%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=218914114&rft_id=info:pmid/&rft_els_id=S1383762107001245&rfr_iscdi=true |