ppxscal/embedding_network huggingface dataset:
Communication complexity
Authors: Christos H. Papadimitriou, Michael Sipser
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In this paper we prove several results concerning this complexity measure. First we establish (in a non-constructive manner) that there exist languages which cannot be recognized with less than n communication (obviously, communication n is always enough for recognizing any language). In fact, we show that for any functionf(n)-&-lt; n, there are languages recognizable with communicationf(n) but not with communicationf (n)-&-minus;1. In other words, this complexity measure possesses a very dense hierarchy or complexity classes, as miniscule increments in communication add to the languages that can be recognized.
A prestructuring model for system arrangement problems
Authors: Keiichi Sato, Charles L. Owen
Venue: Proceedings of the 17th Design Automation Conference (1980)

A computer supported procedure is presented for using requirement information to prestructure component relationships for a general class of arrangement problems. The procedure generalizes and extends the range of admissable requirement information and reduces the risk of local optimality in arrangement. Three categories of requirements and implicit requirements. These three are integrated and used to organize the components to be arranged into a &ldquo;normative structure&rdquo; in the form of a semi-lattice hierarchy. The normative structure is an approximation of the spatial or temporal arrangement to be generated in real space.
IC specification language
Authors: Ron Ayres
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper explores the use of computer languages for specifying ICs. Many different aspects of an IC may be specified via language such as logical function and layout. The logic function of an IC may be specified via boolean equations and the layout may be specified via shapes expressed with cartesian coordinates. With such specification, the computer can simulate the behavior of the IC and generate layouts with great precision.
System optimization: A mass memory system designed for the multi-program/multi-processors users
Authors: J. Dobbie, D. Zatyko
Venue: Proceedings of the 1965 20th national conference (1965)

THE PURPOSE of this paper is to demonstrate why a mass memory subsystem for multi-program operation requires simultaneity in both command and data transfer channels. A hypothetical computer system is discussed which will illustrate the points presented here and in a MAC project1.
An interactive man-machine approach to the computer logic partitioning problem
Authors: M. Hanan, A. Mennone, P. K. Wolff,  Sr.
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The problem of partitioning computer logic has been attacked in the past by manual and automatic techniques. We describe an interactive approach which combines aspects of both approaches and creates results which are better than those obtainable by either approach independently. An overview of the system is presented, several algorithms discussed and experimental results are given.
Tutorial chairman's overview
Authors: John W. McCredie, Paul Roth, Donald Kosy, James Browne, Dennis Gilbert, John Caron
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

The primary goal of this series of tutorial lectures is to introduce participants to the roles of computer based simulation models in the analysis and design of computing systems. Participants should have some programming knowledge although they need not have experience with the specialized data structures and control features of common simulation programming languages. They should gain an understanding of some of the techniques used to analyze computing systems and to judge whether or not a simulation is appropriate for a particular study. Three basic tools useful in systems studies are: 1. the formulation and solution of simplified analytic models; 2. the construction of larger, more detailed, simulations; 3. the design and implementation of empirical investigations. All three methods have areas of applicability which intersect. For example, analytic models often expand to the point where a large amount of computational effort is required to calculate results. Often a point is reached when a modest simulation may be a more cost effective approach. Large simulations may eventually grow into system prototypes, and empirical investigations can provide insight required to design better models. Analytic models often indicate which of many possible parameters or subsystems are good candidates for more detailed study via simulation and experimentation.
A parallel Prolog: The construction of a data driven model
Authors: Michael J. Wise
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

An argument is presented for the implementation of a Prolog-like language using data driven execution, as a step towards the solution of the problems associated with multiprocessor machine architectures. To facilitate this, a number of changes and extensions to the execution control mechanism of Prolog have been implemented. Among the notable features of the system are the use of conditional AND (CAND) and conditional OR (COR) constructs to allow the programmer sequential control in the context of a parallel execution system, and mechanisms supporting dataflow execution within groups of parallel literals. A tentative solution proposed for the evaluation of negative literals is also being investigated.
A simulation study of the University of Iowa campus bus system
Authors: Jeffrey L. Benson, John S. Ramberg
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

A GPSS/360 simulation model of the University of Iowa campus bus system is given. The simulation model was constructed to study modifications of the current system necessitated by the rapid growth in ridership during the first year of service. The main GPSS model is based on three macros: a customer generation and destination macro, a bus macro, and a scheduling macro. Some recommendations concerning future operations are given.
ANNA: Towards a language for annotating Ada programs
Authors: Bernd Krieg Brückner, David C. Luckham
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

ANNA is a proposal to extend Ada to include facilities for formally specifying the intended behaviour of Ada programs (or portions thereof) at all stages of program development. ANNA programs are Ada programs with formal comments. Formal comments in ANNA consist of virtul Ada text and annotations. The syntax and semantics of different kinds of annotations are defined: declarative annotations (for variables, subtypes, subprograms, and packages), statement annotations, exception annotations, and visibility annotations. ANNA includes a small number of predefined attributes which may appear only in annotations, e.g., access type collections. The lexical structure of ANNA is designed so that the extensions of Ada appear as Ada comments. ANNA programs are therefore acceptable by Ada translators. The semantics of annotations are defined in terms of Ada concepts, in particular many annotations are generalizations of the constraint concept. It is therefore a simple step for the Ada programmer to use ANNA to give formal specifications of programs. ANNA is intended to provide a formal framework within which different theories of formal specification may be applied to Ada. Our proposal omits tasking for the time being.
Data processing and computer science theory
Authors: A. T. Berztiss
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Theoretical results have had much greater impact on computing practice than we are normally aware of, and the practical significance of theoretical results can be expected to become more prominent in the future. We discuss the past and present significance for data processing specialists of some results in analysis of algorithms, languages, and program proofs, and argue for a greater emphasis on computer science theory in data processing curricula.
GENDA - a generalized design automation system for modular hardware
Authors: Murray F. Freeman, Mark Resnick
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Design automation techniques are gaining universal usage throughout industry. The tailoring of design automation systems to a specific hardware technology generally results in their early obsolescence. GENDA, a GENeralized Design Automation system currently used within Philco, represents a successful attempt to cope with changing packaging techniques and the lead time normally involved in development of design automation functions. The approach used requires more care in initial specification and development of software for design automation use, but inherently enables the incorporation of added functions, and adaptations to new packaging techniques, to be made rapidly and effectively. The following paragraphs detail and illustrate the operational GENDA design automation system and the design philosophy behind it.
Dynamic Binary Search Trees
Authors: William E. Wright
Venue: Proceedings of the 1978 annual conference (1978)

This paper compares the performance of many algorithms designed to maintain balance in binary search trees. The algorithms are rated primarily in terms of execution speed, although weighted path length is also included. The investigation includes algorithms for height balanced trees, weight balanced trees, trees of bounded balance, and optimal trees, as well as some combination algorithms. Input to the algorithms consists of insert and search commands using given sets of keys with unequal but unknown probabilities. Other types of input are also considered. The best algorithms are shown to be the basic search algorithm which performs no rebalancing, and a combination algorithm.
Generalized page replacement algorithms in a relational data base
Authors: R. G. Casey, I. Osman
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

This paper describes a generalized page replacement problem in which the pages have variable sizes and the cost of a page fault is a function of the particular page referenced. In such an environment the conventional page replacement algorithms are found to perform inadequately. New algorithms are proposed for reducing the cost incurred because of page faults in response to a series of references. Simulation experiments have been run in order to compare the cost performance of these algorithms with standard techniques, and also with the minimum achievable cost. The latter is determined by means of a novel tree-pruning algorithm. One practical environment in which the general problem may arise is a relational data base having an implied relations facility, in which some relations are maintained in definition form until queried. The implied relation is analogous to a page, and the processing time for restructuring a relation from its definition varies from one relation to another. An efficient replacement algorithm is needed to manage the process as the implied relations alternate between the state of definitions and the state of explicit representation.
Automatic design of multiprocessor microprocessor systems
Authors: Hoo-min D. Toong
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

The rapid proliferation of LSI/microprocessor devices and the growing complexity of their areas of application dictate the understanding and development of mechanisms to facilitate their use. In particular, the fully integrated system described herein will provide efficient means for the translation of problem oriented, user specified, higher-level language constructs downwards onto automatically configured single or multi-microprocessor systems. Crucial issues are the domain specific higher level programming languages, the software/hardware target structures, and the algorithms that specify and/or match the capabilities of these known microprocessor structures to the requirements imposed by the problem statement. Mechanisms are being developed at different levels to accomplish these goals. Quick configuration of multimicroprocessor structures of arbitrary topology with appropriate software downloading tools is already a reality.
On the problem of uniform references to data structures
Authors: C. M. Geschke, J. G. Mitchell
Venue: Proceedings of the international conference on Reliable software (1975)

The cost of a change to a large software system is often primarily a function of the size of the system rather than the complexity of the change. One reason for this is that programs which access some given data structure must operate on it using notations which are determined by its exact representation. Thus, changing how it is implemented may necessitate changes to the programs which access it. This paper develops a programming language notation and semantic interpretations which allow a program to operate on a data object in a manner which is dependent only on its logical or abstract properties and independent of its underlying concrete representation.
Software tools used in the development of a VLSI VAX Microcomputer
Authors: Robert Gries, James A. Woodward
Venue: ACM SIGMICRO Newsletter (1984)

This paper presents an overview of the software tools used in the development of the microcode for Digital's VLSI VAX Microcomputers. The software tools effort consisted of five basic areas: assembly, simulation, verification, and statistical analysis.
Stream processing
Authors: Allen Goldberg, Robert Paige
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

Stream processing is a basic method of code optimization related to loop fusion that can improve the space and speed of iterative applicative expressions by a process of loop combination. It has been studied before in applications to program improvement and batch oriented database restructuring. Previous attempts at implementation have been either highly restrictive, have required manual intervention, or have involved naive strategies resulting in impractically slow running times. This paper defines a new model for a stream processing problem for handling a wide class of applicative expressions that can be evaluated by looping in an unordered way through a single set or tuple valued argument. This problem is formulated graph theoretically and shown to be NP-Hard, even in the presence of constraints. Two new efficient heuristic algorithms will be presented. The efficiency of these solutions allows stream processing to be applied dynamically as a database query optimization, and as an important component of a high level language optimizer. Our method of stream processing has been implemented and used effectively within the RAPTS transformational programming system.
Tint fill
Authors: Alvy Ray Smith
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

To fill a connected area of a digital image is to change the color of all and only those pixels in the area. Fill algorithms for areas defined by sharp boundaries (e.g., a white area surrounded by a black curve) have been implemented at several color computer graphics installations. This paper presents an algorithm for the more difficult problem of filling areas with shaded boundaries (e.g., a white area surrounded by a curve consisting of several shades of gray). These images may arise from digitizing photographs or line drawings with a scanning video camera, or they may be generated by programs which produce antialiased line segments or dekink black-and-white images. When an area in such an image is to be filled with a new color, it is desirable to have the fill algorithm understand the shaded edges and maintain the shading with shades of the new color instead of the old. The tint fill algorithm presented here accomplishes this task. Its name arises from its ability to change only the tint (hue and saturation) of a pixel, leaving the value (blackness) unchanged. Although the algorithm was motivated by and is written in terms of color, it has a more general interpretation, which is also presented.
Reliable synchronization of redundant systems
Authors: Daniel Davies
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

This paper is concerned with the problem of reliably maintaining synchronization in redundant systems. While many such systems have been built, little work has been done on formalizing their requirements. The terms necessary to quantify the problem and general synchronizer specifications are given. To illustrate their use and point out issues in synchronization, a synchronizer is advanced and three detailed examples of its use are given. These are a single fault tolerant clock and a TMR microcomputer system synchronized first predominately with hardware, then with software. Because it was felt a practical paper might be of greater interest than a more theoretical one, only a subcase of the general synchronization problem is solved.
Some computer system implications of magnetic bubble memories
Authors: J. Egil Juliussen
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper describes some &ldquo;hidden&rdquo; advantages that magnetic bubble memories have over disk systems because bubbles can be shifted bidirectionally and can be stopped. The resulting impact on the average access time, I/O priority, I/O software, interrupt handling, and the controller complexity of magnetic bubble memories are discussed. Additionally, a short description of the future memory hierarchy when magnetic bubbles are included is given. Finally, the most probable applications for magnetic bubbles have been outlined.
Subroutine interface primitives for ETC
Authors: B. N. Dickman
Venue: Proceedings of the international symposium on Extensible languages (1971)

Efficient coding for subroutine interfaces often implies, especially for system programmers, the passing of arguments in hardware registers, rather than on a system stack. This is a problem in an extendible compiler that allocates registers for itself and also allows programmers to use hardware registers (as well as memory locations) as variables. There is the added problem of standardizing the subroutine interface to reduce the possibility of using the subroutine incorrectly. This abstract discusses a solution to these problems. The compiler for which the solution is intended is ETC[1], an extendible, macro-based, infix compiler designed to facilitate the production of very efficient code. Statements in the language may be freely mixed with machine operations, pseudo-operations, and macro calls. The extended language resembles FORTRAN. The base language consists of an assembler with a powerful macro facility [2] and a set of primitives, including operation, function and attribute definition, and limited register allocation.
Designing introductory computing assignments: The view from the computing center
Authors: William W. McMillan
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The suggestions made here are based on experience as a consultant, writer, and educator at an academic computing center, and on some wellworn precepts of educational psychology. The goal is to convince instructors of introductory computing classes to apply to the design of computing assignments some principles they probably already use in teaching the main content of their courses.
Synthesis and selection of DCT algorithms using behavioral synthesis-based algorithm space exploration
Authors: M. Potkonjak, A. Chandrakasan
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Numerous fast algorithms for the discrete cosine transform (DCT) have been proposed in image and video processing literature. Until recently, it has been difficult to compare different DCT algorithms and select one which is best suited for implementation under a given set of design goals and constraints. In this paper, we propose an approach for design space exploration at the algorithm and behavioral levels using high level synthesis tools. In particular, we study and compare the following nine DCT algorithms: Lee's, Wang's, DIT, DFT, QR, Givens, Arai, MCM, and direct algorithm. The main conclusion of this study is that the best choice among fast DCT algorithms depends on a particular set of design goals and constraints. Another important conclusion is that for almost all sets of implementation goals and constraints more than an order of magnitude improvement can be achieved using algorithm and behavioral design space exploration.
On a multidimensional search problem (Preliminary Version)
Authors: S. Rao Kosaraju
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

The problem of searching for a given k-vector among a sorted list of n k-vectors is considered. The binary search is known to be optimal when k is 1. Here an almost optimal algorithm is presented for the 2-dimensional case. Interesting upper and lower bounds are derived for the general problem.
NOMAD: A printed wiring board layout system
Authors: Martin J. Welt
Venue: Proceedings of the 12th Design Automation Conference (1975)

The NOMAD (Nonmodular Or Modular Automated Design) system provides computer-aided support for the layout of a wide range of printed wiring board designs. The system may be used to design both highly irregular nonmodular and more uniform modular printed wiring boards. The nonmodular boards usually contain numerous discrete and some digital components, whereas the modular varieties are almost entirely digital in nature. In order to guarantee flexibility and control of the layout process, the NOMAD system was implemented on a minicomputer-based interactive graphics terminal. The interactive graphics environment permits the NOMAD user to guide the PWB layout process through steps such as component placement and interconnection routing. Through the use of interactive display techniques and both heuristic and algorithmic computational aids, the user can complete the layout with NOMAD in a considerably shorter time than with alternative methods. Although the focal point of the NOMAD system is at the graphics terminal, telecommunication facilities are utilized to access large compute-bound component placement programs. Aside from the placement, all other design activities, including automatic routing aids, occur at the graphics computer. Once a printed wiring board layout is complete, facilities are available through NOMAD to obtain a full array of design documentation. This documentation includes artmasters for printed wiring board fabrication, an assembly drawing, a stocklist, schematic drawings, and a drill table. The NOMAD system has been operational since April, 1974. Improvements and enhancements are being made continually in an effort to further increase the cost effectiveness of the system.