Preemption threshold scheduling (PTS) enhances real-time schedulability by controlling preemptiveness of tasks. This benefit of PTS highly depends on a proper algorithm that assigns each task feasible scheduling attributes, which are priority and preemption threshold. Due to the existence of an efficient optimal preemption threshold assignment algorithm that works with fully assigned priority o...

Decentralized prioritization is a technique to influence job scheduling order in grid fairshare scheduling without centralized control. The technique uses an algorithm that measures individual user distances between quota allocations and historical resource usage (intended and current system state) to establish a semantic for prioritization. In this work we address design and evaluation of prio...

Guaranteeing quality for differentiated services while ensuring resource efficiency is an important and yet challenging problem in large computing clusters. Priority scheduling is commonly adopted in production systems to minimize the response time of high-priority workload by means of preempting the execution of low-priority workload when faced with limited resources. As a result, the system p...

The task of job shop scheduling – determining the sequence and timing of jobs on available resources – is one of the most discussed practical problems in operations management. There are many appropriate problem definitions for job shop scheduling due to the complex and dynamic nature of the problem with a large number of variables and constraints linked to jobs and resources, such as specific ...

The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...

Time-critical scheduling in real-time database systems has two components: real-time transaction scheduling, which is related to task scheduling in realtime operating systems, and concurrency control, which can be considered as operation level scheduling. Most current research in this area only focuses on the transaction scheduling aspact while the concurrency control part remains untouched. In...

High performance servers in client/server distributed systems must manage and multiplex disk I/O resources eeciently and fairly between multiple clients. In digital multimedia systems, clients may make requests of varying urgencies. The traditional approach to this problem thus assigns priorities to disk requests. High priority requests are scheduled rst, with low priority requests served only ...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

Wireless sensor networks (WSNs) are playing a vital role in automation, sensing and commercial applications. Key issues in WSNs are to satisfy Quality of service (QoS) parameters and to conserve energy. Some of the sensor nodes in WSN act as a single communication link to connect one group of sensor nodes to other in multi-hop environment. If nodes acting as a single communication link become d...

Reconfiguration of a wavelength routed optical network with the use of priority scheduling algorithm to priotoriza lightpath request with the aim to utilizing or exhausting the resources. Preference has given to heavily loaded in establishing lightpaths between node pairs having large traffic and low preference to lightly loaded lightpaths. Applications such as grid computing, e-science, three ...