ppxscal/embedding_network huggingface dataset:
Selective value prediction
Authors: Brad Calder, Glenn Reinman, Dean M. Tullsen
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

Value Prediction is a relatively new technique to increase instruction-level parallelism by breaking true data dependence chains. A value prediction architecture produces values, which may be later consumed by instructions that execute speculatively using the predicted value.This paper examines selective techniques for using value prediction in the presence of predictor capacity constraints and reasonable misprediction penalties. We examine prediction and confidence mechanisms in light of these constraints, and we minimize capacity conflicts through instruction filtering. The latter technique filters which instructions put values into the value prediction table. We examine filtering techniques based on instruction type, as well as giving priority to instructions belonging to the longest data dependence path in the processor's active instruction window. We apply filtering both to the producers of predicted values and the consumers. In addition, we examine the benefit of using different confidence levels for instructions using predicted values on the longest dependence path.
Performance analysis of distributed applications using automatic classification of communication inefficiencies
Authors: Jeffrey Vetter
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

We present a technique for performance analysis that helps users understand the communication behavior of their message passing applications. Our method automatically classifies individual communication operations and it reveals the cause of communication inefficiencies in the application. This classification allows the developer to focus quickly on the culprits of truly inefficient behavior, rather than manually foraging through massive amounts of performance data. Specifically, we trace the message operations of MPI applications and then classify each individual communication event using decision tree classification, a supervised learning technique. We train our decision tree using microbenchmarks that demonstrate both efficient and inefficient communication. Since our technique adapts to the target system's configuration through these microbenchmarks, we can simultaneously automate the performance analysis process and improve classification accuracy. Our experiments on four applications demonstrate that our technique can improve the accuracy of performance analysis, and dramatically reduce the amount of data that users must encounter
Norms of Large Toeplitz Band Matrices
Authors: A. Böttcher, S. Grudsky, A. Kozak, B. Silbermann
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Let T(bjk) be a finite collection of infinite Toeplitz band matrices, let Tn(bjk) denote their (n+1) x (n+1) truncations, and put \[ A_n=\sum_j\prod_k T_n(b_{jk}),\quad M_p=\lim_{n\to\infty}\|A_n\|_p, \] where $\|\cdot\|_p$ stands for the operator norm associated with the $l^p$-norm $(1\le pCn+1. We establish tight two-sided estimates for the difference Mp-||An||p. It is well known that if T(b) is a Hermitian Toeplitz band matrix and An=Tn(b), then M2-||An||2 goes to zero with polynomial speed. We show that such a slow convergence rate is, in a sense, an exceptional case, and we prove that in the generic case Mp - ||An||p approaches zero with exponential speed. Our results yield good error estimates when computing the norms of certain infinite matrices via their large truncations and, conversely, when determining the norms of certain large matrices by having recourse to known norms of infinite matrices.
Experimental Results for Self-Dual Multi-Output Combinational Circuits
Authors: Vl. V. Saposhnikov, V. Moshanin, V. V. Saposhnikov, M. Goessel
Venue: Journal of Electronic Testing: Theory and Applications (1999)

In this short note, the possibilities and the limitations for the application of self-dual circuits with alternating inputs are experimentally investigated. The original circuit is assumed to be given as a netlist of gates. The necessary area overhead, the fault coverage for single stuck-at faults in test mode and the error detection probability in on-line mode due to internal stuck-at faults and stuck-at faults at the input lines are determined for MCNC benchmark circuits.
Yet another reachability algorithm for Petri nets
Authors: Alexander E. Kostin, Svetlana A. Tchoudaikina
Venue: ACM SIGACT News (1998)

A new algorithm for the determination of reachability of a marking in generalized Petri nets is proposed. The algorithm is based on the matrix-equation approach. Given a Petri net, a so called complemented Petri net is created that consists of the given Petri net and a complementary transition with input and output places depending on the initial and target markings. Then the reachability task is reduced to the investigation of T-invariants of the complemented Petri net. Using a technique of search for T-invariants, the algorithm determines minimal-support T-invariants, that include the complementary transition, and then calculates the finite set of their linear combinations. For each T-invariant, the algorithm tries to create sequentially all reachability paths from the given initial marking to the target marking or determines that there are no such paths at all. During creation of the reachability paths, the algorithm needs memory only for storing the reachability path being created. If it is sufficient to determine only one firing sequence that transforms the initial marking into the target one, then the algorithm may be terminated after successful creation of the first reachability path.
Piecewise-Constant Stabilization
Authors: Sergey Nikitin
Venue: SIAM Journal on Control and Optimization (1999)

With the help of topological necessary conditions for continuous stabilization it is shown that, in general, in order to stabilize continuous- and discrete-time systems one has to use time-dependent or discontinuous feedback controls. On the other hand, the criterion of stabilization in the class of piecewise-constant feedbacks is established. In the context of this paper a piecewise-constant feedback is associated with a piecewise-constant function of the form u = u(x), where $x \in {\rm R}^n_x .$ The piecewise-constant feedback synthesis outlined here has several attractive features. First, it can be effectively applied to design feedback stabilizers subjected to control constraints. Second, the designed feedback laws do not cause sliding mode or chattering behavior in the closed loop system; i.e., on a finite interval of time the control in the closed loop system may have only a finite number of jump discontinuities.
International Maternal Mortality Reduction: Outcome of Traditional Birth Attendant Education and Intervention in Angola
Authors: Jeffrey Schaider, Samson Ngonyani, Stephen Tomlin, Robert Rydman, Rebecca Roberts
Venue: Journal of Medical Systems (1999)

Background. As a result of war and periodic natural disasters, Angola has among the highest infant and maternal mortality rates in the world. In response to the acute health needs of the population, the International Medical Corps (IMC) developed a traditional birth attendant educational course designed to reduce the preventable causes of maternal and infant mortality.Methods. From 1994 until 1998, Angolan traditional birth attendants (TBAs) participated in an intensive 38-hr training course on prenatal, delivery, and postnatal care. Following the birth of a child, the trained TBAs completed a registration form containing information regarding the health of the mother. Previous studies of Angolan maternal mortality served as historic comparisons.Findings. Complete data including maternal mortality data were available for 19,666 deliveries (83% of total). Fifty five maternal deaths were recorded, which corresponds to a maternal mortality rate of 293 per 100,000 live births. The average historic maternal mortality rate for available comparison groups was 1241 per 100,000 live births.Interpretation. The maternal mortality rate was reduced among women managed by IMC-trained TBAs when compared with historical control data.
Does it help to have some programming experience before beginning a computing degree program?
Authors: Dianne Hagan, Selby Markham
Venue: ACM SIGCSE Bulletin (2000)

There is an intuitive perception that students with prior programming experience have an initial advantage in an introductory programming course, but that this advantage may decrease over the duration of the course if the style of programming is different from what the student has learnt previously. This paper reports on a study that indicates that students who have experience in at least one programming language at the beginning of an introductory programming course perform significantly better in the assessment than those with none, and that the more languages with which a student has experience, the better the performance tends to be.
PC Controlled Toothbrush/Dentifrice Abrasion Machine
Authors: Güngör Bal, Sadullah Üçtaşli, Erdal Bekiroglu
Venue: Journal of Medical Systems (1999)

A toothbrush/dentifrice abrasion machine was developed to use in dental research laboratory. The mechanism was designed as a hexagonal block driven by two stepping motors which move the mechanism in four directions. In order to control the stepping motors speed, position and direction commands or signals were generated by a software written in C Programming Language and then these commands were applied the stepping motor drives through parallel port of a personal computer. The toothbrush/dentifrice abrasion machine was finally used to measure different longevity of tooth brush. It was experimentally shown that the mechanism can be used for highly accurate position and speed applications.
Coding-based schemes for fault identification in communication networks
Authors: Chi-Chun Lo, Shing-Hong Chen, Bon-Yeh Lin
Venue: International Journal of Network Management (2000)

This paper proposes two event correlation schemes for fault identification in communication networks. The causality graph model is used to describe the cause-and-effect relationships between network events. Copyright &copy; 2000 John Wiley Sons, Ltd.
On the impact of soft hand-off in cellular systems
Authors: Nidhi Hegde, Khosrow Sohraby
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

We present a model for soft, hand-off in wireless cellular networks. In such networks, due to overlapping cells, hand-offs are not instantaneous and multiple channels may be occupied by a single mobile for a non-zero freeze time period.We provide a mathematical model of wireless cellular networks with soft hand-offs. We examine different performance measures and show that freeze time may have a major impact on the system performance if the mobility rate is not negligible. Both exact and approximate formulations are given. Different fixed-point approximation methods are used to reduce the complexity of the exact solution. Various performance measures such as new and hand-off blocking and probability of a call dropout are carefully examined.
A Study on r-Configurations---A Resource Assignment Problem on Graphs
Authors: Satoshi Fujita, Masafumi Yamashita, Tiko Kameda
Venue: SIAM Journal on Discrete Mathematics (2000)

Let G be an undirected graph with a set of vertices V and a set of edges E. Given an integer r, we assign at most r labels (representing "resources") to each vertex. We say that such an assignment is an r-configuration if, for each label c, the vertices labeled by c form a dominating set for G. In this paper, we are interested in the maximum number, Dr(G), of labels that can be assigned to the vertices of graph G by an r-configuration. The decision problem ``$D_1(G)\geq K$?" (known as the domatic number problem) is NP-complete.We first investigate Dr(G) for general graphs and establish bounds on Dr(G) in terms of D1(G) and the minimum vertex degree of G. We then discuss Dr(G) for d-regular graphs. We clearly have $D_r (G) \leq r(d+1)$. We show that the problem of testing if Dr(G) = r(d+1) is solvable in polynomial time for d-regular graphs with |V| = 2(d+1), but is NP-complete for those with |V| = a(d+1) for some integer $a \geq 3$. Finally, we discuss cubic (i.e., 3-regular) graphs. It is easy to show $2r \leq D_r (G) \leq 4r$ for cubic graphs. We show that the decision problem for D1 (G) = K is co-NP-complete for K = 2 and is NP-complete for K = 4. Although there are many cubic graphs G with D1 (G) = 2, surprisingly, every cubic graph has a 2-configuration with five labels, i.e., $D_2 (G) \geq 5$ and such a 2-configuration can be constructed in polynomial time. We use this fact to show $D_r (G) \geq \lfloor 5r/2 \rfloor$ in general.
Function unit specialization through code analysis
Authors: Daniel Benyamin, William H. Mangione-Smith
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Many previous attempts at ASIP synthesis have employed template matching techniques to target function units to application code, or directly design new units to extract maximum performance. This paper presents an entirely new approach to specializing hardware for application specific needs. In our framework of a parameterized VLIW processor, we use a post-modulo scheduling analysis to reduce the allocated hardware resources while increasing the code's performance. Initial results indicate significant savings in area, as well as optimizations to increase FIR filter code performance 200% to 300%.
Performance evaluation of multimedia systems with MPEG-2 bitstreams
Authors: Humayun Khalid
Venue: ACM SIGARCH Computer Architecture News (1999)

MPEG-2 has become a compression standard for multimedia applications. Performance analysts, designers, and researchers have been using mpeg-2 bitstreams for evaluating the multimedia performance of their systems. There exist a significant difference in the characteristics and behavior of such bitstreams. The bitstream set, used for performance evaluation, that does not demonstrate such variations results in erroneous evaluations and projections. In this paper, we have proposed a methodology for improving the performance estimations/projections with mpeg-2 data. Our simulation results demonstrate variations in the mpeg-2 bitstreams and the consequence it can have when data from only one of the several classes is chosen for system measurement and evaluation
Discrete Logarithms: The Past and the Future
Authors: Andrew Odlyzko
Venue: Designs, Codes and Cryptography (2000)

The first practical public key cryptosystem to be published, the Diffie&ndash;Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the presumed security of a variety of other public key schemes. While there have been substantial advances in discrete log algorithms in the last two decades, in general the discrete log still appears to be hard, especially for some groups, such as those from elliptic curves. Unfortunately no proofs of hardness are available in this area, so it is necessary to rely on experience and intuition in judging what parameters to use for cryptosystems. This paper presents a brief survey of the current state of the art in discrete logs.
Advances in transistor timing, simulation, and optimization (embedded tutorial) (abstract only)
Authors: Jacob Avidan, Abe Elfadel, D. F. Wong
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

A translator-level view of the circuit design has become of paramount importance for successful designs, especially in the very demanding context of high-performance microprocessor design in the deep-submicron regime. In this tutorial, such a transistor-level view will be adopted. The VLSI custom design problem will be approached from the three perspectives of transistor-level static timing analysis, fast transistor-level simulation, and transistor-level optimization process. Specifically, the first part of this tutorial will deal with the techniques used in transistor-level static timing, highlighting the differences between gate and transistor level techniques. It will also focus on how delay calculation, false path elimination and timing checks are performed at the transistor level for both combinational and sequential circuits. A fundamental ingredient of transistor-level static timing analyzers is a fast, event-driven transistor-level circuit simulator. The second part of this tutorial will present an important class of such simulators that uses simplified yet accurate transistor models. Simulators using piece-wise constant and piece-wise linear models will be described and contrasted. Methods for computing circuit sensitivities using these simulators will be covered. Finally, the third part will present some of the very recent advances in transistor-level circuit optimization. In particular, the timing-driven custom design problem will be rigorously formalized as a constrained, nonlinear optimization problem with respect to both the geometric and timing variables of the circuit. Although the resulting problems are large-scale, it will be shown how formal optimization algorithms can solve them efficiently. The tradeoffs between circuit size, device model accuracy, and algorithmic efficiency will be discussed, and generalizations of these techniques to simultaneous device and wire sizing will be considered.
Repeated Games with Incomplete Information on One Side: the Case of Different Discount Factors
Authors: Ehud Lehrer, Leeat Yariv
Venue: Mathematics of Operations Research (1999)

Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-sum result, depending on the asymptotic relative patience of the players. We provide sufficient conditions that ensure a zero-sum limit. Moreover, we provide examples of games violating these conditions that possess "cooperative" equilibria whose payoffs are bounded away from the zero-sum payoffs set.
Minimizing Conflicts Between Vector Streams in Interleaved Memory Systems
Authors: A. M. del Corral, J. M. Llaberia
Venue: IEEE Transactions on Computers (1999)

The performance of a vector processor accessing vectors placed in memory is strongly dependent on the conflicts produced in the memory subsystem. These conflicts delay the task of the functional units. There can be conflicts between elements of the same vector and between elements of different vector streams. It is known that the presence of the last kind of conflicts is the main cause of cycles lost. This paper proposes an order to access the elements of a vector stream that reduces the average memory access time in vector processors when several vector streams are concurrently accessed. The proposed order determines that the memory system observes the same stride for all the vector streams of a stride family. Conflicts between concurrent vector streams of the same family are completely eliminated if the rate at which memory modules are requested is less than or equal to their service rate. For other cases, the number of lost cycles due to conflicts is dramatically reduced.
Atomic Decomposition of Financial Data
Authors: Seth A. Greenblatt
Venue: Computational Economics (1998)

When looking at a time series, it is often instructive to consider the data as observations sampled from a noisy version of some underlying data generating process. This data generating process may be considered to be a function from a function space. We can specify very simple functions, known as atoms, which may be taken in linear combinations to represent any function within a particular function space. The atoms are described as members of a family of functions indexed by parameters. Quite commonly used for functions underlying time series data are the parameters location and frequency. This type of atom is known as a time-frequency atom. After we have specified the family of atoms that we wish to use to represent our underlying data generating process, the difficult problem of choosing the most effective, parsimonious representation from this family remains to be solved. Several techniques, such as Matching Pursuit and Basis Pursuit, have been suggested to solve this problem. In the current study, we investigate the use of several families of atoms, both individually and in combination, to decompose exchange rate data in search of structure that has been overlooked in more traditional approaches.
Parallaxis-III: Architecture-Independent Data Parallel Processing
Authors: Thomas Bräunl
Venue: IEEE Transactions on Software Engineering (2000)

Parallaxis-III is an architecture-independent data parallel programming language based on Modula-2. It has been designed for teaching data parallel concepts and is in use at a large number of institutions. Compilers exist for data parallel systems, as well as for a sequential simulation system. A data parallel graphics debugger allows efficient source level analysis for parallel programs.
Pipeline behavior prediction for superscalar processors by abstract interpretation
Authors: Jörn Schneider, Christian Ferdinand
Venue: Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems (1999)

For real time systems not only the logical function is important but also the timing behavior, e. g. hard real time systems must react inside their deadlines. To guarantee this it is necessary to know upper bounds for the worst case execution times (WCETs). The accuracy of the prediction of WCETs depends strongly on the ability to model the features of the target processor.Cache memories, pipelines and parallel functional units are architectural components which are responsible for the speed gain of modern processors. It is not trivial to determine their influence when predicting the worst case execution time of programs.This paper describes a method to predict the behavior of pipelined superscalar processors and reports initial results of a prototypical implementation for the SuperSPARC I processor.
Fast algorithms for projected clustering
Authors: Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, Cecilia Procopiuc, Jong Soo Park
Venue: ACM SIGMOD Record (1999)

The clustering problem is well known in the database literature for its numerous applications in problems such as customer segmentation, classification and trend analysis. Unfortunately, all known algorithms tend to break down in high dimensional spaces because of the inherent sparsity of the points. In such high dimensional spaces not all dimensions may be relevant to a given cluster. One way of handling this is to pick the closely correlated dimensions and find clusters in the corresponding subspace. Traditional feature selection algorithms attempt to achieve this. The weakness of this approach is that in typical high dimensional data mining applications different sets of points may cluster better for different subsets of dimensions. The number of dimensions in each such cluster-specific subspace may also vary. Hence, it may be impossible to find a single small subset of dimensions for all the clusters. We therefore discuss a generalization of the clustering problem, referred to as the projected clustering problem, in which the subsets of dimensions selected are specific to the clusters themselves. We develop an algorithmic framework for solving the projected clustering problem, and test its performance on synthetic data.