ppxscal/embedding_network huggingface dataset:
The impact of job memory requirements on gang-scheduling performance
Authors: Sanjeev Setia, Mark S. Squillante, Vijay K. Naik
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

Almost all previous research on gang-scheduling has ignored the impact of real job memory requirements on the performance of the policy. This is despite the fact that on parallel supercomputers, because of the problems associated with demand paging, executing jobs are typically allocated enough memory so that their entire address space is memory-resident. In this paper, we examine the impact of job memory requirements on the performance of gang-scheduling policies. We first present an analysis of the memory-usage characteristics of jobs in the production workload on the Cray T3E at the San Diego Supercomputer Center. We also characterize the memory usage of some of the applications that form part of the workload on the LLNL ASCI supercomputer. Next, we examine the issue of long-term scheduling on MPPs, i.e., we study policies for deciding which jobs among a set of competing jobs should be allocated memory and thus should be allowed to execute on the processors of the system. Using trace-driven simulation, we evaluate the impact of using different long-term scheduling policies on the overall performance of Distributed Hierarchical Control (DHC), a gang-scheduling policy that has been studied extensively in the research literature.
Convex Entropies and Hyperbolicity for General Euler Equations
Authors: Ami Harten, Peter D. Lax, C. David Levermore, William J. Morokoff
Venue: SIAM Journal on Numerical Analysis (1998)

The compressible Euler equations possess a family of generalized entropy densities of the form $\rho f(\sigma)$, where $\rho$ is the mass density, $\sigma$ is the specific entropy, and f is an arbitrary function. Entropy inequalities associated with convex entropy densities characterize physically admissible shocks. For polytropic gases, Harten has determined which $\rho f(\sigma)$ are strictly convex. In this paper we extend this determination to gases with an arbitrary equation of state. Moreover, we show that at every state where the sound speed is positive (i.e., where the Euler equations are hyperbolic) there exist $\rho f(\sigma)$ that are strictly convex, thereby establishing the converse of the general fact that the existence of a strictly convex entropy density implies hyperbolicity.
Incremental view maintenance in object-oriented databases
Authors: Reda Alhajj, Faruk Polat
Venue: ACM SIGMIS Database (1998)

A database management system should support views to facilitate filtering of information in order to have only necessary and required information available to users with minimal delay. Although a lot of research efforts concentrated on views within the conventional relational model, much more effort is required when object-oriented models are considered. However, supporting views is only a step forward in achieving the purpose that requires improving the performance of the system by considering incremental maintenance of views instead of recomputing a view from scratch each time it is accessedIn this paper, we introduce a model that facilitates incremental maintenance of single-class-based object-oriented views by employing the deferred update mode that has proved to be more suitable for object-oriented databases in general. For that purpose, we categorize classes into base and brother classes corresponding to classes originally present in the database and those introduced as views, respectively. To each class, we add a modification list that keeps related modifications during different intervals. An interval starts with the creation or update of a view and ends with the creation or update of another view. A modification list is empty as long as no views depend on its class. Further, we introduce some algorithms that locate modifications done on related classes while trying to compute a given view incrementally. Finally, we give a theoretical justification showing that, in general, the introduced algorithms perform much better than doing computation from scratch each time a view is accessed.
A Scan-Based Configurable, Programmable, and Scalable Architecture for Sliding Window-Based Operations
Authors: Claude Thibeault, Guy Bégin
Venue: IEEE Transactions on Computers (1999)

In this paper, a scan-based programmable, configurable, and scalable architecture is proposed. This architecture is suitable for a wide range of applications in signal processing requiring programmability and presenting high bandwidth and real-time requirements beyond the capacity of off-the-shelf DSPs or FGPAs. The architecture is specifically targeting a very common type of signal processing operation: sliding window operations (SWOs). Through various examples, the ¿programmability, configurability, and scalability¿ of the proposed architecture are illustrated. Our approach is then compared to traditional programmable architectures with coefficient registers in terms of gate count, speed (delay), and other implementation-related issues. This comparison reveals that our architecture leads to less complex solutions with comparable performance. In general, this approach can be seen as an alternative offering reduced recurrent costs at the expense of potentially higher nonrecurrent costs, which makes it very attractive for high volume production.
Query rewriting for semistructured data
Authors: Yannis Papakonstantinou, Vasilis Vassalos
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set of semistructured views V, finds rewriting queries, i.e., queries that access the views and produce the same result as q. Our algorithm is based on appropriately generalizing containment mappings, the chase, and query composition &mdash; techniques that were developed for structured, relational data. We also develop an algorithm for equivalence checking of TSL queries. We show that the algorithm is sound and complete for TSL, i.e., it always finds every non-trivial TSL rewriting query of q, and we discuss its complexity. We extend the rewriting algorithm to use some forms of structural constraints (such as DTDs) and find more opportunities for query rewriting.
The implementation of set functions in APL: a proposal
Authors: Joseph De Kerf
Venue: ACM SIGAPL APL Quote Quad (1998)

This paper has been translated from "L'implantation de fonctions pour les ensembles en APL (une proposition)" (Les Nouvelles d'APL, No. 22, Mars 1997, pp. 81-86).Proposals are formulated for the implementation of the primitive set functions: unique, union, intersection, and difference. User-defined functions are given, simulating those proposed primitive functions, illustrated with some examples.In a note added to a letter to the editor, published in Les Nouvelles d'APL [1], it emphasizes the need to extend APL with primitive functions for handling sets. Definitions are proposed in this paper for such primitives: the monadic function unique and the dyadic functions union, intersection, and difference. User defined functions are given which are equivalent to those proposed primitives, illustrated with some examples. Concepts are based on those described by D. Livingstone and by the authors referenced in his paper [2]. The number of occurrences of the items in the results are adapted to the needs imposed by handling Relational Database Algebra [2].
Data Mining in Large Databases Using Domain Generalization Graphs
Authors: Robert J. Hilderman, Howard J. Hamilton, Nick Cercone
Venue: Journal of Intelligent Information Systems (1999)

Attribute-oriented generalization summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to user-defined concept hierarchies. We introduce domain generalization graphs for controlling the generalization of a set of attributes and show how they are constructed. We then present serial and parallel versions of the Multi-Attribute Generalization algorithm for traversing the generalization state space described by joining the domain generalization graphs for multiple attributes. Based upon a generate-and-test approach, the algorithm generates all possible summaries consistent with the domain generalization graphs. Our experimental results show that significant speedups are possible by partitioning path combinations from the DGGs across multiple processors. We also rank the interestingness of the resulting summaries using measures based upon variance and relative entropy. Our experimental results also show that these measures provide an effective basis for analyzing summary data generated from relational databases. Variance appears more useful because it tends to rank the less complex summaries (i.e., those with few attributes and/or tuples) as more interesting.
Whole program paths
Authors: James R. Larus
Venue: ACM SIGPLAN Notices (1999)

Whole program paths (WPP) are a new approach to capturing and representing a program's dynamic---actually executed---control flow. Unlike other path profiling techniques, which record intraprocedural or acyclic paths, WPPs produce a single, compact description of a program's entire control flow, including loop iteration and interprocedural paths.This paper explains how to collect and represent WPPs. It also shows how to use WPPs to find hot subpaths, which are the heavily executed sequences of code that should be the focus of performance tuning and compiler optimization.
A New Methodology for Efficient Classification of MultispectralSatellite Images Using Neural Network Techniques
Authors: Nikolaos Vassilas, Eleni Charou
Venue: Neural Processing Letters (1999)

A methodology based on self-organizing feature maps and indexing techniques for time and memory efficient neural network training and classification of large volumes of remotely sensed data is presented. Results on land-cover classification of multispectral satellite images using two popular neural models show orders of magnitude of speedup with respect to both training and classification times. The generality of the proposed methodology is demonstrated with a dramatic improvement of the classification time of the k-nearest neighbors statistical classifier.
Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes
Authors: Andrew E. Johnson, Martial Hebert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

We present a 3D shape-based object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spin image representation. The spin image is a data level shape descriptor that is used to match surfaces represented as surface meshes. We present a compression scheme for spin images that results in efficient multiple object recognition which we verify with results showing the simultaneous recognition of multiple objects from a library of 20 models. Furthermore, we demonstrate the robust performance of recognition in the presence of clutter and occlusion through analysis of recognition trials on 100 scenes.
Pipeline Reconfigurable FPGAs
Authors: Herman H. Schmit, Srihari Cadambi, Matthew Moe, Seth C. Goldstein
Venue: Journal of VLSI Signal Processing Systems (2000)

While reconfigurable computing promises to deliver incomparable performance, it is still a marginal technology due to the high cost of developing and upgrading applications. Hardware virtualization can be used to significantly reduce both these costs. In this paper we describe the benefits of hardware virtualization, and show how it can be achieved using the technique of pipeline reconfiguration. The result is PipeRench, an architecture that supports robust compilation and provides forward compatibility. Our preliminary performance analysis on PipeRench predicts that it will outperform commercial FPGAs and DSPs in both overall performance and in performance normalized for silicon area over a broad range of problem sizes.
Low power DSP's for wireless communications (embedded tutorial session)
Authors: Ingrid Verbauwhede, Chris Nicol
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Wireless communications and more specifically, the fast growing penetration of cellular phones and cellular infrastructure are the major drivers for the development of new programmable Digital Signal Processors (DSPs). In this tutorial, an overview will be given of recent developments in DSP processor architectures, that makes them well suited to execute computationally intensive algorithms typically found in communications systems. DSP processors have adapted instruction sets, memory architectures and data paths to execute compute intensive communications algorithms efficiently and in a low power fashion. Basic building blocks include convolutional decoders (mainly the Viterbi algorithm), turbo coding algorithms, FIR filters, speech coders, etc. This is illustrated with examples of different commercial and research processors. Please note that the authors do not endorse the processors used in this tutorial. These processors are used to illustrate how different solutions are proposed for the same problem.
An Efficient State Space Generation for the Analysis of Real-Time Systems
Authors: Inhye Kang, Insup Lee, Young-Si Kim
Venue: IEEE Transactions on Software Engineering (2000)

State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be infinite even for simple systems. In this paper, we present an algorithm that produces a compact representation of the reachable state space of a real-time system. The algorithm yields a small state space, but still retains enough information for analysis. To avoid the state explosion which can be caused by simply adding time values to states, our algorithm uses history equivalence and transition bisimulation to collapse states into equivalent classes. Through history equivalence, states are merged into an equivalence class with the same untimed executions up to the states. Using transition bisimulation, the states that have the same future behaviors are further collapsed. The resultant state space is finite and can be used to analyze real-time properties. To show the effectiveness of our algorithm, we have implemented the algorithm and have analyzed several example applications.
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Authors: Michael A. Bender, Michael O. Rabin
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

We study the problem of executing parallel programs, in particular Cilk programs, on a collection of processors of different speeds. We consider a model in which each processor maintains an estimate of its own speed, where communication between processors has a cost, and where all scheduling must be online. This problem has been considered previously in the fields of asynchronous parallel computing and scheduling theory. Our model is a bridge between the assumptions in these fields. We provide a new more accurate analysis of of an old scheduling algorithm called the maximum utilization scheduler. Based on this analysis, we generalize this scheduling policy and define the high utilization scheduler. We next focus on the Cilck platform and introduce a new algorithm for scheduling Cilk multithreaded parallel programs on heterogeneous processors. This scheduler is inspired by the high utilization scheduler and is modified to fit in a Cilk context. A crucial aspect of our algorithm is that it keeps the original spirit of the Cilk scheduler. In fact, when our new algorithm runs on homogeneous processors, it exactly mimics the dynamics of the original Cilk scheduler.
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
Authors: Ming-Yang Kao, Junfeng Qi, Lei Tan
Venue: SIAM Journal on Computing (1999)

This paper studies some basic problems in a multiple-object auction model using methodologies from theoretical computer science. We are especially concerned with situations where an adversary bidder knows the bidding algorithms of all the other bidders. In the two-bidder case, we derive an optimal randomized bidding algorithm, by which the disadvantaged bidder can procure at least half of the auction objects despite the adversary's a priori knowledge of his algorithm. In the general k-bidder case, if the number of objects is a multiple of k, an optimal randomized bidding algorithm is found. If the k -- 1 disadvantaged bidders employ that same algorithm, each of them can obtain at least 1/k of the objects regardless of the bidding algorithm the adversary uses. These two algorithms are based on closed-form solutions to certain multivariate probability distributions. In situations where a closed-form solution cannot be obtained, we study a restricted class of bidding algorithms as an approximation to desired optimal algorithms.
On the Singularity of LCM Matrices
Authors: Bo-Ying Wang
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

Let S=x1,x2,...,xn be a set of distinct positive integers. The set S is called gcd-closed if it contains the greatest common divisor (xi,xj) of xi and xj for $1\le i,j\le n.$ The matrix [S] is called the least common multiple (LCM) matrix on S if its i,j entry is the least common multiple [xi,xj] of xi and xj. Bourque and Ligh conjectured that the LCM matrix on a gcd-closed set is invertible [Linear Algebra Appl., 174 (1992), pp. 65--74]. The aim of this note is to show that this conjecture holds if $n\le 7$, but it does not hold in general when $n\ge 8$.
An Alternating Crank--Nicolson Method for Decoupling the Ginzburg--Landau Equations
Authors: Mo Mu, Yunqing Huang
Venue: SIAM Journal on Numerical Analysis (1998)

The time-dependent Ginzburg--Landau model of superconductors consists of coupled nonlinear partial differential equations, which presents difficulties in the numerical solution. We present an alternating Crank--Nicolson method for this model that leads to two decoupled algebraic subsystems; one is linear and the other is semilinear. Both have nice numerical properties and can be solved by efficient matrix solvers. We show the stability and convergence and derive error estimates for this scheme. Numerical results are also reported.
Principles of mixed-initiative user interfaces
Authors: Eric Horvitz
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Recent debate has centered on the relative promise of focusing user-interface research on developing new metaphors and tools that enhance users abilities to directly manipulate objects versus directing effort toward developing interface agents that provide automation. In this paper, we review principles that show promise for allowing engineers to enhance human-computer interaction through an elegant coupling of automated services with direct manipulation. Key ideas will be highlighted in terms of the Lookout system for scheduling and meeting management.
Dynkin Diagram Classification of &lambda;-Minuscule Bruhat Latticesand of d-Complete Posets
Authors: Robert A. Proctor
Venue: Journal of Algebraic Combinatorics: An International Journal (1999)

d-Complete posets are defined to be posets which satisfy certain local structural conditions. These posets play or conjecturally play several roles in algebraic combinatorics related to the notions of shapes, shifted shapes, plane partitions, and hook length posets. They also play several roles in Lie theory and algebraic geometry related to &lambda;-minuscule elements and Bruhat distributive lattices for simply laced general Weyl or Coxeter groups, and to &lambda;-minuscule Schubert varieties. This paper presents a classification of d-complete posets which is indexed by Dynkin diagrams.
An Accumulator-Based BIST Approach for Two-Pattern Testing
Authors: I. Voyiatzis, A. Paschalis, D. Nikolos, C. Halatsis
Venue: Journal of Electronic Testing: Theory and Applications (1999)

Two-pattern tests target the detection of most common failure mechanisms in cmos vlsi circuits, which are modeled as stuck-open or delay faults. In this paper the Accumulator-Based Two-pattern generation (ABT) algorithm is presented, that generates an exhaustive n-bit two-pattern test within exactly 2^n &times; (2^n &minus; 1) + 1 clock cycles, i.e. within the theoretically minimum time. The ABT algorithm is implemented in hardware utilizing an accumulator whose inputs are driven by either a binary counter (counter-based implementation) or a Linear Feedback Shift Register (LFSR-based implementation). With the counter-based implementation different modules, having different number of inputs, can be efficiently tested using the same generator. For circuits that do not contain counters, the LFSR-based implementation can be implemented, since registers (that typically drive the accumulator inputs into dapatapath cores) can be easily modified to LFSRS with small increase in the hardware overhead. The great advantage of the presented scheme is that it can be implemented by augmening existing datapath components, rather than building a new pattern generation structure.
Sorting by Parallel Insertion on a One-Dimensional Subbus Array
Authors: James D. Fix, Richard E. Ladner
Venue: IEEE Transactions on Computers (1998)

We consider the problem of sorting on a one-dimensional subbus array of processors, an architecture that communicates using a segmentable bus. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the parallel insertion model. We give per-input lower bounds for sorting in the parallel insertion model and demonstrate sorting strategies that are optimal by matching those lower bounds. For each of our sorting strategies, we discuss the issues involved in implementing them on subbus machines. Finally, we empirically evaluate the performance of our sorting strategies by applying them to shearsort, a common two-dimensional mesh sorting algorithm. Our results suggest that for sorting the subbus broadcast capability gives at most a slight advantage over using only nearest neighbor communication.
Tree-Structured Linear Cellular Automata and Their Applications in BIST
Authors: Jin Li, Xiaoling Sun
Venue: Journal of Electronic Testing: Theory and Applications (1999)

A novel implementation structure of linear finite state machines, named tree-structured linear cellular automata (TLCA), is introduced. The structures and operations of TLCA are defined. The minimal cost maximum length machines and their implementation procedure are given. Our empirical study on the ISCAS&lsquo;85 benchmark circuits shows the effectiveness of TLCA for testing stuck-open and delay faults.
On the Degree of Mixed Polynomial Matrices
Authors: Kazuo Murota
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The mixed polynomial matrix, introduced as a convenient mathematical tool for the description of physical/engineering dynamical systems, is a polynomial matrix of which the coefficients are classified into fixed constants and independent parameters. The valuated matroid, invented by Dress and Wenzel [ Appl. Math. Lett., 3 (1990), pp. 33--35], is a combinatorial abstraction of the degree of minors (subdeterminants) of a polynomial matrix. We discuss a number of implications of the recent developments in the theory of valuated matroids in the context of polynomial matrix theory. In particular, we apply the valuated matroid intersection theorem to the analysis of the degree of the determinant of a mixed polynomial matrix to obtain a novel duality identity together with an efficient algorithm.