ppxscal/embedding_network huggingface dataset:
Performance evaluation of a decoded instruction cache for variable instruction-length computers
Authors: Gideon Intrater, Ilan Spillinger
Venue: Proceedings of the 19th annual international symposium on Computer architecture (1992)

A Decoded INstruction Cache (DINC) serves as a buffer between the instruction decoder and the other instruction-pipeline stages. In this paper we explain how techniques that reduce the branch penalty based on such a cache, can improve CPU performance. We analyze the impact of some of the design parameters of DINCs on variable instruction-length computers, e.g., CISC machines. Our study indicates that tuning the mapping function of the instructions into the cache, can improve the performance substantially. This tuning must be based on the instruction length distribution for a specific architecture. In addition, the associativity degree has a greater effect on the DINC's performance, than on the performance of regular caches. We also discuss the difference between the performance of DINCs and other caches, when longer cache lines are used. The results presented were obtained by both analytical study and trace-driven simulations of several integer UNIX applications.
Near-optimal multiprocessor scheduling
Authors: Farideh A. Samadzadeh, G. E. Hedrick
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Problems in employing several processors to execute a program can be identified as: a) discovering the potential parallelism of execution in different portions of the same program, and b) scheduling of the resulting task system. This research concentrates on the latter problem. More specifically, this research focuses on designing graph-based scheduling algorithms that produce near-optimal schedules using task system graphs. It is possible for the tasks in a task system to be completely disjoint, or to be interdependent. Algorithms suitable for scheduling of dependent and independent tasks are presented and discussed.
Eliminating Interlocks in Deeply Pipelined Processors by Delay Enforced Multistreaming
Authors: Daniel C. McCrackin
Venue: IEEE Transactions on Computers (1991)

The delay enforced multistreaming (DEMUS) processor architecture provides a simple, inexpensive ways of achieving high hardware utilization in deeply pipelined processors. Multiple streams share the pipeline in an interleaved fashion. Both the data dependency problem and the jump problem are prevented by enforcing enough interdispatch delay on each individual stream to prevent successive instructions from interfering with each other's execution. The structure and operation of a small DEMUS processor are presented, and four stream dispatching algorithms are compared by means of a simple simulation. Of the three implementable algorithms, the modified fixed delay (DEMUS/MFD) and encoded delay with fixed minimum (DEMUS/EDF) mechanisms yield the highest performance.
Notes on Shuffle/Exchange Type Permutation Sets
Authors: Shing-Tsaan Huang
Venue: IEEE Transactions on Computers (1990)

Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Omega , Omega /sup -1/, Psi , L, and U; Omega and Omega /sup -1/ are, respectively, the omega and inverse omega permutation sets, Omega identical to ( Omega intersection Omega /sup -1/); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed.
Lower bounds for on-line graph coloring
Authors: Magnús M. Halldórsson, Márió Szegedy
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

An algorithm for vertex-coloring graphs is said to be online if each vertex is irrevocably assigned a color before any later vertices are considered. We show that such algorithms are inherently ineffective. The performance ratio of any such algorithm can be no better than &OHgr;(n/log2 n), even for randomized algorithms against oblivious adversary. We also show that various means of relaxing the constraints of the on-line model do not reduce these lower bounds. The features include presenting the input in blocks of log2 n vertices, recoloring any fraction of the vertices, presorting vertices according to degree, and disclosing the adversary's previous coloring.
Graphically-oriented reverse engineering tools for Ada software (abstract)
Authors: James H. Cross,  II
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Computer professionals have long promoted the idea that graphical representations of software are extremely useful as comprehension aids when used to supplement textual descriptions and specifications of software, especially for large complex systems. The general goal of this research is the study and formulation of graphical representations of algorithms, structures, and processes for Ada (GRASP/Ada). The research is presently focused on the extraction and generation of graphical representations from Ada source code to directly support the process of reverse engineering. Our primary motivation for reverse engineering is increased support for software reusability and software maintenance. While applications written in Ada may seem somewhat young to benefit from reverse engineering, NASA and others are quickly amassing libraries of Ada packages. Both reuse and maintenance should be greatly facilitated by automatically generating a set of &ldquo;formalized diagrams&rdquo; to supplement the source code and other forms of existing documentation. The first tool implemented was the Control Structure Diagram (CSD Generator. The CSD is representative of a new group of graphical representations for algorithms that can co-exist with PDL or source code. The CSD generator has the potential to increase the comprehensibility of Ada PDL and/or source code, which may have wide-ranging implications for the design, implementation, and maintenance of software written in Ada. In particular, the tool can provide graphical representations which are more easily understood than their textual equivalents. Graphical aids which can increase the efficiency of understanding will ultimately reduce the overall cost of software.
Automating the assignment of submitted manuscripts to reviewers
Authors: Susan T. Dumais, Jakob Nielsen
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

The 117 manuscripts submitted for the Hypertext '91 conference were assigned to members of the review committee, using a variety of automated methods based on information retrieval principles and Latent Semantic Indexing. Fifteen reviewers provided exhaustive ratings for the submitted abstracts, indicating how well each abstract matched their interests. The automated methods do a fairly good job of assigning relevant papers for review, but they are still somewhat poorer than assignments made manually by human experts and substantially poorer than an assignment perfectly matching the reviewers' own ranking of the papers. A new automated assignment method called &ldquo;n of 2n&rdquo; achieves better performance than human experts by sending reviewers more papers than they actually have to review and then allowing them to choose part of their review load themselves.
Superimposing encrypted data
Authors: K. W. Yu, Tong Lai Yu
Venue: Communications of the ACM (1991)

Much has been written about the necessity of processing data in the encrypted form. However, no satisfactory method of processing encrypted data has been published to date. Ahitub et al. [2] have analyzed the possibilities of using some special algorithms to add encrypted data. Rivest et al. [10] have suggested the use of an algorithm based on homomorphic functions for processing encrypted data. The main limitation of this algorithm is that such functions can be broken by solving a set of linear equations, as noted by [2]. The public-key crytosystem described in [11] can be used to multiply encrypted data but cannot be used to add encrypted data and is therefore not appropriate for some practical applications such as bank transactions. Abadi, Feigenbaum and Kilian [1] presented some general theorems concerning the problem of computing with encrypted data and formulated a framework to prove precise statements about what an encrypted instance hides and reveals; they also described encryption schemes for some well-known functions.
Treating statement sequences as block objects
Authors: Hanspeter Mössenböck
Venue: ACM SIGPLAN Notices (1992)

We propose a language construct for treating statement sequences as block objects that can be passed to procedures as arguments. Block objects are well known from Smalltalk but are not available in most other languages. We show how to implement block objects efficiently.
A perspective on personal communication services (PCS)
Authors: Dhawal B. Moghe
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

PCN will be the vehicle for the next generation of mobile communications utilizing digital technology that will lead to communications exchange with anyone, anytime and anywhere. The panel will provide perspectives on the PCN technology, service, applications and providers of these services.
Identifying Extended Entity-Relationship Object Structures in Relational Schemas
Authors: V. M. Markowitz, J. A. Makowsky
Venue: IEEE Transactions on Software Engineering (1990)

Relational schemas consisting of relation-schemes, key dependencies and key-based inclusion dependencies (referential integrity constraints) are considered. Schemas of this form are said to be entity-relationship (EER)-convertible if they can be associated with an EER schema. A procedure that determines whether a relational schema is EER-convertible is developed. A normal form is proposed for relational schemas representing EER object structures. For EER-convertible relational schemas, the corresponding normalization procedure is presented. The procedures can be used for analyzing the semantics of existing relational databases and for converting relational database schemas into object-oriented database schemas.
A General Model for Performance Investigations of Priority Based Multiprocessor System
Authors: Ashwani K. Ramani, Pradip K. Chande, Pramod C. Sharma
Venue: IEEE Transactions on Computers (1992)

A general discrete time semi-Markov model is developed to investigate the effects of task priorities on the system performance of a multiprocessor system with crossbar interconnection network. The number of priority levels associated with the tasks in the system, connection times of different priority level requests, interrequest time, number of processing elements, and the number of shared resources are the parameters involved in estimation of the performance of the system. The bandwidth, queue length at a memory, waiting time for requests at different priority levels, and processor utilization are the performance measures quantified from the analysis. The results reveal the advantage received by the tasks at higher priority levels and the starvation experienced by the lower priority tasks. This information should be useful in the real-time task scheduling, load balancing, and performance optimization. The results obtained are validated with simulation.
Representing extended entity-relationship structures in relational databases: a modular approach
Authors: Victor M. Markowitz Arie Shoshani
Venue: ACM Transactions on Database Systems (TODS) (1992)

A common approach to database design is to describe the structures and constraints of the database application in terms of a semantic data model, and then represent the resulting schema using the data model of a commercial database management system. Often, in practice, Extended Entity-Relationship (EER) schemas are translated into equivalent relational schemas. This translation involves different aspects: representing the EER schema using relational constructs, assigning names to relational attributes, normalization, and merging relations. Considering these aspects together, as is usually done in the design methodologies proposed in the literature, is confusing and leads to inaccurate results. We propose to treat separately these aspects and split the translation into four stages (modules) corresponding to the four aspects mentioned above. We define criteria for both evaluating the correctness of and characterizing the relationship between alternative relational representations of EER schemas.
Multiple feedback queue as a model of general purpose multiprocessor systems
Authors: ChiShih Chang, Victor L. Wallace
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

In this paper an approach toward modeling a multi-programmed general purpose multiprocessor system which links concurrent job structure with processor system structure is proposed. This new approach preserves the property of task precedence relations associated with a family of concurrent processes and yet provides a simple way to evaluate performance of a job and the system.
Highly continuous Runge-Kutta interpolants
Authors: D. J. Higham
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

To augment the discrete Runge-Kutta solutlon to the mitlal value problem, piecewlse Hermite interpolants have been used to provide a continuous approximation with a continuous first derivative We show that it M possible to construct mterpolants with arbltrardy many continuous derivatives which have the same asymptotic accuracy and basic cost as the Hermite interpol ants. We also show that the usual truncation coefficient analysis can be applied to these new interpolants, allowing their accuracy to be examined in more detad As an Illustration, we present some globally C2 interpolants for use with a popular 4th and 5th order Runge-Kutta pair of Dormand and Prince, and we compare them theoretically and numerically with existing interpolants.
Visibility-ordering meshed polyhedra
Authors: Peter L. Williams
Venue: ACM Transactions on Graphics (TOG) (1992)

A visibility-ordering of a set of objects from some viewpoint is an ordering such that if object a obstructs object b, then b precedes a in the ordering. An algorithm is presented that generates a visibility-ordering of an acyclic convex set of meshed convex polyhedra. This algorithm takes time linear in the size of the mesh. Modifications to this algorithm and/or preprocessing techniques are described that permit nonconvex cells nonconvex meshes (meshes with cavities and/or voids), meshes with cycles, and sets of disconnected meshes to be ordered. Visibility-ordering of polyhedra is applicable to scientific visualization, particularly direct volume rendering. It is shown how the ordering algorithms can be used for domain decomposition of finite element meshes for parallel processing, and how the data structures used by these algorithms can be used to solve the spatial point location problem. The effects of cyclically obstructing polyhedra are discussed and methods for their elimination are described, including the use of the Delaunay triangulation. Methods for converting nonconvex meshes into convex meshes are described.
A Fast Translation Method for Paging on Top of Segmentation
Authors: William J. Dally
Venue: IEEE Transactions on Computers (1992)

A description is presented of a fast, one-step translation method that implements paging on top of segmentation. This method translates a virtual address into a physical address, performing both the segmentation and paging translations, with a single TLB (translation lookaside buffer) read and a short add. Previous methods performed this translation in two steps and required two TLB reads and a long add. Using the fast method, the fine-grain protection and relocation of segmentation combined with paging can be provided with delay and complexity comparable to paging-only systems. This method allows small segments, particularly important in object-oriented programming systems, to be managed efficiently.
Object operations benchmark
Authors: R. G. G. Cattell, J. Skeen
Venue: ACM Transactions on Database Systems (TODS) (1992)

Performance is a major issue in the acceptance of object-oriented and relational database systems aimed at engineering applications such as computer-aided software engineering (CASE) and computer-aided design (CAD). Because traditional database systems benchmarks are inapproriate to measure performance for operations on engineering objects, we designed a new benchmark Object Operations version 1 (OO1) to focus on important characteristics of these applications. OO1 is descended from an earlier benchmark for simple database operations and is based on several years experience with that benchmark. In this paper we describe the OO1 benchmark and results we obtained running it on a variety of database systems. We provide a careful specification of the benchmark, show how it can be implemented on database systems, and present evidence that more than an order of magnitude difference in performance can result from a DBMS implementation quite different from current products; minimizing overhead per database call, offloading database server functionality to workstations, taking advantage of large main memories, and using link-based methods.
Loop displacement: an approach for transforming and scheduling loops for parallel execution
Authors: Rajiv Gupta
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

This paper describes loop displacement a mapping that can be used to transform loops and schedule loops for parallel execution. Loop displacement can be applied to hybrid multiply nested loops to achieve the following: Transform sequential loops into parallel loops. Transform and schedule loops to reduce synchronization overhead. Generate schedules that distribute the load evenly among the processors. Generate schedules that reduce idling of processors. Integrate loop transformation and loop scheduling. Loop displacement can be used in place of loop alignment, loop coalescing, and loop skewing. It generalizes loop spreading, a scheduling technique for achieving good load balancing, to multiply nested loops and generates schedules with better load distribution and sometimes less processor idling than those generated by OPTAL a static loop partitioning algorithm. Furthermore, it integrates loop transformation and loop scheduling which provides better results. Achieving the goals of a variety of loop transformation and scheduling strategies through loop displacement can simplify the compiler and allow intelligent techniques that integrate the application of transformations to be developed.
Exploiting inter-operation parallelism in XPRS
Authors: Wei Hong
Venue: Proceedings of the 1992 ACM SIGMOD international conference on Management of data (1992)

In this paper, we study the scheduling and optimization problems of parallel query processing using interoperation parallelism in a shared-memory environment and propose our solutions for XPRS. We first study the scheduling problem of a set of a continuous sequence of independent tasks that are either from a bushy tree plan of a single query or from the plans of multiple queries, and present a clean and simple scheduling algorithm. Our scheduling algorithm achieves maximum resource utilizations by running an IO-bound task and a CPU-bound task in parallel with carefully calculated degrees of parallelism and maintains the maximum resource utilizations by dynamically adjusting the degrees of parallelism of running tasks whenever necessary. Real performance figures are shown to confirm the effectiveness of our scheduling algorithm. We also revisit the optimization problem of parallel execution plans of a single query and extend our previous results to consider inter-operation parallelism by introducing a new cost estimation method to the query optimizer based on our scheduling algorithm.
Artificial intelligence applications to communication network design with bulk facilities
Authors: Hong Liu, Aaron Kershenbaum, Richard Van Slyke
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper presents a heuristic sytem for a special problem in communication network design with bulk facilities, called the TI problem. We apply AI to this problem. The knowledge acquired from an expert team is represented procedurally. Our work shows the promise of applying AI methodologies in solving network optimization problems.
A Design Approach for Ultrareliable Real-Time Systems
Authors: Jaynarayan H. Lala, Richard E. Harper, Linda S. Alger
Venue: Computer (1991)

A design approach developed over the past few years to formalize redundancy management and validation is described. Redundant elements are partitioned into individual fault-containment regions (FCRs). An FCR is a collection of components that operates correctly regardless of any arbitrary logical or electrical fault outside the region. Conversely, a fault in an FCR cannot cause hardware outside the region to fail. The outputs of all channels are required to agree bit-for-bit under no-fault conditions (exact bitwise consensus). Synchronization, input agreement, and input validity conditions are discussed. The Advanced Information Processing System (AIPS), which is a fault-tolerant distributed architecture based on this approach, is described. A brief overview of recent applications of these systems and current research is presented.
An Efficient Channel Routing Algorithm to Yield an Optimal Solution
Authors: Jia-Shung Wang, R. C. T. Lee
Venue: IEEE Transactions on Computers (1990)

An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal solution for the channel routing problem in VLSI design. The algorithm is an A* algorithm with good heuristics and dominance rules for terminating unnecessary nodes in the searching tree. Experimental results, agreeing with theoretical analysis, show that it behaves quite well in average cases. An optimal solution is obtained for the Deutsch difficult case in 5.5-min-CPU time after the algorithm is implemented in Pascal and run on a VAX 11/750 computer.
Symbolic computation with fermions
Authors: D. I. Hughes
Venue: Journal of Symbolic Computation (1990)

A set of REDUCE routines for manipulating operators which anticommute amongst themselves is described. These routines have applications in theories such as supergravity where anticommuting operators are used to represent fermions. The Dirac bracket of the supersymmetry constraints arising in a quantum cosmological model based on N=1 supergravity coupled to a massless scalar multiplet is calculated as an example.
Fixed and flexible phrase structure: coordination in tree adjoining grammars
Authors: Aravind K. Joshi, Yves Schabes
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

Phrase-structure grammars assign a unique phrase structure (constituency) to an unambiguous sentence. Thus, for example, <i>John likes apples</i> will be bracketed as follows (ignoring the phrase labels and ignoring some brackets not essential for our present purpose):(1) (John (likes apples))
The ESPRIT project polyglot
Authors: Louis Boves
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

The ESPRIT project POLYGLOT aims at developing multi-lingual Speech-to-Text and Text-to-Speech conversion and to integrate this technology in a number of commercially viable prototype applications. Speech-to-Text conversion is mainly concerned with very large vocabulary isolated word recognition. It uses a statistical knowledge based approach that was pioneered for Italian and is now being extended to other languages. Work on continuous speech recognition has the character of an in-depth feasibility study. For Text-to-Speech conversion a new multi-level data structure is developed that facilitates rule writing by offering a semi-graphical rule format. The recognition and synthesis technology is used to build a number of generic prototype applications that mainly address office automation.