ppxscal/embedding_network huggingface dataset:
Fast barrier synchronization hardware
Authors: Carl J. Beckmann, Constantine D. Polychronopoulos
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Many recent studies have considered the importance of barrier synchronization overhead on parallel loop performance, especially for large-scale parallel machines. This paper describes a hardware scheme for supporting fast barrier synchronization. It allows barrier synchronization to be performed within a single instruction cycle for moderately sized systems, and is scalable with logarithmic increase in synchronization time. It supports a large number of concurrent barriers, and can also be used to support a number of different barrier synchronization schemes. Simulation results show that under reasonable assumptions, this hardware can decrease parallel loop execution time significantly, especially for statically scheduled loops.
An Observation on the Bisectional Interconnection Networks
Authors: Ching-Tien Ho
Venue: IEEE Transactions on Computers (1992)

It is shown that the bisectional interconnection network (BIN) of 2/sup n/ nodes for any even n is isomorphic to the n-dimensional folded hypercube (FHC), an n-dimensional hypercube with additional edges between any two nodes that are of Hamming distance n apart. This observation leads to simplification for the proofs of many interesting properties for the BIN. Inspired by the isomorphism between BIN and FHC, the class of topologies in which nodes are represented by bit strings and two nodes are adjacent if and only if the bitwise Exclusive-OR of their addresses fall in a set of predefined bit string patterns are studied. A few theorems are given to characterize the topology from the mathematical properties of the binary matrix derived from the definition of edges.
The Perspective View of Three Points
Authors: William J. Wolfe, Donald Mathis, Cheryl Weber Sklair, Michael Magee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The perspective view of three noncollinear points whose image-to-object correspondence is known is studied. Such measurements are known to be ambiguous, resulting in as many as four possible solutions to the perspective three-point problem. Although there can be four solutions, it is quite often the case that there are triangle configurations that cause one, two, three, or four solutions. The results also provide a justification for the common wisdom that there are usually two solutions.
Finite-state approximations of grammars
Authors: Fernando Pereira
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Grammars for spoken language systems are subject to the conflicting requirements of language modeling for recognition and of language analysis for sentence interpretation. Current recognition algorithms can most directly use finite-state acceptor (FSA) language models. However, these models are inadequate for language interpretation, since they cannot express the relevant syntactic and semantic regularities. Augmented phrase structure grammar (APSG) formalisms, such as unification grammars, can express many of those regularities, but they are computationally less suitable for language modeling, because of the inherent cost of computing state transitions in APSG parsers.
A logical approach to designing procedural programming languages (abstract)
Authors: Ashvin Radiya
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

New concepts can sometimes be developed by viewing a well established subject matter from a different perspective. A new perspective which has the potential for developing new concepts for designing and defining procedural programming languages is presented. The guidelines for designing procedural programming languages are educed from an analysis of generalized temporal logic. Generalized temporal logic is briefly discussed to present a logical approach to language definition and to arrive at the necessary syntactic and semantic entities for defining procedural programming languages. Then a new definition is given to the essential constructs of sequential programming languages. Next the Propositional Procedural programming Logic Lpp is presented. It is shown that the logic Lpp can be used to express sequential programs, generalized rule-based (in which rules can be fired concurrently) programs, and a certain type of concurrent programs. In this framework, program execution is equivalent to executing a model-searching algorithm. Model-searching algorithms exist independent of a language definition. This allows one to implement a language in any of the sequential, parallel, or distributed computing environments. The potential, applicability, and some of the advantages of this logical approach are presented.
Model-based integration of planning and learning
Authors: Gregg Collins, Lawrence Birnbaum, Bruce Krulwich, Michael Freed
Venue: ACM SIGART Bulletin (1991)

The goal of our research is to construct an integrated model of planning and learning that can account for the acquisition of new planning knowledge. Our approach involves the use of model-based reasoning. In this approach, the system monitors its performance by comparing it with expectations derived from a model of the system's planning architecture. The arguments relating the system's expectations to its underlying model of the planning process are encoded in the form of explicit justification structures. When the system's actual performance diverges from its expectations, it traces back through these justification structures, looking to fault the setting of some controllable parameter of the planner. When such a controllable parameter is isolated, a repair is then effected, in the form of an adjustment to one of these parameters.
Compiling APL for parallel and vector execution
Authors: Timothy A. Budd, Rajeev K. Pandey
Venue: ACM SIGAPL APL Quote Quad (1991)

The inherent parallelism of applicative languages such as APL and functional languages such as FP present a little-exploited and somewhat unorthodox means of parallel programming. Here we summarize our investigation of a new approach to compiling such programs for execution on various types of parallel hardware. Our method centers around an intermediate form that is an extension of the lambda calculus. We present evidence that APL programs are easily translated into this intermediate form, and that this intermediate representation lends itself readily to code generation for a variety of parallel hardware.
Connected components in O(lg3/2|V|) parallel time for the CREW PRAM (extended abstract)
Authors: Donald B. Johnson, Panagiotis Metaxas
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented.
The concept of Gröbner algebras
Authors: P. Beckmann, J. Stückrad
Venue: Journal of Symbolic Computation (1990)

The aim of this paper is to present a common concept for different applications of the method of Grobner bases. This method was developed by Buchberger (1965) for polynomial rings. Later on extensions to non-commutative algebras were studied by several authors. For our approach we use valuations of (commutative or non-commutative) algebras.
A data model for software representation (abstract)
Authors: Wafa Khorshid, Asad Khailany
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

As software systems evolve, they grow larger and more complex. Thus, they become difficult to maintain. This is true, because making a change to a software system requires an understanding of how the part being changed fits into the system and of the potential ripple effect the change may have on the system. Understanding the software system is a time consuming activity. This is due to the fact that a software system is an abstract complex object. It may consist of many parts which are interrelated in many different ways forming a complex structure. Moreover, if the source code is the only reliable document that is available about a software system, understanding the software system will be more time consuming. The code of a software system show very little of their internal state and does not reveal the structure of the software system for the maintainer. Two of the factors that help the understanding of the programs are: 1) the ability to see the information relevant to what we want to understand and 2) the use of a more natural form of representation of information. In order to provide effective support for the software maintenance process, we believe that both factors described above should be incorporated in a software programming environment. In this paper, we present an environment which incorporate these factors and provides mechanisms for seeing and manipulating software in a much more powerful way than the current systems.
Storyboarding: an advance organizer suited for constructing visually informative text
Authors: T. F. Carney
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1992)

Visually informative text is complex text. It involves complex typesetting in regard to typeface and font mixes, body-copy formatting, and page layout and grid design. It is much influenced by writing teams which are enabled by microcomputer technology. Its complex organization means moving from books produced by printers to books crafted by book designers. The advantage of visually informative text is that it results in complex documents, designed for reading by different kinds of readers. But such de-centred writing, when combined with complexity of format and subject matter, necessitates complex, multi-layered planning. The current advance organizers are inadequate for dealing with this level of complexity in the writing up process. What is needed is a more "advanced" advance organizer, one designed to assist writers who have to deal with writing assignments that are complex both because of their complicated construction and because of interactivity among their writers during their composition and development.
Disk Allocation Methods Using Error Correcting Codes
Authors: Christos Faloutsos, Dimitris Metaxas
Venue: IEEE Transactions on Computers (1991)

The problem of declustering, that is, how to distribute a binary Cartesian product file on multiple disks to maximize the parallelism for partial match queries, is examined. Cartesian product files appear as a result of some secondary key access methods. For the binary case, the problem is reduced to grouping the 2/sup n/ binary strings on n bits in m groups of unsimilar strings. It is proposed that the strings be grouped such that these group forms an error correcting code (ECC). This construction guarantees that the strings of a given group will have large Hamming distances, i.e., they will differ in many bit positions. Intuitively, this should result in good declustering. The authors describe how to build a declustering scheme using an ECC, and prove a theorem that gives a necessary condition for the proposed method to be optimal. Analytical results show that the proposed method is superior to older heuristics, and that it is very close to the theoretical (nontight) bound.
Stochastic evolution: a fast effective heuristic for some generic layout problems
Authors: Youssef G. Saab, Vasant B. Rao
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

There are two canonical optimization problems, namely, NETWORK BISECTIONING (NB) and TRAVELING SALESMAN (TS), that emerge from the physical design and layout of integrated circuits. In this paper, we use an analogy between iterative techniques for combinatorial optimization and the evolution of biological species to obtain the Stochastic Evolution (SE) heuristic for solving a wide range of combinatorial optimization problems. We show that SE can be specifically tailored to solve both NB and TS. Experimental results for the NB and TS problems show that the SE algorithm produces better quality solutions and is faster than the Simulated Annealing algorithm in all instances considered.
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor
Authors: Prithviraj Banerjee, Joe T. Rahmeh, Craig Stunkel, V. S. Nair, Kaushik Roy, Vijay Balasubramanian, Jacob A. Abraham
Venue: IEEE Transactions on Computers (1990)

The design of fault-tolerant hypercube multiprocessor architecture is discussed. The authors propose the detection and location of faulty processors concurrently with the actual execution of parallel applications on the hypercube using a novel scheme of algorithm-based error detection. System-level error detection mechanisms have been implemented for three parallel applications on a 16-processor Intel iPSC hypercube multiprocessor: matrix multiplication, Gaussian elimination, and fast Fourier transform. Schemes for other applications are under development. Extensive studies have been done of error coverage of the system-level error detection schemes in the presence of finite-precision arithmetic, which affects the system-level encodings. Two reconfiguration schemes are proposed that allow the authors to isolate and replace faulty processors with spare processors.
Functional Fault Simulation as a Guide for Biased-Random Test Pattern Generation
Authors: Gabriel M. Silberman, Ilan Spillinger
Venue: IEEE Transactions on Computers (1991)

An approach to the generation of test patterns for implementation-level faults is presented. The approach involves fault simulation on a functional-level description of a combinational VLSI design, together with an appropriate functional fault model. The methodology uses the difference fault model (DFM), a formal abstraction of the faults at the implementation level, as the basis for fault simulation at the functional level. Incremental information from fault simulation results provides guidance for the generation of nonuniformly random test patterns using a backtracing process. The quality of the generated patterns is measured in terms of their coverage of implementation faults.
Anser: An Application of Speech Technology to the Japanese Banking Industry
Authors: Ryohei Nakatsu
Venue: Computer (1990)

A system called Anser, which combines speech recognition and synthesis to offer telephone banking services to millions of customers, is described. Anser's design, its current application in banking services and the reasons for its success are discussed. Experience with Anser is examined and potential applications are indicated.
Scheduling and IPC mechanisms for continuous media
Authors: Ramesh Govindan, David P. Anderson
Venue: Proceedings of the thirteenth ACM symposium on Operating systems principles (1991)

Next-generation workstations will have hardware support for digital "continuous media" (CM) such as audio and video. CM applications handle data at high rates, with strict timing requirements, and often in small "chunks". If such applications are to run efficiently and predictably as user-level programs, an operating system must provide scheduling and IPC mechanisms that reflect these needs. We propose two such mechanisms: split-level CPU scheduling of lightweight processes in multiple address spaces, and memory-mapped streams for data movement between address spaces. These techniques reduce the the number of user/kernel interactions (system calls, signals, and preemptions). Compared with existing mechanisms, they can reduce scheduling and I/O overhead by a factor of 4 to 6.
Piecewise surface flattening for non-distorted texture mapping
Authors: Chakib Bennis, Jean-Marc Vézien, Gérard Iglésias
Venue: ACM SIGGRAPH Computer Graphics (1991)

This paper introduces new techniques for interactive piecewise flattening of parametric 3-D surfaces, leading to a non-distorted, hence realistic, texture mapping. Cuts are allowed on the mapped texture and we make a compromise between discontinuities and distortions. These techniques are based on results from differential geometry, more precisely on the notion of "geodesic curvature": isoparametric curves of the surface are mapped, in a constructive way, onto curves in the texture plane with preservation of geodesic curvature at each point. As an application, we give a concrete example which is a first step towards an efficient and robust CAD tool for shoe modeling.
Declarative programming of graphical interfaces by visual examples
Authors: Ken Miyashita, Satoshi Matsuoka, Shin Takahashi, Akinori Yonezawa, Tomihisa Kamada
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Graphical user interfaces (GUI) provide intuitive and easy means for users to communicate with computers. However, construction of GUI software requires complex programming that is far from being intuitive. Because of the &ldquo;semantic gap&rdquo; between the textual application program and its graphical interface, the programmer himself must conceptually maintain the correspondence between the textual programming and the graphical image of the resulting interface. Instead, we propose a programming environment based on the programming by visual example (PBVE) scheme, which allows the GUI designers to &ldquo;program&rdquo; visual interfaces for their applications by &ldquo;drawing&rdquo; the example visualization of application data with a direct manipulation interface. Our system, TRIP3, realizes this with (1) the bi-directional translation model between the (abstract) application data and the pictorial data of the GUI, and (2) the ability to generate mapping rules for the translation from example application data and its corresponding example visualization. The latter is made possible by the use of generalization of visual examples, where the system is able to automatically generate generalized mapping rules from a given set of examples.
Some Defects in Finite-Difference Edge Finders
Authors: Margaret M. Fleck
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

This work illustrates and explains various artifacts in the output of five finite difference edge finders, those of J.F. Canny (1983, 1986), R.A. Boie et al. (1986) and R.A. Boie and I.J. Cox (1987), and three variations on that of D. Marr and E.C. Hildreth (1980), reimplemented with a common output format and method of noise suppression. These artifacts include gaps in boundaries, spurious boundaries, and deformation of region shape.
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System
Authors: Ibrahim H. Önyüksel, Keki B. Irani
Venue: IEEE Transactions on Computers (1990)

An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.
A random polynomial-time algorithm for approximating the volume of convex bodies
Authors: Martin Dyer, Alan Frieze, Ravi Kannan
Venue: Journal of the ACM (JACM) (1991)

A randomized polynomial-time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within K.
A Parallel Technique for Signal-Level Perceptual Organization
Authors: Shih-Ping Liou, Arnold H. Chiu, Ramesh C. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Due to the potential for essentially unbounded scene complexity, it is often necessary to translate the sensor-derived signals into richer symbolic representations. A key initial stage in this abstraction process is signal-level perceptual organization (SLPO) involving the processes of partitioning and identification. A parallel SLPO algorithm that follows the global hypothesis testing paradigm, but breaks the iterative structure of conventional region growing through the use of alpha -partitioning and region filtering is presented. These two techniques segment an image such that the gray-level variation within each region can be described by a regression model. Experimental results demonstrate the effectiveness of this algorithm.
Beyond induction variables
Authors: Michael Wolfe
Venue: ACM SIGPLAN Notices (1992)

Induction variable detection is usually closely tied to the strength reduction optimization. This paper studies induction variable analysis from a different perspective, that of finding induction variables for data dependence analysis. While classical induction variable analysis techniques have been used successfully up to now, we have found a simple algorithm based on the Static Single Assignment form of a program that finds all linear induction variables in a loop. Moreover, this algorithm is easily extended to find induction variables in multiple nested loops, to find nonlinear induction variables, and to classify other integer scalar assignments in loops, such as monotonic, periodic and wrap-around variables. Some of these other variables are now classified using ad hoc pattern recognition, while others are not analyzed by current compilers. Giving a unified approach improves the speed of compilers and allows a more general classification scheme. We also show how to use these variables in data dependence testing.
Wafer-Scale Integration Using Restructurable VLSI
Authors: Allan H. Anderson, Jack I. Raffel, Peter W. Wyatt
Venue: Computer (1992)

Results from a restructurable very large scale integration (RVLSI) program show the viability of using a laser to restructure wafer-scale circuits for customization and defect avoidance. Wafer-scale circuits are built with a standard integrated circuit fabrication process when the diffused-link restructuring device is used. Nine wafer-scale systems that have been built using the RVLSI technique are described. It is shown that the laser interconnection process has high yield and provides the high reliability of monolithic circuitry. The technology is well suited to signal processing systems, which characteristically use many replications of a small number of circuits and often have modest interconnection requirements.
Seeing the text from the user's point of view
Authors: Karen Kline-Simon
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1992)

In his 1986 article, "Seeing the Text," Stephen Bernhardt urges college composition instructors to add visual cues to their toolbox of traditional rhetorical strategies for expository writing. Perhaps the single most significant point that Bernhardt makes is contained in his opening paragraph: written text is necessarily a visual medium of communication. Even the most traditional use of text---graphic representation of the spoken language---gives the reader a tremendous increase in access control of the information. As the number, variety, and quality of visual clues increase beyond the graphic representation of spoken language, accessibility of information also increases.