ppxscal/embedding_network huggingface dataset:
The distributed V kernel and its performance for diskless workstations
Authors: David R. Cheriton, Willy Zwaenepoel
Venue: ACM SIGOPS Operating Systems Review (1983)

The distributed V kernel is a message-oriented kernel that provides uniform local and network interprocess communication. It is primarily being used in an environment of diskless workstations connected by a high-speed local network to a set of file servers. We describe a performance evaluation of the kernel, with particular emphasis on the cost of network file access. Our results show that over a local network: 1. Diskless workstations can access remote files with minimal performance penalty. 2. The V message facility can be used to access remote files at comparable cost to any well-tuned specialized file access protocol. We conclude that it is feasible to build a distributed system with all network communication using the V message facility even when most of the network nodes have no secondary storage.
Transportability in practice - recent experience with the NAG Library
Authors: J. J. Du Croz
Venue: ACM SIGNUM Newsletter (1979)

Two guiding principles for the development of the NAG Library are: the algorithms must be adaptable to the characteristic of the computer on which they are being run; the software must be transportable (These concepts have been discussed in detail elsewhere.) The purpose of this talk is to discuss how these principles have stood the test of practice over the past two years and how NAG's approach to library development has been refined in the light of experience. The adaptability of algorithms is achieved with the aid of machine-dependent parameters, available through calls of library functions. The initial set of parameters was concerned only with the arithmetic properties of the computer. A new parameter is now being introduced, concerned with storage organizations: it will enable algorithms for certain operations of linear algebra to adapt, when run on a paged machine, to the approximate amount of real store available, and hence to achieve a dramatic reduction in page-thrashing. The transportability of the software is proven by the fact that the NAG Library has now been implemented on 25 different computer systems - including several minicomputers, which required no fundamental change of approach. The talk will discuss various interesting problems which have arisen in the course of implementation. Frequently it has been deficiencies in the compiler and associated software that have caused the problems, rather than defects in the NAG routines. NAG's test software (though not always ideally suited to the task) has proved remarkably effective at detecting these problems before the Library is released to sites. This justifies NAG's policy of always distributing a tested compiled library (in addition to the source-text).
The analysis, design and evaluation of a computer personnel education system
Authors: Edison B. Schroeder
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

The computer world today is faced with a mess. A number of problems tangled together is a mess.1 A mess can't be cleaned up until it is broken apart into separate problems. There are some good people working with computers who are beating their heads against a stone wall. The hardware is not always dependable. Software is often late and full of surprises. The manufacturers' support is not what it used to be. At times, the jargon is almost impenetrable. Standards are lacking in many areas. Programmers foul up, and it's next to impossible to get enough qualified people to solve all of these problems.
Advanced State Clustering for Very Large Vocabulary HMM-based On-Line Handwriting Recognition
Authors: Andreas Kosmala, Daniel Willett, Gerhard Rigoll
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents some novel methods for the introduction of context dependent Hidden Markov Models (HMM) to on-line handwriting recognition. The use of these so-called n-graphs can lead to substantially improved modeling accuracy, but requires some intelligent parameter reduction methods (state clustering). This is especially the case for the investigated very large vocabulary system, incorporating an active vocabulary of 200000 words. Switching from context independent models to context dependent models - considering the underlying vocabulary - yields in the worst case to 25000 HMMs and a very poor trainability for most of the introduced models. Therefore, the conducted investigations are focussed on an appropriate state clustering method which is supported by decision trees and some new self-organizing approaches to generate the required trees. The presented comparison takes also the different context dependencies (left, right or both sides) into consideration.
The effect of instruction fetch strategies upon the performance of pipelined instruction units
Authors: Ramakrishna B. Rau, George E. Rossmann
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The interpretation of a machine instruction requires fetching the instruction, decoding the instruction, and then executing it. In addition, if the instruction requires one or more operands, their addresses must be generated and the operands fetched. A large number of processors have been designed to perform some or all of these functions simultaneously on successive instructions. These pipelined processor architectures would appear to permit the decoding of a new instruction each machine cycle.
Mos LSI computer aided design system
Authors: D. R. Lewallen
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A design system employing computer aided design techniques, a Gerber digital photographic plotter, and an automatic LSI tester has been developed and used in logic design, layout design, mask generation, and testing, of complex MOS Large Scale Integrated circuit arrays. The system employs computer logic simulation for debugging machine logic and generating test tapes, and utilizes abbreviated input data techniques for generating array layout designs and photographic artwork masters. In this system a major portion of the creative array design work is performed manually and detailed design and analysis is performed by the computer. In the design of the computer process, major emphasis was placed on detecting design errors and violations of design rules. As a result of this approach a very flexible computer aided design system has been developed which provides highly accurate custom MOS complex array designs in reasonably short turnaround-time with a minimum of design errors. The system is designed so that more automation features, that will perform additional creative design steps, may be incorporated as they are developed. Due to its modularity, modifications which will take advantage of advanced circuits, advanced fabrication processes, and second source vendors may be carried out at appropriate intervals with minimum system development and reprogramming.
Fault detection and diagnosis of memory system faults
Authors: A. R. Klayton, W. A. Barrett, A. I. Larky
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Algorithms for the detection and diagnosis of faults in semiconductor random-access, word-organized memory systems are presented and evaluated. The memory system is conceptually partitioned into four major elements to facilitate analysis. During the testing of each element, previously tested elements are assumed to be fault-free, but untested elements may contain multiple faults. The problem of fault masking and interaction between the major elements of the system is investigated and considered in the development of the algorithms. The following analysis is not concerned with such problems as control signal timing and parameter tolerance, but rather with the detection and diagnosis of stuck-at 1 (SA1) and stuck-at 0 (SA0) solid faults within the system. It is useful to make a distinction between the concepts of a fault and a failure. Faults are logic gates, bit lines, etc., which are SA1 or SA0. Failures are deviations from correct system behavior which result from the presence of solid logic faults.
A design framework for the ALVEY/ICL/DHSS demonstrator process
Authors: P. I. Pettitt
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The purpose of this project is to develop a system to provide knowledge based decision support within a large legislation based organisation. The system developed will not be made fully operational within the target organisation, the Department of Health and Social Security (DHSS), but will however be constructed to the standards required for real operational use. The project is a collaborative venture involving ICL as the prime contractor, LOGICA, the Universities of Surrey and Lancaster and Imperial College of the University of London. Lastly, but most importantly, the DHSS itself is involved both as end user and co-developer. This project is funded as a large demonstrator as part of the UK ALVEY Programme. The demonstrator system constructed will consist of a fully integrated set of subsystems each supporting a distinct area of DHSS activity (eg. benefit assessment, training). Each subsystem wil be produced by a separate and independent group; therefore a strong framework is required if the design of the demonstrator is to be consistent. This framework should not be regarded as a rigid set of legislative rules but rather as a house style or declaration of design intent.
Real time information processing II: Real-time simulation of a cruise missile trajectory
Authors: Y. N. Chang, K. S. Schulz
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

SIMULATION by use of computers is the most economical means of determining feasibility, compatibility, and stability in developing and evaluating complex systems. The savings in time and money made possible by simulation cannot be overemphasized. This particular simulation concerns the guidance system only, and it is assumed that the missile is stable and is capable of flying from the launch point to any selected target. The dynamics of the autopilot and the airframe are omitted except to the extent that a typical flight profile is generated by the simulation computer. The airborne computer is employed in the missile guidance system to maintain a platform locally level and to send steering commands to the autopilot based on platform-mounted velocity meter measurements; Figure 1. It is a serial machine with a general purpose (GP) section and a digital differential analyzer (DDA) section.
A generalized class of polynomials that are hard to factor
Authors: Erich Kaltofen, David R. Musser, B. David Saunders
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

A class of univariate polynomials is defined which make the Berlekamp-Hensel factorization algorithm take an exponential amount of time. The class contains as subclasses the Swinnerton-Dyer polynomials discussed by Berlekamp and a subset of the cyclotomic polynomials. Aside from shedding light on the complexity of polynomial factorization this class is also useful in testing implementations of the Berlekamp-Hensel and related algorithms.
Promoting academic computing: Description of a faculty intern program
Authors: Steven B. Just
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The New Jersey Educational Computer Network (NJECN) is working to establish a Faculty Intern Program, the purpose of which is to bring faculty into a direct support role for academic computing. Creation of this program is motivated by several factors: (1) the small size of the central support staff relative to the user community; (2) the lack of discipline expertise among the central staff; and (3) the traditional lack of reward structure for those faculty engaged in instructional computing. We anticipate that by funding faculty for limited periods of time to develop and document instructional materials, we will be able to shift the role of evaluating and promoting instructional computing applications from the central staff to those people with the appropriate discipline expertise. In addition, the program will provide a vehicle for faculty publications and professional development.
A plagiarism detection system
Authors: John L. Donaldson, Ann-Marie Lancaster, Paula H. Sposato
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The problem of plagiarism in programming assignments by students in computer science courses has caused considerable concern among both faculty and students. There are a number of methods which instructors use in an effort to control the plagiarism problem. In this paper we describe a plagiarism detection system which was recently implemented in our department. This system is being used to detect similarities in student programs.
A multi-microprocessor implementation of a general purpose pipelined CPU
Authors: Richard R. Ramseyer, Andries van Dam
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

This paper discusses and shows by example the potential of a network of microprogrammable microprocessors as a cost-effective alternative to traditional hardwired medium- and large-scale mainframes. While biased towards vector processing, this system is not intended to compete with multi-million dollar supercomputers such as the 360/195, CDC STAR, Illiac IV, CRAY-1, TI ASC, etc., which use special algorithms and the fastest circuitry available. The architecture incorporates pipelining, multiprocessing and distributed processing techniques with bipolar microprocessor technology. The result should be a machine which will equal or outperform most traditional third- and fourth-generation mainframes at a fraction of the CPU cost. This should be the case even for scalar, general purpose computation.
An experimental evaluation of data types on programming reliability
Authors: J. D. Gannon
Venue: ACM SIGPLAN Notices (1977)

The language in which programs are written can have a substantial effect on the reliability of the resulting programs. This paper discusses an experiment that compares the programming reliability of subjects using a statically-typed language and a &ldquo;typeless&rdquo; language. Analysis of the number of errors and the number of runs containing errors shows that, at least in one environment, the use of a statically-typed language can increase programming reliability. Detailed analysis of the errors made by the subjects in programming solutions to reasonably small problems shows that the subjects had difficulty manipulating the representation of data.
Programming environments for pre-college instruction (Special Session)
Authors: William E. Baird, Charles E. Rughes, J. Michael Moshell
Venue: ACM SIGCSE Bulletin (1983)

This session features two presentations and demonstrations of computer software/hardware systems for teaching problem solving techniques and programming concepts. Several computers will be available for hands-on demonstration at the conclusion of the session.
Inductive methods for proving properties of programs
Authors: Zohar Manna, Stephen Ness, Jean Vuillemin
Venue: Issue 14 (January 1972) (1972)

We have two main purposes in this paper. First, we clarify and extend known results about computation of recursive programs, emphasizing the difference between the theoretical and practical approaches. Secondly, we present and examine various known methods for proving properties of recursive programs. We discuss in detail two powerful inductive methods, computational induction and structural induction, illustrating their applications by various examples. We also briefly discuss some other related methods. Our aim in this work is to introduce inductive methods to as wide a class of readers as possible and to demonstrate their power as practical techniques. We ask the forgiveness of our more theoretical-minded colleagues for our occasional choice of clarity over precision.
The structure of &ldquo;data structures&rdquo;
Authors: Wilfred J. Hansen
Venue: Proceedings of the ACM '81 conference (1981)

A data structure is defined to be a 4-tuple <&Dbarbelow;, &Fbarbelow;, &Sbarbelow;, &Abarbelow;>. &Dbarbelow; and &Fbarbelow; are Domain and Function definitions which define the externally observable behavior; &Sbarbelow; and &Abarbelow; are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students. In particular, the fact that the Storage Structure is a (lower level) data structure leads to a hierarchy of data structures. Following this hierarchy, a suitable order for presentation of the material is bits, words, arrays and records, lists, trees, and search tables. Students deserve structured presentations. In a course on data structures this is especially important because otherwise the subject can seem like a series of unrelated tricks. Moreover, the material is on structure and will be used to build programs with structure, so the student should be given as many examples of good structure as possible. There are a number of questions about how the material on data structures ought to be organized. Is the order arrays, stacks, records, lists appropriate with each subject being motivated by its predecessor? Or should stacks be last so their multiple implementations are derived from the alternate implementations of lists? Where should list node representations be described since one alternative uses lists themselves? This paper answers these questions by referring to the data structure definition presented in Section 1. This definition distinguishes between the externally observable behavior of the data structure and its implementation. Since the latter must be in terms of lower level data structures, the definition induces on data structures the hierarchy discussed in Section 2. Finally, Section 3 describes various topics that are omitted by this organization and why these include some of the more formal appraoches.
Extended architecture and Hypervisor performance
Authors: Carl J. Young
Venue: Proceedings of the workshop on virtual computer systems (1973)

This paper is a brief summary of the impact that architecture extensions to hardware and software have upon the design and performance of software Hypervisors that are intended to provide the extended function in a virtual machine environment.
Observations on nondeterministic multidimensional iterative arrays
Authors: Joel I. Seiferas
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Let NIA(d) be the family of languages accepted within linear time by nondeterministic d-dimensional iterative arrays. (On-line deterministic multidimensional iterative arrays have been studied by Cole [2].) It has been observed [8] that every language accepted by a one-dimensional single-head Turing machine simultaneously within time n2 and space n is in NIA(2). Our main result (Theorem 2) generalizes this observation to NTIME(nd) @@@@ NIA(d), where NTIME(T(n)) is the family of languages accepted within time T(n) by nondeterministic one-dimensional multihead Turing machines. Conversely, we show that NIA(d) @@@@ NTIME(nd+l) (Theorem 3). The two facts together show [equation]NIA(d) = [equation]NTIME(nd), which is the same as Karp's class NP [6]. We also use both facts in a proof that NIA(d) @@@@ NIA(d+2). Let NTM(d) be the family of languages accepted within linear time by nondeterministic d-dimensional multihead Turing machines. A real-time simulation of Turing machines by iterative arrays gives NTM(d) @@@@ NIA(d) (Theorem 1), but a less direct simulation (using Theorem 2) gives the stronger result [equation] NTM(d) @@@@ NIA(2). Thus, in the nondeterministic case, two-dimensional iterative arrays outperform all multi-dimensional multihead Turing machines. Finally, in section 7, we examine related deterministic questions and summarize.
Absolutely parallel grammars and two-way deterministic finite-state transducers
Authors: Vaclav Rajlich
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

Absolutely parallel grammars are defined and it is shown that the family of languages generated is equal to the family of languages generated by two-way deterministic finite-state transducers. Furthermore it is shown that this family forms a full AFL [4], is properly contained in the family of languages generated by two-way nondeterministic finite-state transducers (which is equal to the family of checking automata languages [8]) and properly contains the family of nonexpansive context-free languages [7].
Synchronization with eventcounts and sequencers (Extended Abstract)
Authors: David P. Reed, Rajendra K. Kanodia
Venue: ACM SIGOPS Operating Systems Review (1977)

The design of computer systems to be concurrently used by multiple, independent users requires a mechanism that allows programs to synchronize their use of shared resources. Many such mechanisms have been developed and used in practical applications. Most of the currently favored mechanisms, such as semaphores and monitors are based on the concept of mutual exclusion. In this paper, we describe an alternative synchronization mechanism that is not based on the concept of mutual exclusion, but rather on observing the sequencing of significant events in the course of an asynchronous computation. Two kinds of objects are described, an eventcount, which is a communication path for signalling and observing the progress of concurrent computations, and a sequencer, which assigns an order to events occurring in the system.
Software engineering in avionics applications
Authors: A. Dniestrowski, J. M. Guillaume, R. Mortier
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Flight control for commercial aircraft has to fulfil stringent requirements. This paper describes first the main lines of the system development process in order to situate the software validation problem which is only a part of the whole validation exercise. The appropriate methods and tools used in the different software development stages are then presented. A great deal of our attention was in the software analysis stage (preliminary design) for which a software decomposition approach, a software integration strategy and a managerial procedure was developed. Real-time testing also deserved a great deal of effort. A full set of real-time facilities was created around our airborne computer (UMP 7800) which is a software oriented machine whose essential features are roughly described in the paper. Special emphasis is given to a hardware device (TRACE) connected to the computer bus which is capable to check and record critical numerical data and program paths. Finally some quantitative evaluation of the methodologies we use are given based on some of our avionics projects.
Two-dimensional characteristics of HAL, a language for spaceflight applications
Authors: James S. Miller
Venue: ACM SIGPLAN Notices (1972)

A contribution to software quality is realized in the HAL language implementation by distinguishing the source-language input format from that of the listing produced by the compiler. The two-dimensional features of the source text may be fully supplied by the compiler, and include natural expression of subscripts and exponents of variables, and distinctive marking of data types and organizations.