ppxscal/embedding_network huggingface dataset:
Execution-driven simulation of multiprocessors: address and timing analysis
Authors: S. Dwarkadas, J. R. Jump, J. B. Sinclair
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1994)

This article describes and evaluates an efficient execution-driven technique for the simulation of multiprocessors that includes the simulation of system memory and that is driven by real program work loads. The technique produces correctly interleaved address traces at run-time without disk access overhead or hardware support, allowing accurate simulation of the effects of a variety of architectural alternatives on programs. We have implemented a simulator based on this technique that offers substantial advantages in terms of reduced time and space overheads when compared to instruction-driven or trace-driven simulation techniques, without significant loss of accuracy. The article presents the results of several validation experiments used to quantify the accuracy and efficiency of the simulator for sequential, distributed, and shared-memory multiprocessors, and several parallel programs. These experiments show that prediction errors of less than 5 percent as compared to actual execution times, and overheads 6 to 30 times lower than those incurred by cycle-level simulation can be achieved. Predictions of relative performance metrics such as speedup tend to be even more accurate, making this technique especially attractive as an efficient method for comparative investigations of parallel system designs.
An approach to interface synthesis
Authors: Jan Madsen, Bjarne Hald
Venue: Proceedings of the 8th international symposium on System synthesis (1995)

Abstract: Presents a novel interface synthesis approach based on a one-sided interface description. Whereas most other approaches consider interface synthesis as optimizing a channel to existing client/server modules, we consider the interface synthesis as part of the client/server module synthesis (which may contain the re-use of existing modules). The interface synthesis approach describes the basic transformations needed to transform the server interface description into an interface description on the client side of the communication medium. The synthesis approach is illustrated through a point-to-point communication, but is applicable to synthesis of a multiple client/server environment. The interface description is based on a formalization of communication events.
Mining for full-text gold on a deadline: information technology subject coverage on the three major services
Authors: John Marcus
Venue: Database (1995)

The rapid advances being made in microprocessor technology have stimulated significant interest in distributed multimedia applications supported by high-speed desktop computers and high-speed networks. Examples of distributed multimedia applications include multimedia database retrieval, distributed multimedia documents, and video mail. Due to the large amount of multimedia traffic for audio/visual applications, these applications require high-speed networks to retrieve data in real time, instead of huge local disk storage.
Accountability and computer decision systems
Authors: Deborah G. Johnson, John M. Mulvey
Venue: Communications of the ACM (1995)

Are designers responsible for all of the uses of the systems they create?
Network security in a client/server environment
Authors: Carl Stephen Guynes, Ron G. Thorn
Venue: ACM SIGSAC Review (1995)

There are numerous network security and access control issues to be considered when implementing a client/server system. As the server is usually the central location for critical data, adequate physical security and operational security measures need to be taken to insure the safety of the data. Although there are a large number of tools available to perform security and control functions on mainframe systems, there are significantly less tools available that are designed specifically for client/server systems. Until these tools are developed, companies must exercise extreme caution when placing mission critical applications on a client/server system. The end-user computing evolution provided computing power at the workplace, and resulted in end-user demand for access to corporate data with little regard for the security of that data. (Adam, 1992).
Automating the process of building simulation models
Authors: Simaan M. AbouRizk, Jingsheng Shi, Brenda McCabe, Dany Hajjar
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Presents concepts and implementations for automated construction simulation modeling for aggregate crushing plant operations (CRUISER) and for earthmoving operations (AP2-EARTH). In the automated modeling environment, the user can specify a real-world construction system: its physical components, required resources and other system information. A simulation model is automatically constructed, and the experimentation can then be performed using the generated model. One of the major advantages of an automated modeling process is that it allows a user to build and experiment with a simulation model for a real-world system without being proficient in simulation as required by current simulation packages.
Reducing time in an emergency room via a fast-track
Authors: Marelys L. García, Martha A. Centeno, Camille Rivera, Nina DeCario
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Queues at emergency rooms (ER) are prioritized based on the patient's sickness level. As a consequence, patients with low priority frequently have to wait excessively long. At Mercy Hospital, we began to study means by which such time would be reduced, without putting in jeopardy the life of critical patients. As an initial effort, we studied the flow of patients at the Emergency Department (ED) and decided to model it with and without a fast track lane. A simulation study revealed that indeed a fast track lane reduces by almost 25% the time in the system for patients with low priority without negatively affecting the times of patients with higher priority.
Performance of the VAX-11/780 translation buffer: simulation and measurement
Authors: Douglas W. Clark, Joel S. Emer
Venue: ACM Transactions on Computer Systems (TOCS) (1985)

A virtual-address translation buffer (TB) is a hardware cache of recently used virtual-to-physical address mappings. The authors present the results of a set of measurements and simulations of translation buffer performance in the VAX-11/780. Two different hardware monitors were attached to VAX-11/780 computers, and translation buffer behavior was measured. Measurements were made under normal time-sharing use and while running reproducible synthetic time-sharing work loads. Reported measurements include the miss ratios of data and instruction references, the rate of TB invalidations due to context switches, and the amount of time taken to service TB misses. Additional hardware measurements were made with half the TB disabled. Trace-driven simulations of several programs were also run; the traces captured system activity as well as user-mode execution. Several variants of the 11/780 TB structure were simulated.
A Theory of Wormhole Routing in Parallel Computers
Authors: Sergio Felperin, Prabhakar Raghavan, Eli Upfal
Venue: IEEE Transactions on Computers (1996)

Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until its reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing a message is transmitted as a contiguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we give theoretical analyses of simple wormhole routing algorithms, showing them to be nearly optimal for butterfly and mesh connected networks. Our analysis requires initial random delays in injecting messages to the network. We report simulation results suggesting that the idea of random initial delays may have an impact beyond theoretical analysis.
The joy of software&mdash;starting with objects
Authors: Mark Woodman, Gordon Davies, Simon Holland
Venue: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education (1996)

This paper briefly describes the evolution and content of the Open University's new introductory course in Computing which has been designed for delivery internationally to over 3500 students per year. It replaces a conventional procedural programming course and introduces computing through object technology---specifically, through Smalltalk. Unlike its predecessor it is being designed to be accessible by non-computing majors and with an intention to address the gender imbalance in our student population. Multimedia technologies are used in the delivery of this distance learning course which is being developed by the course team for presentation in 1997.
Sequential random sampling
Authors: J. H. Ahrens, U. Dieter
Venue: ACM Transactions on Mathematical Software (TOMS) (1985)

Fast algorithms for selecting a random set of exactly k records from a file of n records are constructed. Selection is sequential: the sample records are chosen in the same order in which they occur in the file. All procedures run in O(k) time. The &ldquo;geometric&rdquo; method has two versions: with or without O(k) auxiliary space. A further procedure uses hashing techniques and requires O(k) space.
Boundary Stabilization for the von Karman Equations
Authors: Jean-Pierre Puel, Marius Tucsnak
Venue: SIAM Journal on Control and Optimization (1995)

The boundary stabilization of a nonlinear plate model is studied. The equations used take in consideration the in-plane accelerations and the rotary inertia of the cross sections. Applying linear feedbacks, the authors obtain the exponential decay of the energy.
Carry-Save Multiplication Schemes Without Final Addition
Authors: Luigi Ciminiera, Paolo Montuschi
Venue: IEEE Transactions on Computers (1996)

Carry-save multipliers require an adder at the last step to convert the carry-sum representation of the most significant half of the result into a non-redundant form. This paper presents n×n multiplication schemes where this conversion is performed with a circuit operating in parallel with the carry-save array. The most relevant feature of the proposed multipliers is that the full 2n-bit result is produced, unlike similar multiplication schemes presented in the literature.
A methodology for a unified ADT course
Authors: M. D. Evans
Venue: ACM SIGCSE Bulletin (1995)

"From an instructor's perspective (and also from the student's perspective) a course is rarely satisfying unless there is some 'big idea' that seems to hold the disparate elements together." [3,Pg.78]. This big idea is often lacking in a traditional introductory abstract data type (ADT) course, as students frequently perceive it to be a study of disjoint topics - a collection of ADTs. This paper proposes a context, indeed a methodology, for providing a unifying view of the topics and their significance, while suggesting an emphasis on the abstract nature, and design, of ADT's. Simultaneously, it supports a set of broad themes and recurring concepts which offer a unifying perspective on the pair of courses CS1 and CS2, and which establish fundamental ideas and skills pervasive throughout further studies in computing science.
Evaluating intelligent tutoring with gaming-simulations
Authors: Julika Siemer, Marios C. Angelides
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Gaming-simulation is an important pedagogical tool for learning. However, as an educational tool gaming-simulation follows the concept of discovery learning and, therefore, does not necessarily support any direct educational aim. A way to overcome this weakness is to support gaming-simulation with an intelligent tutoring facility. Although it is generally believed that intelligent gaming-simulations have great potential for instruction, little work has been done on the development of an appropriate evaluation method to estimate the efficiency of their intelligent tutoring. The paper presents an introduction to intelligent gaming-simulation. It also proposes an evaluation method for the assessment of the tutoring abilities of intelligent gaming-simulations.
Automated support for software development with frameworks
Authors: Albert Schappert, Peter Sommerlad, Wolfgang Pree
Venue: ACM SIGSOFT Software Engineering Notes (1995)

This document presents some of the results of an industrial research project on automation of software development. The project's objective is to improve productivity and quality of software development. We see software development based on frameworks and libraries of prefabricated components as a step in this direction. An adequate development style consists of two complementary activities: the creation of frameworks and new components for functionality not available and the composition and configuration of existing components.Just providing adequate frameworks and components does not necessarily yield automation and efficiency of software development. We developed the concept of relations between software components as a foundation for abstraction, reuse and automatic code generation for component interrelationship. Furthermore we suggest to supplement frameworks with an active cookbook consisting of active recipes which guide the software developer in the use of framework elements.In this paper our concept of using relations among software components is presented and the active cookbook is illustrated as a means for developer guidance. We created a prototype to demonstrate these concepts.
A supplementary package for distance education students studying introductory programming
Authors: Tanya McGill, Valerie Hobbs
Venue: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education (1996)

Teaching introductory programming can be a challenging task. Students can become too concerned with learning syntax at the expense of more general conceptual understanding. Distance education students in particular often have problems as the difficulty of the course content is compounded by the problems of isolation from other students and their tutor. Although instructional strategies for emphasising conceptual knowledge are well known for face-to-face instruction, there has been little attempt to apply them to the external situation. This paper describes a supplementary package for external students designed to address some of these problems. The package has been used for two semesters and feedback from students indicates that they find it a valuable resource.
Establishing a new curriculum in computer technology: the process continues
Authors: Josephine Alessi Freedman
Venue: 3C ON-LINE (1996)

The creation of a new curriculum requires a great deal of enthusiasm, energy, and perseverance, coupled with the support from department colleagues and all the upper levels of administration. The academic and political environment during the academic year 1994-1995 was conducive for the Computer Science Department to establish a new career track curriculum. In this article, I will enumerate the steps that I took to create and establish the Computer Technology curriculum at Suffolk Community College as well as the frustrations and stumbling blocks that I experienced along the way.
Performance comparison of ILP machines with cycle time evaluation
Authors: Tetsuya Hara, Hideki Ando, Chikako Nakanishi, Masao Nakaya
Venue: Proceedings of the 23rd annual international symposium on Computer architecture (1996)

Many studies have investigated performance improvement through exploiting instruction-level parallelism (ILP) with a particular architecture. Unfortunately, these studies indicate performance improvement using the number of cycles that are required to execute a program, but do not quantitatively estimate the penalty imposed on the cycle time from the architecture. Since the performance of a microprocessor must be measured by its execution time, a cycle time evaluation is required as well as a cycle count speedup evaluation. Currently, superscalar machines are widely accepted as the machines which achieve the highest performance. On the other hand, because of hardware simplicity and instruction scheduling sophistication, there is a perception that the next generation of microprocessors will be implemented with a VLIW architecture. A simple VLIW machine, however, has a serious weakness regarding speculative execution. Thus, it is a question whether a simple VLIW machine really outperforms a superscalar machine. We recently proposed a mechanism called predicating that supports speculative execution for the VLIW machine, and showed a significant cycle count speedup over a scalar machine. Although the mechanism is simple, it is unknown how much it imposes a penalty on the cycle time, and how much the performance is improved as a result. This paper evaluates both the cycle count speedup and the cycle time for three ILP machines: a superscalar machine, a simple VLIW machine, and the VLIW machine with predicating. The evaluation results show that the simple VLIW machine slightly outperforms the superscalar machine, while the VLIW machine with predicating achieves a significant speedup of 1.41x over the superscalar machine.
Validating real-time systems by history-checking TRIO specifications
Authors: Miguel Felder, Angelo Morzenti
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1994)

We emphasize the importance of formal executable specifications in the development of real-time systems, as a means to assess the adequacy of the requirements before a costly development process takes place. TRIO is a first-order temporal logic language for executable specification of real-time systems that deals with time in a quantitative way by providing a metric to indicate distance in time between events and length of time intervals. We summarize the language and its model-parametric semantics. Then we present an algorithm to perform history checking, i.e., to check that a history of the system satisfies the specification. This algorithm can be used as a basis for an effective specification testing tool. The algorithm is described; an estimation of its complexity is provided; and the main functionalities of the tool are presented, together with sample test cases. Finally, we draw conclusions and indicate directions of future research.
A low-cost, high-yield intelligent decision support system for Navy contract termination processing
Authors: Merrill E. Warkentin, Christopher K. Carlson, Stephen R. Ruth
Venue: ACM SIGAPP Applied Computing Review (1995)

This paper describes a contract termination processing model developed for the US Naval Supply Systems Command (NAVSUP). CONTERM serves as an intelligent decision support system for processing contracts recommended as termination candidates. The system employs a benefit-cost model formula, derived from domain experts, to evaluate prospective supply contract termination actions. It emulates expert decision behavior typical of competent contract administrators in this domain. System features are provided for documentation of the evaluation, processing, collection of data for subsequent analysis, and merging and reporting collective statistics from operation. Because of its low unit costs of development and its potential for rapid fanout into operational use in scores of Navy contracting sites, it may be a paradigm for other high yield --- low cost models.
A consideration of some approaches to course organization
Authors: S. Rebecca Thomas
Venue: ACM SIGART Bulletin (1995)

An introductory artificial intelligence course may be taught with emphasis on theory and formalism ("science"), or with emphasis on designing and building artifacts that display intelligence ("engineering"). Along another dimension, it makes pedagogical sense to organize the course around a central theme, but the course may instead be taught as a smorgasbord of approaches and problems. This paper briefly considers the four possible combinations of approaches.
Remarks on Nonlinear Stochastic Partial Differential Equations: An Application of the Splitting-Up Method
Authors: Noriaki Nagase
Venue: SIAM Journal on Control and Optimization (1995)

The objective of this article is to apply the splitting-up method to the existence theorem for nonlinear stochastic partial differential equations. With use of this method an approximating sequence is constructed. By the compactness argument a convergent subsequence can be extracted, and this fact provides the solution.
XIL and YIL: the intermediate languages of TOBEY
Authors: Kevin O'Brien, Kathryn M. O'Brien, Martin Hopkins, Arvin Shepherd, Ron Unrau
Venue: ACM SIGPLAN Notices (1995)

Typically, the choice of intermediate representation by a particular compiler implementation seeks to address a specific goal. The intermediate language of the TOBEY compilers, XIL, was initially chosen to facilitate the production of highly optimal scalar code, yet, it was easily extended to a higher level form YIL in order to support a new suite of optimizations which in most existing compilers are done at the level of source to source translation. In this paper we will discuss those design features of XIL that were important factors in the production of optimal scalar code. In addition we will demonstrate how the strength of the YIL abstraction lay in its ability to access the underlying low level representation.
A Priori Bounds on the Euclidean Traveling Salesman
Authors: Timothy Law Snyder, J. Michael Steele
Venue: SIAM Journal on Computing (1995)

It is proved that there are constants $c_1$, $c_2$, and $c_3$ such that for any set $S$ of $n$ points in the unit square and for any minimum-length tour $T$ of $S$ (1) the sum of squares of the edge lengths of $T$ is bounded by $c_1 \log n$; (2) the number of edges having length $t$ or greater in $T$ is at most $c_2/t^2$; and (3) the sum of edge lengths of any subset $E$ of $T$ is bounded by $c_3 |E|^{1/2}$. The second and third bounds are independent of the number of points in $S$, as well as their locations. Extensions to dimensions $d>2$ are also sketched. The presence of the logarithmic term in (1) is engaging because such a term is not needed in the case of the minimum spanning tree and several analogous problems, and, furthermore, we know that there always exists some tour of $S$ (which perhaps does not have minimal length) for which the sum of squared edges is bounded independently of $n$.
Exploring configurations of functional units in an out-of-order superscalar processor
Authors: Stéphan Jourdan, Pascal Sainrat, Daniel Litaize
Venue: ACM SIGARCH Computer Architecture News (1995)

This study has been carried out in order to determine cost-effective configurations of functional units for multiple-issue out-of-order superscalar processors. The trace-driven simulations were performed on the six integer and the fourteen floating-point programs from the SPEC 92 suite. We first evaluate the number of instructions allowed to be concurrently processed by the execution stages of the pipeline. We then apply some restrictions on the execution issue of different instruction classes in order to define these configurations. We conclude that five to nine functional units are necessary to exploit Instruction-Level Parallelism. An important point is that several data cache ports are required in a processor of degree 4 or more. Finally, we report on complementary results on the utilization rate of the functional units.