Results 1  10
of
18
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 597 (24 self)
 Add to MetaCart
(Show Context)
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available, and that the constraint gradients are sparse. We discuss
Toba: Java For Applications  A Way Ahead of Time (WAT) Compiler
, 1997
"... Toba is a system for generating efficient standalone Java applications. Toba includes a JavabytecodetoC compiler, a garbage collector, a threads package, and Java API support. Tobacompiled Java applications execute 1.54.2 times faster than interpreted and JustInTime compiled applications. ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
(Show Context)
Toba is a system for generating efficient standalone Java applications. Toba includes a JavabytecodetoC compiler, a garbage collector, a threads package, and Java API support. Tobacompiled Java applications execute 1.54.2 times faster than interpreted and JustInTime compiled applications.
Balanced Scheduling: Instruction scheduling when memory latency is uncertain
, 1992
"... Traditional list schedulers order instructions based on an optimistic estimate of the load delay imposed by the implementation. Therefore they cannot respond to variations in load latencies (due to cache hits or misses, congestion in the memory interconnect, etc.) and cannot easily be applied across ..."
Abstract

Cited by 56 (3 self)
 Add to MetaCart
(Show Context)
Traditional list schedulers order instructions based on an optimistic estimate of the load delay imposed by the implementation. Therefore they cannot respond to variations in load latencies (due to cache hits or misses, congestion in the memory interconnect, etc.) and cannot easily be applied across different implementations. We have developed an alternative algorithm, known as balanced scheduling, that schedules instructions based on an estimate of the amount of instruction level parallelism in the program. Since scheduling decisions are program rather than machinebased, balanced scheduling is unaffected by implementation changes. Since it is based on the amount of instruction level parallelism that a program can support, it can respond better to variations in load latencies. Performance improvements over a traditional list scheduler on a Fortran workload and simulating several different machine types (cachebased workstations, large parallel machines with a multipath interconnect an...
User’s Guide for SNOPT Version 7: Software for LargeScale Nonlinear Programming
"... SNOPT is a generalpurpose system for constrained optimization. It minimizes a linear or nonlinear function subject to bounds on the variables and sparse linear or nonlinear constraints. It is suitable for largescale linear and quadratic programming and for linearly constrained optimization, as wel ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
SNOPT is a generalpurpose system for constrained optimization. It minimizes a linear or nonlinear function subject to bounds on the variables and sparse linear or nonlinear constraints. It is suitable for largescale linear and quadratic programming and for linearly constrained optimization, as well as for general nonlinear programs. SNOPT finds solutions that are locally optimal, and ideally any nonlinear functions should be smooth and users should provide gradients. It is often more widely useful. For example, local optima are often global solutions, and discontinuities in the function gradients can often be tolerated if they are not too close to an optimum. Unknown gradients are estimated by finite differences. SNOPT uses a sequential quadratic programming (SQP) algorithm. Search directions are obtained from QP subproblems that minimize a quadratic model of the Lagrangian function subject to linearized constraints. An augmented Lagrangian merit function is reduced along each search direction to ensure convergence from any starting point.
A Tour of Tempo: A Program Specializer for the C Language
, 2003
"... Tempo is a specializer for the C language that automatically customizes a program with respect to the values of con guration parameters. It oers specialization at both compile time and run time, and both program and data specialization. To control the specialization process, Tempo provides the prog ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
Tempo is a specializer for the C language that automatically customizes a program with respect to the values of con guration parameters. It oers specialization at both compile time and run time, and both program and data specialization. To control the specialization process, Tempo provides the program developer with a declarative language to describe specialization opportunities for a given program.
Load/Store Range Analysis for Global Register Allocation
 Proc. of the SIGPLAN Conference on Programming Language Design and Implementation
, 1994
"... Live range splitting techniques improve global register allocation by splitting the live ranges of variables into segments that are individually allocated registers. Load/store range analysis is a new technique for live range splitting that is based on reaching definition and live variable analyses. ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
(Show Context)
Live range splitting techniques improve global register allocation by splitting the live ranges of variables into segments that are individually allocated registers. Load/store range analysis is a new technique for live range splitting that is based on reaching definition and live variable analyses. Our analysis localizes the profits and the register requirements of every access to every variable to provide a fine granularity of candidates for register allocation. Experiments on a suite of C and FORTRAN benchmark programs show that a graph coloring register allocator operating on load/store ranges often provides better allocations than the same allocator operating on live ranges. Experimental results also show that the computational cost of using load/store ranges for register allocation is moderately more than the cost of using live ranges. 1 Introduction Register allocation maps variables in an intermediate language program to either registers or memory locations in order to minimiz...
Java access to numerical libraries
 CONCURRENCY: PRACTICE AND EXPERIENCE, VOL. 9(11), 1279–1291 (NOVEMBER 1997)
, 1997
"... It is a common and somewhat erroneous belief that Java will always be ‘too slow’ for scientific computing. Two projects under way at the University of Tennessee are addressing the question of scientific computing via Java: NetSolve and f2j. The approaches taken by these two projects are radically di ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
It is a common and somewhat erroneous belief that Java will always be ‘too slow’ for scientific computing. Two projects under way at the University of Tennessee are addressing the question of scientific computing via Java: NetSolve and f2j. The approaches taken by these two projects are radically different. NetSolve allows users to access preinstalled computational resources, such as hardware and software, distributed across the network. Using these resources, the user can easily perform scientific computing tasks without having any computing resource installed on his or her computer. NetSolve features a Graphical User Interface written in Java as well as a Java Application Programming Interface. The f2j (Fortran to Java) project will provide the numerical subroutines translated from their Fortran source into class files suitable for use by Java programmers. This makes it possible for a Java application or applet to use established legacy numerical code that was originally written in Fortran. This article describes the research issues involved in these two projects and their current limitations. We also explain how, although using two different paradigms and addressing somewhat different classes of users and applications, NetSolve and f2j achieve a common goal: to provide efficient, reliable
Implementation of the MixedPrecision High Performance
 LINPACK Benchmark on the CELL Processor,” University of Tennessee Computer Science, Tech. Rep. UTCS06580, LAPACK Working Note 177
, 2006
"... This paper describes the design concepts behind implementations of mixedprecision linear algebra routines targeted for the Cell processor. It describes in detail the implementation of code to solve linear system of equations using Gaussian elimination in single precision with iterative refinement o ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
This paper describes the design concepts behind implementations of mixedprecision linear algebra routines targeted for the Cell processor. It describes in detail the implementation of code to solve linear system of equations using Gaussian elimination in single precision with iterative refinement of the solution to the full double precision accuracy. By utilizing this approach the algorithm achieves close to an order of magnitude higher performance on the Cell processor than the performance offered by the standard double precision algorithm. Effectively the code is an implementation of the high performance LINPACK benchmark, since it meets all the requirements concerning the problem being solved and the numerical properties of the solution.
A Portable parallelizing compiler with loop partitioning
 Proc. of the NSC ROC(A
, 1999
"... ..."
(Show Context)
Dimensionality reduction in growth models: an example
 INFORMATION SCIENCES 1: 1–15. GILMORE
, 2003
"... Individualtree growth models are often used to describe forest stand development and response to silvicultural treatments. Although ideal as research tools, incomplete information on initial conditions can make them unreliable and awkward to use for forest management decisionmaking. At least for ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Individualtree growth models are often used to describe forest stand development and response to silvicultural treatments. Although ideal as research tools, incomplete information on initial conditions can make them unreliable and awkward to use for forest management decisionmaking. At least for evenaged singlespecies stands, wholestand models are an attractive alternative. There may be doubts, however, about the ability of these simpler models to reproduce the behaviour of managed forest stands. To explore this issue, standlevel approximations to TASS, a highly detailed mechanistic individualtree distancedependent growth model, are investigated. It is shown that a twodimensional state space, implicit in stand density management diagrams and selfthinning theories, is insufficient for describing the predicted growth of thinned stands. TASS predictions, however, can be approximated by a relatively simple dynamical wholestand model using three state variables.