scientific article; zbMATH DE number 4199942

zbMATH Open0726.90033MaRDI QIDQ3348684FDOQ3348684

Authors: Maryline Chetto, H. Chetto 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

release datepreemptive schedulingdeadlinecomputer network

Mathematics Subject Classification ID

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

Cited In (29)

• A reservation-based algorithm for scheduling both periodic and aperiodic real-time tasks
• Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile robotics
• 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
• 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
• 802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parameters
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Rate-monotonic scheduling for hard-real-time systems
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Distance-constrained scheduling and its applications to real-time systems
• Title not available (Why is that?)
• Dynamic- and static-priority scheduling of recurring real-time tasks
• Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
• Title not available (Why is that?)
• Quasi-static scheduling of communicating tasks
• Optimal real-time scheduling with minimal rejections and minimal finishing time
• The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
• Reducing network and computation complexities in neural based real-time scheduling scheme
• Schedulability analysis for strictly periodic tasks in RTOS
• Parametric dispatching of hard real-time tasks
• Title not available (Why is that?)
• Task scheduling in distributed real-time systems
• Scheduling approach for non real-time applications in open real-time system based on two-level scheduling scheme
• A weakly hard real-time schedule algorithm based on cutting down
• Periodic real-time scheduling: From deadline-based model to latency-based model
• Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints
• Scheduling algorithms based on weakly hard real-time constraints
• Design of PRIME-like systems in a hard-real-time environment

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)