Results 271 to 280 of about 34,037 (308)

Multi-Priority Online Scheduling with Cancellations

Operations Research, 2018
We study a fundamental model of resource allocation in which a finite amount of service capacity must be allocated to a stream of jobs of different priorities arriving randomly over time. Jobs incur costs and may also cancel while waiting for service. To increase the rate of service, overtime capacity can be used at a cost.
Xinshang Wang, Van-Anh Truong
openaire   +2 more sources

Priority Operators for Fairshare Scheduling

2015
Collaborative resource sharing in distributed computing requires scalable mechanisms for allocation and control of user quotas. Decentralized fairshare prioritization is a technique for enforcement of user quotas that can be realized without centralized control. The technique is based on influencing the job scheduling order of local resource management
Gonzalo P. Rodrigo, Per-Olov Östberg, Erik Elmroth   +2 more
openaire   +1 more source

Improved Schedulability Tests for Global Fixed-Priority Scheduling

2011 23rd Euromicro Conference on Real-Time Systems, 2011
In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks is addressed. First, we propose a priority-assignment policy, called ISM-US, for implicit-deadline task systems. Policy ISM-US assigns slack monotonic priorities to a subset of the given task set and other tasks are assigned the highest fixed priority ...
Risat Mahmud Pathan, Jan Jonsson
openaire   +1 more source

Priority Scheduling Versus Pre-Run-Time Scheduling

IFAC Proceedings Volumes, 1998
Abstract Builders of real-time systems often use priority scheduling in their systems without considering alternatives. This paper examines one alternative, pre-run-time scheduling, and show that when it can be applied it has significant advantages when compared to priority scheduling schemes.
Jia Xu, David Lorge Parnas
openaire   +1 more source

Efficient algorithms for schedulability analysis and priority assignment for fixed-priority preemptive scheduling with offsets

International Journal of Embedded Systems, 2014
Fixed-priority scheduling is the most common scheduling algorithm used in industry practice. Imposing fixed task release offsets is an effective technique for improving schedulability by avoiding the critical instant when all tasks are released simultaneously.
Zonghua Gu 0001, Haibin Cai
openaire   +1 more source

Static-priority periodic scheduling on multiprocessors

Proceedings 21st IEEE Real-Time Systems Symposium, 2002
Presents a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling scheme. Like a previous condition due to S. Baruah et al. (1996), our condition actually determines pfair schedulability.
Srikanth Rarnarnurthy, Mark Moir
openaire   +1 more source

An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Applying fixed priority scheduling in practice

Proceedings of the 4th international workshop on Software and performance, 2004
In this paper we are primarily concerned with embedded real-time systems such as mobile phones or personal communication devices. Today personal communication devices are more than voice call terminals. Mobile phones serve as platforms for a variety of mobile applications including text and picture messaging as well as personal information management ...
Raimondas Lencevicius, Alexander Ran
openaire   +1 more source

Synchronous sessions and fixed priority scheduling

Journal of Systems Architecture, 1997
Abstract Fixed priority scheduling is usually applied to tasks that communicate only asynchronously. Synchronous communication, although more suitable for some application requirements, is more difficult to analyse, as a task can be blocked several times and the duration of each block is dependent on the behaviour of other tasks.
Alan Burns 0001, Andy J. Wellings
openaire   +1 more source

A job-priority based soft scheduling approach for uncertain work area scheduling in Semiconductor Manufacturing

International Journal of Production Research, 2022
Huaxing Zhong
exaly