Multiprocessor architecture becomes common on realtime systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, ...

We present a method for calculating the minimum EDF-feasible deadline. The algorithm targets periodic tasks with hard real-time guarantees, that are to be feasibly scheduled with EDF (Earliest Deadline First). The output is the smallest possible deadline required for feasibility, of the task most recently requested. The good thing with our algorithm is that it has the same timecomplexity as the...

Both SignalML and EDF+ offer a solution for the incompatibility between different data storage formats in biomedicine. This article discusses the SignalML approach from an EDF+ point of view.

Abstract Purpose This study aims to measure the number of scientific production Italian professors, as framed on academic disciplines Physical training and methodology (code M-EDF/01) Sport sciences M-EDF/02), afferents recruitment field Exercise sports 06/N2) Didactics, special education educational research 11/D2). Methods The sample consisted entire population full professors ( n = 30) M-EDF...

In this paper, we validate the performance of Moody’s KMV EDF credit measures in its timeliness of default prediction, ability to discriminate good firms from bad firms, and accuracy of levels in three regions: North America, Europe, and Asia. We focus on the period 1996–2006 for most of our tests. Wherever possible, we compare the performance to that of other popular alternatives, such as agen...

The contention-free policy has received attention in real-time multiprocessor scheduling owing to its wide applicability and significant improvement in offline schedulability guarantees. Utilizing the notion of contention-free slots in which the number of active jobs is smaller than or equal to the number of processors, the policy improves the schedulability by offloading executions in contendi...

Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses t...

Real-time disk I/O scheduling is extremely important to the performance improvement of the whole real-time system since the disk devices are the system’s bottleneck. To meet time constraints, some conventional algorithm, such as EDF, Least Slack Time First, Rate Monotonic, can be used to schedule disk I/O. However, these algorithms ignore the relative position of requested data on the disks, he...