In the literature, optimization models deal with planning and scheduling of several subsystems of the petroleum supply chain such as oilfield infrastructure, crude oil supply, refinery operations and product transportation. The focus of the present work is to propose a general framework for modeling petroleum supply chains. As a starting point, processing units are modeled based on the framewor...

A new approach to gas leakage detection in high pressure distribution networks is proposed, where two leakage detectors are modelled as a Linear Parameter Varying (LPV) system whose scheduling signals are, respectively, intake and offtake pressures. Running the two detectors simultaneously allows for leakage location. First, the pipeline is identified from operational data, supplied by REN-Gaso...

The present paper focuses on applications that are periodic and have both latency and throughput constraints. For these applications, pipeline scheduling is effective for reducing energy consumption. Thus, the present paper proposes a pipelined task scheduling method for minimizing the energy consumption of GALS MP-SoC under latency and throughput constraints. First, we model target GALS MP-SoC...

Instruction scheduling is one of the most important compiler optimizations. An instruction scheduler reorders instructions to improve performance by minimizing pipeline stalls. Traditional approaches to instruction scheduling were based on heuristics. Over the past decade, however, a number of researchers have proposed optimal solutions to instruction scheduling. This dissertation presents the ...

Instruction scheduling is one of the most important code optimizations because of its role in increasing processor utilization. Instruction scheduling reorders instructions to minimize pipeline stalls while preserving program semantics. For realistic processor models, this problem is NP-hard, and numerous heuristic and optimal (enumerative) techniques have been proposed. Heuristics can sometime...

We would like to thank Adisak Mekkittikul for help and numerous discussions about the scheduler design, particularly with the pipelining technique described on page 2. 11 References [1] http://tiny-tera.stanford.edu/tiny-tera [2] N.McKeown, " Scheduling Cells in an input-queued switch, " PhD Thesis,

In this paper, we propose a novel efficient technique called cyclo-compaction scheduling, taking into account the data transmission delays and loop carried dependency associated with specific target architectures. This technique uses the retiming technique (loop pipelining), implicitly applied, and a task remapping to appropriate processors in order to compact the schedule length and improve th...

In this report, we describe the novel RTL design methodology based on Accellera RTL semantics. We also propose the scheduling algorithm targeting bus-based architecture for the RTL design methodology. The proposed scheduling algorithm is based on resource constrained list scheduling, which considers the number of function units, storage units, buses and ports of storage units in each control st...

We present a new approach to the loop scheduling problem with limited resources, known as software pipelining. The aproach improves previous solutions with regard to two important aspects: The initiation interval is treated as a rational variable, and the determination of it is an integral part of the solution. So far, was treated as an integer, or as a fraction of two separate integers which w...

Sissades Tongsima Nelson L. Passos Edwin H-M. Sha Dept. of Computer Science & Engineering University of Notre Dame Notre Dame, IN 46556 Abstract Loop pipelining (retiming) is a valuable tool used to explore parallelism across iterations. Few results are available about loop pipelining with data communication considerations. This paper rst designs a modi ed list scheduling algorithm to be used a...