On the properties of a tree-structured server process

DOI10.1214/AOAP/1177005984MaRDI QIDQ2640261zbMATH OpenOpenAlexFDO

Authors János Komlós, Andrew Odlyzko, L. Ozarow, Larry Shepp

Publication date 1991

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177005984

zbMATH Keywords

nonlinear recurrenceAlohaPoisson tree

Mathematics Subject Classification ID

Special processes (60K99)

Recommendations

• On some combinatorial properties of Linux process trees
• A process-calculus analysis of concurrent operations on B-trees
• Tree-indexed processes
• Trellis processes: a compact representation for runs of concurrent systems
• On mapping processes to processors in distributed systems
• scientific article; zbMATH DE number 4082939
• Observational trees as models for concurrency
• Algebraic synchronization trees and processes

This page was built for publication: On the properties of a tree-structured server process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640261)