Random trees in queueing systems with deadlines

DOI10.1016/0304-3975(94)00282-NMaRDI QIDQ672995zbMATH OpenFDO

Authors Ulrich Schmid

Publication date 28 February 1997

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

zbMATH Keywords

schedulingmodelling queueing systems

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 986997 (Why is no real title available?)
• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 53318 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1142298 (Why is no real title available?)
• scientific article; zbMATH DE number 3219117 (Why is no real title available?)
• scientific article; zbMATH DE number 3301915 (Why is no real title available?)
• Asymptotic Methods in Enumeration
• Colliding stacks: A large deviations analysis
• Data Structures' Maxima
• Exponential Limiting Distributions in Queueing Systems with Deadlines
• FCFS-scheduling in a hard real-time environment under rush-hour conditions
• Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited
• Monitoring distributed real-time systems
• On Nonpreemptive LCFS Scheduling with Deadlines
• On an asymptotic method in enumeration
• On optimal lateness and tardiness scheduling in real-time systems
• On the Altitude of Nodes in Random Trees
• On the competitiveness of on-line real-time task scheduling
• On the recursion depth of special tree traversal algorithms
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Preemptive LCFS scheduling in hard real-time applications
• Remarks on an asymptotic method in combinatorics
• Single-server queues with impatient customers
• Singularity Analysis of Generating Functions
• Some investigations on FCFS scheduling in hard real time applications
• Stochastic Scheduling with Release Dates and Due Dates
• The Markovian Queue with Bounded Waiting time
• The Maximum Size of Dynamic Data Structures
• The analysis of the expected successful operation time of slotted ALOHA
• The exhaustion of shared memory: Stochastic results
• The instability time distribution behavior of slotted ALOHA
• The number of registers required for evaluating arithmetic expressions

Cited in

(2)

• scientific article; zbMATH DE number 6909297 (Why is no real title available?)
• 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)