Load sharing in soft real-time distributed computer systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Journal of the ACM (JACM)
Hard Real-Time Systems
On the Optimality of the STE Rule for Multiple Server Queues That Serve
On the Optimality of the STE Rule for Multiple Server Queues That Serve
The Binary Simulation of the Minimum Laxity and Earliest Deadline
The Binary Simulation of the Minimum Laxity and Earliest Deadline
IEEE Transactions on Computers
Tolerating Sensor Timing Faults in Highly Responsive Hard Real-Time Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
IEEE Transactions on Parallel and Distributed Systems
An approximate analysis of waiting time in multi-class M/G/1/./EDF queues
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Using real-time queueing theory to control lateness in real-time systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
IEEE Transactions on Computers
IEEE Transactions on Computers
A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks
IEEE Transactions on Computers
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Static Processor Allocation in a Soft Real-Time Multiprocessor Environment
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Hard deadline queueing system with application to unified messaging service
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
The Journal of Supercomputing
A fuzzy algorithm for scheduling periodic tasks on multiprocessor soft real-time systems
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Resource management using multiple feedback loops in soft real-time distributed object systems
Journal of Systems and Software
Schedulability of aperiodic tasks in hybrid process model
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Deadline-based connection setup in wavelength-routed WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
| Hi-index | 15.00 |
A study is made of the performance of a real-time system in which jobs all have deadlines for either the beginning or the end of service. In the first case the authors analyze the minimum laxity (ML) scheduling policy when there are c processors, and in the latter case they analyze the preemptive-resume earliest deadline (ED) scheduling policy when there is one server. In both cases, the analysis assumes a Poisson arrival process, exponential service times that are not known to the scheduler, and exponential laxities or deadlines, and families of upper and lower bounds on the fraction of jobs that miss their deadlines are developed. The pessimistic bounds are of special interest because they correspond to a family of implementable policies, ML(n) and ED(n), n a positive integer 1, for which the performance approaches that of ML and ED as n increases, but at the cost of increasing overhead.