Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “program optimization”

Program Debloating via Multi-Granularity Stochastic Optimization

Jinran Tang, Shufan Gong, Hao Chen et al. · ACM Transactions on Software Engineering and Methodology · 2026

Code reduction and program generality are two key factors affecting the effectiveness of feature-based debloating. These two factors are inherently in tension: reducing more code typically decreases program generality, and vice versa. Therefore, effective debloating must strike a good tradeoff between them. To this end, a previous technique, Debop , addresses debloating as an optimization problem. It uses an objective function to quantify, for any debloated program that it generates, the reduction, generality, and their tradeoff, and employs a Markov-Chain-Monte-Carlo-based sampling approach for stochastic optimization, aiming to find the best sample, that is, the debloated program with the highest tradeoff score. Unfortunately, because Debop uses a very simple mutation model, which reduces or recovers only one primitive statement (often a line of code) for sampling, its search ability is significantly limited, especially when the program is large and in scenarios where code reduction is prioritized over generality. To improve the stochastic search for better debloating, we propose Mop , a new optimization-based technique that uses three mutation models targeting different code granularities for sample generation based on the code coverage (derived from the program execution with the feature-characterizing inputs), the coverage segments (exercised by unique subsets of features), and the statements. The use of these models accounts for both static code structure and dynamic program execution for sample generation and enables both aggressive and fine-grained exploration for improved optimization. However, as the optimization is guided by a set of inputs serving as the usage profile, it may mistakenly delete robustness-related code that is not covered by these inputs. Therefore, after the optimization, Mop also performs fuzzing-guided code augmentation to enhance the robustness of the optimized program. To assess the effectiveness of Mop , we implemented a prototype of the approach and applied it to an existing benchmark of 25 programs and a real-world database management system PostgreSQL for debloating. Our results are encouraging, as they show that Mop can produce debloated programs with different tradeoffs and achieve a tradeoff score that is on average 15% (and in many cases 30%) higher than Debop ’s. We also found that Mop ’s code reduction ability is at least comparable to that of the state-of-the-art reduction-oriented techniques and that it can produce robustness-enhanced programs. Overall, the results demonstrate Mop ’s improved proficiency for optimization-based debloating.

Cited by 0

Schedule Optimization Study, Hanford RI/FS Program

Pacific Northwest Lab., Richland, WA (United States). Environmental Management Operations · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1992

A Schedule Optimization Study (SOS) of the US Department of Energy (DOE) Hanford Site Remedial Investigation/Feasibility Study (RI/FS) Program was conducted by an independent team of professionals from other federal agencies and the private sector experienced in environmental restoration. This team spent two weeks at Hanford in September 1992 examining the reasons for the lengthy RI/FS process at Hanford and developing recommendations to expedite the process. The need for the study arose out of a schedule dispute regarding the submission of the 1100-EM-1 Operable Unit RI/FS Work Plan. This report documents the study called for in the August 29, 1991, Dispute Resolution Committee Decision Statement. Battelle's Environmental Management Operations (EMO) coordinated the effort for DOE's Richland Field Office (RL).

Cited by 0Open access

Generic Optimization Program User Manual Version 3.0.0

Michael Wetter · 2009

GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.

Cited by 62Open access

A framework for remote dynamic program optimization

Michael Voss, Rudolf Eigenmann · ACM SIGPLAN Notices · 2000

Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applied as program and machine characteristics are discovered and change. In most dynamic optimization and compilation frameworks, the time spent in code generation and optimization must be minimized since it is directly reflected in the total program execution time. We propose a generic framework for remote dynamic program optimization that mitigates this need. A local optimizer thread monitors the program as it executes and selects program sections that should be optimized. An optimizer, running on a remote machine or a free processor of a multiprocessor, is then called to actually perform the optimization and generate a new code variant for the section. A dynamic selector is used to select the most appropriate code variant for each code interval based upon the current runtime environment. We describe this framework in detail and present an example of its use on a simple application. We show that our framework, when used with changing input, can outperform the best statically optimized version of the application.

Cited by 4Open access

Optimization of the Modular Educational Program Structure

Ivanchenko, Alexandr, Kolomiets, Anastasia, Grinchenkov, Dmitriy et al. · SHILAP Revista de lepidopterología · 2016

Optimized structure of the educational program consisting of a set of the interconnected educational objects is offered by means of problem solution of optimum partition of the acyclic weighed graph. The condition of acyclicity preservation for subgraphs is formulated and the quantitative assessment of decision options is executed. The original algorithm of search of quasioptimum partition using the genetic algorithm scheme with coding chromosomes by permutation is offered. Object-oriented realization of algorithm in language C ++ is described and results of numerical experiments are presented.

Cited by 1Open access

Whole-program optimization of global variable layout

Nathaniel McIntosh, Sandya Mannarswamy, Robert Hundt · 2006

On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve locality, but increasingly seek to modify an application's data layout to reduce cache miss and page fault penalties. In this paper we discuss Global Variable Layout (GVL), an optimization of the placement of entire static global data objects in the binary. We describe two practical methods for GVL in the HP-UX Integrity optimizing compiler for the Itanium © architecture. The first layout strategy relies on profile feedback, collaboratively employing the compiler, the linker and a pre-link tool to facilitate reordering. The second strategy uses whole-program analysis to drive data layout decisions, and does not require the use of a dynamic profile. We give a detailed description of our implementation and evaluate its performance for the SPEC integer benchmark programs, as well as for a large commercial database application.

Cited by 6

A Digital Computer Program for Compound Optimization

Roberts Beaumont, Nádia Hartmann, Ciara M. Chamberlain · Rubber Chemistry and Technology · 1970

Abstract In recent years the advent of computers has allowed the analysis of result of far more sophisticated experiments than was possible by manual methods and this has encouraged rubber compounders to investigate the effect on properties of changing many compound variables simultaneously. By using appropriate experimental designs, then fitting property response equations to the data by regression techniques, it is possible to predict the properties of any compound within the experimental range considered. Given a set of response equations describing all the properties of interest in terms of the levels of compound variables, optimization of the compound becomes the problem of “—the determination of the ‘best’ set of factor combinations or design variables consistent with specified constraints”.

Cited by 0

Partnership Offers New Distribution System Optimization Program

Bill Lauer · American Water Works Association · 2010

This article presents the Partnership for Safe Water (PSW) continuous improvement program, originally developed to help well‐run utilities treating surface water sources to optimize their treatment processes beyond regulatory requirements to provide added protection against Cryptosporidium. The article discusses PSW's fundamental approach, along with the development of the program, the four phases of the Distribution System Optimization Program, the three main components of overall system integrity, and the primary performance indicator for each major system integrity component. A unique feature of the program is that data from performance measures provide evidence of progress toward optimization goals.

Cited by 3

Automatic optimization of program settings for performance

Aho, Nico · Theseus (Ammattikorkeakoulujen) · 2023

The purpose of this thesis was to determine if it is possible to create an easy-touse system that automatically optimizes the settings of a video game for improved performance. The reason this kind of system is needed is because optimizing the settings manually can be quite challenging and time-consuming for the average user. 
\n
\nThe objectives of the thesis were achieved by first researching the settings used in video games. Then the acquired knowledge was used to develop several possible ways to achieve the system goals. Finally, a system was built to test the developed methods in practice. 
\n
\nWhen testing the system, it was able to automatically recognize when there was poor performance and improve it by changing the settings in the intended order. Additionally, the system was simple to use. 
\n
\nBased on the test results. it can be concluded that it is indeed possible to create a system that automatically optimizes the performance of a video game by changing its settings and that is user-friendly.

Cited by 0Open access

RAOPS: Resource Allocation Optimization Program for Safegurards

A. Żardecki, J.T. Markin · University of North Texas Digital Library (University of North Texas) · 1994

RAOPS--Resource Allocation Optimization Program for Safeguards is extended to a multiobjective return function having the detection probability and expected detection time as criteria. The expected detection time is included as a constraint, based on the well-known Avenhaus model of the optimum number of inventory periods. Examples of computation are provided.

Cited by 1Open access

Optimization of prodaction program of an enterprise

Єгупов, Ю.А., Егупов, Ю.А., Yegupov, Y. · Electronic Odessa National Economic University Institutional Repository (Odessa National Economic University) · 2008

В статті визначено місце оптимізаційних розрахунків у процесі формування виробничої програми промислового підприємства; досліджені сучасні підходи і дані рекомендації щодо побудови системи обмежень і вибору критеріїв оптимальності на окремих стадіях формування виробничої програми.

Cited by 0Open access

GLOBALMIN - A Computer Program for Global Optimization.

Eldon Hansen · 1979

Abstract : GLOBALMIN is a program for finding the global minimum of nonlinear function f C sq of n variables. It provides infallible bounds on the minimum value F* of f in any prescribed box (a box is a parallelopiped with sides parallel to the coordinate axes). It also provides infallible bounds on the point(s) x* at which the global minimum occurs. The implementation of an algorithm that provides infallible bounds on the global minimum of any twice continuously differentiable real function of n real variables on a closed, bounded domain is described. The algorithm also provides infallible bounds on the location of the global minimum. The algorithm uses interval arithmetic and requires the availability of several fundamental interval arithmetic processors for its operation.

Cited by 0

Shield optimization program, Part I: Executive summary

Roberta Santoro, T. A. Gabriel · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1989

Detailed studies have been completed to estimate the radiation-induced damage in sensitive electronic components carried on a space-based interceptor weapons platform. The architecture of the interceptor was devised to be as realistic as possible. The analyses were completed for natural (Van Allen belt protons and electrons at an orbital altitude of 500 km) and man-made (nuclear weapons: neutrons, gamma-rays, X-rays, and pumped electron belts) radiation expected to be encountered by a SDI platform. Studies have also been completed to determine the hydrodynamic responses of beryllium mirror surfaces to mono-energetic X-rays (1 and 2 keV). This work included the effects of impurities which are introduced into the surface during machining. Finally, a comparison of the HULL and PUFF-TFT codes are presented which includes the thermo-mechanical response of an Al slab to 5 keV black body radiation. 16 refs., 12 figs., 10 tabs.

Cited by 1Open access