ppxscal/embedding_network huggingface dataset:
Automatic routing of double layer gate arrays using a moving cursor
Authors: B D Prazic, M A Bozier
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper presents an efficient algorithm for routing of the interconnections on a large gate array layout. The algorithm employs a vertical cursor strip that traverses the chip in a single pass, laying horizontal segments in its wake on one layer, and vertical segments within the cursor itself, generally on the other layer. The routing algorithm presented here was developed as part of the UK5000 design automation system for large gate arrays and was written in standard FORTRAN 77. Routing results are presented for two gate array layouts.
Software Manufacturing
Authors: L. Bernstein, C. M. Yuhas
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper suggests a unique method of organizing and staffing for the production of deliverable computer-based systems which takes advantage of assembly-line techniques. Although these production activities are common to most projects, Software Manufacturing is defined here as an inline, rather than support, function requiring special skills. A system development cycle is described, detailing the Software Manufacturing tasks with considerations for introducing this functions into existing development efforts. This organizational approach is concluded to lead to systematizing the production of software, to opening career opportunities for technician and production level people, and to better managed product development.
Performance analysis of high-speed digital buses for multiprocessing systems
Authors: W. L. Bain,  Jr., S. R. Ahuja
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Current multiprocessing systems are often organized by connecting several devices with similar characteristics (usually processors) to a common bus. These devices present access with minimal delay; access is controlled by the bus arbitration algorithm. This paper presents a probabilistic analysis of several arbitration algorithms according to several criteria that reflect their relative performances in (1) rendering equal service to all competing devices and (2) allocating available bus bandwidth efficiently. The sensitivity of these criteria to the number of devices on the bus, the speed of the bus, and the distribution of interrequest times is considered. A probabilistic model for the quantitative comparison of these algorithms is constructed in which multiple devices repeatedly issue bus requests at random intervals according to an arbitrary distribution function and are serviced according to one of the algorithms; the devices do not buffer bus requests. The algorithms studied include the static priority, fixed time slice (FTS), two dynamic priority, and first-come, first-served (FCFS) schemes. The performance measures are computed by simulation. The analysis reveals that under heavy bus loads, the dynamic priority and FCFS algorithms offer significantly better performances by these measures than do the static priority and FTS schemes.
On the formulation of normal pushdown acceptors
Authors: Y. R. Wang
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In the course of studying context-free languages, work has been done toward the construction of push-down acceptors.1 The motivation of constructing a pushdown acceptor for a specified context-free language is twofold; to decide whether a given string belongs to this language and to facilitate the syntactic analysis of this language. A pushdown store acceptor is, in a general sense, a finite automaton with exactly one pushdown store of potentially infinite depth. There can be many ways to formalize pushdown acceptors.2 The main concern is then to find an efficient pushdown acceptor model. A pushdown acceptor model is considered to be efficient in the following two aspects; it should be simple and clear in its structure and operation, it should be an effective tool for syntactic analysis of its corresponding context-free language.
A comparison of two recent approaches to machine parameterization for mathematical software
Authors: Brian T. Smith
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

Recently, there have been published two different proposals for expressing the dependence of numerical software on the environment. One proposal, which is essentially described in two papers [1,2]** characterizes the dependence of the software on the machine architecture essentially in terms of the representation of floating point entities in the machine. The second, more recent proposal, described in [3] characterizes the dependence of the software on the environment in terms of models both the floating point numbers and of the behavior of the arithmetic unit of the machine. The purpose of this paper is to expose and clarify the differences and similarities between these two approaches. It is the author's opinion that the two approaches interpreted in their strictest sense serve two distinct purposes. When each is interpreted imprecisely, their roles overlap. In order that the comparisons briefly discussed below are fully understood, we need to briefly summarize the separate approaches. Since our interest here is in the parameterization of the numerical aspects of the environment, the non-numerical parameters discussed in [1] and the considerations of implementation discussed in [2,3] will not be considered here.
Articulation of computer science curricula at the community colleges and the universities
Authors: James E. Brandeberry, B. Albert Friedman
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

An example of a solution to the problem of a student majoring in Computer Science/Data Processing at a Community College transferring to a university and continuing his degree program will be presented. Audience participation will be encouraged.
Automatic generation of efficient evaluators for attribute grammars
Authors: Ken Kennedy, Scott K. Warren
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

The translation process may be divided into a syntactic phase and a semantic phase. Context-free grammars can be used to describe the set of syntactically correct source texts in a formal yet intuitively appealing way, and many techniques are now known for automatically constructing parsers from given CF grammars. Knuth's attribute grammars offer the prospect of similarly automating the implementation of the semantic phase. An attribute grammar is an ordinary CF grammar extended to specify the &ldquo;meaning&rdquo; of each string in the language. Each grammar symbol has an associated set of &ldquo;attributes:&rdquo;, and each production rule is provided with corresponding semantic rules expressing the relationships between the attributes of symbols in the production. To find the meaning of a string, first we find its parse tree and then we determine the values of all the attributes of symbols in the tree.
Distributed programming languages
Authors: Gregory R. Andrews
Venue: Proceedings of the ACM '82 conference (1982)

In response to the increasing interest in distributed systems, several high-level distributed programming languages have recently been developed. These languages contain message-passing based mechanisms for process interaction and support the execution of programs on distributed processors. This paper discusses the major concepts and design issues, describes the alternative language mechanisms, and compares the different languages.
Developing an aggregated survey/macro-economic database for statistical and graphical social science applications
Authors: Michael B. Zartman, Christopher J. Gordon
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The Survey Research Center at The University of Michigan has routinely conducted surveys of consumer attitudes since 1946. The May 1981 survey is the 152nd in this series which provides regular assessments of consumer attitudes and expectations. The surveys are designed to explore why changes in consumer attitudes and expectations occur, and how these changes influence consumer spending and saving decisions. A major research objective of the project is to use this collected data to evaluate economic trends and prospects.Each survey contains "standard" questions asked at regular intervals, many of which have been included from the project's inception. The aggregated results of these surveys provide a wealth of time-series data with the potential to be an important factor in forecasting consumer behavior. The "standard" questions themselves can be disseminated into approximately 190 separate data series (including index transformations). When "nonstandard" (or non-core) questions are included, this total jumps considerably. With such a large number of data variables, many different areas of analysis are available to be researched. When the many macro-economic data series (e.g., Federal Reserve, Census, or Retail Sales data) are added to this compilation, the data management problems increase. The research results which could be achieved, then, are directly related to the development of a flexible method of data storage and retrieval.
History of LISP
Authors: John McCarthy
Venue: ACM SIGPLAN Notices (1978)

This paper concentrates on the development of the basic ideas and distinguishes two periods - Summer 1958 through Summer 1958 when most of the key ideas were developed (some of which were implemented in the FORTRAN based FLPL), and Fall 1958 through 1962 when the programming language was implemented and applied to problems of artificial intelligence. After 1962, the development of LISP became multi-stranded, and different ideas were pursued in different places.
Simulation model management: Resolving the technological gaps
Authors: Richard E. Nance, Ahmed L. Mezaache, C. Michael Overstreet
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Model management poses requirements and responsibilities that extend throughout the life cycle of a simulation model. Recent publications have identified major problems in cost and time overruns, which are traceable to deficiencies in project and sponsor management. Beginning with the division of the simulation model life cycle into seven phases, we define &ldquo;model management&rdquo; and develop the requirements for a Model Management System (MMS). The functional description of a MMS focuses on those phases that jointly characterize the model development effort. Recent research in simulation model development is described, and particular emphasis is given to the approach taken with the Conical Methodology.
Channel analysis for the IBM 7090
Authors: Bernard Roth
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This paper is primarily concerned with the IBM 7090 and the technique by which optimum performance can be attained through the proper balance of input/output channels. However, it should be possible to apply channel analysis to the present generation of computers with facilities for parallel input/output operation and computations. It is assumed that the reader is familiar with the hardware and relationship of channels or tape stations with input and output and some knowledge of the function of parallel input/output and computation. The 7090 presently in use at General Electric's Missile and Space Vehicle Department is a two-channel unit with six tape drives on each channel. A maximum of 10 tape drives associated with any one channel and up to 8 channels are available with the 7090.
A human simulation validation of a telephone loop network simulation model
Authors: H. T. Freedman, T. R. Harms, W. L.G. Koontz
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

A computer simulation model was built to study various strategies for the assignment of telephone loop network facilities to customers. Results of this analysis are presented along with a novel approach to validate the analysis - simulating the simulation model with real data and real assignment personnel.
Moving a D.A. system from development to production (Position Paper)
Authors: W. G. Magnuson,  Jr.
Venue: Proceedings of the 16th Design Automation Conference (1979)

The problems of moving a design automation system from the development phase to the production usage are always numerous, varied, and continuing. Lawrence Livermore Laboratory is a research laboratory, and design automation supports engineering design and fabrication in a slightly different fashion than for a high-volume commercial shop. Jobs are characterized by being quite varied in requirements, requiring fast turnaround, having very low production quantities, having few design constraints, and, in general, place the requirement on the DA system to be very flexible and at the same time to be responsive to requests made on the system by the users. Yet, the problems of making a DA system production ready in the above situation is probably very similar to the problems encountered in other environments. In the following, I will describe some of the difficulties we have faced in the past year in moving a printed circuit board layout DA system from a research and development stage to a production usage.
Generalized information system&mdash;a tool for design automation
Authors: P. Semple,  Jr.
Venue: Proceedings of the 4th Design Automation Conference (1967)

In 1964, an article appeared in Product Engineering with the challenging title, &ldquo;Are You Ready For Computer-Aided Design?&rdquo; In this article, the author suggested that computers might become &ldquo;design assistants&rdquo; in each of the five design functions of mathematics, analysis checking, logic and graphics. Expanding on each of these functions briefly, typical mathematical problems cited were the solution of multiple sets of simultaneous equations occurring in stress, least squares, or circuit analysis. As the author, Mr. Holstein stated, however, most engineering problems do not lend themselves to straightforward computation. For this larger second category, the design engineer must develop an analytical solution which can both approximate the actual problem and can also be computed. Once the design emerges, it must be converted into engineering sketches which are both reproducible, yet easily modified as the inevitable revision cycle assumes control. Today, however, let us place particular emphasis upon the remaining design functions, the two areas of design logic and graphics.
The System Simulators - a modular approach to systems modeling
Authors: H. F. Hertel, R. A. Merikallio
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

As computing systems and their applications become progressively more complex, the prediction of the performance of a proposed computer system or the effects of changes to an existing system likewise becomes more difficult. Fortunately there has been steady growth in performance evaluation technology to meet these expanding systems analysis requirements. The most desirable predictive tools continue to be analytical mathematical models which usually provide a comprehensive theoretical understanding of system behavior and are economical to operate. However many complex systems resist definition in analytical terms. Performance prediction for these systems is usually attempted through the use of imitative discrete simulation models. Simulative systems modeling can, however, be costly in man time, computer time, and elapsed time. Unless techniques such as those described in this paper are used the cost may be high enough to preclude in-depth modeling for any but the very largest systems. Even with sufficient budget, the elapsed time for systems modeling could be too great for system proposal efforts, where analysis is most needed but time is critical due to proposal deadlines.
Social aspects and responsibilities (A Panel Session): Computer investigations of intention to attack
Authors: E. C. Berkeley
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

ONE OF THE SOCIALLY important questions which can be studied with aid from computers is the question: &ldquo;Is any country really preparing to attack any other country?&rdquo; In other words, is it possible, using computers, to distinguish between the absence and the presence of intention to attack, committing obvious and flagrant aggression?
Alternative teaching strategy for an introductory computer language course
Authors: Asad Khailany
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

Many consider that the best strategy to teach an introductory computer language course is to start programming very early in the semester. This paper discusses the drawbacks of such a strategy and presents an alternative way to teach such a course. Based on experiments the alternative strategy appears to be more effective. The advantages and outline of the alternative strategy are discussed. Furthermore, the course outline to teach a FORTRAN language based on the alternative strategy is presented.
Minimal GKS
Authors: Randall W. Simons
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

Minimal GKS is a subset of the Draft International Standard Graphical Kernel System. Minimal GKS has been implemented at Sandia in the programming language C. This implementation confirms that Minimal GKS does indeed have the anticipated advantages of easy implementation and small size. Experience in using this implementation has also demonstrated that Minimal GKS is easy to learn and use, yet is powerful enough for non-trivial, real-world applications.
Documentation in the computer age: Control and audit implications
Authors: J. Jose Cortez
Venue: Proceedings of the ACM 1980 annual conference (1980)

Over the past two decades, proportionally more and more of the corporation's information assets have been entered, processed, stored, and retrieved through EDP facilities. Today the new developments in data entry technology and the growing acceptance of distributive computing methodology are placing more EDP power in the hands of the end-user. As business operations become more dependent upon supportive EDP systems, the internal auditor has to focus more attention on the audit of the EDP system itself. The ability to independently evaluate a system can come only from knowledge of the system. It is for this reason that in an audit engagement involving computerized systems, the internal auditor should begin with a review of available system documentation.
Processing PDP-11 files into IBM file structures
Authors: R. H. Strand, M. P. Farrell
Venue: Proceedings of the ACM 1980 annual conference (1980)

This report summarizes the techniques and procedures used to handle automated data collected at the University of Minnesota-Duluth (UMD) campus coal gasification facility. This facility, which is partially funded by the Department of Energy, is being evaluated by scientists at Oak Ridge National Laboratory (ORNL) for its potential health and environmental effects. Automatic data collections and manually collected and sample results data are used for this assessment. A data management project at ORNL handles these and other UMD data for the Gasifiers in Industry Program (GIIP). Specifically, this report documents the procedures developed within the data management project for handling two categories of automated data: (1) process and (2) environmental. The examples included use actual data from the first one and a half years of gasifier operation.
Partitioning logic circuits to maximize fault resolution
Authors: Ayee Goundan, John P. Hayes
Venue: Proceedings of the 13th Design Automation Conference (1976)

Two techniques are discussed for partitioning logic circuits to maximize the resolution of stuck-line faults. One technique exploits the inherent fault resolution of the circuit by attempting to force equivalent faults into the same module. The other involves inserting control points to separate members of equivalent fault classes, a technique called fault class splitting. Some new methods for identifying equivalent faults are also presented.
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers
Authors: C. V. Ramamoorthy
Venue: Proceedings of the 1966 21st national conference (1966)

Since the computer operation when viewed as the execution of subroutines or instructions or logical subcommands is a discrete sequential process, its action or behavior can be predicted to a degree of certainty when sufficient knowledge is available about the structure of its information flow. Conventionally, the &ldquo;look-ahead&rdquo; function implies fetching the next set of instructions and their associated data and preparing ahead of time for their execution. We shall, however, broaden the concept to the anticipation of the next &ldquo;event&rdquo; of a specified type whether it is a functional subroutine, instruction or an input-output function. In some sense, one can consider &ldquo;looking-ahead&rdquo; as the anticipatory simulation of important events in the execution sequence. By anticipating the most probable events, their requirements can be preplanned and furnished, if possible, without stalling the program, e.g., by alerting I/O units, by providing memory space for the next set of subroutines to be executed, etc. This is particularly important in a multi-programmed, multi-processor environment
Multiprogramming for real-time applications
Authors: H. M. Gladney, G. Hochweller
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A software system supporting multiple event-driven processes concurrently on a small process control computer is described. Each application can be programmed and tested independently. An implementation of the system, called LABS/7, has been productive for over three years. The limits to which real-time multiprogramming may be pushed are explored.
On the relationship between virtual machines and emulators
Authors: Efrem G. Mallach
Venue: Proceedings of the workshop on virtual computer systems (1973)

The subjects of virtual machines and emulators have been treated as entirely separate. The purpose of this paper is to show that they have much in common. Not only do the usual implementations have many shared characteristics, but this commonality extends to the theoretical concepts on which they are based; the concepts of memory mapping and I/O operation simulation are discussed to emphasize this. The paper then discusses structural issues, and points out why the question of instruction set is becoming less valid as a point of distinction between the concepts. Possible combinations of virtual machines and emulators are discussed. In conclusion, it is recommended that workers in both fields keep the relationship between the two in mind.