Random trees in queueing systems with deadlines
From MaRDI portal
Publication:672995
DOI10.1016/0304-3975(94)00282-NzbMath0874.68017MaRDI QIDQ672995
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the recursion depth of special tree traversal algorithms
- Remarks on an asymptotic method in combinatorics
- On optimal lateness and tardiness scheduling in real-time systems
- FCFS-scheduling in a hard real-time environment under rush-hour conditions
- Some investigations on FCFS scheduling in hard real time applications
- On the competitiveness of on-line real-time task scheduling
- The number of registers required for evaluating arithmetic expressions
- Monitoring distributed real-time systems
- On an asymptotic method in enumeration
- Single-server queues with impatient customers
- Singularity Analysis of Generating Functions
- Stochastic Scheduling with Release Dates and Due Dates
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- The Maximum Size of Dynamic Data Structures
- Colliding stacks: A large deviations analysis
- Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
- Preemptive LCFS scheduling in hard real-time applications
- Asymptotic Methods in Enumeration
- The Markovian Queue with Bounded Waiting time
- On the Altitude of Nodes in Random Trees
- The instability time distribution behavior of slotted ALOHA
- The analysis of the expected successful operation time of slotted ALOHA
- On Nonpreemptive LCFS Scheduling with Deadlines
- Data Structures' Maxima
- The exhaustion of shared memory: Stochastic results
- Exponential Limiting Distributions in Queueing Systems with Deadlines
This page was built for publication: Random trees in queueing systems with deadlines
