This paper proposes an innovative Pipeline-based Maximalsized Matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take more than one time slot for its matc...

Architectural design and analysis of VIPER, a VLIW processor designed to take advantage of instruction level parallelism, are presented. VIPER is designed to take advantage of the parallelizing capabilities of Percolation Scheduling. The approach taken in the design of VIPER addresses design issues involving implementation constraints, organizational techniques, and code generation strategies. ...

By combining neural network optimization ideas with “Lagrangian relaxation” for constraint handling, a novel Lagrangian relaxation neural network (LRNN) has recently been developed for job shop scheduling. This paper is to explore architectural design issues for the hardware implementation of such neural networks. A digital circuitry with a micro-controller and an optimization chip is designed,...

Subtask scheduling on multi-core is an important direction in the world today. There is little research of dynamic scheduling subtask according to the network traffic prediction. This paper proposes a method of dynamic scheduling of real-time multi-core subtask based on network traffic prediction. According to the prediction result of network traffics, the larger tasks scheduled dynamically int...

Current schedulability analyses for preemptive systems consider cache behaviour by adding preemption caused cache reload costs. Thereby, they ignore the fact that delays due to cache misses often have a reduced impact because of pipeline effects. In this paper, these methods are called isolated. Pipeline-related preemption costs are not considered at all in current schedulability analyses. This...

In this paper, an analytical model for evaluating the performance of a packet scheduling algorithm, called lookahead scheduling, is proposed. Using lookahead scheduling, each input port of a switch has B packet buffers. A packet arrives at an input port is scheduled for conflict-free transmission for up to B time slots in advance. If it cannot be scheduled for transmission in the next B slots, ...

The scheduling of activities to transport oil derivative products through a pipe network is a complex combinatorial problem that presents a hard computational solution. During the scheduling horizon, many batches are pumped from (or pass through) different areas. Pipes are shared resources. The balance between the demand requirements and the production campaigns, while satisfying inventory mana...