Bounding the Power of Preemption in Randomized Scheduling

SIAM Journal on Computing - United States
doi 10.1137/s0097539795283292
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Analysis of a Synchronization and Scheduling Discipline for Real-Time Tasks With Preemption Constraints

English

Monoprocessor Real-Time Scheduling of Data Dependent Tasks With Exact Preemption Cost for Embedded Systems

2013English

An Analysis of Lazy and Eager Limited Preemption Approaches Under DAG-Based Global Fixed Priority Scheduling

2017English

Optimal Selection of Preemption Points to Minimize Preemption Overhead

2011English

Predictable Configuration Management in a Randomized Scheduling Framework

2001English

Power Constrained Test Scheduling Using Power Profile Manipulation

2001English

Bounding the Piercing Number

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1995English

Bounding the Maximum Likelihood Degree

Mathematical Research Letters
Mathematics
2015English

Network Power Scheduling for TinyOS Applications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy