ppxscal/embedding_network huggingface dataset:
The Amber system: parallel programming on a network of multiprocessors
Authors: J. Chase, F. Amador, E. Lazowska, H. Levy, R. Littlefield
Venue: Proceedings of the twelfth ACM symposium on Operating systems principles (1989)

This paper describes a programming system called Amber that permits a single application program to use a homogeneous network of computers in a uniform way, making the network appear to the application as an integrated multiprocessor. Amber is specifically designed for high performance in the case where each node in the network is a shared-memory multiprocessor. Amber shows that support for loosely-coupled multiprocessing can be efficiently realized using an object-based programming model. Amber programs execute in a uniform network-wide object space, with memory coherence maintained at the object level. Careful data placement and consistency control are essential for reducing communication overhead in a loosely-coupled system. Amber programmers use object migration primitives to control the location of data and processing.
A rewriting semantics for program dependence graphs
Authors: R. Parsons-Selke
Venue: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

Program dependence graphs are an important program representation technique for use in vectorization, parallelization and programming environments. We present a graph rewriting semantics for program dependence graphs and prove the equivalence between the program dependence graphs semantics and the operational semantics for programs. We then propose a framework for studying program transformations using program dependence graphs and a programming language calculus based on this rewriting semantics.
Information management directions: the integration challenge
Authors: E. N. Fong, A. H. Goldfine
Venue: ACM SIGMOD Record (1989)

On October 31 - November 2, 1988, the National Computer Systems Laboratory of the National Institute of Standards and Technology, formerly the National Bureau of Standards, in cooperation with the Association for Computing Machinery Special Interest Group on Management of Data, the IEEE Computer Society Technical Committee on Database Engineering, and the Federal Data Management Users Group, held the fifth in the series of Information Management Directions (formerly called Data Base Directions) workshops. The purpose of these workshops is to examine in depth key trends and strategies that affect the future of the information management profession. The focus of Workshop 5 was on issues related to integration and productivity. The complete workshop report, INFORMATION MANAGEMENT DIRECTIONS: THE INTEGRATION CHALLENGE, has been published by the National Institute of Standards and Technology as Special Publication 500-167, and can be ordered from the Superintendent of Documents, U.S. Government Printing Office, Washington, DC 20402.
An Empirical Comparison of Textual and Graphical Data Structure Documentation for Cobol Programs
Authors: J. A. Lehman
Venue: IEEE Transactions on Software Engineering (1989)

The author presents the results of an experimental investigation into the comparative usefulness of textual tools and graphical tools for the program understanding phase of Cobol program maintenance. Both novice and experienced programmers are used as subjects. The results show a slight superiority for graphical tools when they are used by less experienced programmers. They cast doubt on the importance of rigid adherence to program design methodologies for experienced programmers and on the extensibility of experiments using relatively inexperienced student subjects.
Heterogeneous distributed database systems for production use
Authors: Gomer Thomas, Glenn R. Thompson, Chin-Wan Chung, Edward Barkmeyer, Fred Carter, Marjorie Templeton, Stephen Fox, Berl Hartman
Venue: ACM Computing Surveys (CSUR) (1990)

It is increasingly important for organizations to achieve additional coordination of diverse computerized operations. To do so, it is necessary to have database systems that can operate over a distributed network and can encompass a heterogeneous mix of computers, operating systems, communications links, and local database management systems. This paper outlines approaches to various aspects of heterogeneous distributed data management and describes the characteristics and architectures of seven existing heterogeneous distributed database systems developed for production use. The objective is a survey of the state of the art in systems targeted for production environments as opposed to research prototypes.
Paint by numbers: abstract image representations
Authors: Paul Haeberli
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

Computer graphics research has concentrated on creating photo-realistic images of synthetic objects. These images communicate surface shading and curvature, as well as the depth relationships of objects in a scene. These renderings are traditionally represented by a rectangular array of pixels that tile the image plane.As an alternative to photo-realism, it is possible to create abstract images using an ordered collection of brush strokes. These abstract images filter and refine visual information before it is presented to the viewer. By controlling the color, shape, size, and orientation of individual brush strokes, impressionistic paintings of computer generated or photographic images can easily be created.
Measured response times for page-sized fetches on a network
Authors: J. M. Smith, G. Q. Maguire,  Jr.
Venue: ACM SIGARCH Computer Architecture News (1989)

Previous work has examined the response times associated with disk accesses and the response time associated with various memory access operations. Here, we discuss the response time behavior of access requests for pagesized objects which are made using a network connection. We feel that future architectures must include networked resources as a component of the storage hierarchy; such performance measurements will help architects place these resources intelligently.
An expert database for material and production planning
Authors: B. G. Prasad
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper suggests a new approach to the computerisation of Materials Production Management. The paper starts by taking a sample situation which arises in an industry and describes a methodology by which better solution can be obtained. This paper essentially talks about the application of Expert Databases to Materials Production Planning and an overview of the computational techniques needed.
Debugging heterogeneous distributed systems using event-based models of behavior
Authors: Peter Bates
Venue: ACM SIGPLAN Notices (1989)

Event Based Behavioral Abstraction (EBBA) is a high-level debugging approach which treats debugging as a process of creating models of actual behavior from the activity of the system and comparing these to models of expected system behavior. The differences between the actual and expected models are used to characterize erroneous system behavior and direct further investigation. A set of EBBA-based tools has been implemented that users can employ to construct libraries of behavior models and investigate the behavior of an errorful system through these models. EBBA evolves naturally as a cooperative distributed program that can take better advantage of computational power available in a network computer system to enhance debugging tool transparency, reduce latency and uncertainty for fundamental debugging activities and accommodate diverse, heterogeneous architectures.
Reducing risks from poorly chosen keys
Authors: T. Lomas, L. Gong, J. Saltzer, R. Needhamn
Venue: Proceedings of the twelfth ACM symposium on Operating systems principles (1989)

It is well-known that, left to themselves, people will choose passwords that can be rather readily guessed. If this is done, they are usually vulnerable to an attack based on copying the content of messages forming part of an authentication protocol and experimenting, e.g. with a dictionary, offline. The most usual counter to this threat is to require people to use passwords which are obscure, or even to insist on the system choosing their passwords for them. In this paper we show alternatively how to construct an authentication protocol in which offline experimentation is impracticable; any attack based on experiment must involve the real authentication server and is thus open to detection by the server noticing multiple attempts.
Good splitters for counting points in triangles
Authors: J. Matoušek, E. Welzl
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

A set A of n points in the plane has to be stored in such a way that for any query triangle t the number of points of A inside t can be computed efficiently. For this problem a solution is presented with &Ogr;(&radic;n log n) query time, &Ogr; (n log n) space and &Ogr;(n3/2 log n) preprocessing time. The constants in the asymptotic bounds are small, and the method is easy to implement.
Arrays and references
Authors: Jean-Jacques Girardot
Venue: ACM SIGAPL APL Quote Quad (1990)

Generalized arrays in APL have been for long a very controversial subject. Since we are now undertaking the redaction of an extended standard for APL, it seems legitimate to reopen the old debate. An analysis of both nested and boxed array systems, in the light of a new development in APL which consists of the introduction of a new data-type in the language, shows the interest of having both systems with their own specificities.
Element order and convergence rate of the conjugate gradient method for data parallel stress analysis
Authors: K. K. Mathur, S. L. Johnsson
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A data parallel formulation of the finite element method is described. The data structures and the algorithms for stiffness matrix generation and the solution of the equilibrium equations are presented briefly. The generation of the elemental stiffness matrices requires no communication, even though each finite element is distributed over several processors. The conjugate gradient method with a diagonal preconditioner has been used for the solution of the resulting sparse linear system. This formulation has been implemented on the Connection Machine&reg; model CM-2. The simulations reported in this article investigate the influence of the mesh discretization and the interpolation order on the convergence behavior of the conjugate gradient method. A linear dependence of the convergence behavior on the mesh discretization parameter is observed. In addition, the convergence rate depends on the interpolation order p as &Ogr;(p1.6). The peak floating point rate (single-precision) for the evaluation of the stiffness matrix is approximately 2.4 Gflops s-1. The iterative solver peaks at nearly 850 Mflops s-1.
Design and implementation of the UW Illustrated compiler
Authors: K. Andrews, R. R. Henry, W. K. Yamamoto
Venue: ACM SIGPLAN Notices (1988)

We have implemented an illustrated compiler for a simple block structured language. The compiler graphically displays its control and data structures, and so gives its viewers an intuitive understanding of compiler organization and operation. The illustrations were planned by hand and display information naturally and concisely.
Primitive recursion without implicit predecessor
Authors: M. J. Fischer, R. P. Fischer R. Beigel
Venue: ACM SIGACT News (1989)

The primitive recursive functions are the least class of functions on the natural numbers containing the constant, successor, and projection functions, and closed under composition and the rule of primitive recursion. A weakened rule of primitive recursion, lacking implicit predecessor, is shown nevertheless to be adequate for defining all of the primitive recursive functions. However, it is conjectured that the still weaker rule of iteration is not adequate, and it is shown that an easily characterized class of 1-Place functions that includes predecessor cannot be defined when only 0- and 1-place intermediate functions are allowed.
Dataflow for logic program as substitution manipulator
Authors: S. Yamasaki
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

This paper shows a method of constructing a dataflow, which denotes the deductions of a logic program, by means of a sequence domain based on equivalence classes of substitutions. The dataflow involves fair merge functions to represent unions of atom subsets over a sequence domain, as well as functions as manipulations of unifiers for the deductions of clauses. A continuous functional is associated with the dataflow on condition that the dataflow completely and soundly denotes the atom generation in terms of equivalent substitutions sets. Its least fixpoint is interpreted as denoting the whole atom generation based on manipulations of equivalent substitutions sets.
A Distributed Commit Protocol for a Multicomputer System
Authors: P. Ancilotti, B. Lazzerini, C. A. Prete, M. Sacchi
Venue: IEEE Transactions on Computers (1990)

A distributed commit protocol suitable for multicomputer systems is described. A general programming environment which provides transactions as a programming tool is discussed. This environment is expected to be more dynamic than a database management system; in particular, it is not known how many and which processes will participate in a specific transaction. Therefore, a model of completely distributed transactions, without any hierarchical structure among the participant processes or any centralized locus of control, is proposed.
An Adventure with a Sad Ending: The SEA
Authors: F.-H. Raymond
Venue: IEEE Annals of the History of Computing (1989)

The Société d'Electronique et d'Automatisme (SEA) was created in 1948 by the electronics engineer F. H. Raymond. At first it produced analog computers (OME and NADAC series) and developed process control devices and flight simulators. In 1955, the SEA installed the first stored-program computer in France, CAB 1011, at a military deciphering service. Other computers followed (CUBA, CAB 2000 series) for scientific and business uses. In 1960, the SEA introduced its small CAB 500 computer, based on novel magnetic circuits with a programming language, PAF; a series of transistorized machines was then produced (CAB 3900 and 4000, DOROTHEE). In 1966, the SEA (800 employees) was absorbed in the merger which created the Compagnie Internationale pour l'Informatique (CII) in the context of the Plan Calcul.
Vanna: a visual environment for the design of distributed systems
Authors: P. Attie, G. Bruns, M. Evangelist, C. Richter, V. Shen
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

Raddle is a language for designing large, distributed systems. Raddle includes several high-level design constructs, such as the N-party interaction, non-deterministic choice, and system modularity structures. These constructs have proven useful in projects we have undertaken with MCC Shareholders. This paper describes the Vanna project, in which the goal is to build preprocessors to various programming languages that allow the expression of Raddle-like designs in a compilable language. Our first preprocessor will be based on Ada.
Some patterns of technological change in high-performance computers
Authors: J. Worlton
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

High-performance computer technology is undergoing a period of unusually rapid change, and this paper attempts to describe the patterns of these changes in a systematic way. Pattern recognition is the basis of technology forecasting, and it is through technology forecasting that we obtain the anticipatory information that allows us to avoid problems and create opportunities. We will first identify the stages in which technological changes occur, and then define &ldquo;change&rdquo; as the first derivative of an information function that describes the state of a technology. We then explore the driving forces that cause three generic patterns of technological change: incremental, exponential, and logistic. Some areas in high-performance computer technology that are following these patterns are then identified, and a forecast is developed. Finally, some limits of high-performance computing are discussed.
Ada simulation technology - methods and metrics
Authors: John E. Melde, Philip G. Gage
Venue: Proceedings of the 21st annual symposium on Simulation (1988)

This paper describes the impact of the Ada programming language on the development and use of simulation models. Based upon the development in Ada of a discrete-event simulation package (A*SIM), Ada is shown to provide numerous language features and methodologies that are ideally suited for modeling and simulation. Productivity and performance metrics collected during development and extensive use of A*SIM are also presented to provide quantitative comparisons of Ada-based modeling and simulation with previous approaches.
Nonclausal deduction in first-order temporal logic
Authors: Martín Abadi, Zohar Manna
Venue: Journal of the ACM (JACM) (1990)

This paper presents a proof system for first-order temporal logic. The system extends the nonclausal resolution method for ordinary first-order logic with equality, to handle quantifiers and temporal operators. Soundness and completeness issues are considered. The use of the system for verifying concurrent programs is discussed and variants of the system for other modal logics are also described.
Design management in base/OPEN
Authors: P. Lundholm
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper presents aspects of a design management model. The area of design management may range from items such as users, access-rights, version- and configuration management to projects and tasks. This paper concentrates on the aspects of configuration management within Design Management Model (DMM). It is part of and implemented within a framework for engineering tool development and tool integration called Base/OPEN. The DMM is presented as an end-user views it through a tool called Browser.
Concurrency Control in Distributed Databases Through Time Intervals and Short-Term Locks
Authors: Ugur Halici, Asuman Dogac
Venue: IEEE Transactions on Software Engineering (1989)

A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with short-term locks to provide serializability and prevent deadlocks. The scheduler is distributed, and the standard transaction execution policy is assumed, that is, the read and write operations are issued continuously during transaction execution. However, the write operations are copied into the database only when the transaction commits. The amount of concurrency provided by the OSN method is demonstrated by log classification. It is shown that the OSN method provides more concurrency than basic timestamp ordering and two-phase locking methods and handles successfully some logs which cannot be handled by any of the past methods. The complexity analysis of the algorithm indicates that the method works in a reasonable amount of time.
MoDE: a UIMS for Smalltalk
Authors: Yen-Ping Shan
Venue: ACM SIGPLAN Notices (1990)

While the Model-View-Controller (MVC) framework has contributed to many aspects of user interface development in Smalltalk, interfaces produced with MVC often have highly coupled model, view, and controller classes. This coupling and the effort required to use MVC make user interface creation a less effective aspect of Smalltalk. The Mode Development Environment (MoDE) is a user interface management system (UIMS) which addresses the above issues. MoDE is composed of two major components: the Mode framework and the Mode Composer. The Mode framework accommodates an orthogonal design which decouples the user interface components and increases their reusability. The Mode Composer reduces the effort of using MoDE by providing a direct-manipulation user interface to its users. This paper discusses the importance of orthogonality and illustrates its incorporation into the design of MoDE. A comparison of the Mode framework and the MVC framework is included.
Compiling complex database transition triggers
Authors: D. Cohen
Venue: ACM SIGMOD Record (1989)

This paper presents a language for specifying database updates, queries and rule triggers, and describes how triggers can be compiled into an efficient mechanism. The rule language allows specification of both state and transition constraints as special cases, but is more general than either. The implementation we describe compiles rules and updates independently of each other. Thus rules can be added or deleted without recompiling any update program and vice versa.
A variable order Runge-Kutta method for initial value problems with rapidly varying right-hand sides
Authors: J. R. Cash, Alan H. Karp
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

Explicit Runge-Kutta methods (RKMs) are among the most popular classes of formulas for the approximate numerical integration of nonstiff, initial value problems. However, high-order Runge-Kutta methods require more function evaluations per integration step than, for example, Adams methods used in PECE mode, and so, with RKMs, it is expecially important to avoid rejected steps. Steps are often rejected when certain derivatives of the solutions are very large for part of the region of integration. This corresponds, for example, to regions where the solution has a sharp front or, in the limit, some derivative of the solution is discontinuous. In these circumstances the assumption that the local truncation error is changing slowly is invalid, and so any step-choosing algorithm is likely to produce an unacceptable step. In this paper we derive a family of explicit Runge-Kutta formulas. Each formula is very efficient for problems with smooth solution as well as problems having rapidly varying solutions. Each member of this family consists of a fifty-order formula that contains imbedded formulas of all orders 1 through 4. By computing solutions at several different orders, it is possible to detect sharp fronts or discontinuities before all the function evaluations defining the full Runge-Kutta step have been computed. We can then either accpet a lower order solution or abort the step, depending on which course of action seems appropriate. The efficiency of the new algorithm is demonstrated on the DETEST test set as well as on some difficult test problems with sharp fronts or discontinuities.