The exhaustion of shared memory

Stochastic results

Robert S Maier, René Schott

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We analyse a model of exhaustion of shared memory. The memory usage of a finite number of dynamic data structures is modelled as a Markov chain, and the asymptotics of the expected time until memory exhaustion are worked out, in the limit when memory availability and memory needs scale proportionately, and are taken to infinity. This stochastic model subsumes the model of colliding stacks previously treated by the authors, and gives rise to difficult mathematical problems. However, analytic results can be obtained in the limit. Our analysis uses a technique of matched asymptotic expansions introduced by Naeh et al. [11]. The technique is applicable to other stochastically modelled discrete algorithms.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings
PublisherSpringer Verlag
Pages494-505
Number of pages12
Volume709 LNCS
ISBN (Print)9783540571551
StatePublished - Jan 1 1993
Event3rd Workshop on Algorithms and Data Structures, WADS 1993 - Montreal, Canada
Duration: Aug 11 1993Aug 13 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume709 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Workshop on Algorithms and Data Structures, WADS 1993
CountryCanada
CityMontreal
Period8/11/938/13/93

Fingerprint

Shared Memory
Data storage equipment
Dynamic Data Structures
Matched Asymptotic Expansions
Stochastic Model
Stochastic models
Markov chain
Availability
Markov processes
Infinity
Data structures
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Maier, R. S., & Schott, R. (1993). The exhaustion of shared memory: Stochastic results. In Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings (Vol. 709 LNCS, pp. 494-505). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 709 LNCS). Springer Verlag.

The exhaustion of shared memory : Stochastic results. / Maier, Robert S; Schott, René.

Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS Springer Verlag, 1993. p. 494-505 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 709 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maier, RS & Schott, R 1993, The exhaustion of shared memory: Stochastic results. in Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. vol. 709 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 709 LNCS, Springer Verlag, pp. 494-505, 3rd Workshop on Algorithms and Data Structures, WADS 1993, Montreal, Canada, 8/11/93.
Maier RS, Schott R. The exhaustion of shared memory: Stochastic results. In Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS. Springer Verlag. 1993. p. 494-505. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Maier, Robert S ; Schott, René. / The exhaustion of shared memory : Stochastic results. Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings. Vol. 709 LNCS Springer Verlag, 1993. pp. 494-505 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{78724650395746d5b71e9738715dff04,
title = "The exhaustion of shared memory: Stochastic results",
abstract = "We analyse a model of exhaustion of shared memory. The memory usage of a finite number of dynamic data structures is modelled as a Markov chain, and the asymptotics of the expected time until memory exhaustion are worked out, in the limit when memory availability and memory needs scale proportionately, and are taken to infinity. This stochastic model subsumes the model of colliding stacks previously treated by the authors, and gives rise to difficult mathematical problems. However, analytic results can be obtained in the limit. Our analysis uses a technique of matched asymptotic expansions introduced by Naeh et al. [11]. The technique is applicable to other stochastically modelled discrete algorithms.",
author = "Maier, {Robert S} and Ren{\'e} Schott",
year = "1993",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540571551",
volume = "709 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "494--505",
booktitle = "Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings",
address = "Germany",

}

TY - GEN

T1 - The exhaustion of shared memory

T2 - Stochastic results

AU - Maier, Robert S

AU - Schott, René

PY - 1993/1/1

Y1 - 1993/1/1

N2 - We analyse a model of exhaustion of shared memory. The memory usage of a finite number of dynamic data structures is modelled as a Markov chain, and the asymptotics of the expected time until memory exhaustion are worked out, in the limit when memory availability and memory needs scale proportionately, and are taken to infinity. This stochastic model subsumes the model of colliding stacks previously treated by the authors, and gives rise to difficult mathematical problems. However, analytic results can be obtained in the limit. Our analysis uses a technique of matched asymptotic expansions introduced by Naeh et al. [11]. The technique is applicable to other stochastically modelled discrete algorithms.

AB - We analyse a model of exhaustion of shared memory. The memory usage of a finite number of dynamic data structures is modelled as a Markov chain, and the asymptotics of the expected time until memory exhaustion are worked out, in the limit when memory availability and memory needs scale proportionately, and are taken to infinity. This stochastic model subsumes the model of colliding stacks previously treated by the authors, and gives rise to difficult mathematical problems. However, analytic results can be obtained in the limit. Our analysis uses a technique of matched asymptotic expansions introduced by Naeh et al. [11]. The technique is applicable to other stochastically modelled discrete algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84916567812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84916567812&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540571551

VL - 709 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 494

EP - 505

BT - Algorithms and Data Structures - 3rd Workshop, WADS 1993, Proceedings

PB - Springer Verlag

ER -