Interrelation of characteristics of blocked RMA stack algorithms

Evseev, Grigory; Turlikov, Andrey

doi:10.1134/s0032946007040072

Search citation statements

Order By: Relevance

Paper Sections

Select...

Overview Of Our Contributions1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

2024

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis of d-ary tree algorithms is mainly (despite a number of graph-theoretic approaches having been carried out; see [8] and references therein) done by combining generating functions with tools from complex analysis; see [9,17,19,20,27], for example. With the Markovian structure at hand, we can use the aforementioned tools to derive closed-form expressions for many observables of the process.…”

Section: Overview Of Our Contributionsmentioning

confidence: 99%

Analysis of -ary tree algorithms with successive interference cancellation

Vogel,

Deshpande,

Stefanović

et al. 2024

J. Appl. Probab.

View full text Add to dashboard Cite

We calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the results are new. We furthermore disprove the claim that only the binary tree maximizes throughput. Our method works with many observables and can be used as a blueprint for further analysis.

show abstract