We demonstrate for the first time a multi-wavelength laser based on a bismuth-based erbium-doped fiber (Bi-EDF) assisted by a four-wave mixing (FWM) process. Using a simple linear cavity resonator scheme containing a 49 cm long highly nonlinear Bi-EDF, we obtained about 8 lines of optical comb with a line spacing of approximately 0.52 nm at the maximum 1480 nm pump power of 160mW.

The output from simulation factorial experiments can be complex and may not be amenable to standard methods of estimation like ANOVA. We consider the situation where the simulation output may not satisfy normality assumptions, but more importantly, where there may be differences in output at different factor combinations, but these are not simply differences in means. We show that EDF statistic...

Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as ...

Datacenters are the main infrastructure on top of which cloud computing services are offered. Such infrastructure may be shared by a large number of tenants and applications generating a spectrum of datacenter traffic. Delay sensitive applications and applications with specific Service Level Agreements (SLAs), generate deadline constrained flows, while other applications initiate flows that are...

Schedulability tests are presented for preemptive earliest-deadlinerst and deadline-monotonic scheduling of periodic real-time tasks on a singlequeue m-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.

Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue -server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independe...

This paper presents a fiber-optic ring network with support for heterogeneous real-time communication. The CCR-EDF (Control Channel Ring network with Earliest Deadline First scheduling) network is an optical fibre-ribbon pipelined ring network with a separate channel for network arbitration. The medium access protocol, that uses the control channel, provides low-level support for hard real time...

This report describes a necessary and sufficient test for the schedulability of a set of sporadic hard-deadline tasks on a multiprocessor platform, using any of a variety of scheduling policies including global fixed taskpriority and earliest-deadline-first (EDF). The contribution is to establish an upper bound on the computational complexity of this problem, for which no algorithm has yet been...

This paper investigates the implementation of two types of scheduling algorithm to obtain the best performances of the Single Cart Gantry Crane System (GCS). In this research, Deadline Monotonic Priority Assignment (DMPA) and Earliest Deadline First (EDF) scheduling algorithm are chosen to be implemented. The main ideas of this approach is to find the schedule that more compatible and provide m...