Restart Optimization for Transactional Memory with Lazy Conflict Detection

This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaf...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming 2017-06, Vol.45 (3), p.482-507
Main Authors: Cvetanovic, Milos, Radivojevic, Zaharije, Milutinovic, Veljko
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Computer memory
Computer programming
Computer Science
Computer simulation
Construction
Estimating
Mathematical models
Optimization
Parallel processing
Parallel programming
Processor Architectures
Software
Software Engineering/Programming and Operating Systems
Studies
Theory of Computation
Transactional analysis
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c301t-eb3897bc512c870e220f876f73cd91b081345cf180003a23ee34c71fea7e1fcd3
container_end_page 507
container_issue 3
container_start_page 482
container_title International journal of parallel programming
container_volume 45
creator Cvetanovic, Milos
Radivojevic, Zaharije
Milutinovic, Veljko
description This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper.
doi_str_mv 10.1007/s10766-016-0411-z
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1904225119</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4321601947</sourcerecordid><originalsourceid>FETCH-LOGICAL-c301t-eb3897bc512c870e220f876f73cd91b081345cf180003a23ee34c71fea7e1fcd3</originalsourceid><addsrcrecordid>eNp1kM1LAzEQxYMoWD_-AG8BL15WZ5LdTfYo9ZtKQeo5pGmiW7a7NUmR7l9v6noQwcMwDPze480j5AzhEgHEVUAQZZkBpskRs36PjLAQPBNlDvtkBFIWmcgLeUiOQlgCQCWkHJGnFxui9pFO17Fe1b2OdddS13k687oN2uxu3dBnu-r8ln7W8Z1OdL-l4651TW0ivbHRflMn5MDpJtjTn31MXu9uZ-OHbDK9fxxfTzLDAWNm51xWYm4KZEYKsIyBk6J0gptFhXOQyPPCOJQpI9eMW8tzI9BZLSw6s-DH5GLwXfvuY5Piq1UdjG0a3dpuExRWkDNWIFYJPf-DLruNT_8kSsqSIQLnicKBMr4LwVun1r5eab9VCGrXrhraValdtWtX9UnDBk1IbPtm_S_nf0Vf9sF87w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1886211033</pqid></control><display><type>article</type><title>Restart Optimization for Transactional Memory with Lazy Conflict Detection</title><source>ABI/INFORM global</source><source>Springer Link</source><creator>Cvetanovic, Milos ; Radivojevic, Zaharije ; Milutinovic, Veljko</creator><creatorcontrib>Cvetanovic, Milos ; Radivojevic, Zaharije ; Milutinovic, Veljko</creatorcontrib><description>This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper.</description><identifier>ISSN: 0885-7458</identifier><identifier>EISSN: 1573-7640</identifier><identifier>DOI: 10.1007/s10766-016-0411-z</identifier><identifier>CODEN: IJPPE5</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Analysis ; Computer memory ; Computer programming ; Computer Science ; Computer simulation ; Construction ; Estimating ; Mathematical models ; Optimization ; Parallel processing ; Parallel programming ; Processor Architectures ; Software ; Software Engineering/Programming and Operating Systems ; Studies ; Theory of Computation ; Transactional analysis</subject><ispartof>International journal of parallel programming, 2017-06, Vol.45 (3), p.482-507</ispartof><rights>Springer Science+Business Media New York 2016</rights><rights>International Journal of Parallel Programming is a copyright of Springer, 2017.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c301t-eb3897bc512c870e220f876f73cd91b081345cf180003a23ee34c71fea7e1fcd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1886211033/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1886211033?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,36061,44363,74895</link.rule.ids></links><search><creatorcontrib>Cvetanovic, Milos</creatorcontrib><creatorcontrib>Radivojevic, Zaharije</creatorcontrib><creatorcontrib>Milutinovic, Veljko</creatorcontrib><title>Restart Optimization for Transactional Memory with Lazy Conflict Detection</title><title>International journal of parallel programming</title><addtitle>Int J Parallel Prog</addtitle><description>This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Computer memory</subject><subject>Computer programming</subject><subject>Computer Science</subject><subject>Computer simulation</subject><subject>Construction</subject><subject>Estimating</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Parallel processing</subject><subject>Parallel programming</subject><subject>Processor Architectures</subject><subject>Software</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Studies</subject><subject>Theory of Computation</subject><subject>Transactional analysis</subject><issn>0885-7458</issn><issn>1573-7640</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kM1LAzEQxYMoWD_-AG8BL15WZ5LdTfYo9ZtKQeo5pGmiW7a7NUmR7l9v6noQwcMwDPze480j5AzhEgHEVUAQZZkBpskRs36PjLAQPBNlDvtkBFIWmcgLeUiOQlgCQCWkHJGnFxui9pFO17Fe1b2OdddS13k687oN2uxu3dBnu-r8ln7W8Z1OdL-l4651TW0ivbHRflMn5MDpJtjTn31MXu9uZ-OHbDK9fxxfTzLDAWNm51xWYm4KZEYKsIyBk6J0gptFhXOQyPPCOJQpI9eMW8tzI9BZLSw6s-DH5GLwXfvuY5Piq1UdjG0a3dpuExRWkDNWIFYJPf-DLruNT_8kSsqSIQLnicKBMr4LwVun1r5eab9VCGrXrhraValdtWtX9UnDBk1IbPtm_S_nf0Vf9sF87w</recordid><startdate>20170601</startdate><enddate>20170601</enddate><creator>Cvetanovic, Milos</creator><creator>Radivojevic, Zaharije</creator><creator>Milutinovic, Veljko</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</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>L.0</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>20170601</creationdate><title>Restart Optimization for Transactional Memory with Lazy Conflict Detection</title><author>Cvetanovic, Milos ; Radivojevic, Zaharije ; Milutinovic, Veljko</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c301t-eb3897bc512c870e220f876f73cd91b081345cf180003a23ee34c71fea7e1fcd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Computer memory</topic><topic>Computer programming</topic><topic>Computer Science</topic><topic>Computer simulation</topic><topic>Construction</topic><topic>Estimating</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Parallel processing</topic><topic>Parallel programming</topic><topic>Processor Architectures</topic><topic>Software</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Studies</topic><topic>Theory of Computation</topic><topic>Transactional analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cvetanovic, Milos</creatorcontrib><creatorcontrib>Radivojevic, Zaharije</creatorcontrib><creatorcontrib>Milutinovic, Veljko</creatorcontrib><collection>CrossRef</collection><collection>Global News &amp; ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest_ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</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)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</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 (Proquest) (PQ_SDU_P3)</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>ABI/INFORM Professional Standard</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>ProQuest_Research Library</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</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>Cvetanovic, Milos</au><au>Radivojevic, Zaharije</au><au>Milutinovic, Veljko</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Restart Optimization for Transactional Memory with Lazy Conflict Detection</atitle><jtitle>International journal of parallel programming</jtitle><stitle>Int J Parallel Prog</stitle><date>2017-06-01</date><risdate>2017</risdate><volume>45</volume><issue>3</issue><spage>482</spage><epage>507</epage><pages>482-507</pages><issn>0885-7458</issn><eissn>1573-7640</eissn><coden>IJPPE5</coden><abstract>This paper presents an optimization algorithm for transactional memory with lazy conflict detection. The proposed optimization attempts to minimize the execution time of restarted transactions. Minimizing happens during restart, by avoiding the re-execution of a section of a transaction that is unaffected by the restart. The proposed optimization builds on previous research and differs in that it eliminates the need for the prediction of conflicting accesses and introduces incremental context saving. Moreover, the paper introduces analytical models for estimating the execution time of transactions, with and without the restart optimization, that are developed using the continuous-time model. A critical evaluation comparing analytical models with the simulation results is discussed in the paper.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10766-016-0411-z</doi><tpages>26</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0885-7458
ispartof International journal of parallel programming, 2017-06, Vol.45 (3), p.482-507
issn 0885-7458
1573-7640
language eng
recordid cdi_proquest_miscellaneous_1904225119
source ABI/INFORM global; Springer Link
subjects Algorithms
Analysis
Computer memory
Computer programming
Computer Science
Computer simulation
Construction
Estimating
Mathematical models
Optimization
Parallel processing
Parallel programming
Processor Architectures
Software
Software Engineering/Programming and Operating Systems
Studies
Theory of Computation
Transactional analysis
title Restart Optimization for Transactional Memory with Lazy Conflict Detection
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T14%3A26%3A36IST&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=Restart%20Optimization%20for%20Transactional%20Memory%20with%20Lazy%20Conflict%20Detection&rft.jtitle=International%20journal%20of%20parallel%20programming&rft.au=Cvetanovic,%20Milos&rft.date=2017-06-01&rft.volume=45&rft.issue=3&rft.spage=482&rft.epage=507&rft.pages=482-507&rft.issn=0885-7458&rft.eissn=1573-7640&rft.coden=IJPPE5&rft_id=info:doi/10.1007/s10766-016-0411-z&rft_dat=%3Cproquest_cross%3E4321601947%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c301t-eb3897bc512c870e220f876f73cd91b081345cf180003a23ee34c71fea7e1fcd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1886211033&rft_id=info:pmid/&rfr_iscdi=true