ppxscal/embedding_network huggingface dataset:
A simulation approach to the reliability analysis of main storage systems
Authors: S. K. Kwon, H. E. Harvey
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

The Monte Carlo technique has been employed in studying the behavior of main storage systems with single error correction in terms of uncorrectable error rate and storage card replacement rate under various maintenance conditions in the field. It has been demonstrated that such a simulation approach is very powerful and practical when the component hazard rates vary with time, and that the results of this analysis can be used in determining an optimum maintenance strategy that minimizes the field service cost.
On the importance of teaching PASCAL in the IS curriculum
Authors: Susan M. Merritt
Venue: ACM SIGCSE Bulletin (1980)

This paper asserts that it will become increasingly necessary for persons involved in the software development process to be concerned with creating high quality programs. Furthermore, it is asserted that the presence or absence of certain features in programming languages can affect the quality of programs produced. A survey of language design features which characterize some &ldquo;modern&rdquo; languages - languages which have been created for the design and implementation of reliable software - is given. These features include abstraction, name protection, strong typing, structure and ease of verification. Remarks are made concerning how these features support high quality programs. Each of these features is shown to be either a part of PASCAL or to have its immediate history in PASCAL. Since PASCAL is a widely available and well designed language it is suggested that PASCAL provides a unique language environment in which these features which support high quality program construction can be learned. Finally, it is remarked that it is not yet clear which programming languages will dominate our language culture of the future. However it is reasonable to expect that reliable software will be a priority, that the connections between good programs and language features will continue to be made, and that language features will develop along the lines presented here. Information Systems graduates will be in systems development and management roles. It is important that they be articulate with the issues.
Model of a multiprogrammed computer system with a multilevel memory hierarchy
Authors: Don M. Warner, Udo W. Pooch
Venue: Proceedings of the 1977 annual conference (1977)

A collection of queueing network models with distinguishable tasks in the system is developed and solved to represent various aspects of a multiprogrammed computer system. The basic model is a closed queueing network which models a system with a multilevel memory hierarchy with distinguishable tasks in the system. Equations which describe the behavior of the system are solved analytically. Using the solution of these equations, various performance measures-processor utilization, queue lengths, rate of task execution, expressions for system overhead, and effective CPU utilization - are developed. Program behavior is characterized by CPU processing, page faults, and I/O processing with the possibility of queueing delays. System behavior is characterized by considering the processing requests of all jobs in the system. The solution technique is one which equates the rate at which a job of a particular class enters each queue to the rate at which a job of a particular class leaves that queue.
On the existence of composite flow equivalent markovian servers
Authors: William J. Stewart, Gerald A. Zeiszler
Venue: ACM SIGMETRICS Performance Evaluation Review (1980)

Queueing networks have been used to model a large variety of complex systems. However, once a realistic model has been constructed it has generally been necessary to distort and modify it so that an analytic solution could be obtained. Unfortunately, the analytic solution often has little relation to the original queueing system and consequently often produces solutions with poor accuracy. We begin with a brief introduction to the concepts of decomposition and aggregation. Application of these and other approximate methods to the analysis of computer systems are discussed by Chandy and Sauer [CHAN78].
Breadth or depth in introductory computer courses: The experimental results
Authors: Spotswood D. Stoddard, Robert R. Leeper
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

These are the results of an experiment begun in 1978 to compare two sequences of introductory computer courses which differ by their approaches of breadth or depth. Statistical analysis of the results is presented which indicates the depth approach sometimes, but not always, has the advantage.
User manuals: What does the user really need?
Authors: Roy L. Chafin
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

The purpose of the user manual is to assist the user in effectively operating a system. This objective is complicated by the wide diversity of user skills, and user tasks. The quality of a user manual is affected not only by the level of effort exerted by the system developer in writing the manual, but also by the degree of matching between the user manual and the user's needs. The documentation writer must supply both effort and direction in writing the user manual. This paper addresses the direction issue.
Algorithm dynamics
Authors: Maurice Halstead, Rudolf Bayer
Venue: Proceedings of the ACM annual conference (1973)

A technique for measuring simple structural properties of algorithms is described. Using these measures, it is found that for a non-trivial class of algorithms there is a quantitative relationship between operators and operands and their usage. Properties of &ldquo;Full&rdquo; and &ldquo;Reduced&rdquo; algorithms are then explored, and shown to predict the quantitative relationship observed.
MANAGE&mdash;an interactive simulation model for evaluating the effects of management structure on organization performance
Authors: Michael D. Sherman
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper reports on progress to date in developing a computerized simulation - optimization model of the general management structure of a firm. This model called MANAGE, offers a framework wherein the profit performance of a company can be simulated and assessed under a variety of structural configurations. MANAGE also incorporates certain behavioral parameters that impact upon successful communication within corporate organizations. The paper describes the general framework of the model; the manner in which various structural, behavioral, and economic variables are incorporated into the model or can be set as desired by the user; and the nature of the outputs that are produced. The paper also describes the manner in which MANAGE generates profit solutions under various combinations of behavioral, heirarchical and economic conditions and compares them with traditional optimal economicsresults. The paper concludes with a brief discussion of the potential applications of MANAGE.
A linear probing sort and its analysis(Preliminary Draft)
Authors: Gaston H. Gonnet, J. Ian Munro
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We present a variant of the distribution sort approach which makes use of extra storage to sort a list of n elements in an average of about (2+@@@@2)n &equil; 3.412...n probes into a table. An accurate analysis of this technique is made by introducing a transform from a Poisson approximation to the exact (finite) distribution. This analysis also leads to the solution of an interesting parking problem.
Business data processing education: Teaching in the 80's
Authors: Thomas I.M. Ho
Venue: Proceedings of the 1979 annual conference (1979)

Curriculum recommendations for information systems education have been generally available [1]. However, in view of the emergence of new techniques and the recognition of new areas of concern, curriculum recommendations should now reflect those new developments. The emergence of structured programming adds significant substance to programming education. Awareness about data management, software engineering, and requirements analysis motivates the inclusion of any new knowledge that may have emerged. Furthermore, it is imperative that a conceptual framework for information systems be established. Such a framework will enable the identification of skills and concepts that should be taught in a comprehensive information systems education. Relevant skills will enable the student to perform the tasks of an information systems professional while relevant concepts will enable the student to understand the rationale for the skills that the student has learned.
Operators for manipulating language structures
Authors: Barry Lawrence Wolman
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

The manipulation of symbolic expressions, optimization of computer programs by a compiler, and the use of graphical or pictorial input-output have heretofore been considered to be unrelated problems. The Algorithmic Theory of Language provides a language structure capable of representing both the syntactic and semantic structure of statements in algebraic, procedural, or graphical languages. Utilizing the semantic sequencing information in the structure, &ldquo;operators&rdquo; defined for atomic forms may be applied to arbitrarily complex structures to provide a uniform and powerful manipulation capability for these and other areas of application. This paper describes an on-line, experimental version of a system constructed in this manner.
Design validation in hierarchical systems
Authors: Paul Losleben
Venue: Proceedings of the 12th Design Automation Conference (1975)

As we become increasingly aware of the limitations of automation, design validation techniques to reduce errors in manual operations are receiving more attention. Hierarchical design systems in particular rely heavily on computer aids for validating designs. This paper identifies current work in this area and suggests areas for future research.
A decision procedure for generalized sequential mapability-onto of regular sets
Authors: Robert McNaughton
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

In [1] various problems are solved about the possibility of mapping regular sets into or onto other regular sets by means of a complete sequential machine or a generalized sequential machine under various restraints. One problem in this class has remained open. That problem, as restated on pp. 129-130 of [2], is whether it is &ldquo;recursively solvable to determine for arbitrary regular sets L1 and L2 whether there exists a generalized sequential machine S such that S(L1) &equil; L2.&rdquo; The claim is hereby made on the affirmative solution to this problem. [3] contains an interesting solution to a certain nontrivial subproblem, namely where L1 and L2 are restricted to regular sets with the prefix property.
Computer aided programming for simulation (CAPS) tutorial
Authors: G. K. Hutchinson
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

There are many potential application areas where simulation could profitably be used and isn't. Two of the main factors that limit the use of simulation are the long lead times necessary to develop checkout models and the limited number of people who can program simulations. Using the established principles of CAD, he developed CAPS, which is the subject of the tutorial. The tutorial will consist of an explanation of activity cycles, an illustrative problem, the CAPS dialog, and the output from the simulation. CAPS operates on my computer with an ASCII Fortran IV compiler, backing store, and a 16K 16 bit minimum core. At the University of Wisconsin, the costs of operation are usually dominated by connect time.
Computer storage of contour-map data
Authors: S. P. Morse
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Contour maps have many engineering applications. Besides the common use of contour maps to represent elevation of a geographic region, they are frequently used to represent different types of weather information. Examples are isobars to connect points of equal pressure and isotherms to connect points of equal temperature in a geographic region. An example of using a contour map to represent a variable that is a function of something other than geographic position is a plot of equalloudness curves as a function of intensity and frequency of an audible tone. Contour maps are also used to represent data defined by an equation. In such cases the contour map facilitates visualization of the data. An example of this is a plot of the equipotential lines around an electric dipole.
An interactive multi-item inventory computer simulation model
Authors: M. Wayne Shiveley
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A generalized inventory simulation model has been developed to establish the value of a company's inventory. This model was developed to evaluate inventories which are made up of subassemblies, assemblies, and finished goods; therefore, one component of the model is a time-sharing bill of material processor. The model accepts a finished goods forecast for specified time periods; it then predicts the net requirements for these time periods. Also the obsolete items are identified. The model can be used for production planning as well as the evaluation of on the shelf inventories, The model is interactive; it allows the user to vary inputs from a portable terminal and identify and critical parameters of the model. The model can be demonstrated to any interest group which can provide access to a standard telephone.
Technology-independent circuit layout
Authors: Robert J. Smith,  II
Venue: Proceedings of the 20th Design Automation Conference (1983)

As physical implementation of electronic circuits has evolved from discrete component printed circuit boards to very large scale integrated circuits, there has been increasing economic pressure to automate the layout design process. Early efforts to use computer-based layout focused on relatively simple PCB's, while recently developed layout tools address the demands of quite complex IC layout tasks. It has become evident that it is economically impractical to develop comprehensive layout systems that focus on a single circuit style or technology. Hence, increasing attention has been given to layout tools that are relatively technology independent. That is, they may be successfully applied to a diversity of layout problem styles having different floorplans, design rules, and component attributes. We would prefer to develop and support design tools that are &ldquo;technology independent&rdquo;; in the sense that for both printed circuit boards and integrated circuits having these diverse characteristics the software basis for these tools is common.
MIPS: A microprocessor architecture
Authors: John Hennessy, Norman Jouppi, Steven Przybylski, Christopher Rowen, Thomas Gross, Forest Baskett, John Gill
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

MIPS is a new single chip VLSI microprocessor. It attempts to achieve high performance with the use of a simplified instruction set, similar to those found in microengines. The processor is a fast pipelined engine without pipeline interlocks. Software solutions to several traditional hardware problems, such as providing pipeline interlocks, are used.
Estimation of the best alternative
Authors: Hubert J. Chen
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

In many simulation studies there are available several alternatives and the experimenter is simulating in order to choose which one is best with regard to certain specified criteria. Once an alternative has been selected, people may raise the question: &ldquo;How good is it?&rdquo; For this problem one naturally tries to provide a confidence interval for the parameter of the best alternative. Estimation of the best alternative has been studied in the last decade, and most of the works are in the category of k-population problems under one factor. Below we summarize these results and extend them to experiments in factorial designs - one-way and two-way classifications.
A technique to evaluate dynamic storage management
Authors: Khuzem Kaka, Janis Meadows
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

The Dynamic Storage Management Simulation models have been developed to evaluate the performance of different allocation schemes. The models employ a new criteria, defined as 'fragmentation index,' to evaluate the allocation schemes in terms of space efficiency. This paper, with a series of simulation runs, investigates the new criteria in the case of first-fit and best-fit methods. The results show that fragmentation index may be a good indicator for the performance evaluation of dynamic storage management.
Computer graphics as an aid to teaching geometric transformations
Authors: Joseph K. McAdams, Arlan R. DeKock
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

During the past several years, there has been much discussion and controversy over what should be taught in high school mathematics, in general, and in high school geometry, in particular. Numerous mathematicians have encouraged the teaching of transformations as part of the standard high school mathematics curriculum[l-4,6-9]. The results of a recent survey of high school teachers of mathematics indicate that 19% have taught geometric transformations, 26% feel adequately prepared to teach such a topic, and 50% would like to teach the topic if materials were available for the average college prep student[5]. The topic of transformations is important because transformations are a unifying factor in algebra and geometry. Algebra and geometry are essentially the same material taught from different approaches. In particular, the abstract algebraic concept of a group can be conveyed in purely geometric terms by groups of transformations.
Price/performance comparison of C.mmp and the PDP-10
Authors: Samuel H. Fuller
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The analysis in this paper shows a multiprocessor like C.mmp to have a factor of three to four cost/performance advantage over uniprocessor systems such as the PDP-10 when implementations using similar technologies are considered. This comparison is shown to be very sensitive to memory prices and considerable attention is given to normalizing memory costs between C.mmp and the PDP-10. An important part of this analysis is a comparison of the PDP-10 architecture with the PDP-11 architecture (i.e. the architecture of the processors of C.mmp). When the limited address space of the PDP-11 is not a problem, we see that to a close approximation it takes the same number of PDP-11 instructions (average length 25 bits) as PDP-10 instructions (length 36 bits) to represent a program. While the comparison in this paper explicitly considers multiprocessor degradation factors such as memory interference, it does not address the problem of writing software systems capable of taking full advantage of the multiprocessor structures. The comparisons in this paper are primarily ofcused on comparing the hardware structures of uniprocessors and multiprocessors. Work is now in progress at CMU that is attempting to evaluate the effectiveness of both individual multiprocessor structures application programs and multiprogrammed systems operating on C.mmp.
Designing considerate systems (abstract only)
Authors: Ronald E. Anderson
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Ease of Use can be thought of as consisting of two components: Ease of Learning and Ease of Doing. In the past, most of the attention in discussions of Ease of Use has focused on Ease of Learning. This is the motivation behind consideration for the "naive" or "casual" user. The most common approach has been to allow trading computing functionality for Ease of Learning. This makes the most commonly performed tasks very simple to perform, but prevents a wide range of other tasks from being performed at all. This affects Ease of Doing.Ease of Doing is a concept that has been primarily associated with expert users of computing systems. A task is only Easy to Do on a computer if the proper tools have been provided for doing it. Since there is an enormous range of tasks to apply systems to, there must also be a large collection of tools. A great variety of software tools that are finely tuned to particular applications should be made available to users. In addition, the system should be extensible to allow for ready customization.We feel that a sophisticated personal computing environment must provide a quick path for casual users to be able to operate parts of the system, and yet allow more habitual users a path to gain mastery over the more esoteric components of the system with time.
Research on synthesis of concurrent computing systems (Extended Abstract)
Authors: Richard M. King
Venue: ACM SIGARCH Computer Architecture News (1983)

The object of our research is the codification of programming knowledge for the synthesis of concurrent programs. We present sample rules and techniques that we show can be used to derive two concurrent algorithms: dynamic programming (for the class of problems that run in polynomial time on sequential machines) and array multiplication. For both derived concurrent versions the code runs in linear time. The concurrent versions are significant and complex algorithms, though they are not new and already have been reported in the literature. The synthesis knowledge for these derivations is embodied in seven synthesis rules. We expect these rules to generalize to other classes of algorithms. We have also discovered a pair of techniques called virtualization and aggregation. This pair of techniques (plus the seven rules) is shown to be powerful enough to synthesize Kung's systolic array architecture [Kung-76] from a specification of matrix multiplication.
The anatomy of a project oriented second course for computer science majors
Authors: Will Gillett
Venue: ACM SIGCSE Bulletin (1980)

This paper describes the philosophy and design of a specific course, Computer Science 236, taught over the past few years at Washington University. The philosophy of the course is that the objectives of the course can best be achieved by employing a series of associated projects which are complex enough to require a design and specification effort but are not so large that they cannot be completed in one semester. Several other institutions have also found that a project oriented course is advantageous. The purpose of this paper is to describe the philosophy and methodology of such a course and not to describe the specific course at Washington University. However, in describing the generic course, those decisions made for Computer Science 236 will be presented as examples.