ppxscal/embedding_network huggingface dataset:
Study of multistage SIMD interconnection networks
Authors: Howard Jay Siegel, S. Diane Smith
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Four SIMD multistage networks - Feng's data manipulator, STARAN flip network, omega network, and indirect binary n-cube&mdash;are analyzed. Three parameters - topology, interchange box, and control structure&mdash;are defined. It is shown that the latter three networks use equivalent topologies and differences in their capabilities result from the other parameters. An augmented data manipulator network using a modified control structure to perform more single pass interconnections than the other networks is presented. Some problems may be solved more efficiently if the 2n processing elements of an SIMD machine can be partitioned into submachines of size 2r. Single and multiple control partitioning are defined. The capabilities of these multistage networks to perform in these partioned environments are discussed.
A syntax-directed logic simulator
Authors: Charles M. Allen, Donald D. Givone, William M. Horner, Robert W. Snelsire
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

A syntax directed compiler to simulate digital systems is described. The compiler has been written in Fortran IV for the IBM 7044, and is capable of simulating digital systems containing up to approximately 2500 logic elements. It is a two pass compiler. During the first pass it scans the source statements by using the Backus Normal Form definition of allowed syntax. From this a coded description of the program is constructed. During the second pass this coded program description is used to generate machine code in an order suitable for system simulation. The system being simulated is then evaluated on the basis of its cost and ability to satisfy predetermined input-output requirements.
Cellular image processing techniques for VLSI circuit layout validation and routing
Authors: T. N. Mudge, R. A. Rutenbar, R. M. Lougheed, D. E. Atkins
Venue: Proceedings of the 19th Design Automation Conference (1982)

The architecture of the Cytocomputer?, an existing special-purpose, pipelined cellular image processor, is described. A formalism used to express cellular operations on images is then given. Cellular image processing algorithms are then developed that perform (1) design rule checks (DRC's) on VLSI circuit layouts, and (2) Lee-type wire routing. Two sets of cellular image processing transformations for checking the Mead and Conway design rules and for Lee-routing have been defined and used to program the Cytocomputer. Some experimental results are shown for these cellular implementations.
Computer-aided design of mechanical linkages
Authors: Victor Rappaport
Venue: Proceedings of the 1971 26th annual conference (1971)

An interactive computer-aided design system for kinematic analysis of mechanical linkages in three-dimensional space is described. The design system affords the designer a wide range of capabilities including the conceptual definition of a linkage by its linkage bodies, constraints, and loops, the visualization of a linkage by means of wire frame representations of linkage components, and the performance of position analyses of a linkage's motions. The system makes use of computer graphics in an inter-active environment to provide the output and visual displays which contribute to the comprehension and analyzation of a linkage. The system has been adapted to assist in the design of mechanical linkages with constraints and configurations particularly suitable for analysis under the present system's capabilities. This has proven to be a significant technological advancement over previous methods of designing a linkage in a production environment in which many manual drafting layouts were required to check out the operation and proper functioning of a given design.
Software for interactive on-line conferences
Authors: Sunil K. Sarin, Irene Greif
Venue: Proceedings of the second ACM-SIGOA conference on Office information systems (1984)

A layered architecture for the implementation of real-time conferences is presented. In a real-time conference a group of users each at his or her own workstation, share identical views of on-line application information. The users cooperate in a problem solving task by interactively modifying or editing the shared view or the underlying information, and can use a voice communication channel for discussion and negotiation. The lower layer in this architecture, named Ensemble, supports the sharing of arbitrary application-defined objects among the participants of a conference, and the manipulation of these objects via one or more application-defined groups of commands called activities. Ensemble provides generic facilities for sharing objects and activities, and for dynamically adding and removing participants in a conference; these can be used in constructing real-time conferencing systems for many different applications. An example is presented of how the Ensemble functions can be used to implement a shared bitmap with independent participant cursors. The relation between this layered architecture and the ISO Open Systems Interconnection reference model is discussed. In particular, it is argued that Ensemble represents a plausible first step toward a Session-layer protocol for &ldquo;multi-endpoint connections&rdquo;, a neglected area of communication protocol development.
How acceptable are computers to professional persons?
Authors: Elizabeth Zoltan
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Although our lives are all touched by computers these days, a great many people seem to be ambivalent about them, either fearing them or exhibiting reluctance about interacting with them. The most relevant study about attitudes towards computers was conducted by Lee [1] in 1963. He found two major orthogonal factors: the computer viewed as a beneficial tool of man, and as a superhuman thinking machine that downgrades man's previously unique significance in the order of things. Not only have computers changed quite dramatically since 1963, they have also become increasingly common. It would seem likely then that attitudes towards computers have also changed and hence need to be re-evaluated in the present decade. In this study, the attitudes of certified public accountants (CPAs), lawyers, pharmacists, and physicians were investigated. Professionals were studied because many marketing and electronics analysts have commented that industry is currently designing computers for professional persons [2]. Computer availability, however, does not necessarily lead to computer acceptability. Therefore, the primary question this study sought to answer was - how acceptable are computers to professional persons?
Translating data base procedures
Authors: Eric Kintzer
Venue: Proceedings of the 1975 annual conference (1975)

One of the fastest growing areas in computer science today is the development and application of data base management systems (DBMS). These systems collect and maintain data in user-specified relationships in support of various interrelated applications. They provide a high level interface between application programs and the actual data to isolate the user from such operations as physical I/O, buffering and pointer manipulation. As new DBMSs are being developed with greater capabilities and features, users of existing DBMSs may wish to convert their application programs and the data bases to operate on the new system software. If the up-grading decision is made, all of the data and all of the application programs must be migrated to the new DBMS. Migration of DBMS involves all aspects connected with the stored data. The schema of the data, the data definition language, the application procedures as well as the physical data items must be converted in some fashion so that the new DBMS functions as desired. Migration is an expensive undertaking especially if a different manufacturer's hardware is to be acquired. In the past when users converted from one file organization to another file organization (example: Honeywell's ISP to IBM's ISAM), specialized programs were written to translate the data between file systems. In addition, all the old application programs were re-written or modified so that they would operate on the new file organization. If you multiply an individual data processing shop's efforts to convert by the number of computer installations that undergo a system conversion, an enormous expense has been incurred. In the future, it is foreseeable that even greater expenses will be incurred in order to change from an existing DBMS to a new DBMS.
Computing failure: A learning experience
Authors: Robert L. Glass
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

Computing people can learn from failure as well as success. Most professional papers deal only with the latter ... yet it is well known that some of our most lasting learning experiences are based on failure. This paper is a lighthearted, anecdotal discussion of a computing failure, with an underlying message that sharing the sometimes embarrassing truths about What Goes Wrong In Our Field is at least as illuminating as more serious discussions about Things That Look Promising. There are some necessary defense mechanisms to be dealt with in discussing failure. People who have failed in general do not want the world to know about it. Perhaps even more so, companies which have failed also do not want the world to know about it. As a result, the content of this paper is fictionalized to some extent. That is, company names and people names are creations of the author, and there are corresponding distortions in some story details. However, the computing meat of the paper, the basis for the failure learning experience, is untouched.
Review without violence
Authors: Lori Buffum
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The review process for a technical document is a harrowing experience for all involved. Some techniques do exist however, that can ease the pains and smooth the path to a well-done and accurate final product. The responsibility for using these techniques rests with many people: the editor who solicits review comments, the technical expert who must correct inaccuracies, the interested party who has another perspective on the subject, the manager who must approve the piece. Each of these people reviews documents for different reasons and to make unique contributions to the finished document; but, some practical techniques can be employed by all of them to make the most of their contributions and, in fact, to make their jobs easier. This paper talks to and about the two protagonists - the editor and the reviewer.
Negation can be exponentially powerful
Authors: L. G. Valiant
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Among the most remarkable algorithms in algebra are Strassen's algorithm for the multiplication of matrices and the Fast Fourier Transform method for the convolution of vectors. For both of these problems the definition suggests an obvious algorithm that uses just the monotone operations + and &times;. Schnorr [18] has shown that these algorithms, which use &thgr;(n3) and &THgr;(n2) operations respectively, are essentially optimal among algorithms that use only these monotone operations. By using subtraction as an additional operation and exploiting cancellations of computed terms in a very intricate way Strassen showed that a faster algorithm requiring only O(n2.81) operations is possible. The FFT method for convolution achieves O(nlog n) complexity in a similar fashion. The question arises as to whether we can expect even greater gains in computational efficiency by such judicious use of cancellations. In this paper we give a positive answer to this, by exhibiting a problem for which an exponential speedup can be attained using {+,&minus;,&times;} rather than just {+,&times;} as operations. The problem in question is the multivariate polynomial associated with perfect matchings in planar graphs. For this a fast algorithm is implicit in the Pfaffian technique of Fisher and Kasteleyn [6,8]. The main result we provide here is the exponential lower bound in the monotone case.
APL and the search for truth: A set of functions to play New Eleusis
Authors: Michael J.A. Berry
Venue: ACM SIGAPL APL Quote Quad (1981)

New Eleusis is a card game used to study problem solving techniques. In 1977, the inventor of the game characterised efforts to get a computer to win at it as &ldquo;doomed to failure.&rdquo; The expressive power of APL combined with the use of nested arrays has enabled the author to confound that prediction, suggesting that APL is a good language for research in Artificial Intelligence.
A five course sequence for Information Systems
Authors: Robert A. Barrett
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The organization and outline for the Information Systems in the Computer Science program is shown. The interfaces between the course sequence for Information Systems and the courses in Computer Science are shown. How the sequence meets the ACM standards for Information Systems are also shown. The methods and approaches to teaching the five course sequence is also shown. The Information Systems option is very important in our university setting where almost all of our graduates at the two year level go directly to the work place and then continue their education on a part-time basis for their four-year degree.
Micromultiprocessing of a single instruction stream
Authors: Ross Pavlac
Venue: Proceedings of the ACM annual conference (1973)

It is often desirable to increase both flexibility and speed of the processing of a stream of machine language instructions. Additional hardware can be added, but after a certain point loss of flexibility and added complexity make it undesirable. Microprogramming offers a means of achieving high flexibility and low complexity. Combining microprogramming and multiprocessing (micromultiprocessing) offers possibilities of increase in speed with moderate increase in cost over uniprocessing. Leapfrogging 1, balanced pipelining 2, and queued graphing(new) are examples of some approaches to micromultiprocessing that have been explored. In each approach, different tradeoffs are involved and many questions need further investigation.
Design and evaluation of a relational data base machine employing advanced data structures and algorithms
Authors: Y. Kiyoki, K. Tanaka, H. Aiso, N. Kamibayashi
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper presents the architecture design and evaluation of a relational machine employing advanced data structures and algorithms to manipulate set-level operations required in a relational model. We have developed data structures and algorithms that are suitable for VLSI-oriented parallel processing. The data structure called VTF (valid tuple flags) is a simple bit string that is used to distinguish valid tuples from invalid ones. VTF helps to reduce the cost to recognize the valid tuples, to minimize the memory requirement, and to avoid constructing a temporary relation as a result of executed relational operations. By extending concepts of VTF, we have established an advanced processing method based on efficient data structures and algorithms that could avoid reconstructing relations and numbers of iterative searches required in accomplishing relational operations. This paper describes basic concepts of VTF, an efficient processing method using VTF, design of a relational machine architecture introducing this method, and performance evaluations of the method and the architecture. Basic concepts and extended concepts of the method incorporated with VTF will provide strong foundations on architecture design of a relational machine.
Methods for hierarchical automatic layout of custom LSI circuit masks
Authors: B. T. Preas, C. W. Gwyn
Venue: Proceedings of the 15th Design Automation Conference (1978)

A new automatic IC mask layout code is described which avoids most of the problems inherent in the present generation of layout codes such as lack of flexibility, inefficient use of area, and restricted design complexity. The structured hierarchical layout approach, construction graphs, and placement and routing algorithms are outlined.
Inspection Department manpower planning using simulation models
Authors: John Quackenbush
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper presents two points of interest. The first is a relatively straightforward application of a simulation study to help solve a problem of understanding and planning manpower requirements in an Inspection Department. The second is an account of the problems encountered by the managers associated with this Inspection Department in preparing a simulation model with only a minimum of assistance from professional computer programmers.
Fortran tools
Authors: Leon Presser
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

This paper outlines an integrated set of Fortran tools that are commercially available. The basic purpose of various tools is summarized and their economic impact highlighted. The areas addressed by these tools include: code auditing, error detection, program portability, program instrumentation, documentation, clerical aids and quality assurance.
A Modification Request Control System
Authors: D. B. Knudsen, A. Barofsky, L. R. Satz
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Modification Request Control System (MRCS) tracks and reports project change requests and resulting activity through interactive input and extraction of change request data from computer files. MRCS is one of the tools available as part of the Programmer's Workbench (PWB). It was developed to aid in the timely control and coordination of software changes. It provides the capability to: (1) interactively create, update, and print MRS; (2) track and record the flow of the MR through the system development cycle; and (3) provide management with timely MR status information via reports and on-line inquiries. MRCS supports many projects, each project with its own MR data base and commands. It provides, via common control logic, standard operations such as the creation, updating, and printing of MRS, and the extraction of data from them. Each project then defines the fields, validity checks, defaults, prompting sequences, and report formats which satisfy its particular requirements, and these are used to produce an MRCS for that project.
Selecting sequence numbers
Authors: Raymond S. Tomlinson
Venue: ACM SIGOPS Operating Systems Review (1975)

This paper discusses techniques for selecting and synchronizing sequence numbers such that no errors will occur if certain network characteristics can be bounded and if adequate data error detection measures are taken. The discussion specifically focuses on the protocol described by Cerf and Kahn, (1) but the ideas are applicable to other similar protocols.
Software Quality And Reliability
Authors: Robert Dunn, Dennis Fife
Venue: Proceedings of the 1978 annual conference (1978)

Has the institutionalization of software quality and reliability within industry and government improved software products and systems? And, if so, can this improvement be meaningfully quantified and the recipients of its benefits identified? There is no simple answer to these questions since there may be no quantitative proof that things have improved. However, on the positive side it can be said that software quality has been improved because of: improvements in software technology, increased concern of government and industry resulting in the establishment of quality organizations, increased incidence of formal software quality audits and reviews, improved software documentation, and the use of independent V and V contractors. On the negative side, there are some major obstacles in assessing the improvement or implementation of software quality, among them is the lack of techniques and metrics for measuring software quality. This session will address the above questions, in addition to the problems and accomplishments in software quality assurance from both the government and industry viewpoints, with an emphasis on potential standards and testing criteria applicable on a government-wide basis or within industry as a whole. The principal elements of a quality plan for embedded software will also be highlighted by the panelists. Specific attention will be paid to the need for a well-ordered development methodology and to the review cycle attending it; to the array of hardware and software resources that may be required to assure software quality; and to the manner in which configuration control can be maintained. These matters will be discussed within the context of a synthesis of the disciplines of Software Engineering and Quality Assurance. Finally, experiences with Higher Level Language (HLL) compiler validation will be used as concrete examples to give the panel focus.
A Block Structured Query Language for accessing a relational data base
Authors: Anthony Q. Baxter, Rowland R. Johnson
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

This paper describes a Block Structured Query Language (BSQL) to be used with relational data bases. The syntax of the language is presented and discussed. Facilities of the language are illustrated by examples of actual queries. In particular we demonstrate the ability of BSQL to obtain useful information from a relational data base that is incomplete. A relational calculus is then presented which forms a basis for a formalism which precisely describes the semantics of BSQL. Finally, comparative examples with other query languages are given.
Simulation of rapid ship unloading by helicopter
Authors: Bruce F. Powers, Martin Goldberg
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A ship with helicopters aboard arrives in the vicinity of a shoreline. The commander intends to operate the helicopters so as to unload the ship as rapidly as possible. The ship's cargo is to be delivered to a specific point ashore by the helicopters. The arrival rate of the cargo at that point will measure the effectiveness of the unloading operation. The commander must decide at what distance to station the ship from the unloading point ashore, how many of his helicopters to use for the unloading, and the grouping of the participating helicopters. He knows, or has reliable estimates of, the time spent by helicopters while loading or refueling on the ship, unloading at the point ashore, and flying between the ship and point ashore. This paper describes a simulation model which can assist the commander with his decisions.