The stringent performance constraints and short time to market of modern digital systems require automatic methods for design of high performance applicationspecific architectures. This paper presents a novel algorithm for automatic generation of custom pipelined data path for a given application from its C code. The data path optimization targets both resource utilization and performance. The ...

beneficial management practices (bmps) are important measures for reducing agricultural non-point source (nps) pollution. however, selection of bmps for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. due to its iterative nature, the optimization typically takes a long time to achieve the bmp trade-off results which is not desirable ...

Current state-of-the-art solution techniques for solving bilevel optimization problems either assume strong problem regularity criteria or are computationally intractable. In this article, we address power system of structure, commonly arising after the deregulation industry. Such predominantly solved by converting lower level into a set equivalent constraints using Karush–Kuhn–Tucker optimalit...

In these presentation records we propose a procedure to increase robustness of production plans embedded in a modelling approach based on integrated multi-scale optimization models and solution methods for planning and scheduling of a make to order production process under uncertain and varying demand conditions. As an inspiration we have a large real world problem originating from a complex ph...

Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gather a large number of runs often with the same data set and on the same environment in order to test many different optimizations and to select the most appropriate ones. Naturally, in many cases, users cannot afford a training...

Run-Time Optimization of Adaptive Irregular Applications. (August 2004) Hao Yu, B.S., Tsinghua University, PR China; M.S., Tsinghua University, PR China Chair of Advisory Committee: Dr. Lawrence Rauchwerger Compared to traditional compile-time optimization, run-time optimization could offer significant performance improvements when parallelizing and optimizing adaptive irregular applications, b...

We focus on automatic strategies to optimize life cycle savings and investment. Classical optimal savings theory establishes that, given the level of risk aversion, a saver would keep the same relative amount invested in risky assets at any given time. We show that, when optimizing lifecycle investment, performance and risk assessment have to take into account the investor's risk aversion and t...

This paper introduces a methodology for estimating the applicability of a particular Genetic Algorithm (GA) configuration for an arbitrary optimization problem based on run-time data. GAs are increasingly employed to solve complex real-world optimization problems featuring ill-behaved search spaces (e.g., non-continuous, non-convex, non-differentiable) for which traditional algorithms fail. The...

Abstract –– High–performance embedded systems– High–performance embedded systems are being implemented as parallel and distributed systems with increasing frequency. There is strong motivation to make such systems adaptive and/or dynamic in order to obtain maximum performance and maximum reliability. One important component of an adaptive or dynamic parallel system is the ability to monitor the...