ppxscal/embedding_network huggingface dataset:
BIST-PLA: a built-in self-test design of large programmable logic arrays
Authors: C.-Y. Liu, K. K. Saluja, J. S. Upadhyaya
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

A new method for designing a Built-In Self-Test Programmable Logic Array (BIST-PLA) is presented. In the proposed design, the Test Pattern Generator and the Response Evaluator circuits are very simple. The design requires a re-arrangement of the AND (OR) planes on the basis of number of crosspoints in the product (output) lines in the PLA. The BIST-PLA proposed in this paper is capable of detecting all single stuck-at and crosspoint faults and almost all multiple faults, thus offering fault coverage higher than any of the known BIST designs of PLAs. A program has been written which generates a BIST-PLA. The program was used to study 22 large PLAs from the list of 56 PLAs given in [18]. It was found that the silicon area overhead for almost all these PLAs was lower than those using methods reported in literature [ 10 -17]. Furthermore, the delay performance degradation was found to be within acceptable limits. The program was developed in the Unix environment (4.3beta BSD UNIX) and is integratable with the existing design automation tools.
Towards an alternative model for software developments
Authors: S Jähnichen, G Goos
Venue: ACM SIGSOFT Software Engineering Notes (1986)

This paper addresses three distinct but strongly related topics in the life cycle and environments area: bull;Failure of the traditional life-cycle-model due to missing support for feedback loops. bull;An alternative model which represents development states and rules of well-structured project progress on the basis of abstract properties of the underlying documents. bull;Software engineering environment support for the proposed model.
Memory-constrained task scheduling on a network of dual processors
Authors: Ken Fuchs, Dennis Kafura
Venue: Journal of the ACM (JACM) (1985)

One aspect of network design is the extent to which memory is shared among the processing elements. In this paper a model with limited sharing (only two processors connected to each memory) is analyzed and its performance compared with the performance of two other models that have appeared in the literature. One of these is a model of multiple processors sharing a single memory; the other model considers a multiprocessor configuration in which each processor has its own dedicated memory. The tasks processed by these networks are described by both time and memory requirements. The largest-memory-first (LMF) scheduling algorithm is employed and its performance with respect to an enumerative optimal scheduling algorithm is bounded. On the basis of this measure we conclude that memory sharing is only desirable on very small networks and is disadvantageous on networks of larger size.
A Spiral Model of Software Development and Enhancement
Authors: Barry W. Boehm
Venue: Computer (1988)

A short description is given of software process models and the issues they address. An outline is given of the process steps involved in the spiral model, an evolving risk-driven approach that provides a framework for guiding the software process, and its application to a software project is shown. A summary is given of the primary advantages and implications involved in using the spiral model and the primary difficulties in using it at its current incomplete level of elaboration.
Parallelization and Performance Analysis of the Cooley-Tukey FFT Algorithm for Shared-Memory Architectures
Authors: A. Norton, A. J. Silberger
Venue: IEEE Transactions on Computers (1987)

We present here a study of parallelization of the Cooley-Tukey radix two FFT algorithm for MIMD (nonvector) architectures. Parallel algorithms are presented for one and multidimensional Fourier transforms. From instruction traces obtained by executing Fortran kernels derived from our algorithms, we determined the precise instructions to be executed by each processor in the parallel system. We used these instruction races to predict the performance of the IBM Research Parallel Processing Prototype, RP3, as a computer of FFT's. Our performance results are depicted in graphs included in this paper.
Mapping a semantic database model to the relational model
Authors: Peter Lyngbaek, Victor Vianu
Venue: ACM SIGMOD Record (1987)

The connection between semantic database models and the relational model is formally investigated using the Iris Data Model, which has been implemented using relational database techniques. The results focus on properties of relational schemas that are translations of Iris schemas. Two new types of constraints, cross-product constraints and multiplicity constraints are introduced to characterize the relational translations of Iris schemas. The connection established between Iris and relational schemas also yields new, unexpected information about Iris schemas. In particular, a notion of equivalence of Iris schemas is defined using their relational translations, and a result is obtained on simplifying the type structure of Iris schemas.
A system for semantic query optimization
Authors: Sreekumar T. Shenoy, Z. Meral Ozsoyoglu
Venue: ACM SIGMOD Record (1987)

This paper describes a scheme to utilize semantic integrity constraints in optimizing a user specified query. The scheme uses a graph theoretic approach to identify redundant join clauses and redundant restriction clauses specified in a user query. An algorithm is suggested to eliminate such redundant joins and avoid unnecessary restrictions. In addition to these eliminations, the algorithm aims to introduce as many restrictions on indexed attributes as possible, thus yielding an equivalent, but potentially more profitable, form of the original query.
Augmenting Ada for SIMD Parallel Processing
Authors: Carolyn L. Cline, Howard J. Siegel
Venue: IEEE Transactions on Software Engineering (1985)

In order to program SIMD (single instruction stream-multiple data stream) parallel machines used for tasks such as speech and image processing, a language with explicit parallel constructs is often desirable. The language Ada, developed by the Department of Defense, is used here as a basis for such a language. Extensions of Ada, which allow the user to specify such operations as interprocessor communications and activation of processors, are proposed. These features are demonstrated by showing their use in a common speech processing algorithm, the parallel FFT.
Transient exponential-Erlang queues and steady-state simulation
Authors: W. David Kelton
Venue: Communications of the ACM (1985)

The transient probabilistic structure of M/Em/1 and Em/M/1 queues initialized in an arbitrary deterministic state is derived in discrete time. Computational algorithms for obtaining the required probabilities are provided, and their application in calculating a variety of system performance measures is illustrated. The results are used to investigate the question of initializing simulations of systems such as these to promote rapid convergence to steady state, if that is the object of the simulation. These results are consistent with earlier studies for transient queueing systems, such as the M/M/s, but allow greater flexibility in specification of interarrival or service-time models inherent in the Erlang distributions.
Design and specification of microprogrammed computer architectures
Authors: W. Damm
Venue: Proceedings of the 18th annual workshop on Microprogramming (1985)

This paper presents a hierarchical firmware design method. It allows to structure the design of a microprogrammed (level of a) computer architecture into independently verifiable modules. To specify the behaviour of the system we use the axiomatic architecture description language AADL. We illustrate the design and specification style using an emulation example.
A model and an architecture for a relational knowledge base
Authors: H. Yokota, H. Itoh
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

A relational knowledge base model and an architecture which manipulates the model are presented. An item stored in the relational knowledge base is called a term. A unification operation on terms in the relational knowledge base is used as the retrieval mechanism. The relational knowledge base architecture we propose consists of a number of unification engines, several disk systems, a control processor, and a multiport page-memory. The system has a knowledge compiler to support a variety of knowledge representations.
Using idle workstations in a shared computing environment
Authors: D. Nichols
Venue: Proceedings of the eleventh ACM Symposium on Operating systems principles (1987)

The Butler system is a set of programs running on Andrew workstations at CMU that give users access to idle workstations. Current Andrew users use the system over 300 times per day. This paper describes the implementation of the Butler system and tells of our experience in using it. In addition, it describes an application of the system known as gypsy servers, which allow network server programs to be run on idle workstations instead of using dedicated server machines.
Symbolic mathematical computation
Authors: Stephen Wolfram
Venue: Communications of the ACM (1985)

Standard programming languages are inadequate for the kind of symbolic mathematical computations that theoretical physicists need to perform. Higher mathematics systems like SMP address this problem.
The making of VIVID: a software engineering perspective
Authors: J. B. Rosenberg
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper is about the software engineering facets of the making of a large programming systems product for symbolic VLSI CAD called VIVID. Issues such as how teams were organized, how conceptual integrity was maintained, and portability are discussed. Specific tools are also described that were built to aid in the development of VIVID. Methods are explored that aid in managing large systems with many directories and huge numbers of files. Finally, techniques for debugging such a large system are discussed. This paper's goal is to share these tools, techniques and methods to improve the software engineering practices used by all developers of CAD as well as other large software systems.
A complete simplification package for the absolute value function in REDUCE
Authors: H Caprasse
Venue: ACM SIGSAM Bulletin (1986)

In all versions of REDUCE, the function ABS (i.e., absolute value) is either not defined in the algebraic mode or, when it is defined, assumes that the domain of its variable is the one of semi-definite positive real numbers. This implies that, for instance in REDUCE 3.2 [1], ABS( plusmn;X) simplifies to X.
Extension of record types
Authors: Niklaus Wirth
Venue: ACM SIGCSE Bulletin (1987)

Software systems represent a hierarchy of modules. Client modules contain sets of procedures that extend the capabilities of imported modules. This concept of extension is here applied to data types. Extended types are related to their ancestor in terms of a set hierarchy. Variables of an extended type form a subset of the variables of the ancestor type. This scheme is easily and efficiently implementable, and is manifest by two new language constructs only: the type test and the type guard.
Comments on "Detection of Faults in Programmable Logic Arrays"
Authors: L Ye-Wei, J Wei
Venue: IEEE Transactions on Computers (1986)

This correspondence shows two counter examples which contradict the Theorems 4 and 5 in [1].
Fast Search Algorithms for Associative Memories
Authors: W A Davis, D L Lee
Venue: IEEE Transactions on Computers (1986)

A new scheme for constructing search algorithms for bit-parallel associative memories of m n-bit words is described. The resulting equivalence searches, threshold searches, and double-limit searches achieve the time bound of O(log n), compared to O(n), the recent result of Ramamoorthy et al. [12]. The extremum search algorithm by Frei and Goldberg [2] is modified and generalized so that the number of memory interrogations is reduced by 30 percent over the initial algorithm in the average case.
Measuring Errors in Operational Analysis Assumptions
Authors: N. M. Bengtson
Venue: IEEE Transactions on Software Engineering (1987)

Operational analysis, an area of study first defined in the computer science field, has been used in the analysis of systems performance. System performance measures for a specific set of output data are obtained using operational analysis formulas derived from assumptions which are verifiable by the observed data. This paper gives relationships which may be used to quantify the errors in these assumptions. Additionally, basic propositions are given which help in understanding operational analysis assumptions. These propositions are used in developing correction terms which can be used to adjust performance measures so that their values are exact for a set of data no matter how much the assumptions used in deriving the performance measure relations are violated.
Federal funding in computer science: a preliminary report
Authors: Joel S. Yudken, Barbara Simons
Venue: ACM SIGGRAPH Computer Graphics (1988)

Dr. Joel S. Yudken is Director of the Project on Funding Policy in Computer Science. Dr. Barbara Simons, is vice-chair of the Special Interest Group on Automata and Computability Theory (SIGACT) of the Association for Computing Machinery (ACM). Dr. Simons is also chair of the Committee on Scientific Freedom and Human Rights of the ACM. This article is adapted from a paper presented at the Conference on Directions and Implications of Advanced Computing, sponsored by CPSR/Seattle in July.This study is sponsored by the Science Policy Committee of SIGACT. It has been partially funded by SIGACT, the MIT Lab for Computer Science, the Rockefeller Family Associates and the SIG chairs and SIGBOARD. It has also been endorsed by the executive committees of SIGGRAPH, the Association for Women in Mathematics, the IEEE Society on Social Implications of Technology and Computer Professional for Social Responsibility. The authors of this report assume full responsibility for its content. It does not necessarily represent the views of the sponsoring, contributing or endorsing organizations.
The microarchitecture of a capability-based computer
Authors: D. A. Abramson, J. Rosenberg
Venue: Proceedings of the 19th annual workshop on Microprogramming (1986)

This paper describes the micro-architecture of a microprogrammed workstation called MONADS-PC. The system has been specifically designed to support a very large uniform virtual memory, capability-based addressing and information hiding software modules with procedural interfaces. The paper gives a brief introduction to these topics followed by implementation details of the system.
Extending State Transition Diagrams for the Specification of Human-Computer Interaction
Authors: Anthony I. Wasserman
Venue: IEEE Transactions on Software Engineering (1985)

User Software Engineering is a methodology for the specification and implementation of interactive information systems. An early step in the methodology is the creation of a formal executable description of the user interaction with the system, based on augmented state transition diagrams. This paper shows the derivation of the USE transition diagrams based on perceived shortcomings of the "pure" state transition diagram approach. In this way, the features of the USE specification notation are gradually presented and illustrated. The paper shows both the graphical notation and the textual equivalent of the notation, and briefly describes the automated tools that support direct execution of the specification.
Computing with structured connectionist networks
Authors: Jerome A. Feldman, Mark A. Fanty, Nigel H. Goddard, Kenton J. Lynne
Venue: Communications of the ACM (1988)

The design and applications of massively parallel computational models could lead to dramatic advances in the ability to automate complex tasks such as those found in artificial intelligence.
Some observations on the performance of a 56 Kbit internet link
Authors: D Farber, L Cassel
Venue: ACM SIGCOMM Computer Communication Review (1987)

A 56 Kb gateway between two Ethernets was installed and subjected to heavy traffic loads. While large file transfers were being done between the networks, less demanding internetwork commands were issued and the response time measured. The effect of the heavy network load on the smaller tasks is presented in this report. It appears that the smaller tasks are unfairly penalized for the network load caused by the larger tasks. If so, this could be a problem for the design and use of the backbone network of the NSFnet. No conclusions are drawn concerning the applicability of these results in a general case. The data is presented for consideration by those who are planning to rely on such links and have some knowledge of the level of traffic that can be expected in their own environment.
Optimization of nested SQL queries revisited
Authors: Richard A. Ganski, Harry K. T. Wong
Venue: ACM SIGMOD Record (1987)

Current methods of evaluating nested queries in the SQL language can be inefficient in a variety of query and data base contexts. Previous research in the area of nested query optimization which sought methods of reducing evaluation costs is summarized, including a classification scheme for nested queries, algorithms designed to transform each type of query to a logically equivalent form which may then be evaluated more efficiently, and a description of a major bug in one of these algorithms. Further examination reveals another bug in the same algorithm. Solutions to these bugs are proposed and incorporated into a new transformation algorithm, and extensions are proposed which will allow the transformation algorithms to handle a larger class of predicates. A recursive algorithm for processing a general nested query is presented and the action of this algorithm is demonstrated. This algorithm can be used to transform any nested query.
A Multiple Valued Logic: A Tutorial and Appreciation
Authors: Kenneth C. Smith
Venue: Computer (1988)

This tutorial places the developments and potential of multiple-valued signals and logic in the relevant context of binary and two-valued signals. It covers: the role of multivalued logic (MVL) in the binary world; multivalued representation; binary-related radices; multivalued functions; storage techniques in MVL; and implementation issues. An overview of applications is included.
The impact of electronic mail on managerial and organizational communications
Authors: Mary Sumner
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

The primary objectives of this study were to determine how an electronic mail system was being used by manager and professionals in a business setting and to describe its cognitive, affective and behavioral impacts. The organizational impacts reported by the respondents were compared with research-based evidence reported by experts in an earlier study by Kerr and Hiltz. The results showed that electronic mail was used extensively to displace phone calls and memos particularly for &ldquo;organizing&rdquo; activities, such as scheduling events, asking questions, and providing feedback. The experiences of the users showed that electronic mail reduced lag times in distributing information, created more flexible working hours, and provided lateral linkages throughout the organization. More pervasive social impacts of electronic mail, such as changes in social structure, expansion in group size, and increase in span of control, were not experienced to a marked degree.
A multitasking switchboard approach to user interface management
Authors: Peter P. Tanner, Stephen A. MacKay, Darlene A. Stewart, Marceli Wein
Venue: ACM SIGGRAPH Computer Graphics (1986)

A Switchboard model of user input management is presented which takes advantage of opportunities afforded by a multitasking multiprocessor programming environment. This model further separates application programming from the programming of the interaction dialogues as compared with conventional user interface management systems. It also provides powerful tools for implementing parallel forms of input, is suitable for managing interaction in window-based systems, and is very flexible.The paper describes this Switchboard model and its implementation on top of the Harmony operating system, as well as discussing some of the graphics support needed for the model.
Performance analysis of recovery techniques
Authors: Andreas Reuter
Venue: ACM Transactions on Database Systems (TODS) (1984)

Various logging and recovery techniques for centralized transaction-oriented database systems under performance aspects are described and discussed. The classification of functional principles that has been developed in a companion paper is used as a terminological basis. In the main sections, a set of analytic models is introduced and evaluated in order to compare the performance characteristics of nine different recovery techniques with respect to four key parameters and a set of other parameters with less influence. Finally, the results of model evaluation as well as the limitations of the models themselves are discussed.
A study of dynamic load balancing in a distributed system
Authors: A Hac, T Johnson
Venue: Proceedings of the ACM SIGCOMM conference on Communications architectures protocols (1986)

This paper presents a study of a distributed system consisting of a number of hosts connected by a local area network. The system model is based on the LOCUS distributed file system. The LOCUS file system allows replicated files, and the synchronization policy is enforced by the use of the Centralized Synchronization Sites (CSS). All requests to open a file for access must be sent to the file's CSS which checks for access conflicts. Our simulation model allows process migration. The focus of this study is on load balancing as applied to optimal process and read site placement. An algorithm is proposed that increases system performance through load balancing. This algorithm uses data collected by the system on which to base its decisions. The characteristics of the algorithm and their effects on system performance are analyzed and discussed.
Language Support for Loosely Coupled Distributed Programs
Authors: Michael L. Scott
Venue: IEEE Transactions on Software Engineering (1987)

A distributed operating system encourages a style of programming in which independently developed processes interact in a nontrivial fashion at run time. Server processes, for example, must deal with clients that they do not understand, and certainly cannot trust. Interprocess communications can be written in a traditional, sequential language with direct calls to kernel primitives, but the result is both cumbersome and error-prone. Convenience and safety are offered by the many distributed languages proposed to date, but in a form too inflexible for anything other than the pieces of a single distributed program. A new language known as LYNX overcomes the disadvantages of both these previous approaches. Novel features of LYNX address problems encountered in the course of practical experience, writing distributed programs without high-level language support. Chief among these features are a virtual circuit abstraction called the link, and an unconventional coroutine mechanism that allows a server to maintain nested contexts for interleaved conversations with an arbitrary number of clients.