Showing papers on "Software portability published in 1974"

The use of ATOPSS for presenting elementary operating system concepts

Abstract: ATOPSS (Adage Tutorial Operating System Simulator) was designed to provide both a learning tool and a teaching aid for the presentation of elementary operating system concepts to graduate or advanced undergraduate computer science students. As a real learning tool, the simulator itself offers real time interaction and observation of a parametric, discrete time event oriented operating system. For a teaching aid, a series of short movies has been produced using ATOPSS solely as its basis, demonstrating both the use of the simulator and the different concepts it portrays. These movies thus offer the portability necessary for in-classroom presentation and provide a basis for further discussion.

Name standardization and value specification for machine dependent constants

Abstract: There are a number of factors which limit the ease of transfer of mathematical software from one computer sytem to another. For FORTRAN implementations of mathematical and statistical algorithms, a primary portability problem is caused by necessary variation in machine dependent constants. The problem occurs for both decimal and machine-specific representations. Redish and Ward (1971) discuss the problem, and propose a solution. This note extends their ideas to additional constants and computer types.

Software Portability via an Intermediate Language

Abstract: ion provides: Primitive operands. Objects which have no structure which can be described within this level of abstraction. Primitive o~erators ,. Transformations which cannot be decomposed into a sequence of actions within this level of abstraction. Formation rules. Mechanisms used to create structured operands and operators. When a problem solution is expressed as an algorithm at a given level of abstraction, we have two choices: translation (or modellin@) and interpretation. Translation converts the given algorithm to an equivalent algorithm at a different level of abstraction. (The term modellin@ usually connotes some creativity on the part of the translator, while translation is a more mechanical process.) An algorithm to solve our differential equation, for example, might be stated in terms of a mathematical function which is then translated to a Fortran program. The primitive concepts provided by this new level include approximations to real numbers, arithmetic operators and certain predicates. Formation rules are available for declaration of objects, creation of arrays and sequencing of operations. Interpretation is the process of applying an algorithm to obtain results. Primitive operations of the given level are carried out directly upon the primitive operands by an interpreter. For example, the hardware of a particular computer is the interpreter of its machine language. An algorithm may be interpreted at any level of abstraction if a suitable device is available to carry out the primitive operations. I call such a device the abstract machine for the

System for efficient program portability

Abstract: The acquisition of major Automatic Data Processing Equipment (ADPE) systems in the Department of the Navy is accomplished by either single source acquisition or competitive selection. In the case of the single source acquisition, only one vendor is considered as having the system capable of satisfying the needs of the procuring organization. The criteria which must be satisfied for a single source acquisition include the need for unique hardware, excessive conversion/reprogramming cost and/or time, etc. The competitive selection, on the other hand, is open to any vendor who feels he can provide a system meeting the requirements specified in the solicitation document associated with that procurement.

A syntax-directed approach to inverse compilation

Abstract: A general syntax-directed strategy is described for translating computer programs written in a machine-level source language into equivalent programs in a higher-level target language. This translation process is referred to as decompilation or inverse compilation. Work on decompilation is potentially applicable in such areas as software portability, source-level debugging and diagnostic systems, and program analysis and validation.

An example of a pragmatic approach to portable interactive graphics

Abstract: Standards for graphics subroutines would encourage the coding of portable programs using graphics However such standards do not yet exist In this paper a small set of generally available primitive subroutines, and FORTRAN, are used to pragmatically provide a degree of portability for a second level graphics package This package consists of only nine subroutines and yet provides considerable power for coding interactive graphical numerically oriented programs

On improving operating system efficency through use of a microprogrammed, low-level environment

Abstract: This paper concerns the measurement of possible gains to be made in efficiency of an operating system by implementing a selected subset of its basic modules in firmware. The subject of our measurement is a skeletal minicomputer operating system designed with modularity, adaptability, and portability in mind. The base system consists of a call support processor providing dynamic binding of procedures and a set of resource management and interprocess communication primitives.One of the major objectives in the design of our base system is to develop criterin for selecting from among its primitives, currently implemented in software, those that, may be suitable for later implementation in firmware.

Operating Systems with Characteristics of Portability for Minicomputers

Abstract: The purpose of this work is to delineate a technique of defining managing software, in the direction of multiprogrammed minicomputers, ca pable of distinguishing this software from the hardware on which it will operate and easily adaptable to various operative conditions.