Results 241 to 250 of about 10,305,324 (289)

Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture, 2011
Non-preemptive scheduling is usually considered inferior to preemptive scheduling for time critical systems, because the non-preemptive block would lead to poor task responsiveness. Although this is true in single-processor scheduling, we found by empirical simulation experiments that it is not necessarily the case in multiprocessor scheduling ...
Nan Guan, Ge Yu, Qingxu Deng
exaly   +2 more sources

Scheduling of Flexible Non-Preemptive Loads

2020 59th IEEE Conference on Decision and Control (CDC), 2020
A market consisting of a generator with thermal and renewable generation capability, a set of non-preemptive loads (i.e., loads which cannot be interrupted once started), and an independent system operator (ISO) is considered. Loads are characterized by durations, power demand rates and utility for receiving service, as well as disutility functions ...
Nathan Dahlin, Rahul Jain 0002
openaire   +2 more sources

Non-Preemptive Coflow Scheduling and Routing

2016 IEEE Global Communications Conference (GLOBECOM), 2016
As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network.
Ruozhou Yu, Guoliang Xue, Xiang Zhang 0005, Jian Tang 0008   +3 more
openaire   +1 more source

Dynamic non-preemptive single machine scheduling

Computers & Operations Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sri V. Sridharan, Zhuoqun Zhou
openaire   +2 more sources

Non-preemptive time warp scheduling algorithms

ACM SIGOPS Operating Systems Review, 1990
This paper presents results of experiments we conducted on a number of scheduling algorithms used in a multi-processing Time Warp system. Our results show that system performance can be improved by using indirect indicators of Time Warp progress without going to the expense of user specified scheduling or relying on dependency graphs.
Christopher Burdorf, Jed Marti
openaire   +2 more sources

An Exact and Sustainable Analysis of Non-preemptive Scheduling

2017 IEEE Real-Time Systems Symposium (RTSS), 2017
This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs scheduled with a fixed-job-priority (FJP) policy upon a uniprocessor. Both classic work-conserving and recent non-work-conserving schedulers are supported. Jobs may exhibit both release jitter and execution time variation.
Mitra Nasri, Björn B. Brandenburg
openaire   +2 more sources

On non-preemptive scheduling of period and sporadic tasks

[1991] Proceedings Twelfth Real-Time Systems Symposium, 2002
A fundamental problem in the theory of real-time scheduling is examined: scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. The authors give a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks ...
Kevin Jeffay, Donald F. Stanat, Charles U. Martel   +2 more
openaire   +1 more source

Non-preemptive real-time scheduling of multimedia tasks

Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166), 1999
Motivated by the special characteristics of multimedia tasks, we consider non-preemptive scheduling of tasks where there exists no (or very limited) information concerning the tasks before they are released. We present impossibility results and analyze algorithms for non-preemptive scheduling in single processor and multiprocessor systems.
Shlomi Dolev, Alexander Keizelman
openaire   +3 more sources

Clairvoyant Non-Preemptive EDF Scheduling

18th Euromicro Conference on Real-Time Systems (ECRTS'06), 2006
It is well-known that although EDF is optimal for preemptive systems this is not the case in non-preemptive ones. The problem is that for a non-preemptive scheduler to be optimal, it must sometimes use inserted idle times. In this paper we show how the performance of non-preemptive EDF can be improved by using a form of lookahead that identifies when ...
openaire   +2 more sources

Non-Preemptive Scheduling of Optical Switches

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., 2005
Many high-speed routers today use input-queuing (IQ) architectures with a crossbar switching fabric based on optical technology. Packets in the input queues are divided into cells of unit length, and the goal is to find a schedule of minimum makespan that forwards all packets to the output ports.
Alexander Kesselman, Kirill Kogan
openaire   +4 more sources