In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well known for uniprocessor platforms and which are also true for unrelated multiprocessor platforms: (i) under few and not so restrictive assumptions, we prove that feasible schedules of periodic task systems are periodic starting from som...

The replication of the non-structure data from one data center to another is an urgent task in HBase. The paper studies the priority growth probability of the priority replication queue and proposed a dynamic priority replication task queue algorithm based on the earliest deadline first algorithm (EDF). The experiment results show that the proposed algorithm can balance the replication overhead...

This paper examines the relative effectiveness of fixed priority non-pre-emptive scheduling (FP-NP) in a uniprocessor system, compared to an optimal workconserving non-pre-emptive algorithm; Earliest Deadline First (EDF-NP). The quantitative metric used in this comparison is the processor speedup factor, defined as the factor by which processor speed needs to increase to ensure that any taskset...

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm f...

In this paper we study the global scheduling of periodic task systems upon multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so restrictive assumptions, we show that feasible schedules of periodic task systems are periodic from some point with a period equal to ...

This paper presents a feature-based machine vision system for estimating lanedeparture of a traveling vehicle on a road. The system uses edge information to define an edge distribution function (EDF), the histogram of edge magnitudes with respect to edge orientation angle. The EDF enables the edge-related information and the lane-related information to be connected. Examining the EDF by the sha...

We have implemented Soft Real-Time DBMS prototype called ZDBMS. Using this prototype we have investigated performance for commonly used policies EDF, LSF and for new transaction handling policy SPF oriented for using in cases when transactions have different static priorities. The results represent these policies performance for equal sets of experiments.

Various techniques have been proposed to achieve good QoS for diverse application types at network nodes. In order to supply the various QoS requirements for different kinds of applications, new scheduling policies need to be developed and evaluated. Many scheduling techniques have been proposed to respond to the temporal requirements of real-time flows. We propose a new scheduling Hierarchical...

Most existing WLAN access mechanisms cannot provide QoS assurances. Even those that are QoS aware can only provide relative service differentiation. Based on EY-NPMA, the HIPERLAN Medium Access Control algorithm, we propose a dynamic priority medium access scheme to provide time-bounded services. By approximating an ideal Earliest Deadline First (EDF) scheduler, the proposed scheme can offer de...

This paper proposes a new hardware-based energy management technique for future embedded multithreaded processors with integrated Earliest Deadline First (EDF) real-time scheduling. Our energy management technique controls frequency reduction and dynamic voltage scaling depending on the deadlines, the Worst Case Execution Times (WCET), and the real execution times. Hard real-time capability can...