ppxscal/embedding_network huggingface dataset:
A study of interleaved memory systems by trace driven simulation
Authors: Fred W. Terman
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

A model of interleaved memory systems for IBM System/360 and System/370 architecture has been investigated by means of a trace driven simulation. The model used is an extension of one due to G. J. Burnett and E. G. Coffman, Jr. The trace data to drive the simulation was obtained from instruction-by-instruction traces of typical IBM 360/370 programs and of the OS/VS2 operating system. The predictions of the Burnett-Coffman model are found to fit well with the simulation results for the fetching of instructions. For the fetching of operands, however, the simulation results show only about half the increase in the memory bandwidth that the Burnett-Coffman analysis predicts. This indicates that data references on the IBM 360/370 are not random in the way assumed by Burnett and Coffman. In fact, repetitive references to the same memory location occur often enough to limit the memory bandwidth increase which can be obtained by interleaving.
Amoeba: A symbolic VLSI layout system
Authors: Mikhail Lotvin, Belinda Juran, Reeni Goldin
Venue: Proceedings of the 21st Design Automation Conference (1984)

Amoeba is an auto-interactive system which provides the chip designer with a powerful tool for cell layout. The system contains both interactive graphics tools, which give the user a great deal of control over the layout process, and highly automatic commands, which eliminate many of the tedious and error prone tasks. The designer works with a symbolic rather than physical data representation which allows for easier construction of complex designs.
The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems
Authors: Benjamin W. Wah, Guo-Jie Li, Chee-Fen Yu
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

In this paper, we report the status of study on MANIP, a parallel computer for solving combinatorial extremum-search problems. The most general technique that can be used to solve a wide variety of these problems on a uniprocessor system, optimally or sub-optimally, is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms with lower-bound tests for parallel processing. Three major problems are identified in the design: interconnection networks for supporting the selection of subproblems, anomalies in parallelism and virtual-memory support. A unidirectional ring network has been shown to be the most cost-effective selection network. We provide sufficient conditions so that anomalies can be eliminated under certain conditions and show that anomalies are unavoidable otherwise. Lastly, we develop a modified branch-and-bound algorithm so that the amount of memory space required under a best-first search is significantly reduced.
Integration of methodology and tools: An approach to teaching systems development
Authors: Barbara Beccue, Carol Chrisman
Venue: ACM SIGCSE Bulletin (1984)

An approach to teaching systems development is presented which integrates the teaching of the tools used in structured analysis with a systems development methodology. The students are taught about each tool at the place in the development methodology where it is first needed. Students apply the methodology in a semester long team project where they obtain experience applying the tools. This emphasizes the application of the tools and the students' learning of the mechanics of each tool.
SIGCSE (Panel Session)
Authors: M. Faiman, Earl Schweppe, L. Symes
Venue: Proceedings of the 1976 annual conference (1976)

Microcomputers, desk-top computers, minicomputer based timesharing systems, and low-cost peripherals are some of the economic developments that are leading more and more computer science departments to establishing their own laboratories for instructional and research computing. The implications of various modes of operation on laboratory student-handling capability, interractions between resources and course content, availability of useful software, benefits of cooperating with a campus computing center, are just some of the topics that will be discussed. The panel should be of interest not only to educators, but to all those concerned about the kind of educational experience which is being made available in computer science.
Simulation of the working set model for virtual storage management
Authors: William D. Flannery
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

The efficiency of a paging drum, operating as the back-up storage device in a virtual memory system, is defined to be the percentage of time that data is being transferred. Efficiency (E) is a function of the number of page requests pending (L), and the capacity of one track on the drum (S), expressed as a multiple of the page size. Denning has derived the following formula E(L) &equil; 2&bull;L/(2&bull;L+s&minus;1). This formula is shown to be a very accurate predictor of paging drum efficiency. Denning has also derived results for the space-time cost of loading a program's working set using the strategies of prepaging and pure demand paging. For the cost of prepaging, simulation analysis produces results which are at variance with those predicted by the analytically derived formula. The simulated cost of prepaging the working set is tabulated for several values of L, s, and w (the number of pages in the working set), and compared with the cost of loading the working set by pure demand paging.
The planar package planner for system designers
Authors: William R. Heller, G. Sorkin, Klim Maling
Venue: Proceedings of the 19th Design Automation Conference (1982)

The Planar Package Planner is a design aid aimed at helping to form a package layout plan, given only the information available during project initiation to digital system logic and package designers. A hierarchical approach is adopted, and a clustering program makes possible use of the layout scheme for bottom-up as well as top-down design. The layout plan for an experimental microprocessor is worked out as an example of the method.
The impact of government regulations and policy on the computer industry
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The panelists will discuss the following Government actions and their impact on the computer industry: 1) the adoption of the I/0 channel interface standard; 2) the effect of the Government's reorganization plans on the computer industry; 3) the impact of GSA scandels on the procurement process; 4) problems associated with the Federal Government's procedures for procuring computer services (i.e., its Teleprocessing Services Program); 5) the effects of recent changes to Federal procurement regulations.
The responsibilities of computer science in continuing education for managers
Authors: R. B. DesJardins
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

Jay W. Forrester has defined management as &ldquo;the process of converting information into action.&rdquo;1. The conversion process is called decision making. To make a decision a manager should (1) identify a set of feasible alternatives, (2) evaluate each of these alternatives and (3) select the alternative which most nearly satisfies his decision criteria. Computer science can support this decision making process in two ways: (1) by providing information which is required to identify and evaluate alternatives which involve the acquisition of additional computing capability and (2) by providing systems which aid in the execution of the decision making process. Continuing education is needed in both of these areas. First I will examine the need for specific education to provide information and then I will look at the need for general education in the use of the computer as an aid in managerial decision making.
Invited papers: Decision tables in systems design
Authors: B. Grad
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

EFFICIENT IMPLEMENTATION and operation have received more attention in business system planning than system study and design. Since programming and equipment installation are such important and difficult steps, there has been a tendency to deemphasize other critical steps: (a)&mdash;Problem definition. (b)&mdash;Problem analysis. (c)&mdash;Solution specification. (d)&mdash;Documentation. Even some aspects of implementation and operation have been neglected: (a)&mdash;Debugging. (b)&mdash;Modification. (c)&mdash;Maintenance. Thorough systems design requires careful evaluation of alternatives, with consideration of all features needed for efficient continuing work and growth. While it is difficult to sell the extra cost of professional design, it may be inexpensive in the long run. Decision tables are a valuable aid in systems design; they provide a different view of problems and their solution than other generally used methods: flow diagrams, narrative, and Boolean algebra. By presenting alternate courses of action under various combinations of conditions, a decision table enables the analyst to think through a problem and its solution more effectively; he can check more readily for completeness and accuracy.
Reconstruction methods for multiple projections
Authors: W. G. Wee, C. C. Lin, M. J. Tsai
Venue: Proceedings of the ACM annual conference (1973)

Two approaches are involved in this study, namely, the multiple-gray-level (direct) approach and the binary-level (indirect) approach. In the direct approach, a new reconstruction method called Minimum Ray-Sum Difference Technique (MRDT) is introduced. The algorithm is applicable for any even number of projections which consist of pairs of perpendicular projections. Comparative studies with respect to other methods1 are conducted. In the indirect approach, a multiple-gray-level pattern is decomposed or coded into a set of dependent or independent binary patterns. Projections are obtained for each binary pattern for processing or transmission. A multiple-gray-level pattern has to be reconstructed. A modified algorithm introduced by Chang2 is used in this study.
A heathkit approach for computer-aided comparison of building alternatives
Authors: R. Dunning Roberts
Venue: Proceedings of the 9th Design Automation Workshop (1972)

COMPUCON, &ldquo;Computer Aided Information System for Component Construction&rdquo;, utilizes the Heathkit concept in its development incorporating a 'circuit board' into which are plugged a series of program modules. Three dimensional graphic representations are generated in conjunction with pertinent physical, performance, and cost criteria. Three configurations are developed and compared, assisting in the evaluation of tradeoffs between the physical form, cost and performance data.
Global common subexpression elimination
Authors: John Cocke
Venue: ACM SIGPLAN Notices (1970)

When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is optimization necessary and two, to what extent is it possible. When considering the second question, one might immediately become discouraged since it is well known that the program equivalency problem is recursively unsolvable. It is, of course, clear from this that there will never be techniques for generating a completely optimum program. These unsolvability results, however, do not preclude the possibility of ad hoc techniques for program improvement or even a partial theory which produces a class of equivalent programs optimized in varying degrees. The reasons why optimization is required seem to me to fall in two major categories. The first I will call &ldquo;local&rdquo; and the second &ldquo;global&rdquo;.
A large-scale dual operating system
Authors: John H. Howard,  Jr.
Venue: Proceedings of the ACM annual conference (1973)

The UT2D operating system is a large high-performance batch and time sharing system which runs on a dual mainframe configuration consisting of a CDC 6600 and a CDC 6400 sharing an Extended Core Storage unit and all of their disks. It was developed locally at the Computation Center of the University of Texas at Austin, in an evolutionary process which started with a simple batch system. UT2D is of general interest because of its successful use of a dual configuration, because of its ability to support a large and varied load of both batch and interactive jobs, and because it demonstrates that evolutionary development by a small programming staff can succeed with a large system. Furthermore, UT2D contains some unusual features such as a built in event recorder for performance evaluation and a distributed tape-based permanent file system. This paper describes the evolution, design principles, and unusual features of UT2D. An outline is provided here for the sake of the reader who is interested in specific topics.
Computer-aided circuit layout and design
Authors: Leroy C. Martin
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Automation of the design of electronic circuits in general is a challenging task. Work in the Electronics Engineering Department at Lawrence Radiation Laboratory is no exception&mdash;projects range from infrared telemetry and solid state devices to oscilloscopes, lasers, computers and nuclear instruments. Most of the design automation activity thus far can perhaps be more properly described as simply computer-aided or computeroriented design with the aim of letting the computer perform those tasks in which it exhibits some competence. Toward this goal, there are at present several large CAD programs which are in use at the Laboratory. Figure 1 provides a glimpse at some of those which are installed or are pending. Several of the analysis programs being used (POTTLE, CIRCUIT, PREDICT, SCEPTRE, etc.) are described and compared in (1). Supplementing these are versions of a program under development at the Laboratory that is intended primarily for the design and layout of printed circuits. This paper reviews some of the general features of the basic program, which is called PUZZLE by its originators and designers, Ronald Zane and Deanna Wilber, of the Laboratory in Berkeley (6), and covers some of the special problems and solutions which become evident in a time-shared remote console version of the program.
ACE: A Circuit Extractor
Authors: Anoop Gupta
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes the design, implementation and performance of a fiat edge-based circuit extractor for NMOS circuits. The extractor is able to work on large and complex designs, it can handle arbitrary geometry, and outputs a comprehensive wirelist. Measurements show that the run time of the edge-based algorithm used is linear in size of the circuit, with low implementation overheads. The extractor is capable of analyzing a circuit with 20,000 transistors in less than 30 minutes of CPU time on a VAX 11/780. The high performance of the extractor has changed the role that a circuit extractor played in the design process, as it is now possible to extract a chip a number of times during the same session.
Visions: A computer-graphics notation
Authors: Judson Rosebush
Venue: Proceedings of the international conference on APL: part 1 (1979)

Visions is a collection of APL functions designed to produce two-or three-dimensional graphics and animation. Homogeneous coordinates and transformation matrices have been adopted to permit data, transformations and viewing parameters to be of arbitrary rank and dimension. Drawing is accomplished through the implementation of a shape-independent dyadic draw function which accepts data and transformations as arguments. Clipping, a window-to-viewport transformation, and perspective are incorporated and may be modified under user control. Shape-independent transformation functions are also defined.
Requirements language processing for the effective testing of real-time systems
Authors: Alan M. Davis, Walter J. Rataj
Venue: ACM SIGSOFT Software Engineering Notes (1978)

GTE Laboratories is currently developing a trio of software tools which automate the feature testing of real-time systems by generating test plans directly from requirements specifications. Use of the first of these tools, the Requirements Language Processor (RLP), guarantees that the requirements are complete, consistent, non-ambiguous, and non-redundant. It generates a mode] of an extended finite-state machine which is used by the second tool, the Test Plan Generator, to generate test plans which thoroughly test the software for conformity to the requirements. These test plans are supplied to the third tool, the Automatic Test Executor, for actual testing. The RLP is the subject of this paper. The primary goal of the RLP is to provide the ability to specify the features of a target real-time system in a vocabulary familiar to an application-oriented individual and in a manner suitable for test plan generation. The RLP produces a document which can be easily understood by non-computer personnel. It is expected that this document will function as a key part of the &ldquo;contract&rdquo; between a real-time system supplier and a customer. This document must also serve as a springboard for the software designers during their development of the actual product. In addition to the requirements document, the RLP also produces an augmented state transition table which describes a finite state machine whose external behavior is identical to the target real-time system as defined by the specified requirements.
Design automation challenges for the 1970's
Authors: C. S. Perry
Venue: Proceedings of the 4th Design Automation Conference (1967)

When Mort asked me some weeks ago if I would be the kickoff speaker for this year's Design Automation Workshop, he told me about the general makeup of your group and high level of technical competence that would be represented here today. At first I was somewhat reluctant to accept because my own field of experience has not been with specific technical uses of computers, but rather with technical management of large groups of people concerned with development engineering on major missile programs. However, when I learned that my remarks could be directed toward broad future developments in design automation and its impact on the aerospace industry, and business in general, I accepted because I am extremely enthusiastic about the potential of computer technology in reshaping our traditional ways of doing things. I also welcome this opportunity to perhaps exchange ideas with your group which is in the forefront of a changing technology.
The use of computerized business games to simulate business behavior under different policies
Authors: Peter R. Sugges,  Jr.
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

Computerized business games can be used as a research tool to investigate in a laboratory setting how business firms respond to either governmental policies or to policies established by corporate headquarters. This idea was tested by comparing performance in 2 industries which had constraints placed on certain decision variables to that in 2 industries without constraints on these variables.
Insights into the implementation and application of heterogeneous local area networks
Authors: William P. Lidinsky
Venue: Proceedings of the seventh symposium on Data communications (1981)

The ideal local area network is a mechanism which provides concurrent high speed error-free data paths over a limited geographical area and between any computational entities on the network. A computational entity may be a program running on any type of computer, any intelligent device, or any terminal. This means that such an ideal network must be able to support systems of cooperating processes within disjoint and dissimilar host environments. Achieving such an ideal heterogeneous network (referred to as an &ldquo;open&rdquo; network with respect to the ISO Reference Model for Open Systems Interconnection) may be impossible in the limit. However, the ideal shows promise of being approachable. Recent work in local area networks, protocols, and multiprocessor operating systems looks promising for attacking the problem. This paper first discusses data paths and the dilemma of heterogeneous data communications. Existing local area networks, their functionality, shortcomings, and relationship to networking standards are described. Commercial LANs are discussed and classified. Standards, high level protocols, and operating system concepts are discussed and related to networks. Finally some possible approaches to the implementation of hetergeneous networks are discussed.
Cross-country scoring and timing using APL
Authors: Alan L. Jones
Venue: Proceedings of the sixth international conference on APL (1974)

Producing hard copy results of a large cross-country meet is usually a tedious and time-consuming process. This is due to the speed with which the event proceeds and the complicated scoring algorithm. A set of APL functions have been written that scored the New York State high school championship meets in the fall of 1973.
A Partitioned Ring Structure Processor
Authors: L. J. French
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The topic of this paper is a Partitioned Ring Structure Processor (PRSP) which is a data structure system that has been designed for small computers. PRSP provides techniques of creating and traversing very complex network type structures as necessitated by an application. The created structures are highly efficient in storage space and can be efficiently partitioned into secondary storage such that very large data structures (106 bytes) can be handled in a small stand alone computer. PRSP has been implemented and utilized as the most important part of the GOLD31 System designed and developed at RCA Laboratories in Princeton, New Jersey. The GOLD System has been used for over two years in the design of circuit artwork. In Part II of this paper I will discuss the hardware and software environment in which PRSP operates, and some of the problems encountered and solved in the design of PRSP. In Part III the detailed operation of PRSP is given. In Part IV partitioning and segment management techniques are described.
An on-line symbol manipulation system
Authors: Frederick W. Blackwell
Venue: Proceedings of the 1967 22nd national conference (1967)

The purpose of the study described in this paper was to develop a computer program that enables users arbitrarily to define symbols and to instruct the computer to manipulate and to operate with them on-line according to the rules of their definition. An additional goal was the use of this symbol manipulation capability for constructing on-line programs that perform analytic operations upon algebraic expressions; the results of this work will be briefly mentioned in this paper.