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 stochastic optimization

Xin Qi, Myeongsoo Kim, Qirun Zhang et al. · 2020

Programs typically provide a broad range of features. Because different typologies of users tend to use only a subset of these features, and unnecessary features can harm performance and security, program debloating techniques, which can reduce the size of a program by eliminating (possibly) unneeded features, are becoming increasingly popular. Most existing debloating techniques tend to focus on program-size reduction alone and, although effective, ignore other important aspects of debloating. We believe that program debloating is a multifaceted problem that must be addressed in a more general way. In this spirit, we propose a general approach that allows for formulating program debloating as a multi-objective optimization problem. Given a program to be debloated, our approach lets users specify (1) a usage profile for the program (i.e., a set of inputs with associated usage probabilities), (2) the factors of interest for debloating, and (3) the relative importance of these factors. Based on this information, the approach defines a suitable objective function for associating a score to every possible reduced program and aims to generate an optimal solution that maximizes the objective function. We also present and evaluate Debop, a specific instance of our approach that considers three objectives: size reduction, attack-surface reduction, and generality (i.e., the extent to which the reduced program handles inputs in the usage profile provided). Our results, albeit still preliminary, are promising and show that our approach can be effective at generating debloated programs that achieve a good trade-off between the different de-bloating objectives considered. Our results also provide insights on the performance of our general approach when compared to a specialized single-goal technique.

Cited by 11Open access

Network optimization computer program package

Bandler, John W., Jha, Virendra K. · MacSphere (McMaster University) · 1972

Report and program package produced by John W. Bandler and Virendra K. Jha. Program package is written in FORTRAN IV. This work is licensed under a Creative Commons Attribution-Non-Commercial-No-Derivatives 4.0 International License.

Cited by 0

A Microwave Network Optimization Program

J.W. Bandler, V.K. Jha, Chandra M. Kudsia et al. · 1973

The paper describes a fully-documented, comprehensive, user-oriented computer program package that will analyze and optimize certain electrical networks such as microwave filters and allpass networks. The package is written in FORTRAN IV.

Cited by 3

Optimization of maintenance program for machines.

Ngo Ngoc Lan · OpenGrey (Institut de l'Information Scientifique et Technique) · 2004

In the thesis optimization of maintenance management is discussed including aspects of historical overview, maintenance concepts and comparing maintenance management with other management areas. Maintenance optimization models are reviewed and five of the most popular models are discussed more detailed. Application and its difficulties are given. Future prospects of maintenance are predicted. A solution of the problem is proposed. It includes the basic theories in a wide range of fields such as mathematics, management, dependability, informatic science, etc. It describes how to build a general optimization model to determine the intervals of time to preceded maintenance activities. It also covers engineering practice including dependability modelling and prediction, failure modes, effect and criticality analysis, even tree analysis, fault tree analysis and shows how they can be applied in the proposed method. The proposal of the Optimization Maintenance Program is applied for an ammoniac plant. The plant description is given and then, step by step, procedures needed for the proposed method of optimization are introduced. The results of the analysis are documented in form of tables.

Cited by 0

Interactive optimization techniques enterprise production program

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

В статье представлен авторский вариант систематизации существующих способов реализации многоцелевого подхода к решению оптимизационных задач.

Cited by 0Open access

HOPI: on-line injection optimization program

J. Lemaire · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1977

A method of matching the beam from the 200 MeV linac to the AGS without the necessity of making emittance measurements is presented. An on-line computer program written on the PDP10 computer performs the matching by modifying independently the horizontal and vertical emittance. Experimental results show success with this method, which can be applied to any matching section.

Cited by 1Open access

Imperative program optimization by partial evaluation

Søren Debois · 2004

We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to identify and remove code duplication in residual programs; and we discover that some simple classical optimizations, notably constant-propagation, seemingly do not lend themselves to implementation by specialization of instrumented interpreters.

Cited by 9

Program Type Recognition for Compiler Optimization

Tzu-Han Hung, Jiunn-yeu Chen, Wuu Yang et al. · 2009

Today’s compilers have many optimization options, and it is difficult to understand all the details and the interactions between them. Therefore, many application developers simply use the well-known compiler flags to compile all their programs. On the other hand, some researchers focus on customizing the optimizations for each program. The former method may hurt the performance of some programs since non-optimal options are applied on them. The latter approach takes care of the variations of programs but suffer from the scalability problem because the optimization space is often huge. This makes it less popular for the emerging dynamic optimizing compilers. We attack this problem by exploiting two insights: first, it is feasible to categorize the programs into different classes according to their functionalities and characteristics; second, dynamic profiling information is useful for recognizing the type of a program. With both insights, we present a novel approach for program optimization: first, the programs are categorized into different classes and the classlevel optimization decision is made by the domain experts; then, the class of an input program is recognized by the machine learning models and the optimal class-level optimizations are applied to obtain the best performance. We demonstrate that this approach can be applied to a binary translator and great performance improvement can be achieved.

Cited by 0

Global Program Optimization: Register Allocation of

Static Scalar Objects, Andrea G. M. Cilio, Henk Corporaal · 1999

Performing certain optimizations on whole programs offers huge potential for code improvement. To exploit this possibility, we implemented a framework that allows sophisticated analysis and transformation of machine code, during or after linkage. This paper presents one of the many applications of our framework: the allocation of global scalar variables into registers. We present the algorithms that select the variables and remove the load and store instructions associated with them. The simulations of the unscheduled code of our benchmarks show that up to 10% of the execution cycles is saved by applying this technique.

Cited by 0