A new concurrency control mechanism for multi-threaded environment using transactional memory
Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consist...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ghosh, Ammlan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s) 2015 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The journal of supercomputing - Springer US, 1987, 71(2015), 11 vom: 07. Sept., Seite 4095-4115 |
|---|---|
| Übergeordnetes Werk: |
volume:71 ; year:2015 ; number:11 ; day:07 ; month:09 ; pages:4095-4115 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11227-015-1507-8 |
|---|
| Katalog-ID: |
OLC203394820X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC203394820X | ||
| 003 | DE-627 | ||
| 005 | 20230504053842.0 | ||
| 007 | tu | ||
| 008 | 200819s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11227-015-1507-8 |2 doi | |
| 035 | |a (DE-627)OLC203394820X | ||
| 035 | |a (DE-He213)s11227-015-1507-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Ghosh, Ammlan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A new concurrency control mechanism for multi-threaded environment using transactional memory |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s) 2015 | ||
| 520 | |a Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. | ||
| 650 | 4 | |a Concurrency control | |
| 650 | 4 | |a Software transactional memory | |
| 650 | 4 | |a Obstruction freedom | |
| 700 | 1 | |a Chaki, Rituparna |4 aut | |
| 700 | 1 | |a Chaki, Nabendu |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The journal of supercomputing |d Springer US, 1987 |g 71(2015), 11 vom: 07. Sept., Seite 4095-4115 |w (DE-627)13046466X |w (DE-600)740510-8 |w (DE-576)018667775 |x 0920-8542 |7 nnns |
| 773 | 1 | 8 | |g volume:71 |g year:2015 |g number:11 |g day:07 |g month:09 |g pages:4095-4115 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11227-015-1507-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 71 |j 2015 |e 11 |b 07 |c 09 |h 4095-4115 | ||
| author_variant |
a g ag r c rc n c nc |
|---|---|
| matchkey_str |
article:09208542:2015----::nwocreccnrlehnsfruttraeevrnets |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.1007/s11227-015-1507-8 doi (DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p DE-627 ger DE-627 rakwb eng 004 620 VZ Ghosh, Ammlan verfasserin aut A new concurrency control mechanism for multi-threaded environment using transactional memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2015 Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. Concurrency control Software transactional memory Obstruction freedom Chaki, Rituparna aut Chaki, Nabendu aut Enthalten in The journal of supercomputing Springer US, 1987 71(2015), 11 vom: 07. Sept., Seite 4095-4115 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 https://doi.org/10.1007/s11227-015-1507-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 71 2015 11 07 09 4095-4115 |
| spelling |
10.1007/s11227-015-1507-8 doi (DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p DE-627 ger DE-627 rakwb eng 004 620 VZ Ghosh, Ammlan verfasserin aut A new concurrency control mechanism for multi-threaded environment using transactional memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2015 Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. Concurrency control Software transactional memory Obstruction freedom Chaki, Rituparna aut Chaki, Nabendu aut Enthalten in The journal of supercomputing Springer US, 1987 71(2015), 11 vom: 07. Sept., Seite 4095-4115 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 https://doi.org/10.1007/s11227-015-1507-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 71 2015 11 07 09 4095-4115 |
| allfields_unstemmed |
10.1007/s11227-015-1507-8 doi (DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p DE-627 ger DE-627 rakwb eng 004 620 VZ Ghosh, Ammlan verfasserin aut A new concurrency control mechanism for multi-threaded environment using transactional memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2015 Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. Concurrency control Software transactional memory Obstruction freedom Chaki, Rituparna aut Chaki, Nabendu aut Enthalten in The journal of supercomputing Springer US, 1987 71(2015), 11 vom: 07. Sept., Seite 4095-4115 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 https://doi.org/10.1007/s11227-015-1507-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 71 2015 11 07 09 4095-4115 |
| allfieldsGer |
10.1007/s11227-015-1507-8 doi (DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p DE-627 ger DE-627 rakwb eng 004 620 VZ Ghosh, Ammlan verfasserin aut A new concurrency control mechanism for multi-threaded environment using transactional memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2015 Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. Concurrency control Software transactional memory Obstruction freedom Chaki, Rituparna aut Chaki, Nabendu aut Enthalten in The journal of supercomputing Springer US, 1987 71(2015), 11 vom: 07. Sept., Seite 4095-4115 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 https://doi.org/10.1007/s11227-015-1507-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 71 2015 11 07 09 4095-4115 |
| allfieldsSound |
10.1007/s11227-015-1507-8 doi (DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p DE-627 ger DE-627 rakwb eng 004 620 VZ Ghosh, Ammlan verfasserin aut A new concurrency control mechanism for multi-threaded environment using transactional memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2015 Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. Concurrency control Software transactional memory Obstruction freedom Chaki, Rituparna aut Chaki, Nabendu aut Enthalten in The journal of supercomputing Springer US, 1987 71(2015), 11 vom: 07. Sept., Seite 4095-4115 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 https://doi.org/10.1007/s11227-015-1507-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 AR 71 2015 11 07 09 4095-4115 |
| language |
English |
| source |
Enthalten in The journal of supercomputing 71(2015), 11 vom: 07. Sept., Seite 4095-4115 volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 |
| sourceStr |
Enthalten in The journal of supercomputing 71(2015), 11 vom: 07. Sept., Seite 4095-4115 volume:71 year:2015 number:11 day:07 month:09 pages:4095-4115 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Concurrency control Software transactional memory Obstruction freedom |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The journal of supercomputing |
| authorswithroles_txt_mv |
Ghosh, Ammlan @@aut@@ Chaki, Rituparna @@aut@@ Chaki, Nabendu @@aut@@ |
| publishDateDaySort_date |
2015-09-07T00:00:00Z |
| hierarchy_top_id |
13046466X |
| dewey-sort |
14 |
| id |
OLC203394820X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203394820X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504053842.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-015-1507-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203394820X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-015-1507-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ghosh, Ammlan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A new concurrency control mechanism for multi-threaded environment using transactional memory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrency control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software transactional memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Obstruction freedom</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chaki, Rituparna</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chaki, Nabendu</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">71(2015), 11 vom: 07. Sept., Seite 4095-4115</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:71</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:11</subfield><subfield code="g">day:07</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:4095-4115</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-015-1507-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">71</subfield><subfield code="j">2015</subfield><subfield code="e">11</subfield><subfield code="b">07</subfield><subfield code="c">09</subfield><subfield code="h">4095-4115</subfield></datafield></record></collection>
|
| author |
Ghosh, Ammlan |
| spellingShingle |
Ghosh, Ammlan ddc 004 misc Concurrency control misc Software transactional memory misc Obstruction freedom A new concurrency control mechanism for multi-threaded environment using transactional memory |
| authorStr |
Ghosh, Ammlan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13046466X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-8542 |
| topic_title |
004 620 VZ A new concurrency control mechanism for multi-threaded environment using transactional memory Concurrency control Software transactional memory Obstruction freedom |
| topic |
ddc 004 misc Concurrency control misc Software transactional memory misc Obstruction freedom |
| topic_unstemmed |
ddc 004 misc Concurrency control misc Software transactional memory misc Obstruction freedom |
| topic_browse |
ddc 004 misc Concurrency control misc Software transactional memory misc Obstruction freedom |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The journal of supercomputing |
| hierarchy_parent_id |
13046466X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
The journal of supercomputing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 |
| title |
A new concurrency control mechanism for multi-threaded environment using transactional memory |
| ctrlnum |
(DE-627)OLC203394820X (DE-He213)s11227-015-1507-8-p |
| title_full |
A new concurrency control mechanism for multi-threaded environment using transactional memory |
| author_sort |
Ghosh, Ammlan |
| journal |
The journal of supercomputing |
| journalStr |
The journal of supercomputing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
4095 |
| author_browse |
Ghosh, Ammlan Chaki, Rituparna Chaki, Nabendu |
| container_volume |
71 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Ghosh, Ammlan |
| doi_str_mv |
10.1007/s11227-015-1507-8 |
| dewey-full |
004 620 |
| title_sort |
a new concurrency control mechanism for multi-threaded environment using transactional memory |
| title_auth |
A new concurrency control mechanism for multi-threaded environment using transactional memory |
| abstract |
Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. © The Author(s) 2015 |
| abstractGer |
Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. © The Author(s) 2015 |
| abstract_unstemmed |
Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput. © The Author(s) 2015 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
11 |
| title_short |
A new concurrency control mechanism for multi-threaded environment using transactional memory |
| url |
https://doi.org/10.1007/s11227-015-1507-8 |
| remote_bool |
false |
| author2 |
Chaki, Rituparna Chaki, Nabendu |
| author2Str |
Chaki, Rituparna Chaki, Nabendu |
| ppnlink |
13046466X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11227-015-1507-8 |
| up_date |
2024-07-03T19:01:49.056Z |
| _version_ |
1803585647077752832 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203394820X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504053842.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-015-1507-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203394820X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-015-1507-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ghosh, Ammlan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A new concurrency control mechanism for multi-threaded environment using transactional memory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Software transactional memory (STM) is one of the techniques used towards achieving non-blocking process synchronization in multi-threaded computing environment. In spite of its high potential, one of the major limitations of transactional memory (TM) is that in order to ensure data consistency as well as progress condition, TM often forces transactions to abort. This paper proposes a new concurrency control mechanism. It starts with the existing TM implementations for obstruction freedom and eventually builds a new STM methodology. The primary objective is to reduce aborting of transactions in some typical scenarios. A programming model is described for a chain of update transactions that share the same data object among themselves. Using the proposed approach, any new update transaction appended in this chain need not wait for the earlier transactions to finish. The proposed STM allows wait-free, non-blocking implementation of a mix of read and multiple update transactions on the same shared data object with higher throughput.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrency control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software transactional memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Obstruction freedom</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chaki, Rituparna</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chaki, Nabendu</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">71(2015), 11 vom: 07. Sept., Seite 4095-4115</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:71</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:11</subfield><subfield code="g">day:07</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:4095-4115</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-015-1507-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">71</subfield><subfield code="j">2015</subfield><subfield code="e">11</subfield><subfield code="b">07</subfield><subfield code="c">09</subfield><subfield code="h">4095-4115</subfield></datafield></record></collection>
|
| score |
7.3999405 |