Results 1  10
of
8,670
Static Optimization
, 1995
"... Contents 1 Introduction 3 1.0.1 Minimal cost feeding : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.1 General approach : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 Algorithms : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ..."
Abstract
 Add to MetaCart
Contents 1 Introduction 3 1.0.1 Minimal cost feeding : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.1 General approach : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 Algorithms : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 1.3 Notation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.4 Some simple unconstrained problems : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.4.1 Positive deniteness : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1.4.2 Taylor's Theorem : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 8 1.4.3 Square root of a matrix : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 1.4.4 Completing the square for quadratics on R n : :
Static Optimization of Queueing Systems
, 1995
"... This paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers, or service capacity, to queues in a network; (ii) the optimal allocation of the visits of a single server to sev ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers, or service capacity, to queues in a network; (ii) the optimal allocation of the visits of a single server
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 1003 (8 self)
 Add to MetaCart
In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single
Dynamo: A Transparent Dynamic Optimization System
 ACM SIGPLAN NOTICES
, 2000
"... We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT ..."
Abstract

Cited by 479 (2 self)
 Add to MetaCart
for example), or it can come from the execution of a statically compiled native binary. This paper evaluates the Dynamo system in the latter, more challenging situation, in order to emphasize the limits, rather than the potential, of the system. Our experiments demonstrate that even statically optimized
Muscular Forces from Static Optimization by
, 2006
"... At every joint there is a redundant set of muscle activated during movement or loading of the system. Optimization techniques are needed to evaluate individual forces in every muscle. The objective in this thesis was to use static optimization techniques to calculate individual muscle forces in the ..."
Abstract
 Add to MetaCart
At every joint there is a redundant set of muscle activated during movement or loading of the system. Optimization techniques are needed to evaluate individual forces in every muscle. The objective in this thesis was to use static optimization techniques to calculate individual muscle forces
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 694 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
Static Optimality and Dynamic SearchOptimality in Lists and Trees
, 2002
"... Adaptive data structures form a central topic of online algorithms research, beginning with the results of Sleator and Tarjan showing that splay trees achieve static optimality for search trees, and that MovetoFront is constant competitive for the list update prob lem [ST85a, ST85b]. This paper is ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
Adaptive data structures form a central topic of online algorithms research, beginning with the results of Sleator and Tarjan showing that splay trees achieve static optimality for search trees, and that MovetoFront is constant competitive for the list update prob lem [ST85a, ST85b]. This paper
Formalization and Static Optimization of Parallel Implementations
 in Proc. Workshop on Distributed and Parallel Systems
, 1998
"... In this paper, we present a relational formalism based on graphs theory to build all the possible implementations of an algorithm onto a parallel machine. Here, the term implementation means, not only as usual, the distribution and the scheduling of the computations, as well as the distribution of t ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
the critical path length and the schedule flexibility. This type of optimization is static, because the distribution and the scheduling choices are done during the compilation, instead of during the realtime execution. Finally, we compare our heuristic using several examples, with other ones of the same type
Static Optimization based on Output Feedback
, 2007
"... In the framework of process optimization, the use of measurements to compensate the effect of uncertainty has reemerged as an active area of research. One of the ideas therein is to adapt the inputs in order to track the active constraints and push certain sensitivities to zero. In perturbationbas ..."
Abstract
 Add to MetaCart
In the framework of process optimization, the use of measurements to compensate the effect of uncertainty has reemerged as an active area of research. One of the ideas therein is to adapt the inputs in order to track the active constraints and push certain sensitivities to zero. In perturbation
1. STATIC OPTIMIZATION OF BARRIER SYNCHRONIZATION
"... We want to perform compiletime analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the barrier minimization problem. No full solution to the problem has been given previously. Here we model the problem with a ..."
Abstract
 Add to MetaCart
We want to perform compiletime analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the barrier minimization problem. No full solution to the problem has been given previously. Here we model the problem with a new combinatorial structure, a nested family of sets of circular intervals. We show that barrier minimization is equivalent to finding a hierarchy of minimum cardinality point sets that cut all intervals. For a single loop, modeled as a simple family of circular intervals, a lineartime algorithm is known. We extend this result, finding a lineartime solution for nested circular interval families. This result solves the barrier minimization problem for general nested loops.
Results 1  10
of
8,670