4.1 Article

Cutting-plane algorithms for preemptive uniprocessor scheduling problems

Related references

Note: Only part of the references are listed.
Article Computer Science, Software Engineering

A computational status update for exact rational mixed integer programming

Leon Eifler et al.

Summary: A new algorithmic framework for general mixed integer programming problems is proposed, which integrates symbolic presolving, exact repair steps, and a faster LP solver. This framework shows significantly improved performance on benchmark instances, with an average speedup of 10.7x and 2.9 times as many instances solved within a time limit of two hours compared to the original framework.

MATHEMATICAL PROGRAMMING (2023)

Article Computer Science, Information Systems

Determining rate monotonic schedulability of real-time periodic tasks using continued fractions

Moonju Park et al.

Summary: This paper presents a new approach to analyze the schedulability of fixed-priority scheduling using continued fractions and derives a new schedulability test for Rate Monotonic algorithm by utilizing continued fractions.

INFORMATION PROCESSING LETTERS (2023)

Proceedings Paper Computer Science, Hardware & Architecture

Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems

Sanjoy Baruah et al.

Summary: The algorithmic technique of fixed-parameter analysis aims to gain a deeper understanding of the underlying causes of computational intractability and identify conditions under which the problem becomes tractable. This study applies fixed-parameter analysis to investigate the fixed-priority and EDF scheduling of recurrent task systems on preemptive uniprocessor platforms.

2022 IEEE 43RD REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2022) (2022)

Article Computer Science, Hardware & Architecture

Removing bias from the judgment day: A Ravenscar-based toolbox for quantitative comparison of EDF-to-RM uniprocessor scheduling

D. Perale et al.

Summary: EDF uniprocessor scheduling has been shown to be superior to FPS in terms of sustaining high utilization and performing better in various performance indicators. Recent research allows for the application of EDF scheduling in Ada Ravenscar systems without changing application code, providing a pathway for performance comparisons.

JOURNAL OF SYSTEMS ARCHITECTURE (2021)

Proceedings Paper Computer Science, Theory & Methods

Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard

Pontus Ekberg et al.

2017 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS) (2017)

Article Computer Science, Hardware & Architecture

Schedulability Analysis of EDF-Scheduled Embedded Real-Time Systems with Resource Sharing

Fengxiang Zhang et al.

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS (2013)

Article Computer Science, Hardware & Architecture

An Efficient Formulation of the Real-Time Feasibility Region for Design Optimization

Haibo Zeng et al.

IEEE TRANSACTIONS ON COMPUTERS (2013)

Article Computer Science, Software Engineering

A hybrid branch-and-bound approach for exact rational mixed-integer programming

William Cook et al.

MATHEMATICAL PROGRAMMING COMPUTATION (2013)

Article Engineering, Multidisciplinary

CVXGEN: a code generator for embedded convex optimization

Jacob Mattingley et al.

OPTIMIZATION AND ENGINEERING (2012)

Article Computer Science, Hardware & Architecture

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Fengxiang Zhang et al.

IEEE TRANSACTIONS ON COMPUTERS (2009)

Article Computer Science, Hardware & Architecture

Efficient exact schedulability tests for fixed priority real-time systems

Robert I. Davis et al.

IEEE TRANSACTIONS ON COMPUTERS (2008)

Article Computer Science, Theory & Methods

Rate Monotonic vs. EDF: Judgment day

GC Buttazzo

REAL-TIME SYSTEMS (2005)

Article Computer Science, Hardware & Architecture

Schedulability analysis of periodic fixed priority systems

E Bini et al.

IEEE TRANSACTIONS ON COMPUTERS (2004)

Review Computer Science, Theory & Methods

Real time scheduling theory:: A historical perspective

L Sha et al.

REAL-TIME SYSTEMS (2004)