Instruction scheduling methods which use the concepts developed by the classical pipeline theory have been proposed for architectures involving deeply pipelined function units. These methods rely on the construction of state diagrams (or automatons) to (i) eeciently represent the complex resource usage pattern, and (ii) analyze legal initiation sequences, i.e., those which do not cause a struct...

ing the Lyon platform. [email protected] February 8, 2008 Algorithms and scheduling techniques 65/ 134 Introduction Parallel algorithms Scheduling Pipeline workflows Models and real life Conclusion Results First heuristic building the ring without taking link sharing into account Second heuristic taking link sharing into account (and with quadratic programming) Ratio Dc/Dw H1 H2 Gain 0.64...

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...

1996 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. Abstract In this paper we propose Co-Scheduling, a framework f...

In this paper, we propose a novel algorithm for synthesizing the pipeline structures with variable data initiation intervals (DIIs). Compared to previous researches where the pipeline synthesis is confined to those with fixed DIIs, the proposed algorithm tries to optimize the pipeline latency by fully utilizing hardware resources to which abstract operations in high-level design descriptions ar...

Synchronous Data Flow (SDF) is a useful computational model in image processing, computer vision, and DSP. Previously, throughput and buffer requirement analyses have been studied for SDFs. In this paper, we address energy-aware scheduling for acyclic SDFs on multiprocessors. The multiprocessor considered here has the capability of Dynamic Voltage and Frequency Scaling (DVFS), which allows proc...

Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly diminishes for rather long time horizons. By introducing an MILP continuous representation in both time and...