ppxscal/embedding_network huggingface dataset:
Hypersim: distributed discrete-event simulation on an iPSC
Authors: T. C. Hartrum, B. J. Donlan
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

This paper describes HYPERSIM, a distributed discrete-event simulation system developed as a research test bed for distributed simulation synchronization techniques. HYPERSIM is a Fortran-based, GASP-like distributed simulation software system which runs on a 32-node Intel iPSC hypercube computer. The simulation system is used to evaluate and expand on the &ldquo;conservative&rdquo; synchronization techniques developed by K. Mani Chandy and Jayadev Misra [1]. HYPERSIM provides a complete distributed simulation environment with event and multi-use queues, lists, simulated clock management, automatic statistic collection and comprehensive result reporting.
A robust protocol for parallel join operation in distributed data bases
Authors: S. Bandyopadhyay, A. Sengupta
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

Fault tolerant distributed databases use replicated data(e.g., record or relation) to handle failures of one or more nodes in a computer network. Efficient and economic access strategies for such data bases have not been investigated. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied. It has been shown that, for a local area network based on a binary hypercube, having 2r nodes where every data is replicated r times, in the absence of faults, any query involving an arbitrary sequence of joins R1 @@@@ R2 @@@@ &hellip; @@@@ Rn, n &le; r, may be performed by repeatedly executing joins in a distributed fashion using n node disjoint paths from n/2 distinct sites of database operations to n arbitrary sites containing a target relation each. This protocol also solves the problem of materialization of relations. In the presence of up to r-2 faults, the protocol still guarantees N node disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes.
Matrix multiplication on the connection machine
Authors: S. L. Johnsson, T. Harris, K. K. Mathur
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A data parallel implementation of the multiplication of matrices of arbitrary shapes and sizes is presented. A systolic algorithm based on a rectangular processor layout is used by the implementation. All processors contain submatrices of the same size for a given operand. Matrix-vector multiplication is used as a primitive for local matrix-matrix multiplication in the Connection Machine system CM-2 implementation. The peak performance of the local matrix-matrix multiplication is in excess of 20 Gflops s-1. The overall algorithm including all required data motion has a peak performance of 5.8 Gflops s-1.
A plan-based intelligent assistant that supports the software development
Authors: Karen E. Huff, Victor R. Lesser
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

We describe how an environment can be extended to support the process of software development. Our approach is based on the AI planning paradigm. Processes are formally defined hierarchically via plan operators, using multiple levels of abstraction. Plans are constructed dynamically from the operators; the sequences of actions in plans are tailored to the context of their use, and conflicts among actions are prevented. Monitoring of the development process, to detect and avert process errors, is accomplished by plan recognition; this establishes a context in which programmer-selected goals can be automated via plan generation. We also show how nonmonotonic reasoning can be used to make an independent assessment of the credibility of complex process alternatives, and yet accede to the programmer's superior judgment. This extension to intelligent assistance provides deeper understanding of software processes.
An iterative-design model for reusable object-oriented software
Authors: Sanjiv Gossain, Bruce Anderson
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

We present an iterative-design approach for reusable object-oriented software that augments existing design methods by incorporating iteration into the design methodology and focuses on the set of problems within the domain, encouraging reuse of existing design information. The model has five separate stages which are described, before an example design is outlined using the model with sample code constructs in C++. Our results have shown a high degree of code reuse when using the model, directly attributable to two distinct design stages. An analysis of these results is also presented.
Palenque: an interactive multimedia digital video interactive prototype for children
Authors: K. S. Wilson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

The Palenque interactive multimedia digital video interactive prototype is based on themes, locations, and characters from The Second Voyage of the Mimi television show, which is being produced at Bank Street College. In the TV show, a cast of scientists and children explore the Yucatan's ancient Maya ruins and are introduced to the science of archeology. The Palenque prototype incorporates this theme to the extent that the user's experience is based on a virtual travel exploration of an ancient Maya site, Palenque, and on the perusal of a multimedia Palenque Museum database. One of our goals was to create a visually interesting database environment in which information in many formats could be browsed through spatially and thematically by children. In addition, we experimented with icon and window-based interface conventions that would make navigation around the video environment motivating and comprehensible for young users.
Interpretation of Image Flow: A Spatio-Temporal Approach
Authors: M. Subbarao
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A general formulation is described for the interpretation of image flow. In the framework of this formulation, computational methods have been derived for image flow interpretation for many important cases, including simple cases of nonrigid and nonuniform motions. It is possible to derive computational methods for other situations not considered explicitly. The formulation is general in that it is applicable to any situation provided that the scene geometry, the scene transformation, and the image flow are all 'smooth' or analytic.
A methodology of autonomous navigation in 3-D space under location uncertainty
Authors: Alex C.-C. Meng, Vytas B. Gylys
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper addresses the methodology for constructing autonomous navigation schemes for which the path and free space corridor along the path are precomputed by means of Voronoi Diagram methods of computational geometry, and in which the position and the velocity of the vehicle are not exactly known during the navigation process. Such navigation schemes are useful in applications such as the routing of maneuvering missiles or robotic vehicles so that they, by traveling through the free space corridor, will avoid obstacles. An autonomous navigation scheme can be implemented by building it around an estimator which during the navigation process, can cyclically estimates not only the position and velocity of the craft but also the errors in the estimates of these two quantities. Kalman filter (KF) and, to a lesser extent, certain nonlinear extensions of KF, provide a formalism for estimating these errors through the estimates of estimation error covariances, also through the estimation of certain errors as a part of the system state vector. In practice, the use of this formalism requires a great deal of caution. During each navigation cycle, the estimates of position and velocity errors, computed in that cycle, can then be used to construct an uncertainty ellipsoid for position, which in turn is used to make a corrective adjustment in the course of the vehicle.
EC commission communication on establishing an information services market
Authors: CORPORATE European Commission
Venue: Communications of the ACM (1990)

The following is an excerpt from the communciation sent by the European Commission to the Council of Ministers explaining the rationale for an internal information services market. It is followed by the Counicl's formal decision and budget allocation totalling $36 million.
The UT1000 microprogramming simulator: an educational tool
Authors: F. Cornett
Venue: ACM SIGARCH Computer Architecture News (1989)

The concepts of microprogramming and firmware are frequently difficult to explain to computer science students. The subject of firmware is normally introduced in a beginning course of the computer science curriculum, usually as one of many terms for which a definition is memorized, but rarely understood. Even in advanced courses in computer organization or architecture, the concept may remain somewhat abstract to the student. Just as the practice of writing and executing programs in high level languages develops an increased understanding of those languages, writing and executing microprograms aids the student in understanding this concept. This paper describes the UT1000 microprogramming simulator, a software emulator for writing and executing microprograms on a simulated 16 bit CPU built using AMD2901 ALU/register slices and an AMD2910 microprogramming sequencer. The simulator package described here executes on the IBM PC/AT and PS/2 models of microcomputers. In addition to learning microprogramming concepts, the student is exposed to the principles of bit slice architecture, as well.
The National Applied Mathematics Laboratories-A Prospectus
Authors: John H. Curtiss
Venue: IEEE Annals of the History of Computing (1989)

A prospectus is herein set forth for a federal center of applied mathematics, to be operated as a division of the National Bureau of Standards of the Department of Commerce. The center is to be known as the National Applied Mathematics Laboratories. It will specialize in numerical and statistical analysis, and will undertake to offer various services in these fields, and carry on a broad program of research and training. Particular emphasis will be placed on the development of high-speed automatic computing machinery and the mathematical theory needed for its effective use. (1947)
PCLOS: stress testing CLOS experiencing the metaobject protocol
Authors: Andreas Paepcke
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

This paper demonstrates that the CLOS metaobject protocol approach to defining and implementing an object model is very powerful. CLOS is an object-oriented language that is based on Common Lisp and is in the process of being standardized. Implementations of CLOS are themselves object-oriented with all major building blocks of the language being instances of system classes. A metaobject protocol provides a framework for CLOS implementations by specifying the hierarchy of these classes and the order and contents of the communication among their instances. This design has made CLOS both flexible and portable, two design goals that traditionally conflict. In support of this suggestion we present a detailed account of how we added object persistence to CLOS without modifying any of the language's implementation code.
Models of user interactions with graphical interfaces: 1. statistical
Authors: D. J. Gillan, R. Lewis, M. Rudisill
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

Three models of human interactions with computer-displayed statistical graphics were developed and tested in an experiment which examined users' speed and accuracy on identification and comparison questions using 17 graph types. The results indicated that response time and accuracy were influenced by the perceptual and informational complexity of the graph, as well as the relation between the figure and axes, (Model 1); by the physical elements of the graph &mdash; points, lines, and areas (Model 2); and by the data-ink ratio and data density (Model 3). The discussion focuses on the development of a single integrated model of interactions with graphics.
A quantitative evaluation of interrupt handling capabilities in Ada
Authors: D. Strube
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

Projects considering the use of Ada for embedded weapon systems have performance as their primary concern. Despite the genuine interest throughout industry to commit to Ada for reasons of portability and maintainability, the language is still viewed with reservations when being considered for use in applications with high interrupt throughput or tasking requirements. There is increased demand from users for quantitative data on Ada's ability to handle deadlines in realtime. Such data can be used as the basis for language and processor selections. This paper presents a summary of interrupt handling capabilities and quantitative interrupt benchmark measurements for three popular Ada compilers targeted to the Intel 80386 microprocessor.
Nonce functions
Authors: J. Philip Benkard
Venue: ACM SIGAPL APL Quote Quad (1990)

Data, functions, and operators exist in divers current APL systems in primitive, derived, and defined forms. Only data primitives occur in an extended literal form, which can be quite complex. This paper introduces a form of function literal, subsequently extended to include operators. Lexical scope is restricted to the minimum to achieve perspicuousness and syntactic predictability. The short expressions which result form convenient, explicit representations of some common trivial functions. They can indirectly simulate trivial operators. Nonce operators can simulate syntactic entities, which have been called transforms, that produce operators. The trade-offs between extra key strokes and symbol clutter are discussed.
3-D Moment Forms: Their Construction and Application to Object Identification and Positioning
Authors: C.-H. Lo, H.-S. Don
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The 3-D moment method is applied to object identification and positioning. A general theory of deriving 3-D moments invariants is proposed. The notion of complex moments is introduced. Complex moments are defined as linear combinations of moments with complex coefficients and are collected into multiplets such that each multiplet transforms irreducibly under 3-D rotations. The application of the 3-D moment method to motion estimation is also discussed. Using group-theoretic techniques, various invariant scalars are extracted from compounds of complex moments via Clebsch-Gordon expansion. Twelve moment invariants consisting of the second-order and third-order moments are explicitly derived. Based on a perturbation formula, it is shown that the second-order moment invariants can be used to predict whether the estimation using noisy data is reliable or not. The new derivation of vector forms also facilities the calculation of motion estimation in a tensor approach. Vectors consisting of the third-order moments can be derived in a similar manner.
Reflection in an object-oriented concurrent language
Authors: Takuo Watanabe, Akinori Yonezawa
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1988)

Our work is along the line of the work of B. Smith and P. Maes. We first discuss our notion of reflection in object-oriented concurrent computation and then present a reflective object-oriented concurrent language ABCL/R. We give several illustrative examples of reflective programming such as (1) dynamic concurrent acquisition of &ldquo;methods&rdquo; from other objects, (2) monitoring the behavior of concurrently running objects, and (3) augmentation of the time warp mechanism to a concurrent system. Also the definition of a meta-circular interpreter of this language is given as the definition of a meta-object. The language ABCL/R has been implemented. All the examples given in this paper are running on our ABCL/R system.
The KEYSTONE system design methodology
Authors: Eric Kiem
Venue: ACM SIGAda Ada Letters (1989)

The Keystone Methodology uses Entity-Relationship modeling to determine an optimum object-oriented packaging structure, which will exhibit minimum coupling and inter-dependencies between elements of a system and therefore maximum reusability potential. Furthermore, the resulting organization of the data dimension permits extensive use of a limited range of generics to provide complete data manipulation through the use of relational operations. The form and disposition of concurrent elements of a system can also be determined directly from the E-R model. The modeling process is proven and the implementation of the resulting design is systematic.
The unique stresses of user services
Authors: S. Stager
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

Ever wonder why staff from other units of your computer center aren't madly trying to obtain positions in your User Services unit? Or why the turnover rate in your User Services unit is so high? The obvious answer is working in User Services is highly stressful and no one in their right mind chooses to work in a stressful environment. If talented, sane individuals momentarily take leave of their senses and accept positions in the User Services unit, they quickly begin applying for other positions within the organization. A lateral move from User Services to another part of the organization is always viewed by our staff as a promotion because of the ten years such a move adds to one's life expectancy. What causes this stress? According to organizational theory, unclear expectations, change, coping with job demands, and problems surrounded with personal development cause stress at the workplace. How do these theoretical factors relate to User Services? What does the stress of User Services mean for the successful management of the User Services unit? Half the battle of the stress of User Services may be identifying those unique events in day-to-day service delivery that increase stress. For example, why do we let ourselves get more upset by a complaint from a full professor than from an assistant instructor? Why do we get more upset when the network goes down for just 10 seconds than we were the day before when the network was down for 24 hours? And why, in this age of the paperless office, do we get more upset when the Xerox machine breaks down than when the network goes down? This paper focuses on the unique stresses of User Services. Hopefully recognition of these stresses will reduce ambiguity and uncertainty about what causes stress, allowing us to focus on strategies to reduce this stress. By anticipating the unique stresses of User Services, maybe we can defuse a situation before it gets out of hand. What are the unique stresses of User Services?
Improving performance of small on-chip instruction caches
Authors: M. K. Farrens, a. R. Pleszkun
Venue: ACM SIGARCH Computer Architecture News (1989)

Most current single-chip processors employ an on-chip instruction cache to improve performance. A miss in this instruction cache will cause an external memory reference which must compete with data references for access to the external memory, thus affecting the overall performance of the processor. One common way to reduce the number of off-chip instruction requests is to increase the size of the on-chip cache. An alternative approach is presented in this paper, in which a combination of an instruction cache, instruction queue and instruction queue buffer is used to achieve the same effect with a much smaller instruction cache size. Such an approach is significant for emerging technologies where high circuit densities are initially difficult to achieve yet a high level of performance is desired, or for more mature technologies where chip area can be used to provide more functionality. The viability of this approach is demonstrated by its implementation in an existing single-chip processor.
Concurrent I/O system for the hypercube multiprocessor
Authors: A. Witkowski, K. Chandrakumar, G. Macchio
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

This paper describes the Concurrent I/O (CIO) system for the Hypercube Multiprocessor. Our system has three components: Architecture, User Interface, and Programming Paradigm. The architecture of the system is based on clusters. Each cluster has a hypercube topology and contains either computing nodes or I/O nodes. This architecture scales well, provides a convenient naming convention and offers independent connectivity between the I/O nodes. The routing algorithm confines the I/O traffic within the I/O clusters. Clusters can be connected in a variety of ways suitable for such diverse applications as graphics and database systems. The system provides a programming paradigm where several nodes of a multiprocessor can cooperate on creating a file.
Maintaining the evolution of software objects in an integrated enviornment
Authors: A. Gustavsson
Venue: Proceedings of the 2nd International Workshop on Software configuration management (1989)

This paper discusses the organization of software objects in an integrated environment from the software configuration management view. We will emphasize organization by evolution, by membership and by composition. The paper introduces program base objects which are version controlled in order to maintain the evolution of software objects. Different specializations of such objects make it possible to maintain source objects and to support organization of software objects by membership and by composition in a uniform way.
Elint in Lamina: application of a concurrent object language
Authors: B. A. Delagi, N. P. Saraiya
Venue: Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming (1988)

The design and performance of an "expert system" signal interpretion application written in a concurrent object-based programming language, LAMINA, is described together with a synopsis of the programming model that forms the foundation of the language. The effects of load balancing and the limits imposed by task granularity and message transmission costs are studied and their consequences to application performance are measured over the range of one to 250 processors as simulated in SIMPLE/CARE, an extensively instrumented simulation system and computer array model.
Combining software engineering principles with discrete event simulation
Authors: B. J. Schroer, F. T. Tseng, S. X. Zhang
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper presents an approach for using the concepts of software engineering to improve the simulation modeling environment. This approach is demonstrated by discussing the Automatic Manufacturing Programming System with a graphical user interface.