Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

From MaRDI portal
Revision as of 04:30, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5681520

DOI10.1145/321738.321743zbMath0265.68013OpenAlexW2109488193WikidataQ55879022 ScholiaQ55879022MaRDI QIDQ5681520

No author found.

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321738.321743




Related Items (only showing first 100 items - show all)

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling802.4 rate monotonic scheduling in hard real-time environments: setting the medium access control parametersAn earlier time for inserting and/or accelerating tasksOn fixed priority scheduling, offsets and co-prime task periodsLiu and Layland's schedulability test revisitedIntegrating security constraints into fixed priority real-time schedulersDelay composition in preemptive and non-preemptive real-time pipelinesFlexible hard real-time scheduling for deliberative AI systemsThe feasibility of general task systems with precedence constraints on multiprocessor platformsThe space of EDF deadlines: The exact region and a convex approximationLine search method for solving a non-preemptive strictly periodic scheduling problemResource holding times: Computation and optimizationFormal verification of real-time systems with preemptive schedulingRobust priority assignment for messages on Controller Area network (CAN)Optimal priority assignment in the presence of blockingExact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive schedulingA HW/SW partitioner for multi-mode multi-task embedded applicationsMaintaining the feasibility of hard real-time systems with a reduced number of priority levelsA new sufficient schedulability analysis for hybrid schedulingAn analysis of fixed-priority schedulability on a multiprocessorGroup-based Pfair schedulingThe non-preemptive scheduling of periodic tasks upon multiprocessorsDynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasksScalable online feasibility tests for admission control in a Java real-time systemA non-blocking buffer mechanism for real-time event message communicationFinite-horizon scheduling of radar dwells with online template constructionVerifying distributed real-time properties of embedded systems via graph transformations and model checkingA framework for modular analysis and exploration of heterogeneous embedded systemsApproximation algorithms for scheduling real-time jobs with multiple feasible intervalsPeriodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platformsMinimality of EDF networks with resource sharingA mechanism of function calls in MSVLCausality problem in real-time calculusSecurity-aware optimization for ubiquitous computing systems with SEAT graph approachFeasibility interval for the transactional event handlers of P-FRPAsynchronous task execution in networked control systems using decentralized event-triggeringOn queues with impatience: stability, and the optimality of earliest deadline firstScheduling of hard real-time garbage collectionSchedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlinesA greedy algorithm for combined scheduling of computations and data exchanges in real-time systemsImproved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systemsOpen problems in real-time scheduling{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor schedulingCPU scheduling and memory management for interactive real-time applicationsEfficient computation of response time bounds for preemptive uniprocessor deadline monotonic schedulingQoc elastic scheduling for real-time control systemsPartitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting schemeOn the nature and impact of self-similarity in real-time systemsFeasibility analysis of real-time transactionsState-based scheduling with tree schedules: analysis and evaluationOn-line schedulability tests for adaptive reservations in fixed priority schedulingMulti-task implementation of multi-periodic synchronous programsAn optimal boundary fair scheduling algorithm for multiprocessor real-time systemsControl: a perspectiveSticky-ERfair: a task-processor affinity aware proportional fair schedulerPredictability of fixed-job priority schedulers on heterogeneous multiprocessor real-time systemsPower efficient rate monotonic scheduling for multi-core systemsOptimal and efficient adaptation in distributed real-time systems with discrete ratesStability of adaptive feedback-based resource managers for systems with execution time variationsUtility accrual real-time scheduling for multiprocessor embedded systemsUnified overhead-aware schedulability analysis for slot-based task-splittingPartition oriented frame based fair schedulerOptimizing distributed real-time embedded system handling dependence and several strict periodicity constraintsComputing periodic request functions to speed-up the analysis of non-cyclic task modelsMultiprocessor real-time scheduling with arbitrary processor affinities: from practice to theoryMaintaining thermal comfort in buildings: feasibility, algorithms, implementation, evaluationExact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigmsGraph-based models for real-time workload: a surveyOptimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systemsReal-time uniprocessor scheduling with fewer preemptionsA misconception in blocking time analyses under multiprocessor synchronization protocolsModel predictive control under timing constraints induced by controller area networksFeasibility problems for recurring tasks on one processorFeasibility analysis of sporadic real-time multiprocessor task systemsEnergy efficient scheduling for real-time embedded systems with QoS guaranteeFeasibility analysis under fixed priority scheduling with limited preemptionsCluster scheduling for real-time systems: utilization bounds and run-time overheadA parallel algorithm of simulated annealing for multiprocessor schedulingA formal proof of the deadline driven scheduler in PPTL axiomatic systemA design flow for supporting component-based software development in multiprocessor real-time systemsOptimal harmonic period assignment: complexity results and approximation algorithmsUniprocessor scheduling of real-time synchronous dataflow tasksDeepRT: predictable deep learning inference for cyber-physical systemsDecision-driven schedulingThe concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systemsThe basic cyclic scheduling problem with deadlinesFeedback EDF scheduling of real-time tasks exploiting dynamic voltage scalingQoS management through adaptive reservationsGlobal control of robotic highway safety markers: a real-time solutionQuantitative characterization of event streams in analysis of hard real-time applicationsPre-schedulingFeasibility analysis of real-time periodic tasks with offsetsMeasuring the performance of schedulability testsA technique for adaptive scheduling of soft real-time tasksCalculating WCET estimates from timed tracesOn the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithmResponse time analysis for fixed priority real-time systems with energy-harvestingCombined task- and network-level scheduling for distributed time-triggered systemsCache related pre-emption delays in hierarchical scheduling




This page was built for publication: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment