ppxscal/embedding_network huggingface dataset:
A Characterization of Processor Performance in the vax-11/780
Authors: Joel S. Emer, Douglas W. Clark
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper reports the results of a study of VAX-11/780 processor performance using a novel hardware monitoring technique. A micro-PC histogram monitor was built for these measurements. It keeps a count of the number of microcode cycles executed at each microcode location. Measurement experiments were performed on live timesharing workloads as well as on synthetic workloads of several types. The histogram counts allow the calculation of the frequency of various architectural events, such as the frequency of different types of opcodes and operand specifiers, as well as the frequency of some implementation-specific events, such as translation buffer misses. The measurement technique also yields the amount of processing time spent in various activities, such as ordinary microcode computation, memory management, and processor stalls of different kinds. This, paper reports in detail the amount of time the &ldquo;average&rdquo; VAX instruction spends in these activities.
System/370 extended architecture: A program view of the channel subsystem
Authors: Robert J. Dugan
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

The 370-XA channel-subsystem architecture represents an evolutionary and significant extension of the System/370 channel architecture. This paper examines the programming-machine interface of the 370-XA channel subsystem and how it was designed to meet the requirements called for by the evolution of IBM's large-scale systems. In particular, emphasis has been placed upon meeting the needs of multiprocessing, maintaining availability, and supporting large I/O configurations while at the same time preserving compatibility for running System/370 channel programs.
Two systems which produce animated representations of the execution of computer programs
Authors: Ron Baecker
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

This paper describes two prototype systems which facilitate the production of teaching films containing animated representations of the execution of computer programs. With such systems, it is possible for an instructor to produce short quick-and-dirty single-concept film clips with only hours of effort, and more polished material with only slightly more effort. Demonstration clips produced in this way will be shown at the Symposium.
Access path lengths and performance measurement of data Base systems
Authors: William G. Tuel,  Jr.
Venue: Proceedings of the 1975 annual conference (1975)

In data base systems supporting relatively complex logical structures, the length of the access path can account for a significant portion of the overall resource demands of a transaction. Since many data base design decisions affect the access path, it becomes important to measure these lengths and characterize their effect on system performance, both in terms of CPU usage and I/O efficiency. Alternatively, measurement of access path lengths for transactions may point to possible design alternatives and give some indication of their effectiveness. Recently a framework for the evaluation of data base systems has been proposed. This framework describes transaction processing in terms of decomposition into primitive queries, which are further decomposed into steps along the access path. Each step along the access path is then related to a physical access, which may or may not require physical I/O. Because of the fan-out from transaction to access path step, resource requirements for a transaction can be determined in terms of the access path step atoms and how these steps are mapped into the physical data structure.
Stress in the information systems professional
Authors: John M. Ivancevich, H. Albert Napier, James C. Wetherbe
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

Stress is and always has been a normal part of life. It has both beneficial and harmful effects. The present study examines occupational stress among information systems personnel. A self-report stress and health behavior instrument was completed by 580 respondents in eighteen large corporations in the midwest and southwestern sections of the United States. The data indicates that various job factors are perceived as stressful by respondents. However, the stress levels reported by respondents are not as excessive as has been found in studies of other occupational groups. The data was also examined on the basis of position held, years of service, and sex to clarify the profile of stress among information systems personnel.
Microprogrammed spectrum analysis
Authors: Timothy J. Mulrooney
Venue: ACM SIGMICRO Newsletter (1978)

This paper will demonstrate how microprogramming affects the FFT. An interactive simulator is used to draw comparisons between an assembler FFT, a microprogrammed FFT, and a microprogrammed FFT with a hard-wired multiply. The FFT is analyzed in detail and the bottlenecks involved with microprogramming are graphically displayed.
Recursion schemes with lists
Authors: James H. Morris,  Jr.
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

Scheme translation is used to compare the abilities of languages obtained by augmenting recursion schemes with lists, markers, and functional values. It is shown that the first two additions make orthogonal contributions to the language's power. Theorems 4 and 5 appear to be new results.
Programming languages for non-numeric processing&mdash;2: A universal assembly mapping language
Authors: M. L. Graham, P. Z. Ingerman
Venue: Proceedings of the 1965 20th national conference (1965)

THE PRIMEVAL ASSEMBLY LANGUAGES generally provided a one-to-one mapping from the symbolic to the numeric version of a program, that is, from assembly language to machine language. The second major step in the development of assembly languages was the inclusion of a one-to-many capability, in the form of the macro, which allows the user to build several machine words in a systematic, parameterized manner with a one line call. HalpernH64 has implemented an assembly meta-language which expects virtually every line of a program to be either a macro call or a contribution to the definition of a macro. In Halpern's system, the parameterization is performed in terms of symbolic quantities. FergusonF64, on the other hand, has implemented an assembly meta-language in which the parameterization process operates in terms of the allocation-time values of the symbols used. The present paper specifies an assembly meta-language, based on the work of Ferguson, but in which the parameterization can at any point be either by symbol or by value. This system is currently being implemented at the Westinghouse Defense and Space Center.
Efficient LR(1) processor construction
Authors: A. J. Korenjak
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Strings from LR(k) grammars can be recognized and parsed in linear time by a processor that is directed by a pre-computed parsing table. This paper deals with two questions of practical importance: the effort required to generate an LR(k)parsing table for a grammar and the size of the table generated. Knuth has described an algorithm for checking an arbitrary context-free grammar for the LR(k) condition and producing a parsing table, if possible. The time-complexity of this algorithm and the size of the table it produces are each exponential functions of the grammar size. Thus, for very large grammars &mdash; such as those defining the syntax of a programming language &mdash; it is not feasible to use this algorithm directly. This paper presents a practical method of checking large cfgs for the LR(1) condition and generating the corresponding parsing table. It significantly decreases both the computation required to produce the parsing table and the size of the resulting table. It operates as follows. The given grammar G is partitioned into a number of parts. Each part is checked for LR(1)-ness and individual parsing tables are generated, using the Knuth algorithm. Certain conditional modifications to these tables are then made; if the conditions are satisfied, the grammar G is LR(1) and the modified tables can be combined into a single parsing table for G. Because of the exponential nature of the Knuth algorithm, this process of partitioning, computing and combining can greatly improve the efficiency of the table generation procedure. Using this method LR(1) parsers for a number of programming languages, including ALGOL, have been constructed. The empirical evidence obtained has verified the efficacy of this method: in one programming language example, table construction time was reduced by a factor of nine and the table size was reduced by a factor of three.
Sensorimotor learning in a simulated physical environment
Authors: Robert P. Plummer
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

A computer program that interacts through sensory and motor mechanisms with a simulated two-dimensional environment is described. The program receives information from the environment through visual and tactile senses, and possesses an arm with which it can move objects. Learning mechanisms are described that allow the program to progress from almost random initial behavior to fairly organized interactions with the environment, including guiding the arm by use of visual information. The program retains its knowledge of its world in a net-like structure.
A two year computer science program
Authors: Gerald N. Pitts, Barry Bateman
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

The accelerated accumulation of knowledge in recent years has illustrated graphically the value of developing human resources to their most usable form at an early point in each person's life span. Not only is this early development important to the continued growth of the nation but to the expanded life style and earned human dignity of each individual. Traditional education techniques have fallen short in this regard. Students have graduated from two year colleges, four year colleges, and graduate programs with ill defined capabilities directed toward no specific area within the world of work. Human resource capability loss has been staggering and in some instances, irreparable harm has resulted. In recognizing the problem and its wide-spread ramifications the Federal Government as well as State Governments have developed programs of career education for junior and four year colleges. Central Texas College in Killeen, Texas, is one of these development areas and provides an excellent two year associate degree in Computer Science. The curriculum and text requirements are presented in this paper.
Graph models of computer systems: Application to performance evaluation of an operating system
Authors: James Wayne Anderson, J. C. Browne
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

This paper defines and determines a graph model of a computer system in a form applicable to system performance analysis. The power of this modeling technique with respect to comprehensibility, accuracy of representation and ease of validation and modification is demonstrated by application to modeling of the UT-2 operating system for the CDC 6000 series computer system. This multiprocessor-multi-programmed operating system with its high degree of parallelism provides an excellent test for the utility and range of application of graph models in performance evaluation. A programmed representation of the kernel monitor is used. All other system processes are represented in graph form and are input data to the simulator. A generally applicable technique for extracting graph representations of processes are represented in graph form and are input data to the simulator. A generally applicable technique for extracting graph representations of processes from event trace data is described and applied to the event trace generated by the UT-2 operating system. The technique is both complete and general and may be profitably applied for either partial or complete models of any type of complex computer system process where data or techniques for automated graph construction are available or can he applied.
Important criteria in selecting engineering work stations
Authors: Fontaine K. Richardson
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper discusses the changes in perspective brought about by the migration of Design Automation tools from the drafting and layout departments upstream to the electronic design engineer. Criteria are suggested for selecting among this new breed of computer-aided engineering (CAE) workstations. A brief description introduces the driving forces behind the need for increased engineering productivity including: product life cycles vs. product development cycles, number of design engineers vs. industry needs and the push for improved product quality and innovation. In addition, the design engineering task is examined to determine which areas are most likely to benefit from CAE tools. The paper examines four important considerations: functionality, ease of use, price and flexibility. Each of these considerations is defined, including issues that may not be readily appearent. Hidden costs are uncovered, functionality is defined in terms of user requirements rather than specifications, and the elements of ease of use and flexibility are examined and related directly to real design engineering problems.
The application of computer graphics to environmental planning
Authors: Paul M. Wilson
Venue: Proceedings of the ACM 1980 annual conference (1980)

The emerging field of environmental planning has relied heavily on computer technology - especially computer graphics - as a necessary tool in the study of problems such as air and water pollution , toxic wastes, and land use. This reliance increased greatly during the last decade, and is likely to further mature in the eighties. BASIS, a geographic information system developed for environmental planning in the San Francisco Bay Area, is used as an example of an existing system incorporating new technologies.
A retrospective on the Dorado, a high-performance personal computer
Authors: Kenneth A. Pier
Venue: ACM SIGARCH Computer Architecture News (1983)

In late 1975, members of the Xerox Palo Alto Research Center embarked on the specification of a high-performance successor to the Alto personal minicomputer, in use since 1973. After four years, the resulting machine, called the Dorado, was in use within the research community at PARC. This paper begins with an overview of the design goals, architecture, and implementation of the Dorado and then provides a retrospective view and critique of the Dorado project as a whole. The major machine architectural features are evaluated, other project aspects such as design automation and management structures are explained, a chronological history with milestones is included, and a variety of accomplishments, red herrings, and shortfalls is discussed. The paper concludes with some speculations on what the project might have done differently and what might be done differently today instead of in the late 1970s. Although more than a dozen scientists and technicians contributed to the project, the evaluative and speculative parts of this paper are the sole responsibility of the author.
The value of digital printer plotting in ship design
Authors: Alexander C. Landsburg
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Ship Design is an iterative process which involves much graphical information and a sizeable amount of computation. Present computer aided design methods fall short of desired effectiveness due to the difficulty of handling graphical input and output. Some work has been done toward exploiting the use of computer driven plotters, CRT's, and digitizers as design aids. Graphic peripherals are relatively expensive, however, and a lack of available resources prompted the author to explore the utilization of the standard line printer in creating various graphical outputs which would be helpful in the design process. A general set of plotting subroutines was developed and these were then incorporated into a system of ship design programs. Applications to date have been found extremely useful.
Connecting Frameworks: Case Study with Middleware-Based Load Balancing
Authors: Erik Putrycz, Guy Bernard
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

With the increasing demand in application adaptability and the current availability of open libraries, delegating concerns in external frameworks becomes a more and more common software engineering practice. A consequence of this evolution is that the way frameworks are connected becomes an important issue for modularity, maintainability and extensibility.We study in this paper the framework connections involved in a typical middleware application using our load balancing service called DLBS. Such application consists in three frameworks: the client application, the middleware and DLBS.DLBS (Dynamic Load Balancing Service) brings new solutions regarding large scale load balancing for middleware based applications. DLBS offers a portable, multi-criteria and customizable load balancing service. It consists of a scalable monitoring infrastructure, a connection manager and customizable load balancing strategies. DLBS portability and integration across several middleware is made using aspect oriented techniques.
Programming and algorithms II: A second course in computer science
Authors: Douglas S. Kerr
Venue: ACM SIGCSE Bulletin (1978)

Ohio State's school year is divided into four quarters, each ten weeks long. It is possible to schedule classes to meet three, four, or five hours per week. (The latter with 50 class meetings is similar to a three semester hour course.) Most students attend classes for three of the four quarters. Because the amount of material covered in a programming class is proportional to the number and quality of programs completed, we have chosen a two quarter sequence, each course meeting three days a week. The students receive four quarter hours credit (one hour of laboratory credit) for each course. The students in this sequence are mostly computer and information science majors, but there are also many mathematics and some science and engineering majors. There are other courses for administrative science, engineering and other non-technical students. All the introductory courses are taught by graduate students under the supervision of a faculty member.
The aliquot project: an application of job chaining in number theoretic computing
Authors: M. C. Wunderlich
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This paper is divided into two parts. Part 1 first presents an old and charming number theoretic conjecture which has been generally believed or at least respected by the mathematical community for over 70 years. A probabilistic argument is then detailed which supports the opposite of this conjecture. A vast amount of computing has been recently done at various universities all over the world in order to investigate the plausibility of this conjecture and it was largely as a result of these computations that the negative argument was formulated. Part II of the paper discusses these computations and describes some of the problems which were encountered in this project. Not only were many hours of machine time consumed but hundreds of man-hours were spent book-keeping and &ldquo;terminal- watching&rdquo; because of the non-homogeneous character of the project. Finally, a software system is described which, when fully implemented, will provide the user with controlled but automatic job submission permitting number theoretic projects such as this to be carried out with much less constant attention.
MATHLAB tutorial
Authors: Carl Engelman
Venue: Proceedings of the 1975 annual conference (1975)

MATHLAB is an on-line system, publicly available under the DECsystem-10 Tops-10 and TENEX operating systems, which provides computer aid for the mechanical symbolic processes encountered in analysis. It is capable of performing, automatically and symbolically, such common procedures as simplification, substitution, differentiation, polynomial factorization, indefinite integration, direct and inverse Laplace transforms, matrix inversion, and the solution of algebraic, simultaneous linear, and linear differential equations with constant (symbolic) coefficients. In addition, it provides bookkeeping services consonant with its on-line function. The presentation will consist of a twenty-minute sound movie intended to explain the motivation of MATHLAB and related systems.
Buffer constraints in a variable-rate packetized video system
Authors: M. Balakrishnan
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper provides an analysis of the buffers in a variable rate video encoding system and provides necessary conditions that need to be met by the channel and the encoder buffer control mechanism in order to ensure that the decoder and encoder buffers do not underflow or overflow. It is also shown that this can be achieved through the monitoring of just the encoder buffer. The paper also provides an algorithm that allows encoders to change their rate, by dynamically changing their logical buffer sizes, and lists the conditions that need to be met prior to the change in channel rate.
Iterative methods for solution of diffusion problems in r--and-thgr; geometry
Authors: D. B. MacMillan
Venue: Proceedings of the 1964 19th ACM national conference (1964)

This paper compares three iteration methods for computing approximately a steady-state solution of the diffusion equation, in a pie-shaped region of the plane, using a finite mesh based on the r--and-thgr; coordinate system. The methods are successive line overrelaxation along curves of constant radius, successive line relaxation along radii, and alternating-direction-implicit iteration. It is concluded that the first-named of these three methods is superior, in that it is expected to converge faster for most problems.
Logic partitioning
Authors: A. J. Stone
Venue: Proceedings of the SHARE design automation project (1966)

A program and underlying algorithms are described which quasi-optimally partition a set of logic equations into subsets which represent physical packaging entities. The criterion for partitioning is the signal communication between equations. Several different methods of measuring and evaluating the criterion are built into the program as optional strategies. The effectiveness of these and other strategies are compared, based on accumulated experience with the program. The important characteristics of the program and its data structures which allow very efficient computer execution time are described. The plans and techniques for further development of the program are also presented.
The arithmetic properties of certain number systems
Authors: Malcolm H. Steward
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

This paper introduces the concept of digit range lowering. It then studies the effects of the selection of radix and of digit lowering on arithmetic processes. An attempt is finally made to indicate the effect of these choices on computer arithmetic section cost. An opinion is given on the optimum choice.