Meld scheduling : A technique for relaxing scheduling constraints
Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stall...
Gespeichert in:
| Veröffentlicht in: | International journal of parallel programming 1998-08, Vol.26 (4), p.349-381 |
|---|---|
| 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 | 381 |
|---|---|
| container_issue | 4 |
| container_start_page | 349 |
| container_title | International journal of parallel programming |
| container_volume | 26 |
| creator | ABRAHAM, S. G KATHAIL, V DEITRICH, B. L |
| description | Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for noninterlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch takes effect produce inefficient schedules. General data structures are presented for maintaining latency constraint information at region boundaries. A meld scheduling algorithm for noninterlocked processors that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions. |
| doi_str_mv | 10.1023/A:1018746314457 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_26655149</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>26655149</sourcerecordid><originalsourceid>FETCH-LOGICAL-p240t-ba84e4f0ae6a18bebba8ea468a747152be1ba5056c7639cbfb17fff81e0b6d343</originalsourceid><addsrcrecordid>eNpdzktLAzEUBeAgCtbq2u0g4m4070d3Q_EFFTe6HpL0xk5JMzWZAf33juhCXB245-NyEDon-Jpgym6aBcFEKy4Z4VyoAzQjQrFaSY4P0QxrLWrFhT5GJ6VsMcZGaT1DzRPEdVX8BtZj7NJbtaiaagC_Sd37CFXoc5Uh2o_v6o_yfSpDtl0ayik6CjYWOPvNOXq9u31ZPtSr5_vHZbOq95TjoXZWc-ABW5CWaAduOoDlUlvFFRHUAXFWYCG9ksx4FxxRIQRNADu5ZpzN0dXP333up2llaHdd8RCjTdCPpaVSCkG4meDFP7jtx5ymbS3FnBquDJ3Q5S-yxdsYsk2-K-0-dzubP1sijMLKsC8P8WYo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204294792</pqid></control><display><type>article</type><title>Meld scheduling : A technique for relaxing scheduling constraints</title><source>SpringerLink Journals</source><creator>ABRAHAM, S. G ; KATHAIL, V ; DEITRICH, B. L</creator><creatorcontrib>ABRAHAM, S. G ; KATHAIL, V ; DEITRICH, B. L</creatorcontrib><description>Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for noninterlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch takes effect produce inefficient schedules. General data structures are presented for maintaining latency constraint information at region boundaries. A meld scheduling algorithm for noninterlocked processors that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions.</description><identifier>ISSN: 0885-7458</identifier><identifier>EISSN: 1573-7640</identifier><identifier>DOI: 10.1023/A:1018746314457</identifier><identifier>CODEN: IJPPE5</identifier><language>eng</language><publisher>New York, NY: Plenum Press</publisher><subject>Algorithms ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Language theory and syntactical analysis ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization ; Parallel processing ; Performance evaluation ; Schedules ; Scheduling ; Scheduling, sequencing ; Software ; Studies ; Theoretical computing</subject><ispartof>International journal of parallel programming, 1998-08, Vol.26 (4), p.349-381</ispartof><rights>1999 INIST-CNRS</rights><rights>Plenum Publishing Corporation 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,776,780,785,786,23910,23911,25119,27903,27904</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1597079$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ABRAHAM, S. G</creatorcontrib><creatorcontrib>KATHAIL, V</creatorcontrib><creatorcontrib>DEITRICH, B. L</creatorcontrib><title>Meld scheduling : A technique for relaxing scheduling constraints</title><title>International journal of parallel programming</title><description>Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for noninterlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch takes effect produce inefficient schedules. General data structures are presented for maintaining latency constraint information at region boundaries. A meld scheduling algorithm for noninterlocked processors that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Language theory and syntactical analysis</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Parallel processing</subject><subject>Performance evaluation</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Software</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0885-7458</issn><issn>1573-7640</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdzktLAzEUBeAgCtbq2u0g4m4070d3Q_EFFTe6HpL0xk5JMzWZAf33juhCXB245-NyEDon-Jpgym6aBcFEKy4Z4VyoAzQjQrFaSY4P0QxrLWrFhT5GJ6VsMcZGaT1DzRPEdVX8BtZj7NJbtaiaagC_Sd37CFXoc5Uh2o_v6o_yfSpDtl0ayik6CjYWOPvNOXq9u31ZPtSr5_vHZbOq95TjoXZWc-ABW5CWaAduOoDlUlvFFRHUAXFWYCG9ksx4FxxRIQRNADu5ZpzN0dXP333up2llaHdd8RCjTdCPpaVSCkG4meDFP7jtx5ymbS3FnBquDJ3Q5S-yxdsYsk2-K-0-dzubP1sijMLKsC8P8WYo</recordid><startdate>19980801</startdate><enddate>19980801</enddate><creator>ABRAHAM, S. G</creator><creator>KATHAIL, V</creator><creator>DEITRICH, B. L</creator><general>Plenum Press</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>19980801</creationdate><title>Meld scheduling : A technique for relaxing scheduling constraints</title><author>ABRAHAM, S. G ; KATHAIL, V ; DEITRICH, B. L</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p240t-ba84e4f0ae6a18bebba8ea468a747152be1ba5056c7639cbfb17fff81e0b6d343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Language theory and syntactical analysis</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Parallel processing</topic><topic>Performance evaluation</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Software</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ABRAHAM, S. G</creatorcontrib><creatorcontrib>KATHAIL, V</creatorcontrib><creatorcontrib>DEITRICH, B. L</creatorcontrib><collection>Pascal-Francis</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</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 Basic</collection><jtitle>International journal of parallel programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ABRAHAM, S. G</au><au>KATHAIL, V</au><au>DEITRICH, B. L</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Meld scheduling : A technique for relaxing scheduling constraints</atitle><jtitle>International journal of parallel programming</jtitle><date>1998-08-01</date><risdate>1998</risdate><volume>26</volume><issue>4</issue><spage>349</spage><epage>381</epage><pages>349-381</pages><issn>0885-7458</issn><eissn>1573-7640</eissn><coden>IJPPE5</coden><abstract>Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for noninterlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch takes effect produce inefficient schedules. General data structures are presented for maintaining latency constraint information at region boundaries. A meld scheduling algorithm for noninterlocked processors that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions.</abstract><cop>New York, NY</cop><pub>Plenum Press</pub><doi>10.1023/A:1018746314457</doi><tpages>33</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0885-7458 |
| ispartof | International journal of parallel programming, 1998-08, Vol.26 (4), p.349-381 |
| issn | 0885-7458 1573-7640 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26655149 |
| source | SpringerLink Journals |
| subjects | Algorithms Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Language theory and syntactical analysis Operational research and scientific management Operational research. Management science Operations research Optimization Parallel processing Performance evaluation Schedules Scheduling Scheduling, sequencing Software Studies Theoretical computing |
| title | Meld scheduling : A technique for relaxing scheduling constraints |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T08%3A47%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Meld%20scheduling%20:%20A%20technique%20for%20relaxing%20scheduling%20constraints&rft.jtitle=International%20journal%20of%20parallel%20programming&rft.au=ABRAHAM,%20S.%20G&rft.date=1998-08-01&rft.volume=26&rft.issue=4&rft.spage=349&rft.epage=381&rft.pages=349-381&rft.issn=0885-7458&rft.eissn=1573-7640&rft.coden=IJPPE5&rft_id=info:doi/10.1023/A:1018746314457&rft_dat=%3Cproquest_pasca%3E26655149%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204294792&rft_id=info:pmid/&rfr_iscdi=true |