ppxscal/embedding_network huggingface dataset:
The SLIDE simulator: A facility for the design and analysis of computer interconnections
Authors: Arthur H. Altman, Alice C. Parker
Venue: Proceedings of the 17th Design Automation Conference (1980)

Interconnection design can have a profound effect on the price and performance of a digital system. This paper describes a new simulation facility that is designed to allow the user to describe and simulate the behavior of an interconnected system. The simulator provides the capability to devise, debug, and evaluate digital interconnection schemes. The user first writes a description of the system interconnections using the hardware descriptive language SLIDE. The UNIBUS, for example, has been described in SLIDE. The description is then compiled into SIMULA code, and linked by the user with other SIMULA or SLIDE modules which probabilistically or deterministically model the hardware that drives the interconnections. The simulation then proceeds under interactive user control.
Physically dispersing an operating system
Authors: E. Douglas Jensen
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

Computer systems can be &distributed& in many different senses - for example: the user access (such as remote terminals); the system geography (such as a computer network); the processing (such as a multiprocessor or a multicomputer); the data (such as a partitioned or a replicated database); the operating system (such as a network OS or a decentralized OS). These senses of distribution are not independent, and each has its own advantages and disadvantages in various circumstances, as well as its own research problems. However, some senses are becoming better understood than others, and some are becoming recognized as more fundamentally important than others. Distributing the user access or the system geography per se can be regarded as neither especially challenging nor critically fundamental technology. Distributing the (user portion of the) processing is important, and the ease of doing so is, to a first order approximation, determined by the extent and manner in which the data and operating system are distributed. It currently seems to be these latter two aspects of computing whose distribution involves the most essential, and difficult, new technology.
Computer science curriculum for high school students
Authors: R. M. Aiken, C. E. Hughes, J. M. Moshell
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

This paper describes a current project to design an Introductory Computer Science Course for High School students. Problems concerning the choice of hardware, the selection of software, programming language(s) and the overall design of the curriculum are discussed. In addition, some previous related research is summarized and a plan for future activities is outlined.
CMOS new product development for the health care industry: Procedures and pitfalls
Authors: Hal Berghel
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

In the summer of 1980, a California communications firm contracted me to conduct a feasibility study, the focus of which was to be a hand-held Diet Calculator which would keep a running total of the calories, fats, carbohydrates, cholesterol, protein, sodium, etc. intake for individuals on restricted diets. The president of the firm wanted a display prototype and a rough estimate of unit cost. If the results of the study looked favorable, a new company would be formed to manufacture and market this product. In this paper I will briefly summarize the results of this project. The key to this endeavor was flexibility. We were unsure of which food properties would eventually be important to monitor, and what ultimate size the calculator should have. So we aimed at 8 food properties, and an overall dimension of approximately 6&rdquo; &times; 3&rdquo; &times; 1/2&rdquo;. Much closer to our intended product was the new line of hand-held computers marketed by Panasonic/Quasar, Radio Shack and Sinclair (for a general description of these devices, of. Williams and Meyer (1981) and MaCallum (1981)). Each of these HHC's was innovative in its own way. The Sinclair ZX80, for example, had included syntax-checking software in its interpreter. The Radio Shack TMS80 introduced a unique twin 4-bit CMOS microprocessor configuration, wherein each processor was individually assigned a unique subset of I/O, interpretive and control operations. But it was the Panasonic/Quasar approach which seemed the most germane to our application.
Model specification with respect to analysis
Authors: C. Michael Overstreet
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Much potential exists for reducing the costs while also improving the quality of simulation models through the use of Model Development Systems (MDSs). We describe a specification language for discrete event models to be used in a MDS. Our approach is to introduce an intermediate form between a conceptual model (the model as it exists in the mind of the modeler) and an implementation of that model in some programming language. The model specification language described here is intended to be used in conjunction with a model specification generator (a program to assist a modeler or modeling team with the construction of model specifications). A simple example is presented using this specification language. The example is used to illustrate some types of model analyses and documentation.
Automatic revision of formal test procedures
Authors: David J. Panzl
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

An automatic software test driver is a new type of software tool which controls and monitors the execution of software tests. An automatic test driver is controlled by a formal test procedure coded in a special software test language. The test procedure replaces the test data and test setup instructions of conventional testing. The specific goals of automatic test drivers are to eliminate the need for writing drivers and stubs for module and subsystem testing, to provide a standard format and language for specifying software tests, to provide a standard execution setup for software tests, and to automate the verification of test execution results. A test procedure contains input data to be supplied to the program under test and model outputs against which actual outputs of the target program are verified. Typically, ninety percent or more of the text of a test procedure consists of model outputs which must be revised each time the target program is modified. The TPL/2.0 automatic software test driver described in this paper automates both the initial generation and subsequent revision of test procedure model outputs.
Programmimg languages for hardware description
Authors: Peter Robinson, Jeremy Dion
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes work done as part of a design automation system for gate arrays. The system provides no hard ware description language and circuits are described in the same language in which the system is implemented, Modula-2. We claim that modern programming languages are sufficiently general to be good hard ware description languages, and that a design automation system which is based on this principle will be simpler and more extensible than one based on a specialized hard ware description language.
QUADRIL: A computer language for the description of quadric-surface bodies
Authors: Joshua Zev Levin
Venue: ACM SIGGRAPH Computer Graphics (1980)

Most man-made objects can be closely approximated by bodies whose surfaces are composed of portions of second-order (quadric) surfaces. These surfaces include elliptic, hyperbolic, and parabolic cylinders, as well as quadric cones, paraboloids, hyperboloids, ellipsoids, and pairs of planes. Simple planes (first-order surfaces) may be included as degenerate quadric surfaces. Because these quadric-surface bodies are so useful for modelling man-made objects, it is important that any Computer-Aided Design (CAD) system be able to work with such bodies. The &ldquo;QUADRIL&rdquo; language described here was designed to accept descriptions of quadric-surface bodies in character-string form. QUADRIL has a mixture of English-like and algebraic syntax. It may be used to specify quadric-surface bodies and then to display them on various media. QUADRIL will accept descriptions of quadric-surface bodies either as &ldquo;volumetric&rdquo; combinations of basic bodies, or as boolean functions of bounding surfaces. English-like syntax is used for specifying what surfaces and basic bodies are used, while algebraic syntax is used to transform the canonical forms of the surfaces or bodies into the shape, position, and orientation that the user desires. Volumetric combination of bodies involves the operations of union (+), intersection (*), and subtraction (-). Boolean specification of volumes is in terms of a boolean tree with the bounding surfaces as leaf nodes. The tree is expressed as a character string. QUADRIL permits using user-created &ldquo;STRUCTURES&rdquo; as component bodies (&ldquo;OBJECTS&rdquo;) in greater STRUCTURES. The display of the quadric-surface bodies may also be specified in QUADRIL. The user is considered fixed in space, while the body is transformed to give the desired view.
Maze recognizing automata (Extended Abstract)
Authors: Walter J. Savitch
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

In [2], computations of nondeterministic machines are shown to correspond to threadings of certain mazes. We briefly summarize these results and then obtain some new extentions of them. A new device called a maze-recognizing automaton is introduced. This is a type of finite-state device that crawls through mazes. The following statements are proven equivalent. (i) There is a maze-recognizing automaton which recognizes the threadable mazes. (ii) Every nondeterministic L(n) tape-bounded Turing machine is equivalent to some deterministic L(n) tape-bounded Turing machine, provided L(n) &ge; log2n.
Teaching a computer-based college level statistics course in a secondary school
Venue: ACM SIGCUE Outlook (1976)

This paper discusses experiences in utilizing an HP-2000 system as the framework for teaching computer programming and statistics. The statistical approach relies upon the binary model; this model is developed by each student using the random function generator. Although empirically heuristic, such an approach provides a useful intellectual base for developing all other statistical notions more formally. Student experiences in researching the role of computer science and/or statistics in their career choices led three students to select Computer Science as a major at California State University, Northridge.
Academic and administrative computing as zero- and nonzero-sum games
Authors: James W. Cerny
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

There are many ways to deliver academic and administrative computer services. Some imply competition and some imply cooperation. It is useful to discuss and analyze these situations in game-theory terms. To illustrate such an analysis, data from the University of New Hampshire are used.
Experience with porting the Portable C Compiler
Authors: Charles H. Minchew, Kuo-Chung Tai
Venue: Proceedings of the ACM '82 conference (1982)

In May of 1981, a project was undertaken at North Carolina State University to develop a C compiler for the Data General Eclipse MV/8000. The compiler was to be based upon the Portable C Compiler1 (PCC), which was developed at Bell Labs by Steve Johnson. The project, now near completion, has proven to be an enlightening journey into the realm of portable software, and many lessons have been learned. This paper will describe the approach we took to porting the compiler, problems we encountered, and our solutions to these problems.
Complete problems for deterministic polynomial time
Authors: Neil D. Jones, William T. Laaser
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

The results of Cook and Karp ([K], [C]) aroused considerable interest for at least two reasons. First, the answer to a long-standing open question which had seemed peculiar to automata theory&mdash;whether deterministic and nondeterministic polynomial-time-bounded Turing machines are equivalent in power&mdash;was seen to be exactly equivalent to determining whether any of several familiar combinatorial problems can be solved by polynomial-time algorithms. Second, the existence of complete problems for NP1 made it possible to replace an entire class of questions by a question about a single representative.Thus all of these combinatorial and automata-theoretic problems were essentially restatements of a single problem, such as: can satisfiability of a propositional formula be decided in polynomial time. The main purpose of this paper is to introduce several problems which are complete for P, the class of languages recognizable in deterministic polynomial time. Any such language has the property that if it is recognizable in space logk(&bull;), then every language in P is so recognizable. Thus a problem complete for P will serve to differentiate those sets in P which are not recognizable in logarithmic space from those which are, providing such differentiation is possible. A problem of this type was first presented by Cook in [C2], concerning solvable path systems.
Teaching microprogramming(Panel Discussion)
Authors: Louise H. Jones, Earl W. Reigel, W. Gary Sitton, Masahiro Tsuchiya
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The following are excerpts from the material that will be discussed by the panelists: &ldquo;Microprogramming and Emulation&rdquo;. This experimental seminar was directed toward learning about microprogramming rather than how to microprogram because of lack of equipment. Some of the topics discussed were: Organization of Microprogrammable Machines, Languages f o r Microprogramming, Synthesis of System Architectures, Emulation and Signal Processing, and the Future of Microprogramming. Student projects from the course included an ALGOL simulation of the HP 2100 and the John Hopkins dynamic multiprocessor and a simulation package to investigate the emulation of the AN/UYK-20.&mdash;L.H. Jones &ldquo;CIS 672 - Microprogramming&rdquo;. The objectives of this course are (1) teaching the basic principles of microprogramming, (2) to develop the student's ability to write microprograms and evaluate machines, (3) to demonstrate the potential of writable control store and, (4) to prepare students to do research in the microprogramming field . Material covered in the course includes: A review of control structures and history of microprogramming, development of microprograms for functions and emulators and future trends and research topics in microprogramming.&mdash;E.W. Reigel &ldquo;Microprogramming Theory&rdquo; This is a graduate level course that takes up where our introductory course in microprogramming leaves off. The prerequisites are a basic understanding of microprogramming and the ability to write and debug microprograms. The course begins with discussion of control structures and micro-memory. Particular attention is placed upon microword encoding, time validity, and sequencing techniques. Micro-programming languages are developed from the standpoint of those which assume a particular hardware configuration (e.g. IBM's CAS) to those which include virtual machine definition capability (e.g. Young's ALSIM).&mdash;W.G. Sitton &ldquo;Microprogramming Activities at Northwestern University&rdquo;. The equipment at Northwestern has been used to develop a senior/graduate course and to provide facilities for Master and Ph.D. research. The Varian V73 has been used in a variety of projects including the development of a microprogram monitoring device study microprogram resource utilization, the implementation of microprogram parallelism detection techniques and the development of a high level language for V73 microprogramming.&mdash;M. Tsuchiya
Two simulation applications to outpatient clinics
Authors: S. K. Kachhal, Georgia-Ann Klutke, Edward B. Daniels
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes two applications of simulation modeling for outpatient clinics in a major urban medical center. The first application was developed for the Ear, Nose and Throat (ENT) Clinic where patients first see the physician and; when the physician requires a hearing test to be done immediately before a diagnosis can be made and treatment prescribed, then the patients see an audiologist.The simulation model tested various scheduling policies for scheduling patients for ENT physicians to provide a uniform hearing test load to the audiologists. In the other application, a simulation model was developed for a general practice medical clinic. This model provided results on patient waiting times and utilization levels for resources at different staffing levels and configurations of reception areas, nursing areas and combination office/exam rooms. The experience with the two models indicated that simulation modeling can be of great help in testing various strategies and configurations and thus assisting in the development of efficient and cost-effective outpatient clinics
APLSV access to indexed sequential files
Authors: Gordon W. Chamberlain, Michael E. Massey
Venue: Proceedings of seventh international conference on APL (1975)

This paper describes a system which allows APLSV users to access standard IBM indexed sequential files. Included are APL functions which allow easy access to specific data fields within a record with automatic conversion of data to and from the APL Z-code representation and the external file format (binary, character, packed decimal, zoned decimal).
Pragmatic techniques for program analysis and verification
Authors: Erhard Ploedereder
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The Program Development System (PDS) is a collection of programming tools created as an extension of the ECL programming system23. It contains components that assist the programmer in the definition and modular structuring of large programs at different levels of algorithmic abstraction. These components are supplemented by a program analysis package that produces an information pool to be used for such tasks as source-to-source optimization, semi-automated program documentation, fault detection and program verification. This paper describes the core of the analyzing package, the Symbolic Evaluator. In its implementation we have incorporated pragmatic methods for handling data sharing patterns, and for characterizing and reasoning about the behaviour of loops and procedures. The impact of these methods upon program verification techniques is briefly discussed.
Divide-and-conquer in multidimensional space
Authors: Jon Louis Bentley, Michael Ian Shamos
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a single problem on N points in k&minus;1 dimension. Special structure of the subproblems is exploited to obtain an algorithm for finding the two closest of N points in 0(N log N) time in any dimension. Related results are discussed, along with some conjectures and unsolved geometric problems.
On using statistical analysis of SMF data to build usable simulation models of large-scale computer systems
Authors: H. W. Barry Merrill
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

This paper describes a technique of building workload models from SMF data. In a stable production environment, two classes of jobs were modeled, one employing a synthetic jobstream to model the &ldquo;back-ground noise&rdquo;, and one employing individual models of &ldquo;important&rdquo; jobs. Univariate statistical analysis of SMF data provided the job profiles for the synthetic job-stream, and provided relationships between CPU time and I/O counts of each file for the &ldquo;important&rdquo; jobs. The resultant workload was simulated with the System Analysis Machine (SAM) language.
SIGBDP 3 Performance measurement and data base design (Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

Good data base design is of increasing concern to systems designers and data base administrators. The rapidly increasing use of data base management systems to support an increasing number of dynamic information systems has brought data base performance measurement and evaluation into the limelight. The task is to provide as easily as possible the most cost effective data base structures (logical-physical structures, physical access paths, storage mappings, etc.) to support the given logical system requirements while meeting a number of constraints such as integrity, flexibility, etc. In environments where data base contents and transaction traffic are changing, the determination of the best data base structures is a complex task, particularly with the multiple criteria of access time, storage utilization, etc. This session strives to present and discuss quantitative-oriented performance experiences, experimental results, insights and tools available toward good data base design in actual systems and situations (particularly IMS, System 2000, and ADABAS).
Data structure architectures - a major operational principle
Authors: W. K. Giloi, H. K. Berg
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Computer architectures may be characterized by their operational principle and their physical structure. The paper defines these two characteristics for the novel concept of data structure architectures (DSAs). The representation and processing of arbitrary data structures in such a DSA is demonstrated by examples. It is shown how the functional requirements of a DSA can be satisfied by the specific information structure and the physical structure of the STARLET architecture introduced in preceding publications.