No abstract

In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible under EDF, the proposed algorithm allows computing the shortest deadline that can be assigned to an arbitrary task in the set, or to a new incoming task (periodic or aperiodic), still preserving the EDF feasibility of the new task set. The algorithm has a pseudo polynomial complexity and handles arbitrary relative deadlines, which can be less than, equal to, or greater than periods.

Abstract

No abstract

In this paper, an architecture and a Medium Access Control (MAC) protocol for a multi-wavelength optical communication network, applicable in short range communication systems like System Area Networks (SANs), are proposed. The main focus lies on guaranteed support for hard and soft real-time traffic. The network is based upon a single-hop star topology with an Arrayed Waveguide Grating (AWG) at its center. Traffic scheduling is centralized in one node (residing together with the AWG in a hub), which communicates through a physical control channel. The AWG's property of spatial wavelength reuse and the combination of fixed-tuned and tunable transceivers in the nodes enable simultaneous control and data transmission. A case study with defined real-time communication requirements in the field of Radar Signal Processing (RSP) was carried out and indicates that the proposed system is very suitable for this kind of application.

©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.