ppxscal/embedding_network huggingface dataset:
Rules for reducing calculate time and conservation of storage space
Authors: J. H. Allen
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

Two of the most costly commodities of a computing machine are calculate speed and amount of storage space. It makes good economic sense to be able to utilize the machine so that both of these commodities are effectively increased. Here are presented some of the most frequently used functions, and some of the means whereby their computation is faster, and/or the amount of required storage is reduced. Except for the four basic arithmetic operations: add, subtract, divide and multiply, the most frequently used operation in general problems is square root. Hence, if this one operation can be minimized in calculate time, considerable saving may be realized in the overall operating speed.
The effects of solid state paging devices in a large time-sharing system
Authors: John Sanguinetti
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

This paper reports the results of some measurements taken on the effects two new solid state paging devices, the STC 4305 and the Intel 3805, have on paging performance in the Michigan Terminal System at the University of Michigan. The measurements were taken with a software monitor using various configurations of the two solid state devices and the fixed head disk, which they replace. Measurements were taken both during regular production and using an artificial load created to exercise the paging subsystem. The results confirmed the expectation that the solid state paging devices provide shorter page-in waiting times than the fixed-head disk, and also pointed up some of the effects which their differing architectures have on the system.
Performance evaluation through job scheduler modeling
Authors: M. K. Rajaraman
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

The scheduler in the Cyber-176 computer does the major functions of routing the job through the system, controlling job's progress through aging and swapping of jobs between various queues and resource allocation among jobs. This paper reports some results of the performance evaluation study of the Cyber-176 by modeling the scheduler as the heart of the system. The study explores the effects of varying the scheduler parameters in the performance of the machine in a particular installation. The basic theme of the paper is that the selection of parameters in a laboratory or a system test environment may not always result in the best performance in an actual installation. The simulation provides vital information for installation management and tuning the operating system.
Invited papers&mdash;2: soviet computer science, revisited
Authors: E. A. Feigenbaum
Venue: Proceedings of the 1965 20th national conference (1965)

IN THE SUMMER OF 1960, I visited the Soviet Union as a delegate to the International Automatic Control Congress, made an extensive tour of computer centers in the USSR, and spoke with numerous Soviet scientists in computers and cybernetics (broadly defined, in the Soviet sense). A report of this trip was published in the Communications of the ACM1. In October, 1964, I had the opportunity to revisit the Soviet Union under circumstances much more conducive to the free interchange of ideas and information. I was invited by the USSR Academy of Sciences to deliver a lecture series on heuristic programming and computer simulation of cognitive processes in the following cities: Moscow, Leningrad, Kiev, and Novosibirsk. The paragraphs that follow summarize, much too briefly, the state-of-art in a few computer areas as I saw them in October 1964.
Special session on large scale applications of computer charting and mapping in industry (Panel Session)
Authors: Alan Paller, Walter d'Hondt, David Dahl, Robert L. Dupree
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

1. It will demonstrate, with specific examples, the types of planning, justification, expense, and results that are part of the implementation of new computer graphics applications; and, 2. It will attempt to bring out the major barriers to implementation of computer graphics in large organizations and how those barriers may be overcome. The session is designed to help developers of the new advances in computer graphics software and hardware technology better understand the environments in which their tools will be used in order to optimize the use of the tools they develop. Too often developers of new tools have little opportunity to &ldquo;get inside the heads&rdquo; of the managers who will take these new tools and implement them. Through speakers and discussion, the session will draw together the experiences of people who have done the hard work necessary to estimate the costs and benefits and persuade top management that the project is worthwhile, to find the right hardware and software, and to train the staff to work with the new systems.
Analyzing a real-time system
Authors: Allen Weingarten
Venue: Proceedings of the 1966 21st national conference (1966)

A fitting way to begin this article would be to state that real-time systems are not designed properly; that the resulting losses are enormous; that industry does not know how to overcome this problem; but that an overall plan can do the trick. This line of discourse would provoke a series of defensive responses such as: &ldquo;I'll sue you if anyone concludes that my system is in poor shape&rdquo;; &ldquo;We've done as well as possible&rdquo;; &ldquo;Who are you to say that you know more than the experts?&rdquo; In order to avoid the distractions resulting from such controversy, this article will merely present an approach to real-time work which focuses upon analysis. However, I cannot avoid suggesting that this approach has vast implications&mdash;for relevant analysis can supply the key to real-time design, programming and planning. It can be used to redirect design approaches yielding gains of large orders of magnitude. Moreover, it is imperative that the focus of real-time work be placed upon analysis in order to remove the likelihood of the complete wastage of systems.
The TRIPOS filing machine, a front end to a file server
Authors: M. F. Richardson, R. M. Needham
Venue: ACM SIGOPS Operating Systems Review (1983)

This paper discusses an experiment which sets out to improve the performance of a number of single user computers which rely on a general purpose file server for their filing systems. The background is described in detail in reference [1], but for completeness it is necessary to say something about it here. The Cambridge Distributed Computing System consists, at the time of writing, of between 50 and 60 machines of various types, connected by a digital communications ring. On the ring, there are two file servers [2], [3], which are general purpose (or "universal" [4]) in the sense that they have no commitment to a particular directory or access control structure. This is done in order that they may support several client systems, and so that new systems may be added without difficulty. We speak of a particular directory and access control structure implemented over the file server as "a filing system".
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 12th conference on Winter simulation (1980)

Summary information about key aspects of the simulation programming language GPSS is provided. The class of problems to which GPSS applies especially well is described; commentary on the semantics and syntax of the language is offered; the learning-oriented literature for GPSS is summarized; various GPSS implementations are commented on; the time-sharing networks offering GPSS are cited; and public courses on the language are listed. Finally, the source of a tutorial introduction to the fundamental semantics and syntax of GPSS is given. Copies of this tutorial material, excluded from reproduction here because of page-count limits, will be distributed at the session and provide the basis for the session itself.
A case study in interlanguage communication: Fast LISP polynomial operations written in 'C'
Authors: Richard J. Fateman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

It is shown that a simple program, written in the &ldquo;C&rdquo; programming language, can be interfaced to a Lisp algebraic manipulation system with substantial performance improvement as a result.
Chart drawing: A simplified tool for improving computer system documentation
Authors: Kenneth A. Hough, Larry R. Hart
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

This paper takes a different approach to overcoming this documentation problem. The approach taken incorporates within WYLBUR, an on-line program maintenance system, a set of documentation tools for allowing the system designers and programmers to automatically draw the necessary charts, and more importantly, to maintain these charts as the system and program designs evolve. The documentation tools, called Chart Drawing, utilize the facilities of WYLBUR and do not require any additional hardware or software capabilities. The use of the Chart Drawing system also provides standardization in chart presentation and the use of charting symbols.
Specifying and proving properties of sentinel processes
Authors: Krithivasan Ramamritham, Robert M. Keller
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper presents a technique for specifying and verifying properties of &ldquo;sentinels&rdquo;&mdash;a high-level language construct for synchronizing access to shared resources. Statements in the specification language possess formal temporal semantics. As a prelude to proving the correctness of sentinels, the semantics of constructs used in sentinels is given. The proof technique involves showing that the temporal behavior of a sentinel conforms to that defined by the specification. The methodology is illustrated by applying it to a typical synchronization problem.
Statistical analysis of discrete&mdash;event simulations
Authors: Michael A. Crane, Donald L. Iglehart
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper surveys past and ongoing work by the authors in statistical analysis of simulations. An earlier developed technique for analyzing simulations of GI/G/S queues and Markov chains is shown to apply to discrete-event simulations which can be modeled as regenerative processes. It is possible to address questions of simulation run duration and of starting and stopping simulations because of the existence of a random grouping of observations which produces independent identically distributed blocks in the course of the simulation. This grouping allows one to obtain confidence intervals for a general function of the steady-state distribution of the process being simulated. The technique is illustrated with a simulation of a retail inventory distribution system. In some simulations, more than one random grouping may exist which produce independent identically distributed blocks. In this case, it is shown that the simulator may choose any such grouping without fear of obtaining less efficient confidence intervals. That is, simulations of the same time duration will produce confidence intervals which are asymptotically the same in length. Finally, approximation techniques are presented which may be appropriate for simulations in which it is not possible to find a random grouping as above.
User services from a twelve-year perspective
Authors: Barbara B. Wolfe
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Twelve years ago user services within a university computing center was much different than today. In 1966 the computing center was the highlight of the university administration's promotion of the campus. All computing center employees were available; no one group was called &ldquo;user services&rdquo;. An employee could spend as much time and as many computer cycles as he could invent uses for in order to put the fancy new second-generation computer to some useful work. This stage lasted until the large IBM 360 computers arrived, for computing centers &agrave; la IBM. The 360 line of machines was so big and so powerful that a computing center could not hire enough people to assist interested professors and still keep the machine relatively busy. And so the concept arose of teaching the users to use the machine themselves. About the same time the concept of time sharing and terminal access to computers was introduced. With assistance from user services departments, many professors and staff became knowledgeable users of computing services. Thus, many diverse activities are simultaneously taking place on time sharing systems at universities. Secretaries may be doing word processing and professors may be calculating orbits of electrons.
DEX-Design Automation system cooperative development
Authors: K. Kusunoki
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Study of large size electronic switching systems (ESS) commenced in 1964 in Japan, expecting it to be a center of communication and processing in the near future information innovation. During this period, DEX-1, DEX-2, DEX-21 and D10 systems were designed, refining them step by step. The final one, somewhat improved over the DEX-21, is now commercially available in the field. Two features required in designing DEX systems. One is very high quality in reliability and maintainability as well as effectively low cost. The second is as follows. The development of large scale system, such as Cross-bar system or DEX system, requires an enormous amount of manpower and design refinement by various competitive groups. The present design involved close cooperation between NTT Laboratories(ECL) and several manufacturers. On the other hand, in spite of these conditions, NTT requires a unity of devices or components in purchase and repair and requires unity of training from the standpoint of system maintenance and administration. These special NTT requirements were added to the general ones in the design of Design Automation (DA) system for DEX, and exactly the some devices or equipments for high quality ESS can be made by the several manufacturers.
An experimental comparison of force directed placement techniques
Authors: David C. Wilson, Robert J. Smith,  II
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Force-directed placement algorithms are experimentally compared using several sample problems. Significant differences are noted in the computational efficiency of the algorithms, and in the relationship of the placement solution to the routability of the resulting board.
The response times of priority classes under preemptive resume in M/G/m queues
Authors: André B. Bondi, Jeffrey P. Buzen
Venue: Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1984)

Approximations are given for the mean response times of each priority level in a multiple-class multiserver M/G/m queue operating under preemptive resume scheduling. The results have been tested against simulations of systems with two and three priority classes and different numbers of servers.
A scheme for implementing functional values on a stack machine
Authors: M. P. Georgeff
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

In this paper we describe a relatively simple method for handling partial application and function valued expressions in applicative (functional) programming languages. In essence, the approach defers evaluation of function valued expressions until sufficient arguments have been accumulated to reduce the expression to a basic (non-functional) value. This results in a stack-like environment structure, and thus obviates the need for the more complex environment management schemes used for the tree-like environment structures created by standard evaluators.
Hardware and software tools for the development of a micro-programmed microprocessor
Authors: James Nash, Mike Spak
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

This paper discusses the development and implementation of a number of hardware and software tools used in the design, development, and debugging of the microcode and nanocode for the MC68000 microprocessor. A functional description of these tools is included as well as an analysis of how each worked with respect to solving the desired problem (ie., generating correct microcode and nanocode). Peculiarities in the integrated circuit industry for microcode verification is considered as well as the automated process of error detection and correction.
Business graphics(Panel Session): What is it?
Authors: Irwin Jarett, Jack Russell, Howard Johnson, John Thompson
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

Much has been written about the explosive growth occurring and forecast for business graphics. Users and vendors alike are excited by these prospects. But, what is business graphics? Is it narrowly confined to slide making? Some with a broad view have suggested it is an extension of a management information system. Users search through journals and marketing literature eager to prove a salesman's claim that &ldquo;a pretty color picture is really worth a thousand words&rdquo; or at least several pages of numbers in a computer printout. Vendors seek the clues to developing a product strategy that will allow them to cash in on the forecasted shipments. One study [1] indicated 58,000 graphic terminals will be used in business graphics applications in 1986 sales, including computer graphics&mdash;capable personal computers, and dedicated computer graphics systems. This panel will present the thoughts and views of four business graphics practitioners&mdash;one associated with a large computer company, another a user from a large industrial concern, the third associated with an independent software company and the last, an industry consultant.
Associative retrieval trie hash-coding (Extended Abstract)
Authors: Walter A. Burkhard
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

Data base designs for retrieval from a file of k-letter records when queries may be only partially specified are examined. A family of data base designs referred to as the H &agr;&bgr;&kgr; PMF-trie designs which yield a data structure with good worst case and average case performances and requires an amount of storage space essentially equal to that required of the records themselves is introduced. The analysis of the designs including bounds on the worst case performance and an explicit expression for the average performance is presented. Previously known families of PMF-trie designs are seen to be special cases within the H &agr;&bgr;&kgr; family.
Arithmetic complexity of unordered sparse polynomials
Authors: F. Gustavson, D. Y. Y. Yun
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper, we show that addition and subtraction of unordered sparse polynomials can be done in time m+n and multiplication in time m+n. So we see already that if a particular sequence of polynomials computation involves a combination of these arithmetic operations as well as tests for equivalence or zero while intermediate expressions are not important enough to be displayed, then the unordered representation could amount to substantial savings in computation time. The visual demand of human users can still be satisfied at the cost of a single sort of the final answer as opposed to sorting each intermediate result in the case of ordered representations.
Workshop on microcomputer database management systems
Authors: Rebecca Serey, Anthony Skrabak
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

Database management is one of the most popular microcomputer applications. This workshop will present an overview of microcomputer database concepts and systems. It is designed to prepare User Services Personnel to provide purchasing advice to Computer Center customers.
Hardware-measurements of storage access conflicts in the processor array EGPA(1)
Authors: Uwe Hercksen, Rainer Klar, Wolfgang Kleinöder
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

The contemporary general purpose computer of the Princeton type is limited in its performance by the speed of the available logic families. Many projects around the world try to achieve higher performance by using many processors connected via common memories. The hardware costs for the interconnection of many processors and memories has to be limited and a severe degradation resulting from memory access conflicts must be avoided. The EGPA-project uses the concept of restricted neighbourhoods to solve these problems. The processors and memories are arranged in a freely extensible cellular structure. The number of connections to processors and to memories are limited for all sizes of the array. In this paper we present measured results from the pilot system, which show whether memory conflicts will influence the speed of the individual processors. The results will be valid for larger arrays, too.
SIGPLAN(Paper Session)
Authors: Ralph E. Griswold, Harald Ganzinger, B. P. Buckles, G. C. Hintze
Venue: Proceedings of the 1976 annual conference (1976)

This session has no single theme; rather, it includes a variety of topics of interest to the SIGPLANer. Griswold will be unveiling some new string processing concepts which are being developed in the string processing language SL5. Grazinger, et.al, will be bringing us up-to-date on some recent advances in the compiler generator area. Finally, Buckles and Hintze will show us how a compiler can (and should) be designed and implemented in a disciplined, structured manner. It promises to be an interesting session.
Execution of logic programs on a dataflow architecture
Authors: Lubomir Bic
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

Logic programming is a mathematical formalism capable of expressing certain classes of problems in a non-procedural manner. Furthermore, logic programs do not presuppose a von Neumann computer architecture and are therefore inherently well suited to parallel computations. In this paper we consider a data-driven model for interpreting logic programs and investigate the architectural requirements necessary to support its implementation. It will be shown that the model is capable of exploiting the capabilities of highly-parallel dataflow architectures.
Interpolating numerical solutions of ordinary differential equations
Authors: M K Gordon, L F Shampine
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Methods like the Runge-Kutta family for the solution of ordinary differential equations produce approximate solutions only at mesh points. The efficiency of such methods is greatly reduced if the user requests output too frequently. This paper justifies interpolating to resolve this difficulty. In addition the use of interpolation to approximate the derivatives of the solution is justified