ppxscal/embedding_network huggingface dataset:
Proteus-1: a general accelerator for CAD
Authors: S. P. Smith, B. Wood, J. Little, P. Hunter
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

The architecture of a low cost, highly flexible, general accelerator for Electronic Computer Aided Design (CAD) is presented. Previously reported special purpose compute engines for CAD addressed only one specific application (typically, logic simulation). In contrast, the Proteus-1, a dynamically reconfigurable multi-processor with both distributed and shared memory, significantly accelerates the low level operations fundamental to a variety of CAD applications. As a result of this approach, Proteus-1 maintains a high degree of flexibility while also achieving substantial performance gains over conventional mainframes. Logic simulation results are offered in support of these conclusions.
Towards Complexity Metrics for Ada Tasking
Authors: Sol M. Shatz
Venue: IEEE Transactions on Software Engineering (1988)

Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity.
Scale and performance in a distributed file system
Authors: J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan Robert N. Sidebotham M. West
Venue: ACM SIGOPS Operating Systems Review (1987)

Andrew is a distributed computing environment being developed in a joint project by Carnegie Mellon University and IBM. One of the major components of Andrew is a distributed file system which constitutes underlying mechanism for sharing information. The goals of the Andrew file system are to support growth up to at least 7000 workstations (one for each student, faculty member, and staff at Carnegie Mellon) while providing users, application programs, and system administrators with the amenities of a shared file system.A fundamental result of our concern with scale is the design decision to transfer whole files between servers and workstations rather than some smaller unit such as records or blocks, as almost all other distributed file systems do. This paper examines the consequences of this and other design decisions and features that bear on the scalability of Andrew.Large scale affects a distributed system in two ways: it degrades performance and it complicates administration and day-to-day operation. This paper addresses both concerns and shows that the mechanisms we have incorporated cope with them successfully. We start the initial prototype of the system, what we learned from it, and how we changed the system to improve performance. We compare its performance with that of a block-oriented file system, Sun Microsystems' NFS, in order to evaluate the whole file transfer strategy. We then turn to operability, and finish with issues related peripherally to scale and with the ways the present design could be enchanced.
Cognitive style, personality type, and learning ability as factors in predicting the success of the beginning programming student
Authors: Larry S Corman
Venue: ACM SIGCSE Bulletin (1986)

The Myers-Briggs Type Indicator, Group Embedded Figures Test, the Learning Style Inventory, and a Type A-B Questionnaire were administered to introductory COBOL students along with marketing students to determine if results from these instruments would improve the predictability of student success in computer science. Demographic data was also gathered on the 83 subjects similarly to prior studies. No significant new findings were found in this study; the strongest variable was a student's major grade point average.
A Quantitative Comparison of the Performance of Three Discrete Distributed Associative Memory Models
Authors: Gardiner S. Stiles, Dong-Lih Denq
Venue: IEEE Transactions on Computers (1987)

Monte Carlo methods have been used to study the recall accuracy of three discrete distributed associative memory models: a discrete correlation matrix model (DCM), the Bayes discriminant rule model developed by Murakami and Aibara (MA), and a discrete version of the generalized inverse model of Kohonen (DGI). The key (input) and data (output) vectors have nc components restricted to the values - 1 and + 1. The elements of the nc × nc recall matrix may take on any floating point value. Auto-associative (key and data vectors identical) and hetero- associative operation have been examined with both noiseless (perfect) and noisy key vectors. Simulations have been performed over a range of nc from 20 to 100 and of nv, the number of vector pairs stored, from 1 to 50. The recall accuracy, defined as the probability that a component of the output vector is correct, depends strongly on the ratio nv/nc. The DGI model is the only one able to provide perfect hetero-associative recall with perfect input for nv = nc, but is extremely sensitive to input noise. If the probability that a component of the input vector is correct is 0.9 the three models will provide perfect output only if nv is less than about 0.15 nc. For more noisy inputs the MA model provides the highest probability that a component of the output will be correct.
Wide channel computers
Authors: Stanley Lass
Venue: ACM SIGARCH Computer Architecture News (1987)

The wide channel design approach integrates vector and general purpose computing. Wide word accesses to a cache move several instructions per access or a few operands per access, thereby allowing a slower and somewhat larger cache. Channel commands control the movement of wide words in wide channels. Wide channels load data, vectors, instructions, and channel commands over wide channels to channel registers. Arithmetic unit operations are performed on the data in channel registers. Wide channels store data and vectors from channel registers.
Disk scheduling in System V
Authors: Robert Geist, Robert Reynolds, Eve Pittard
Venue: Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1987)

A variety of disk scheduling algorithms, including some newly defined ones, are compared both in simulation and in tests on a real machine running UNIX* System V. In the real system tests, first-come first-served (FCFS), shortest seek time first (SSTF), and the standard System V algorithm (SVS) are all seen to yield relatively poor mean waiting time performance when compared to the VSCAN(0.2) algorithm and modifications thereof suggested by Coffman. Nevertheless, each is seen to excel along a particular performance dimension. The adequacy of open, Poisson arrival simulation models in predicting disk scheduling performance is questioned, and an alternative arrival model is suggested which offers improved predictions in the System V environment.
Analyzing surfaces: the truth about elimination theory
Authors: A. Schwartz, C. M. Stanton
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

In this paper we discuss the relationship between parametric and implicit representations of algebraic surfaces. This problem is fundamental in computer graphics and computer aided design. In addition to presenting our results, we are trying to expose a number of basic mathematical ideas and techniques that are useful in the theory of algebraic surfaces from the point of view of graphics. We also hope that this paper can serve as a useful, although necessarily only partial, introduction to the study of algebraic surfaces. We use extended versions of Sylvester's resultant to present a precise and accessible proof that a surface in C3 with a rational parameterization of degree n, is defined by a polynomial equation F(x1,x2,x3) = 0 of degree N &le; n2. We make no claim that this result is original, although we have not found it anywhere. In addition to the calculus of resultants we use some field theory and Bezout's Theorem. We discuss some examples of surfaces from this point of view, and we prove that the real torus has no parameterization of degree n < 4.
Tuple sequences and lexicographic indexes
Authors: Serge Abiteboul, Seymour Ginsburg
Venue: Journal of the ACM (JACM) (1986)

The concept of a tuple sequence is introduced in order to investigate structure connected with relational model implementation. Analogs are presented for the relational operations of projection, join, and selection, and the decomposition problem for tuple sequences is considered. The lexicographical ordering of tuple sequences is studied via the notion of (lexicographic) index. A sound and complete set of inference rules for indexes is exhibited, and two algorithmic questions related to indexes examined. Finally, indexes and functional dependencies in combination are studied.
The decision problem for the probabilities of higher-order properties
Authors: P. Kolaitis, M. Vardi
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

The probability of a property on the class of all finite relational structures is the limit as n &rarr; &infin; of the fraction of structures with n elements satisfying the property, provided the limit exists. It is known that 0-1 laws hold for any property expressible in first-order logic or in fixpoint logic, i.e. the probability of any such property exists and is either 0 or 1. It is also known that the associated decision problem for the probabilities is PSPACE-complete and EXPTIME-complete for first-order logic and fixpoint logic respectively. The 0-1 law fails, however, in general for second-order properties and the decision problem becomes unsolvable. We investigate here logics which on the one hand go beyond fixpoint in terms of expressive power and on the other possess the 0-1 law. We consider first iterative logic which is obtained from first order logic by adding while looping as a construct. We show that the 0-1 law holds for this logic and determine the complexity of the associated decision problem. After this we study a fragment of second order logic called strict &Sgr;11. This class of properties is obtained by restricting appropriately the first-order part of existential second-order sentences. Every strict &Sgr;11 property is NP-computable and there are strict &Sgr;11 properties that are NP-complete, such as 3-colorability. We show that the 0-1 law holds for strict &Sgr;11 properties and establish that the associated decision problem is NEXPTIME-complete. The proofs of the decidability and complexity results require certain combinatorial machinery, namely generalizations of Ramsey's Theorem.
Efficient solutions to the replicated log and dictionary problems
Authors: Gene T J Wuu, Arthur J Bernstein
Venue: ACM SIGOPS Operating Systems Review (1986)

We propose efficient algorithms to maintain a replicated dictionary using a log in an unreliable network. A non-serializable approach is used to achieve high concurrency. The solutions are resilient to both node and communication failures. Optimizations are developed for networks which are not completely connected.
A federated architecture for information management
Authors: Dennis Heimbigner, Dennis McLeod
Venue: ACM Transactions on Information Systems (TOIS) (1985)

An approach to the coordinated sharing and interchange of computerized information is described emphasizing partial, controlled sharing among autonomous databases. Office information systems provide a particularly appropriate context for this type of information sharing and exchange. A federated database architecture is described in which a collection of independent database systems are united into a loosely coupled federation in order to share and exchange information. A federation consists of components (of which there may be any number) and a single federal dictionary. The components represent individual users, applications, workstations, or other components in an office information system. The federal dictionary is a specialized component that maintains the topology of the federation and oversees the entry of new components. Each component in the federation controls its interactions with other components by means of an export schema and an import schema. The export schema specifies the information that a component will share with other components, while the import schema specifies the nonlocal information that a component wishes to manipulate. The federated architecture provides mechanisms for sharing data, for sharing transactions (via message types) for combining information from several components, and for coordinating activities among autonomous components (via negotiation). A prototype implementation of the federated database mechanism is currently operational on an experimental basis.
Adapting not adopting a curriculum
Authors: Alonso Villegas
Venue: ACM SIGCSE Bulletin (1986)

This paper presents the background of computer science programs in the Dominican Republic and show how the curriculum at Universidad Catolica Madre y Maestra was chosen.
Reliability Optimization in the Design of Distributed Systems
Authors: C. S. Raghavendra, Salim Hariri
Venue: IEEE Transactions on Software Engineering (1985)

The reliability of a distributed system depends on the reliabilities of its communication links and computing elements, as well as on the distribution of its resources, such as programs and data files. A useful measure of reliability in distributed systems is the terminal reliability between a pair of nodes which is the probability that at least one communication path exists between these nodes. An interesting optimization problem is that of maximizing the terminal reliability between a pair of computing elements under a given budget constraint. Analytical techniques to solve this problem are applicable only to special forms of reliability expressions. In this paper, three iterative algorithms for terminal reliability maximization are presented. The first two algorithms require the computation of terminal reliability expressions, and are therefore efficient for only small networks. The third algorithm, which is developed for large distributed systems, does not require the computation of terminal reliability expressions; this algorithm maximizes approximate objective functions and gives accurate results. Several examples are presented to illustrate the approximate optimization algorithm and an estimation of the error involved is also given.
On Multiple Random Accesses and Physical Data Placement in Dynamic Files
Authors: J. H. Wang, T. S. Yuen, D. H. C. Du
Venue: IEEE Transactions on Software Engineering (1987)

In the study of data storage and retrieval involving secondary storage devices, for example, magnetic disks, a simplified model of storage that is often used is that each access takes a constant amount of time. However, if some information about the accesses is known, the model should take into consideration the inherent characteristics of the storage devices. In this paper, we assume a more refined model of storage that takes into consideration the seek time, the latency time, and the transmission time of disk accesses separately. We analyze the time required to randomly access a set of records residing on a set of consecutive cylinders on a magnetic disk a number of times, say n, for n = 1. This problem may arise, for example, in the processing of queries that involve several relations in a relational database system. We also analyze the more general situations in which the n operations may represent retrievals, insertions, or deletions, or a combination of them. We assume that the dynamic file structure linear hashing is used for locating and organizing the records. A linear hashing file does not employ any directory and its primary data buckets are assumed to be contiguous, therefore the data area of a linear hashing file corresponds closely to the disk space on a set of consecutive cylinders.
Realistic fault modeling for VLSI testing
Authors: W. Maly
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Functional failures of VLSI circuits are caused by process-induced defects. Such defects have very complex physical characteristics and may be significantly different from the simplistic defect models assumed by typical fault modeling techniques. In the tutorial an overview of the actual mechanisms causing processing defects, and the defects' electrical manifestations will be discussed. It will be demonstrated that inadequate insight into the physics of processing defects and the manufacturing process may lead to inefficient testing of actual VLSI circuits.
Data flow graph partitioning to reduce communication cost
Authors: C. Koutsougeras, C. A. Papachristou, R. R. Vemuri
Venue: Proceedings of the 19th annual workshop on Microprogramming (1986)

This paper presents a cost-effective scheme for partitioning large data flow graphs. Standard data flow machine architectures are assumed in this work. The objective is to reduce the overhead due to token transfers through the communication network of the machine. When this scheme is employed on large graphs, the load distribution on the rings of the data flow machine is also improved. A canonical form of a data flow graph is introduced to establish the relationship between the communication overhead and the size reduction of the partition cut-set. General lower estimates on the overhead are derived in terms of processing and transmission delay parameters of the machine. The method uses heuristics and an evaluation function to guide the partition algorithm. Some implications of the proposed method on the organization of the data flow machines are discussed.
Optimiizing Static Scope Lisp by Repetitive Interpretation of Recursive Function Calls
Authors: Kay-Ulrich Felgentreu, Wolfram-M. Lippe, Friedemann H. Simon
Venue: IEEE Transactions on Software Engineering (1987)

This paper presents some recent results in interpreter optimization. The techniques of shallow binding and repetitive interpretation of tail recursive functions are adapted to Lisp with static scoping as the binding method for-all identifiers. Then a new technique of interpreting" covered tail recursive" functions is proposed. The purpose of the paper is to show that the extra expense for static scoping can be kept small by combining these techniques.
Personal and professional growth in a user services career
Authors: Jeb Lawson
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

The commitment one makes to become part of a user services staff tends to be long term. This paper will examine what avenues are available for both career advancement and personal growth. A number of user related jobs in Private Industry have been created in the past years. A portion of this paper will look at parallel and new industry jobs and the differences in salaries and responsibilities those jobs have compared to University Positions. Also, personal growth can be a very attractive &ldquo;perk&rdquo; from a job. Which environment is more likely to provide and foster that personal growth will also be discussed.
Order-preserving key transformations
Authors: Anil K. Garg, C. C. Gotlieb
Venue: ACM Transactions on Database Systems (TODS) (1986)

File organizations based on conventional hash functions provide faster access to the stored records in comparison with tree-like file structures. Tree structures such as B+-trees and ISAM do provide for sequential processing, but require considerable storage for the indices. When sequential processing is needed a table that performs an order-preserving transformation on keys can be used. H is an order-preserving key transform if H(K1) &ges; H(K2), for all keys K1> K2. We present methodologies for constructing such key transforms, and illustrate them for some real-life key sets. Storage requirements for the table needed to carry out the transformation are less than those needed for the indices.
Superscalar vs. superpipelined machines
Authors: Norman P. Jouppi
Venue: ACM SIGARCH Computer Architecture News (1988)

The performance and implementation cost of superscalar and superpipelined machines are compared. Superscalar machines can issue several instructions per cycle. Superpipelined machines can issue only one instruction per cycle, but they have cycle times shorter than the time required for any operation. Both of these techniques exploit instruction-level parallelism, which is often limited in many applications. Superpipelined machines are shown to have better performance and less cost than superscalar machines.
The impact of interactive application development with CODESTAR
Authors: Robert Fisher
Venue: ACM SIGMETRICS Performance Evaluation Review (1987)

Many companies are currently plagued with the problem of not being able to deliver information systems quickly enough to meet business opportunities. Management is generally dissatisfied with the development cycle time, and backlogs are often two years or more. Texas Instruments has a strategic program to solve this problem by developing an integrated set of tools to automate the systems life cycle of analysis, design, construction and maintenance, and to reduce associated costs.CODESTAR, the first major tool to be completed (currently for use only at TI), addresses both construction and maintenance. It supports applications ranging from simple to complex and can be used for the development of IMS, batch and TSO applications. For example, the current CODESTAR was developed using the previous CODESTAR.A pilot project assessed the impact of CODESTAR. The project's scope included the construction, checkout and installation of a 20-screen IMS transaction system involving 6,000 lines of code. The project had originally been designed, scheduled and budgeted for a non-CODESTAR methodology.Results were impressive. Both elapsed time and manpower were reduced by 50 percent, while computer costs decreased slightly.
Human computer interaction in the year 2000
Authors: J. Thomas, J. S. Brown, W. Buxton, B. Curtis, T. Landauer
Venue: ACM SIGCHI Bulletin (1986)

Much of the work in the field of computer human interaction consists of finding out what is wrong with existing interfaces or which of several existing alternatives is better. Over the next few decades, the possibilities for computer human interaction will explode. This will be due to: 1) continued decrease in the costs of processing and memory, 2) new technologies being invented and existing technologies (e.g., handwriting recognition, speech synthesis) being extended, 3) new applications and 4) new ideas about how people can interact with computers. While changes along these lines are bound to occur, we need not take the view that investigators in human-computer interaction are to be passive observers of some uncontrolled and uncontrollable evolution. Indeed, we can help steer this process by visions of what the future of human computer interaction could and should be like.
Nontraversible Paths in a Program
Authors: Mallika Chellappa
Venue: IEEE Transactions on Software Engineering (1987)

A finite-state machine representation of a program graph is shown to have the property of exposing nontraversible paths in a program. A minimal covering set of paths for such a program may fail to yield realizable test cases, as the nontraversible paths have inconsistent path predicates.
A Simple Method for Determining Hadamard Sequency Vectors
Authors: Mansour I. Irshid
Venue: IEEE Transactions on Computers (1988)

A simple method for determining the sequency ordering of any row in any Hadamard matrix directly from its binary representation is developed. This proposed method is proved to be much simpler than the well-known bit-reverse inverse Gray code method.
On the number of faces in higher-dimensional Voronoi diagrams
Authors: R. Seidel
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

We give exact upper bounds for the number of i-dimensional faces of Euclidean furthest point Voronoi diagrams of n points in Rd.