Random trees in queueing systems with deadlines

DOI10.1016/0304-3975(94)00282-NzbMATH Open0874.68017MaRDI QIDQ672995FDOQ672995

Ulrich Schmid

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 986997
• On Nonpreemptive LCFS Scheduling with Deadlines
• Some investigations on FCFS scheduling in hard real time applications

zbMATH Keywords

schedulingmodelling queueing systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Singularity Analysis of Generating Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the competitiveness of on-line real-time task scheduling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Single-server queues with impatient customers
• Stochastic Scheduling with Release Dates and Due Dates
• On the Altitude of Nodes in Random Trees
• On optimal lateness and tardiness scheduling in real-time systems
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• The Markovian Queue with Bounded Waiting time
• Asymptotic Methods in Enumeration
• On an asymptotic method in enumeration
• The number of registers required for evaluating arithmetic expressions
• On the recursion depth of special tree traversal algorithms
• Data Structures' Maxima
• FCFS-scheduling in a hard real-time environment under rush-hour conditions
• Some investigations on FCFS scheduling in hard real time applications
• Monitoring distributed real-time systems
• Title not available (Why is that?)
• The Maximum Size of Dynamic Data Structures
• Colliding stacks: A large deviations analysis
• Title not available (Why is that?)
• Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
• Preemptive LCFS scheduling in hard real-time applications
• 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
• The exhaustion of shared memory: Stochastic results
• Exponential Limiting Distributions in Queueing Systems with Deadlines
• Remarks on an asymptotic method in combinatorics

Cited In (2)

• Title not available (Why is that?)
• Preemptive LCFS scheduling in hard real-time applications

This page was built for publication: Random trees in queueing systems with deadlines

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