Deadline-aware scheduling for Software Transactional Memory
Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to s...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 268 |
|---|---|
| container_issue | |
| container_start_page | 257 |
| container_title | |
| container_volume | |
| creator | Maldonado, W. Marlier, P. Felber, P. Lawall, J. Muller, G. Riviere, E. |
| description | Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts. |
| doi_str_mv | 10.1109/DSN.2011.5958224 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_6IE</sourceid><recordid>TN_cdi_ieee_primary_5958224</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5958224</ieee_id><sourcerecordid>oai_HAL_hal_01286605v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h209t-7380805393a49b4ad7eb906a4d5abdbae99566dc8a48efc4bd5f6d25afe063e53</originalsourceid><addsrcrecordid>eNpVkEtLw1AQRq8vsNTuBTfZukid-8wdXJVWrVB10boOk9yJjaSNJLXSf2-0RXA2A2cO3wcjxKWEoZSAN5P581CBlEOL1itljsQAEy-NMgaV1u5Y9JS0PtaokpN_N4Wnoiethhi8x3MxaNt36MY5BOd74nbCFKpyzTF9UcNRmy85fHbgLSrqJprXxeaXLxpat5RvynpNVfTEq7rZXYizgqqWB4fdF6_3d4vxNJ69PDyOR7N4qQA3caI9eLAaNRnMDIWEs66cTLCUhYwY0ToXck_Gc5GbLNjCBWWpYHCare6L633ukqr0oylX1OzSmsp0OpqlPwyk8s6B3crOvdq7JTP_yYe36W-XCltJ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Deadline-aware scheduling for Software Transactional Memory</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Maldonado, W. ; Marlier, P. ; Felber, P. ; Lawall, J. ; Muller, G. ; Riviere, E.</creator><creatorcontrib>Maldonado, W. ; Marlier, P. ; Felber, P. ; Lawall, J. ; Muller, G. ; Riviere, E.</creatorcontrib><description>Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts.</description><identifier>ISSN: 1530-0889</identifier><identifier>ISBN: 9781424492329</identifier><identifier>ISBN: 1424492327</identifier><identifier>EISSN: 2158-3927</identifier><identifier>EISBN: 9781424492336</identifier><identifier>EISBN: 1424492319</identifier><identifier>EISBN: 9781424492312</identifier><identifier>EISBN: 1424492335</identifier><identifier>DOI: 10.1109/DSN.2011.5958224</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer Science ; Contention Management ; Games ; Instruction sets ; Linux ; Optimized production technology ; Rendering (computer graphics) ; Reservoirs ; Runtime ; Scheduling ; Transactional Memory</subject><ispartof>2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), 2011, p.257-268</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5958224$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,885,2056,27916,54911</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5958224$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://hal.science/hal-01286605$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Maldonado, W.</creatorcontrib><creatorcontrib>Marlier, P.</creatorcontrib><creatorcontrib>Felber, P.</creatorcontrib><creatorcontrib>Lawall, J.</creatorcontrib><creatorcontrib>Muller, G.</creatorcontrib><creatorcontrib>Riviere, E.</creatorcontrib><title>Deadline-aware scheduling for Software Transactional Memory</title><title>2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)</title><addtitle>DSN</addtitle><description>Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts.</description><subject>Computer Science</subject><subject>Contention Management</subject><subject>Games</subject><subject>Instruction sets</subject><subject>Linux</subject><subject>Optimized production technology</subject><subject>Rendering (computer graphics)</subject><subject>Reservoirs</subject><subject>Runtime</subject><subject>Scheduling</subject><subject>Transactional Memory</subject><issn>1530-0889</issn><issn>2158-3927</issn><isbn>9781424492329</isbn><isbn>1424492327</isbn><isbn>9781424492336</isbn><isbn>1424492319</isbn><isbn>9781424492312</isbn><isbn>1424492335</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkEtLw1AQRq8vsNTuBTfZukid-8wdXJVWrVB10boOk9yJjaSNJLXSf2-0RXA2A2cO3wcjxKWEoZSAN5P581CBlEOL1itljsQAEy-NMgaV1u5Y9JS0PtaokpN_N4Wnoiethhi8x3MxaNt36MY5BOd74nbCFKpyzTF9UcNRmy85fHbgLSrqJprXxeaXLxpat5RvynpNVfTEq7rZXYizgqqWB4fdF6_3d4vxNJ69PDyOR7N4qQA3caI9eLAaNRnMDIWEs66cTLCUhYwY0ToXck_Gc5GbLNjCBWWpYHCare6L633ukqr0oylX1OzSmsp0OpqlPwyk8s6B3crOvdq7JTP_yYe36W-XCltJ</recordid><startdate>201106</startdate><enddate>201106</enddate><creator>Maldonado, W.</creator><creator>Marlier, P.</creator><creator>Felber, P.</creator><creator>Lawall, J.</creator><creator>Muller, G.</creator><creator>Riviere, E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>1XC</scope></search><sort><creationdate>201106</creationdate><title>Deadline-aware scheduling for Software Transactional Memory</title><author>Maldonado, W. ; Marlier, P. ; Felber, P. ; Lawall, J. ; Muller, G. ; Riviere, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h209t-7380805393a49b4ad7eb906a4d5abdbae99566dc8a48efc4bd5f6d25afe063e53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Computer Science</topic><topic>Contention Management</topic><topic>Games</topic><topic>Instruction sets</topic><topic>Linux</topic><topic>Optimized production technology</topic><topic>Rendering (computer graphics)</topic><topic>Reservoirs</topic><topic>Runtime</topic><topic>Scheduling</topic><topic>Transactional Memory</topic><toplevel>online_resources</toplevel><creatorcontrib>Maldonado, W.</creatorcontrib><creatorcontrib>Marlier, P.</creatorcontrib><creatorcontrib>Felber, P.</creatorcontrib><creatorcontrib>Lawall, J.</creatorcontrib><creatorcontrib>Muller, G.</creatorcontrib><creatorcontrib>Riviere, E.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Hyper Article en Ligne (HAL)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Maldonado, W.</au><au>Marlier, P.</au><au>Felber, P.</au><au>Lawall, J.</au><au>Muller, G.</au><au>Riviere, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Deadline-aware scheduling for Software Transactional Memory</atitle><btitle>2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)</btitle><stitle>DSN</stitle><date>2011-06</date><risdate>2011</risdate><spage>257</spage><epage>268</epage><pages>257-268</pages><issn>1530-0889</issn><eissn>2158-3927</eissn><isbn>9781424492329</isbn><isbn>1424492327</isbn><eisbn>9781424492336</eisbn><eisbn>1424492319</eisbn><eisbn>9781424492312</eisbn><eisbn>1424492335</eisbn><abstract>Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies the development of parallel programs. Still, the interest of STM has not yet been demonstrated for reactive applications that require bounded response time for some of their operations. We propose to support such applications by allowing the developer to annotate some transaction blocks with deadlines. Based on previous execution statistics, we adjust the transaction execution strategy by decreasing the level of optimism as the deadlines near through two modes of conservative execution, without overly limiting the progress of concurrent transactions. Our implementation comprises a STM extension for gathering statistics and implementing the execution mode strategies. We have also extended the Linux scheduler to disable preemption or migration of threads that are executing transactions with deadlines. Our experimental evaluation shows that our approach significantly improves the chance of a transaction meeting its deadline when its progress is hampered by conflicts.</abstract><pub>IEEE</pub><doi>10.1109/DSN.2011.5958224</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1530-0889 |
| ispartof | 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), 2011, p.257-268 |
| issn | 1530-0889 2158-3927 |
| language | eng |
| recordid | cdi_ieee_primary_5958224 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer Science Contention Management Games Instruction sets Linux Optimized production technology Rendering (computer graphics) Reservoirs Runtime Scheduling Transactional Memory |
| title | Deadline-aware scheduling for Software Transactional Memory |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T00%3A32%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Deadline-aware%20scheduling%20for%20Software%20Transactional%20Memory&rft.btitle=2011%20IEEE/IFIP%2041st%20International%20Conference%20on%20Dependable%20Systems%20&%20Networks%20(DSN)&rft.au=Maldonado,%20W.&rft.date=2011-06&rft.spage=257&rft.epage=268&rft.pages=257-268&rft.issn=1530-0889&rft.eissn=2158-3927&rft.isbn=9781424492329&rft.isbn_list=1424492327&rft_id=info:doi/10.1109/DSN.2011.5958224&rft_dat=%3Chal_6IE%3Eoai_HAL_hal_01286605v1%3C/hal_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424492336&rft.eisbn_list=1424492319&rft.eisbn_list=9781424492312&rft.eisbn_list=1424492335&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5958224&rfr_iscdi=true |