ppxscal/embedding_network huggingface dataset:
A procedure for designing abstract interfaces for device interface modules
Authors: Kathryn Heninger Britton, R. Alan Parker, David L. Parnas
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes the abstract interface principle and shows how it can be applied in the design of device interface modules. The purpose of this principle is to reduce maintenance costs for embedded real-time software by facilitating the adaptation of the software to altered hardware interfaces. This principle has been applied in the Naval Research Laboratory's redesign of the flight software for the Navy's A-7 aircraft. This paper discusses a design approach based on the abstract interface principle and presents solutions to interesting problems encountered in the A-7 re-design. The specification document for the A-7 device interface modules is available on request; it provides a fully worked out example of the design approach discussed in this paper.
Simulation analysis of marine terminal investments
Authors: David W. Graff
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A common problem in the oil industry is the optimization of terminal facilities to minimize delays in servicing incoming tankers. In Exxon Corporation, simulation has been successfully applied to marine terminal studies since the early nineteen sixties. The development of a general model in 1967 contributed to wider use of marine terminal simulation throughout the company. This paper discusses the marine terminal investment problem, the basic technical features of this model, and a typical application of the model.
Simulation of computer systems using automatically generated load descriptions
Authors: Herbert D. Schwetman
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

A complete description of a computer system must include three groups of components: 1. The hardware components 2. The software components (the operating system), and 3. The load components (the stream of tasks to be processed). When computer systems are simulated all of these components are found as features of the simulations. The hardware normally appears as a collection of tables and associated operational data. The operating system appears both as tables and as scheduling or assignment algorithms. The load is represented either as a sequence of requests for service (use of system resources) or as a set of functions which can generate such a sequence of requests. In many applications, the description of the load turns out to be the most difficult task. This paper discusses some techniques and procedures which have been used to automatically generate the required load descriptions. The emphasis is on a request sequence generator which uses data found in a system event trace. One such technique, called trace-driven modeling, has been implemented at the Purdue University Computing Center. This implementation is discussed and its usefulness and accuracy are illustrated with actual data.
How to assemble tree machines (Extended Abstract)
Authors: Sandeep N. Bhatt, Charles E. Leiserson
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Many researchers have proposed that ensembles of processing elements be organized as trees. This paper explores how large tree machines may be assembled efficiently from smaller components. A principal constraint that we consider is the limited number of external connections from an integrated circuit chip. We also explore the emerging capability of restructurable VLSI which allows a chip to be customized after fabrication. We give a linear-area chip of m processors and only four off-chip connections which can be used as the sole building block to construct an arbitrarily large complete binary tree. We also present a restructurable linear-area layout of m processors with O(lg m) pins that can realize an arbitrary binary tree. This layout is based on a solution to the graph-theoretic problem: Given a tree in which each vertex is either black or white, determine how many edges need be cut in order to bisect the tree into equal-size components, each containing exactly half the black and half the white vertices.
Semantic preprocessing
Authors: Paul B. Schneck
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Many preprocessor systems exist to transform a program from an augmented language to the particular language expected by a processor. Historically these have been capable of only simple lexical or syntactic substitutions (macro processors). This paper discusses the potential of semantic preprocessing&mdash;where the function of a program is &ldquo;understood&rdquo; as a basis for transformation&mdash;and describes experiments with a prototype system.
Design aids for the simulation of bipolar gate arrays
Authors: P. Kozak, A. K. Bose, A. Gupta
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a system of design aids which are used in the modeling and simulation of bipolar gate arrays for applications where the delays cannot be neglected. Prewired function blocks composed of circuit elements such as transistors, resistors, diodes, etc. are automatically converted to logic gate descriptions. The transistor level model of a function block is analyzed with a circuit simulation program to obtain delay values for the gate level model. The gate equivalent circuits and the delay values produced by these methods provide accurate digital simulation of bipolar gate arrays.
A system to improve incorrect programs
Authors: Harald Wertz
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper presents a system (PHENARETE) which understands and improves incompletely defined LISP programs, such as those written by students beginning to program in LISP. This system takes, as input, the program without any additional information. In order to understand the program, the system meta-evaluates it, using a library of pragmatic rules, describing the construction and correction of general program constructs, and a set of specialists, describing the syntax and semantics of the standard LISP functions. The system can use its understanding of the program to detect errors in it, to eliminate them and, eventually, to justify its proposed modifications. This paper gives a brief survey of the working of the system, emphasizing some commented examples.
An experiment in program restructuring for performance enhancement
Authors: Domenico Ferrari, Edwin Lau
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

An experiment intended to determine the influence of the input data on the performance improvements resulting from program restructuring is described. This influence is found to be non-significant for the particular program, memory policy, restructuring procedure and inputs considered in the experiment. It is speculated that such a conclusion is likely to have much more general validity.
Business and management data processing II: A multi-variant generalized sort program employing auxiliary drum storage
Authors: J. H. Nichols, A. Tiedrich
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

PRIOR TO DESCRIBING the details of a generalized sort program, it is first necessary to discuss the objectives and organization of such a program so as to minimize the semantics which usually arise in a discussion of any aspect of the data processing art. A sort is a computer program which arranges data records (or messages) into a sequence in accordance with keys (or criteria) contained within the record. A generalized sort must be provided with information which includes the record length, the location of keys within the record and other information which is dependent upon the user's requirements. I n operation, it passes through two phases: One in which it analyzes the user provided in formation and modifies the generalized skeletal sort program which is independent of the data to be sorted; the second in which the modified skeleton performs its specialized sorting function. The first phase is in reality a sort generator that analyzes parameters, generates constants, and builds complete routines for insertion into the skeleton. It is truly a generator because it will provide a copy of the modified/ generated sort program which may at any subsequent time be independently operated on sets of data identical in format to that specified to the generator. The sort to be discussed in this paper may be operated as either a generalized sort, i.e., both phases run successively, or as a sort generator.
Simulation of institutional behavior in a national networking environment
Authors: Norman R. Nielsen, Ronald Segal
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Computer networking is often mentioned as being an attractive means for bringing a varied and economical mix of computing services to the nation's researchers. Technically, a national network linking major universities and research institutions is feasible today; however, the economic, political, and organizational implications of such a network have not been established. To this end a computer simulation model has been constructed to permit investigation of the behavioral rather than the technical aspects of such a national network. Data for the study is being provided by 18 participating institutions around the country, permitting a realistic representation of the variety of capabilities, requirements, policies, and decision rules that exist at such institutions. The design goals and the operational characteristics of this network model are described in the first portion of the paper. Using the simulation model, eleven areas of investigation pertaining to network performance and behavior have been identified. Five of these topic areas (standard performance, site specialization, network stability, network resource-sharing potential, and service pricing policies) are particularly relevant to questions of institutional behavior and impact and have been the subject of a pilot program of experimentation. The organization of these preliminary investigations and the experimental findings obtained to date are discussed in the last portion of the paper.
A performance study of a Network Front End
Authors: Susan S. Poh, Paul D. Stoneburner, David C. Wood
Venue: Proceedings of the sixth symposium on Data communications (1979)

A Network Front End (NFE) is a mini-computer which is used to connect a host computer to the communicating network. The purpose of using an NFE, as contrasted to connecting the host computer directly to the network, is to reduce the processing load imparted to the host computer by the network interfacing software. This paper presents a comparative evaluation of the NFE attachment method in relation to the host direct connection method. The comparative evaluation addressed two major areas: the impact on the host of the network interface software and end-to-end network performance. Various evaluation experiments were conducted, the results of which indicate that the NFE is a promising alternative to host direct connection in terms of performance in the WWMCCS Intercomputer Network (WIN). In addition, the NFE also has the capability to satisfy the standardized high capacity host-AUTODIN II interface requirement and to provide other features, such as direct terminal to network connection and network security, not available in the WIN architecture. It is recommended that refinement of the NFE and further development be continued.
Consulting forms and how to get them filled out
Authors: Margaret Baker
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

In an attempt to find the better ways of motivating consultants to fill out consulting forms, we have collected a number of different forms and information about what is actually done with the data. These different approaches will be discussed and we will try to isolate the features that seem to lead to successful documentation of consultation.
Iteration theorems for LL(k) languages (Extended Abstract)
Authors: John C. Beatty
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

The classical pumping lemma [BP S] and Ogden's lemma [Og] are among the most powerful tools we possess for proving that languages are not context-free. Hence one goal of recent research has been to obtain analogous theorems for subclasses of the context-free languages. We establish here a property of LL(k) derivation trees which is analogous to the left part property for strict deterministic grammars[H H]. We show that our property characterizes LL(k) grammars and use it to establish two iteration theorems for the LL languages. These theorems, in turn, enable us to prove simply and rigorously that a variety of LR languages are not LL. In particular, the &ldquo;dangling&rdquo; Algol 60 IF-THEN-ELSE construct allowed in Pascal and PL/1 cannot be generated by an LL(k) grammar.
The dynamics of the human resource
Authors: Bruce H. Wrigley
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

In today's business environment the manager in the data processing industry is faced with three major personnel problems: failure to acquire, failure to utilize, and failure to retain. Employee potential remains untapped due to our inability to utilize resources; we find it increasingly difficult to attract quality employees, and the technical personnel in whom we have accumulated sizable investment through long training periods at high salaries, continue to turn over at a high rate. An investigation of the internal psychodynamics of a data processing organization has been conducted in an attempt to shed light on at least one aspect of these employer/employee relationships. Although the current analytical method is somewhat primitive, the potential for a technique of organizational analysis is apparent. The original study, from which this report is extracted, included an extensive presentation of a theory of psychological structures currently being proposed by Dr. Clare W. Graves of Union College. This, and a section of the study cross-referencing the Gravesian theory with other works, is presented here in only brief form to provide context. As a practical test and application of Gravesian theory and psychological testing instrument was designed and applied to employees in a data processing organization. The development and application of the instrument is discussed. Interesting results are shown in several comparative groupings: age, job type, sex, length of service, and employment termination.
A quantitative assessment of IBM's programming productivity techniques
Authors: Linda C. Jones, David A. Nelson
Venue: Proceedings of the 13th Design Automation Conference (1976)

Much interest is being shown in reducing program development costs and increasing program reliability. The large number of potential applications which are still not computerized attests to user dissatisfaction with the high cost of developing and maintaining software. These unimplemented applications form a backlog which is slowing the growth of computerization. (A recent survey showed that many mature user installations are facing a three-year applications backlog.) These problems beg for a solution. This paper briefly describes the most popular short-term solution for these problems: the so-called IBM programming productivity techniques. These techniques include the Chief Programmer Team approach to programming project organization, top-down development, structured coding and interactive programming. Next, the paper describes several independent attempts to measure the effectiveness of these programmer productivity techniques in reducing costs and increasing reliability. Difficulties encountered in these attempts are discussed, and the quantitative results of these 'experiments are interpreted. Then an expected improvement factor is established for use in estimating the cost impact of adopting these techniques. Finally, the long-term role of these techniques in reducing the applications backlog is projected.
A questionnaire
Authors: Anthony P. Lucido
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

Comments from the editors To determine the current status of some of the work being done by our readers I have put together a questionnaire. The questionnaire itself will be found following this short note. I would appreciate hearing from all persons currently doing some work in the area of computer graphics, or from anyone wishing to contribute information on a system in use. I will try to put all responses together (assuming someone out there responds) and summarize what is being done, as indicated by the returned questionnaires.
Numerical analysis II: Numerical analysis of two generalized elliptic integrals
Authors: D. W. C. Shen, M. L. El-Sabbagh
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

Numerical Analysis of Two Generalized Elliptic Integrals
A tool designed to facilitate structured programming
Authors: Herman D. Hughes
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

An algorithmic language interpreter is presented which provides users of various technical backgrounds a convenient way to describe algorithms and simultaneously focus on problem-solving concepts: problem analysis, algorithm development, and the computer implementation of the algorithm. The interpreter permits the use of decision tables as a means of expressing complex logic. In view of the significance of structured programming in today's environment (and that of the future), the language processor allows three logical constructs: sequential, IF... THEN...ELSE..., and the DO WHILE construct. The use of GO TOs is only allowed to transfer control from one table to another. Hence, several tables/subtables (each may contain 1 decision table) may be required for the description of an algorithm. Examples are presented to illustrate how the language interpreter enhances programming organization and thereby facilitates structured programming.
Microarchitecture description techniques
Authors: John L. Gieser, Robert J. Sheraga
Venue: ACM SIGMICRO Newsletter (1982)

A procedure is outlined for describing the microarchitecture of a horizontal processor such that a retargetable Microprogram Compiler System can incorporate the description to generate microcode for that processor. The microarchitecture description methodology is an organized approach to defining a machine's microinstruction formats, fields, and microorders; its hardware elements; its microoperation usage rules; and its behavioral rules. To a large extent, the description procedure can be performed interactively. The link between the microarchitecture description and the microprogram compiler, termed the instruction set interpretation mechanism, is also described. Preliminary application of the microarchitecture description methodology to several real processors has shown that, despite some problems, the procedure shows promise for significantly reducing the time required to retarget a microprogram compiler.
Collection, analysis, and presentation of computing resource usage and demand data in the academic environment
Authors: Margaret P. Mize
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

&ldquo;Academic computing is a black hole and we will not fall into it.&rdquo; This statement by a university chancellor unfortunately represents the opinion held by many in higher education upper management. Furthermore, it is an opinion often expressed by many of those outside the campus community who understand little about academic computing yet exercise approval authority over acquisitions or budgeting. Managers of computing resources in academic environments are often charged with the responsibility of justifying changes in hardware, software, and support personnel. Traditional methods used in the business world such as Return On Investment or break-even analysis are often inappropriate to the academic institution. In addition, the advent of more complex computing environments such as distributed processing and the widespread use of microcomputers make previously used methods such as saturation point analysis unusable as well. Add to these problems the increasing number of bureaucrats looking over our shoulders to insure that computing expenditures are kept within reasonable bounds, and the frustration felt by many in the field of academic computing becomes understandable. Survival in the current environment requires us to reevaluate many of our traditional tools and procedures. We may be required to make drastic changes in services offered, delivery systems, or training methods to match the changes in types and uses of equipment as well as our changing audience of users. To accomplish this, we must have solid, defendable data upon which to base and defend our decisions or requests. The collection and analysis of data about computing resource use and demand must be a carefully planned, continuing activity. Methods of presentation must be well researched and prepared for the appropriate audience. This paper presents guidelines to assist in the identification of data which should be collected, collection methods, statistical and other analytical techniques, and techniques for the development and delivery of effective presentations.
Sequential Prolog machine: Image and host architectures
Authors: Evan Tick
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

A modified version of D. Warren's sequential Prolog machine architecture is described. Data and instruction formats are given. A microcoded host architecture is also described, with formats and examples presented.
Editing requirements for data base applications and their implementation on the INDY backend kernel
Authors: Allen J. Otis, George P. Copeland
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

An extrapolation of user and hardware cost trends indicate that future systems should provide more complete functionality, simplicity of use, and reliability by increasing the amount of hardware present in the system. For data base systems, this can be done by providing very high level data languages and by implementing them directly in hardware. These goals are realized with a simple hardware arrangement called INDY, which uses inexpensive memory technologies (such as charge coupled devices, magnetic bubbles, or discs). This paper first discusses the data definition and editing requirements of data languages. Then the implementation of these requirements on the INDY backend kernel is described. Finally, a comparison is made of the various memory technologies for suitability to INDY.