Results 251 to 260 of about 10,305,324 (289)
Some of the next articles are maybe not open access.
Scheduling Non-Preemptive Deferrable Loads
IEEE Transactions on Power Systems, 2016Accurate control of deferrable electrical loads results in an aggregate load profile more desirable to the system operator. This in turn could lead to reduced peak consumption of power, less ramping of generators and lower emissions of greenhouse gases. In this paper, we describe an algorithm which automatically schedules deferrable loads.
Gearoid O'Brien, Ram Rajagopal
openaire +1 more source
Non-preemptive Scheduling with Setup Times: A PTAS
2016Consider the following scheduling problem: a set of jobs is to be processed without preemption on m identical machines. The jobs are partitioned into classes. Before jobs from a class can be processed on a machine, a setup is required, whose duration depends on the class. The objective is to schedule all jobs while minimizing the completion time of the
Klaus Jansen, Felix Land
openaire +2 more sources
Improved Schedulability Test for Non-Preemptive Fixed-Priority Scheduling on Multiprocessors
IEEE Embedded Systems Letters, 2020Non-preemptive scheduling is essential to tasks that inherently disallow any preemption and useful for tasks that exhibit extremely large preemption/migration overhead; however, studies of non-preemptive scheduling have not matured for real-time tasks subject to timing constraints.
Hyeongboo Baek, Jinkyu Lee 0001
openaire +2 more sources
A decomposition approach to non-preemptive real-time scheduling
Real-time Systems, 1994Consider the problem of scheduling a set ofn tasks on a uniprocessor such that a feasible schedule that satisfies each task's time constraints is generated. Traditionally, researchers have looked at all the tasks as a group and applied heuristic or enumeration search to it.
Xiaoping Yuan +2 more
openaire +1 more source
Online Non-Preemptive Story Scheduling in Web Advertising
International Joint Conference on Autonomous Agents and Multiagent Systems, 2016This paper is concerned with online story scheduling, motivated by storyboarding in online advertising. In storyboarding, triggered by the browsing history of a user, advertisers arrive online and wish to present a sequence of ads (stories) on the website. The user ceases to browse with probability 1-β at each time step. Once the user finishes watching
Tie-Yan Liu +5 more
openaire +2 more sources
Provably efficient non-preemptive task scheduling with Cilk
Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241), 2002We consider the problem of scheduling static task graphs by using Cilk, a C based runtime system for multithreaded parallel programming. We assume no preemption of task execution and no prior knowledge of the task execution times. Given a task graph G, the output of the scheduling algorithm is a Cilk program P which, when executed initiates the tasks ...
V.-B. Vee, W.-J. Hsu
openaire +1 more source
Non-preemptive real-time scheduling of dataflow systems
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks.
Thomas M. Parks, Edward A. Lee
openaire +2 more sources
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling
2011We propose a partially non-preemptive dual priority scheduling algorithm (PNPDP) for multiprocessors. In dual priority scheduling, each task has two fixed priorities. When a job is released, it executes at its task's lower priority. After some fixed amount of time, its priority is promoted. Our approach is to prevent lower priority jobs from preempting
Chiahsun Ho, Shelby H. Funk
openaire +2 more sources
Non-preemptive Scheduling with History-Dependent Execution Time
2012 24th Euromicro Conference on Real-Time Systems, 2012Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.
Björn Andersson +5 more
openaire +2 more sources
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
Mathematics in Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Andrei +2 more
openaire +1 more source