A modular algorithm for resource allocation

Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algo...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Rhee, Injong [verfasserIn]

Format:	Artikel
Sprache:	Englisch

Erschienen:	1998

Anmerkung:	© Springer-Verlag Berlin Heidelberg 1998

Übergeordnetes Werk:	Enthalten in: Distributed computing - Springer-Verlag, 1986, 11(1998), 3 vom: Aug., Seite 157-168
Übergeordnetes Werk:	volume:11 ; year:1998 ; number:3 ; month:08 ; pages:157-168

Links:	Volltext

DOI / URN:	10.1007/s004460050047

Katalog-ID:	OLC2054807591

Internformat


LEADER	01000caa a22002652 4500
001	OLC2054807591
003	DE-627
005	20230403073025.0
007	tu
008	200819s1998 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/s004460050047 \|2 doi
035			\|a (DE-627)OLC2054807591
035			\|a (DE-He213)s004460050047-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 004 \|q VZ
082	0	4	\|a 620 \|q VZ
100	1		\|a Rhee, Injong \|e verfasserin \|4 aut
245	1	0	\|a A modular algorithm for resource allocation
264		1	\|c 1998
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-Verlag Berlin Heidelberg 1998
520			\|a Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large.
773	0	8	\|i Enthalten in \|t Distributed computing \|d Springer-Verlag, 1986 \|g 11(1998), 3 vom: Aug., Seite 157-168 \|w (DE-627)13042885X \|w (DE-600)635600-X \|w (DE-576)01592789X \|x 0178-2770 \|7 nnns
773	1	8	\|g volume:11 \|g year:1998 \|g number:3 \|g month:08 \|g pages:157-168
856	4	1	\|u https://doi.org/10.1007/s004460050047 \|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_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_40
912			\|a GBV_ILN_62
912			\|a GBV_ILN_70
912			\|a GBV_ILN_105
912			\|a GBV_ILN_130
912			\|a GBV_ILN_267
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2016
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4036
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4277
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4310
912			\|a GBV_ILN_4311
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4336
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 11 \|j 1998 \|e 3 \|c 08 \|h 157-168

Indexfelder

author_variant	i r ir
matchkey_str	article:01782770:1998----::mdlrloihfreor
hierarchy_sort_str	1998
publishDate	1998
allfields	10.1007/s004460050047 doi (DE-627)OLC2054807591 (DE-He213)s004460050047-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Rhee, Injong verfasserin aut A modular algorithm for resource allocation 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 1998 Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Enthalten in Distributed computing Springer-Verlag, 1986 11(1998), 3 vom: Aug., Seite 157-168 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:11 year:1998 number:3 month:08 pages:157-168 https://doi.org/10.1007/s004460050047 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 11 1998 3 08 157-168
spelling	10.1007/s004460050047 doi (DE-627)OLC2054807591 (DE-He213)s004460050047-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Rhee, Injong verfasserin aut A modular algorithm for resource allocation 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 1998 Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Enthalten in Distributed computing Springer-Verlag, 1986 11(1998), 3 vom: Aug., Seite 157-168 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:11 year:1998 number:3 month:08 pages:157-168 https://doi.org/10.1007/s004460050047 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 11 1998 3 08 157-168
allfields_unstemmed	10.1007/s004460050047 doi (DE-627)OLC2054807591 (DE-He213)s004460050047-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Rhee, Injong verfasserin aut A modular algorithm for resource allocation 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 1998 Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Enthalten in Distributed computing Springer-Verlag, 1986 11(1998), 3 vom: Aug., Seite 157-168 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:11 year:1998 number:3 month:08 pages:157-168 https://doi.org/10.1007/s004460050047 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 11 1998 3 08 157-168
allfieldsGer	10.1007/s004460050047 doi (DE-627)OLC2054807591 (DE-He213)s004460050047-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Rhee, Injong verfasserin aut A modular algorithm for resource allocation 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 1998 Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Enthalten in Distributed computing Springer-Verlag, 1986 11(1998), 3 vom: Aug., Seite 157-168 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:11 year:1998 number:3 month:08 pages:157-168 https://doi.org/10.1007/s004460050047 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 11 1998 3 08 157-168
allfieldsSound	10.1007/s004460050047 doi (DE-627)OLC2054807591 (DE-He213)s004460050047-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Rhee, Injong verfasserin aut A modular algorithm for resource allocation 1998 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 1998 Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Enthalten in Distributed computing Springer-Verlag, 1986 11(1998), 3 vom: Aug., Seite 157-168 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:11 year:1998 number:3 month:08 pages:157-168 https://doi.org/10.1007/s004460050047 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700 AR 11 1998 3 08 157-168
language	English
source	Enthalten in Distributed computing 11(1998), 3 vom: Aug., Seite 157-168 volume:11 year:1998 number:3 month:08 pages:157-168
sourceStr	Enthalten in Distributed computing 11(1998), 3 vom: Aug., Seite 157-168 volume:11 year:1998 number:3 month:08 pages:157-168
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Distributed computing
authorswithroles_txt_mv	Rhee, Injong @@aut@@
publishDateDaySort_date	1998-08-01T00:00:00Z
hierarchy_top_id	13042885X
dewey-sort	14
id	OLC2054807591
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">OLC2054807591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073025.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1998 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s004460050047</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054807591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s004460050047-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="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rhee, Injong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A modular algorithm for resource allocation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</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-Verlag Berlin Heidelberg 1998</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">11(1998), 3 vom: Aug., Seite 157-168</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:1998</subfield><subfield code="g">number:3</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:157-168</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s004460050047</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_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">1998</subfield><subfield code="e">3</subfield><subfield code="c">08</subfield><subfield code="h">157-168</subfield></datafield></record></collection>
author	Rhee, Injong
spellingShingle	Rhee, Injong ddc 004 ddc 620 A modular algorithm for resource allocation
authorStr	Rhee, Injong
ppnlink_with_tag_str_mv	@@773@@(DE-627)13042885X
format	Article
dewey-ones	004 - Data processing & computer science 620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0178-2770
topic_title	004 VZ 620 VZ A modular algorithm for resource allocation
topic	ddc 004 ddc 620
topic_unstemmed	ddc 004 ddc 620
topic_browse	ddc 004 ddc 620
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Distributed computing
hierarchy_parent_id	13042885X
dewey-tens	000 - Computer science, knowledge & systems 620 - Engineering
hierarchy_top_title	Distributed computing
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)13042885X (DE-600)635600-X (DE-576)01592789X
title	A modular algorithm for resource allocation
ctrlnum	(DE-627)OLC2054807591 (DE-He213)s004460050047-p
title_full	A modular algorithm for resource allocation
author_sort	Rhee, Injong
journal	Distributed computing
journalStr	Distributed computing
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works 600 - Technology
recordtype	marc
publishDateSort	1998
contenttype_str_mv	txt
container_start_page	157
author_browse	Rhee, Injong
container_volume	11
class	004 VZ 620 VZ
format_se	Aufsätze
author-letter	Rhee, Injong
doi_str_mv	10.1007/s004460050047
dewey-full	004 620
title_sort	a modular algorithm for resource allocation
title_auth	A modular algorithm for resource allocation
abstract	Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. © Springer-Verlag Berlin Heidelberg 1998
abstractGer	Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. © Springer-Verlag Berlin Heidelberg 1998
abstract_unstemmed	Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. © Springer-Verlag Berlin Heidelberg 1998
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2016 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4336 GBV_ILN_4700
container_issue	3
title_short	A modular algorithm for resource allocation
url	https://doi.org/10.1007/s004460050047
remote_bool	false
ppnlink	13042885X
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/s004460050047
up_date	2024-07-04T00:27:48.535Z
_version_	1803606156678004736
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">OLC2054807591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073025.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1998 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s004460050047</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054807591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s004460050047-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="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rhee, Injong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A modular algorithm for resource allocation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1998</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-Verlag Berlin Heidelberg 1998</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">11(1998), 3 vom: Aug., Seite 157-168</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:1998</subfield><subfield code="g">number:3</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:157-168</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s004460050047</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_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">1998</subfield><subfield code="e">3</subfield><subfield code="c">08</subfield><subfield code="h">157-168</subfield></datafield></record></collection>
score	7.3999033

Nicht das Richtige dabei?

Schreiben Sie uns!

A modular algorithm for resource allocation

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?