In this paper, we consider the problem of determining a cyclic (or loop) scheduler that allocates slots to flows as periodically as possible. We use the second moment of the inter-allocation distance for each flow as its periodicity metric. We establish the optimality of a Weighted-Round Robin with spreading (WRR-sp2) scheduler for a two-flow scenario. We consider a class-based scheduling scena...

In this paper we propose a new infrastructure for efficient job scheduling on the Grid using multiagent systems and a market-like Service Level Agreement (SLA) negotiation protocol based on the well known Contract Net Protocol. The agent-based Grid scheduling system involves user agents, local scheduler agents, and super scheduler agents. User agents submit jobs to Grid Compute resources. Local...

This paper describes a medium access protocol for real-time communication in wireless networks. Medium access is controlled by a scheduler, which utilizes a pre-emptive earliest deadline first (PEDF) scheduling algorithm. The scheduler prevents collisions in the network, where normally only collisions are avoided. PEDF is the scheduler of choice, because it has excellent properties with respect...

The execution order of a block of computer instructions can make a difference in its running time by a factor of two or more. In order to achieve the best possible speed, compilers use heuristic schedulers appropriate to each specific architecture implementation. However, these heuristic schedulers are time-consuming and expensive to build. In this paper, we present results using both rollouts ...

We propose a new multiwavelength almost all-optical switch architecture called the -scheduler that uses wavelength division multiplexing (WDM) internally to fold the switch architecture in both the space and time domains to reduce the hardware complexity and to improve the signal characteristics through the switch. The -scheduler preserves the packet order for a given input–output pair, is cons...