A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable,...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Kanrar, Sukhendu [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of network and systems management - Springer US, 1993, 21(2011), 1 vom: 09. Nov., Seite 1-24 |
|---|---|
| Übergeordnetes Werk: |
volume:21 ; year:2011 ; number:1 ; day:09 ; month:11 ; pages:1-24 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10922-011-9218-9 |
|---|
| Katalog-ID: |
OLC2066987379 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2066987379 | ||
| 003 | DE-627 | ||
| 005 | 20230503145426.0 | ||
| 007 | tu | ||
| 008 | 200819s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10922-011-9218-9 |2 doi | |
| 035 | |a (DE-627)OLC2066987379 | ||
| 035 | |a (DE-He213)s10922-011-9218-9-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Kanrar, Sukhendu |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| 264 | 1 | |c 2011 | |
| 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 © Springer Science+Business Media, LLC 2011 | ||
| 520 | |a Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). | ||
| 650 | 4 | |a Correctness | |
| 650 | 4 | |a Directed graph | |
| 650 | 4 | |a Token-based algorithms | |
| 650 | 4 | |a Simulation | |
| 650 | 4 | |a Critical section | |
| 650 | 4 | |a Request queue | |
| 700 | 1 | |a Chattopadhyay, Samiran |4 aut | |
| 700 | 1 | |a Chaki, Nabendu |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of network and systems management |d Springer US, 1993 |g 21(2011), 1 vom: 09. Nov., Seite 1-24 |w (DE-627)182373657 |w (DE-600)1202352-8 |w (DE-576)9182373655 |x 1064-7570 |7 nnns |
| 773 | 1 | 8 | |g volume:21 |g year:2011 |g number:1 |g day:09 |g month:11 |g pages:1-24 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10922-011-9218-9 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4305 | ||
| 951 | |a AR | ||
| 952 | |d 21 |j 2011 |e 1 |b 09 |c 11 |h 1-24 | ||
| author_variant |
s k sk s c sc n c nc |
|---|---|
| matchkey_str |
article:10647570:2011----::nwikalrrsletroiyaefimtaecuinloi |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10922-011-9218-9 doi (DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p DE-627 ger DE-627 rakwb eng 004 VZ Kanrar, Sukhendu verfasserin aut A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). Correctness Directed graph Token-based algorithms Simulation Critical section Request queue Chattopadhyay, Samiran aut Chaki, Nabendu aut Enthalten in Journal of network and systems management Springer US, 1993 21(2011), 1 vom: 09. Nov., Seite 1-24 (DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 1064-7570 nnns volume:21 year:2011 number:1 day:09 month:11 pages:1-24 https://doi.org/10.1007/s10922-011-9218-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 AR 21 2011 1 09 11 1-24 |
| spelling |
10.1007/s10922-011-9218-9 doi (DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p DE-627 ger DE-627 rakwb eng 004 VZ Kanrar, Sukhendu verfasserin aut A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). Correctness Directed graph Token-based algorithms Simulation Critical section Request queue Chattopadhyay, Samiran aut Chaki, Nabendu aut Enthalten in Journal of network and systems management Springer US, 1993 21(2011), 1 vom: 09. Nov., Seite 1-24 (DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 1064-7570 nnns volume:21 year:2011 number:1 day:09 month:11 pages:1-24 https://doi.org/10.1007/s10922-011-9218-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 AR 21 2011 1 09 11 1-24 |
| allfields_unstemmed |
10.1007/s10922-011-9218-9 doi (DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p DE-627 ger DE-627 rakwb eng 004 VZ Kanrar, Sukhendu verfasserin aut A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). Correctness Directed graph Token-based algorithms Simulation Critical section Request queue Chattopadhyay, Samiran aut Chaki, Nabendu aut Enthalten in Journal of network and systems management Springer US, 1993 21(2011), 1 vom: 09. Nov., Seite 1-24 (DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 1064-7570 nnns volume:21 year:2011 number:1 day:09 month:11 pages:1-24 https://doi.org/10.1007/s10922-011-9218-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 AR 21 2011 1 09 11 1-24 |
| allfieldsGer |
10.1007/s10922-011-9218-9 doi (DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p DE-627 ger DE-627 rakwb eng 004 VZ Kanrar, Sukhendu verfasserin aut A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). Correctness Directed graph Token-based algorithms Simulation Critical section Request queue Chattopadhyay, Samiran aut Chaki, Nabendu aut Enthalten in Journal of network and systems management Springer US, 1993 21(2011), 1 vom: 09. Nov., Seite 1-24 (DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 1064-7570 nnns volume:21 year:2011 number:1 day:09 month:11 pages:1-24 https://doi.org/10.1007/s10922-011-9218-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 AR 21 2011 1 09 11 1-24 |
| allfieldsSound |
10.1007/s10922-011-9218-9 doi (DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p DE-627 ger DE-627 rakwb eng 004 VZ Kanrar, Sukhendu verfasserin aut A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). Correctness Directed graph Token-based algorithms Simulation Critical section Request queue Chattopadhyay, Samiran aut Chaki, Nabendu aut Enthalten in Journal of network and systems management Springer US, 1993 21(2011), 1 vom: 09. Nov., Seite 1-24 (DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 1064-7570 nnns volume:21 year:2011 number:1 day:09 month:11 pages:1-24 https://doi.org/10.1007/s10922-011-9218-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 AR 21 2011 1 09 11 1-24 |
| language |
English |
| source |
Enthalten in Journal of network and systems management 21(2011), 1 vom: 09. Nov., Seite 1-24 volume:21 year:2011 number:1 day:09 month:11 pages:1-24 |
| sourceStr |
Enthalten in Journal of network and systems management 21(2011), 1 vom: 09. Nov., Seite 1-24 volume:21 year:2011 number:1 day:09 month:11 pages:1-24 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Correctness Directed graph Token-based algorithms Simulation Critical section Request queue |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Journal of network and systems management |
| authorswithroles_txt_mv |
Kanrar, Sukhendu @@aut@@ Chattopadhyay, Samiran @@aut@@ Chaki, Nabendu @@aut@@ |
| publishDateDaySort_date |
2011-11-09T00:00:00Z |
| hierarchy_top_id |
182373657 |
| dewey-sort |
14 |
| id |
OLC2066987379 |
| 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">OLC2066987379</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503145426.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10922-011-9218-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066987379</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10922-011-9218-9-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="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kanrar, Sukhendu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</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">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Correctness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directed graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Token-based algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Critical section</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Request queue</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Samiran</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">Journal of network and systems management</subfield><subfield code="d">Springer US, 1993</subfield><subfield code="g">21(2011), 1 vom: 09. Nov., Seite 1-24</subfield><subfield code="w">(DE-627)182373657</subfield><subfield code="w">(DE-600)1202352-8</subfield><subfield code="w">(DE-576)9182373655</subfield><subfield code="x">1064-7570</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:1</subfield><subfield code="g">day:09</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:1-24</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10922-011-9218-9</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">21</subfield><subfield code="j">2011</subfield><subfield code="e">1</subfield><subfield code="b">09</subfield><subfield code="c">11</subfield><subfield code="h">1-24</subfield></datafield></record></collection>
|
| author |
Kanrar, Sukhendu |
| spellingShingle |
Kanrar, Sukhendu ddc 004 misc Correctness misc Directed graph misc Token-based algorithms misc Simulation misc Critical section misc Request queue A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| authorStr |
Kanrar, Sukhendu |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)182373657 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1064-7570 |
| topic_title |
004 VZ A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems Correctness Directed graph Token-based algorithms Simulation Critical section Request queue |
| topic |
ddc 004 misc Correctness misc Directed graph misc Token-based algorithms misc Simulation misc Critical section misc Request queue |
| topic_unstemmed |
ddc 004 misc Correctness misc Directed graph misc Token-based algorithms misc Simulation misc Critical section misc Request queue |
| topic_browse |
ddc 004 misc Correctness misc Directed graph misc Token-based algorithms misc Simulation misc Critical section misc Request queue |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of network and systems management |
| hierarchy_parent_id |
182373657 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Journal of network and systems management |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)182373657 (DE-600)1202352-8 (DE-576)9182373655 |
| title |
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| ctrlnum |
(DE-627)OLC2066987379 (DE-He213)s10922-011-9218-9-p |
| title_full |
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| author_sort |
Kanrar, Sukhendu |
| journal |
Journal of network and systems management |
| journalStr |
Journal of network and systems management |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
1 |
| author_browse |
Kanrar, Sukhendu Chattopadhyay, Samiran Chaki, Nabendu |
| container_volume |
21 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Kanrar, Sukhendu |
| doi_str_mv |
10.1007/s10922-011-9218-9 |
| dewey-full |
004 |
| title_sort |
a new link failure resilient priority based fair mutual exclusion algorithm for distributed systems |
| title_auth |
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| abstract |
Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). © Springer Science+Business Media, LLC 2011 |
| abstractGer |
Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). © Springer Science+Business Media, LLC 2011 |
| abstract_unstemmed |
Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process). © Springer Science+Business Media, LLC 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4305 |
| container_issue |
1 |
| title_short |
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems |
| url |
https://doi.org/10.1007/s10922-011-9218-9 |
| remote_bool |
false |
| author2 |
Chattopadhyay, Samiran Chaki, Nabendu |
| author2Str |
Chattopadhyay, Samiran Chaki, Nabendu |
| ppnlink |
182373657 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10922-011-9218-9 |
| up_date |
2024-07-03T13:17:53.762Z |
| _version_ |
1803564009404760064 |
| 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">OLC2066987379</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503145426.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10922-011-9218-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066987379</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10922-011-9218-9-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="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kanrar, Sukhendu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</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">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Correctness</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directed graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Token-based algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Critical section</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Request queue</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chattopadhyay, Samiran</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">Journal of network and systems management</subfield><subfield code="d">Springer US, 1993</subfield><subfield code="g">21(2011), 1 vom: 09. Nov., Seite 1-24</subfield><subfield code="w">(DE-627)182373657</subfield><subfield code="w">(DE-600)1202352-8</subfield><subfield code="w">(DE-576)9182373655</subfield><subfield code="x">1064-7570</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:1</subfield><subfield code="g">day:09</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:1-24</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10922-011-9218-9</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">21</subfield><subfield code="j">2011</subfield><subfield code="e">1</subfield><subfield code="b">09</subfield><subfield code="c">11</subfield><subfield code="h">1-24</subfield></datafield></record></collection>
|
| score |
7.3975964 |