scientific article; zbMATH DE number 4199942

MaRDI QIDQ3348684zbMATH OpenFDO

Authors Maryline Chetto, H. Chetto

Publication date 1990

zbMATH Keywords

computer networkdeadlinepreemptive schedulingrelease date

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• scientific article; zbMATH DE number 495275
• A new algorithm for scheduling periodic, real-time tasks
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• scientific article; zbMATH DE number 4215346

Cited in

(38)

• Design of PRIME-like systems in a hard-real-time environment
• Load adaptive dynamic scheduling of tasks with hard deadlines useful for industrial applications
• Rate-monotonic scheduling for hard-real-time systems
• Choosing task periods to minimise system utilisation in time triggered systems
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Task scheduling in distributed real-time systems
• Real-time supervisory control of a processor for non-preemptive execution of periodic tasks
• Robust adaptive metrics for deadline assignment in distributed hard real-time systems
• Scheduling algorithms based on weakly hard real-time constraints
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Quasi-static scheduling of communicating tasks
• Schedulability analysis for strictly periodic tasks in RTOS
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
• 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
• A weakly hard real-time schedule algorithm based on cutting down
• Scheduling approach for non real-time applications in open real-time system based on two-level scheduling scheme
• scientific article; zbMATH DE number 30973 (Why is no real title available?)
• scientific article; zbMATH DE number 1247723 (Why is no real title available?)
• scientific article; zbMATH DE number 495275 (Why is no real title available?)
• scientific article; zbMATH DE number 1041071 (Why is no real title available?)
• Scheduling real-time tasks for dependability
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• Parametric dispatching of hard real-time tasks
• Distance-constrained scheduling and its applications to real-time systems
• A reservation-based algorithm for scheduling both periodic and aperiodic real-time tasks
• scientific article; zbMATH DE number 1487629 (Why is no real title available?)
• scientific article; zbMATH DE number 1760150 (Why is no real title available?)
• Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics
• scientific article; zbMATH DE number 820115 (Why is no real title available?)
• Optimal real-time scheduling with minimal rejections and minimal finishing time
• Reducing network and computation complexities in neural based real-time scheduling scheme
• Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints
• Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks
• Scalable online feasibility tests for admission control in a Java real-time system
• Periodic real-time scheduling: From deadline-based model to latency-based model

This page was built for publication:

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