Results 1  10
of
19
Simple Register Spilling in a Retargetable Compiler
 SOFIWAREPRACTICE AND EXPERIENCE, VOL. 22(1), 8999(JANUARY 1992)
, 1992
"... This paper describes the management of register spills in a retargetable C compiler. Spills are rare, which means that testing is a bigger problem than performance. The tradeoffs have been arranged so that the common case (no spills) generates respectable code quickly and the uncommon case (spills) ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
This paper describes the management of register spills in a retargetable C compiler. Spills are rare, which means that testing is a bigger problem than performance. The tradeoffs have been arranged so that the common case (no spills) generates respectable code quickly and the uncommon case (spills) is less efficient but as simple as possible. The technique has proven practical and is in production use on VAX, Motorola 68020, SPARC and MIPS machines
Efficient implementation of the firstfit strategy for dynamic storage allocation
 ACM Transactions on Programming Languages and Systems
, 1989
"... We describe an algorithm that efficiently implements the firstfit strategy for dynamic storage allocation. The algorithm imposes a storage overhead of only one word per allocated block (plus a few percent of the total space used for dynamic storage), and the time required to allocate or free a bloc ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
We describe an algorithm that efficiently implements the firstfit strategy for dynamic storage allocation. The algorithm imposes a storage overhead of only one word per allocated block (plus a few percent of the total space used for dynamic storage), and the time required to allocate or free a block is O(log W), where W is the maximum number of words allocated dynamically. The algorithm is faster than many commonly used algorithms, especially when many small blocks are allocated, and has good worstcase behavior. It is relatively easy to implement and could be used internally by an operating system or to provide runtime support for highlevel languages such as Pascal and Ada. A Pascal implementation is given in the Appendix.
A Simulation and Decision Framework for Selection of Numerical Solvers in Scientific Computing
"... Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive mathematical background and deeper knowledge in numerical analysis. In this paper we propose a modeldriven combined decision ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive mathematical background and deeper knowledge in numerical analysis. In this paper we propose a modeldriven combined decisionsimulation framework for automatically selecting a numerical method for a given set of equation system. We also propose a formal paradigm based on domainspecific languages for specification of structural and behavioral aspects of the numerical equation solving process. Starting from a declarative description of the equation system that need to be solved, our system is able to detect the nature of the equations, perform symbolic manipulations of the equations, and transform them into a domainspecific model. We describe the motivation for such a system, its main features, and a prototype environment together with a usage example.
Mathematical Software: Past, Present, and Future
 Math. Comput. Simulation
, 1999
"... This paper provides some reflections on the field of mathematical software on the occasion of John Rice's 65th birthday. I describe some of the common themes of research in this field and recall some significant events in its evolution. Finally, I raise a number of issues that are of concern to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper provides some reflections on the field of mathematical software on the occasion of John Rice's 65th birthday. I describe some of the common themes of research in this field and recall some significant events in its evolution. Finally, I raise a number of issues that are of concern to future developments.
AUTOMATING THE SELECTION OF NUMERICAL SOLVERS
"... Abstract. Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive mathematical background and deeper knowledge in numerical analysis. In this paper we present the design of an exten ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive mathematical background and deeper knowledge in numerical analysis. In this paper we present the design of an extensible simulation and decision framework for selecting numerical solvers, called ModSimPack. Starting from a declarative description of the equation system that need to be solved, our system is able to detect the nature of the equations, perform symbolic manipulations of the equation, automatically select a numerical solver, and emit procedural simulation code that calls the selected solver. We describe the motivation for such a system, its main features, and a prototype environment together with several usage examples. 1.
The Collected Algorithms of the ACM
, 2008
"... The Collected Algorithms of the ACM (CALGO) is now the longest running journalpublished series of algorithms. After placing CALGO in the context of other journal algorithm series, we discuss the factors that we believe have made CALGO the well respected means of publishing mathematical software that ..."
Abstract
 Add to MetaCart
(Show Context)
The Collected Algorithms of the ACM (CALGO) is now the longest running journalpublished series of algorithms. After placing CALGO in the context of other journal algorithm series, we discuss the factors that we believe have made CALGO the well respected means of publishing mathematical software that it is today. We report on how moving with the times and technology has ensured the survival of CALGO, and we look briefly at how we may continue this in the near future.
Software Supporting Optimal Experimental Design: A Case Study of Binary Diffusion Using EFCOSS
"... Methods for optimal experimental design aim at minimizing uncertainty in parameter estimation problems. Despite their long tradition in applied mathematics and importance in practical applications, they are currently not widely used in computational science and engineering. To make the techniques ..."
Abstract
 Add to MetaCart
(Show Context)
Methods for optimal experimental design aim at minimizing uncertainty in parameter estimation problems. Despite their long tradition in applied mathematics and importance in practical applications, they are currently not widely used in computational science and engineering. To make the techniques of optimal experimental design more accessible to a broader community, we introduce a novel software environment called EFCOSS and demonstrate its ease of use and versatility in two case studies of binary diffusion experiments. Through the use of a componentbased software architecture, integration of automatic differentiation technology and facilitated interfacing to optimization algorithms, EFCOSS minimizes the computational overhead for the user who can thus focus on model development and analysis itself. The presented case studies focus on diffusion experiments in liquids since these experiments are typically very demanding. The use of optimal experimental design techniques allows to reduce experimental time and effort significantly. Key words: optimal experimental design, parameter estimation, EFCOSS,