ppxscal/embedding_network huggingface dataset:
Comprehensive Hardware and Software Support for Operating Systems to Exploit MP Memory Hierarchies
Authors: Chun Xia, Josep Torrellas
Venue: IEEE Transactions on Computers (1999)

High-performance multiprocessor workstations are becoming increasingly popular. Since many of the workloads running on these machines are operating-system intensive, we are interested in exploring the types of support for the operating system that the memory hierarchy of these machines should provide. In this paper, we evaluate a comprehensive set of hardware and software supports that minimize the performance losses for the operating system in a sophisticated cache hierarchy. These supports, selected from recent papers, are code layout optimization, guarded sequential instruction prefetching, instruction stream buffers, support for block operations, support for coherence activity, and software data prefetching. We evaluate these supports under a simulated environment. We show that they have a largely complementary impact and that, when combined, speed up the operating system by an average of 40 percent. Finally, a cost-performance comparison of these schemes suggests that the most cost-effective ones are code layout optimization and block operation support, while the least cost-effective one is software data prefetching.
Object-oriented database systems
Authors: François Banciihon
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

This paper describes my vision of the current state of object-oriented database research. I first briefly define this field by its objectives, and relate it to other database subfields. I describe what I consider to be the main characteristics of an object oriented system, i.e. those which are important to integrate in a database system: encapsulation, object identity, classes or types, inheritance, overriding and late binding. I point out the differences between an object oriented system and an object oriented database system. I also point out the advantages and drawbacks of an object oriented database system with respect to a relational system. Finally, I list some research issues.
Selective, accurate, and timely self-invalidation using last-touch prediction
Authors: An-Chow Lai, Babak Falsafi
Venue: ACM SIGARCH Computer Architecture News (2000)

Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper proposes Last-Touch Predictors (LTPs) that learn and predict the &ldquo;last touch&rdquo; to a memory block by one processor before the block is accessed and subsequently invalidated by another. By predicting a last-touch and (self-)invalidating the block in advance, an LTP hides the invalidation time, significantly reducing the coherence overhead. The key behind accurate last-touch prediction is trace-based correlation, associating a last-touch with the sequence of instructions (i.e., a trace) touching the block from a coherence miss until the block is invalidated. Correlating instructions enables an LTP to identify a last-touch to a memory block uniquely throughout an application's execution. In this paper, we use results from running shared-memory applications on a simulated DSM to evaluate LTPs. The results indicate that: (1) our base case LTP design, maintaining trace signatures on a per-block basis, substantially improves prediction accuracy over previous self-invalidation schemes to an average of 79%; (2) our alternative LTP design, maintaining a global trace signature table, reduces storage overhead but only achieves an average accuracy of 58%; (3) last-touch prediction based on a single instruction only achieves an average accuracy of 41% due to instruction reuse within and across computation; and (4) LTP enables selective, accurate, and timely self-invalidation in DSM, speeding up program execution on average by 11%.
Bounded Power Signal Spaces for Robust Control and Modeling
Authors: P. M. Mäkilä, J. R. Partington, T. Norlander
Venue: SIAM Journal on Control and Optimization (1999)

The nonlinear space of signals allowing Wiener's generalized harmonic analysis (GHA), the linear bounded power signal spaces of Beurling, Marcinkiewicz, and Wiener, and a new linear bounded power space are studied from a control and systems theory perspective. Specifically, it is shown that the system power gain is given by the $H_\infty$ norm of the system transfer function in each of these spaces for a large class of (power) stable finite and infinite dimensional systems. The GHA setup is shown to possess several limitations for the purpose of robustness analysis which motivates the use of the other more general (nonstationary) signal spaces. The natural double-sided time axis versions of bounded power signal spaces are shown to break the symmetry between Hardy space $H_\infty$ methods and bounded power operators; e.g., the system transfer function being in $H_\infty$ does not imply that a causal-linear time-invariant (LTI) system is bounded as an operator on any of the double-sided versions of the studied bounded power signal spaces.
Transparent replication for fault tolerance in distributed Ada 95
Authors: Thomas Wolf
Venue: Proceedings of the ninth international workshop on Real-time Ada (1999)

In this paper we present the foundations of RAPIDS ("Replicated Ada Partitions In Distributed Systems"), an implementation of the PCS supporting the transparent replication of partitions in distributed Ada 95 using semi-active replication. The inherently non-deterministic executions of multi-tasked partitions are modeled as piecewise deterministic histories. I discuss the validity and correctness of this model of computation and show how it can be used for efficient semi-active replication. The RAPIDS prototype ensures that replicas of a partition all go through the same history and are hence consistent.
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
Authors: Anne Canteaut, Pascale Charpin, Hans Dobbertin
Venue: SIAM Journal on Discrete Mathematics (2000)

We study [2m-1,2m]-binary linear codes whose weights lie between w0 and 2m-w0, where w0 takes the highest possible value. Primitive cyclic codes with two zeros whose dual satisfies this property actually correspond to almost bent power functions and to pairs of maximum-length sequences with preferred crosscorrelation. We prove that, for odd m, these codes are completely characterized by their dual distance and by their weight divisibility. Using McEliece's theorem we give some general results on the weight divisibility of duals of cyclic codes with two zeros; specifically, we exhibit some infinite families of pairs of maximum-length sequences which are not preferred.
Resource management in wireless networks using intelligent agents
Authors: Khaldoun M. Al agha
Venue: International Journal of Network Management (2000)

This article relates to the larger-scale traffic variations and proposes an adaptive resource assignment approach based on the multi-agent technique which relies on self-learning. The adaptive resource allocation scheme Channel Segregation &lpar;CS&rpar; containing inherently a self&hyphen;learning attribute was selected to test and validate the concept of using intelligent agents in base stations. Copyright &copy; 2000 John Wiley Sons, Ltd.
On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
Authors: Zhong-Zhi Bai
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

The convergence properties of a variant of the multisplitting methods for solving the large sparse linear complementarity problems presented by Machida, Fukushima, and Ibaraki [J. Comput. Appl. Math., 62 (1995), pp. 217--227] are further discussed when the system matrices are nonsymmetric and the weighting matrices are nonnegative and diagonal. This directly results in several novel sufficient conditions for guaranteeing the convergence of these multisplitting methods. Moreover, some applicable parallel multisplitting relaxation methods and their corresponding convergence properties are discussed in detail.
Organizing Web site information: principles and practical experience
Authors: Kate Dobroth, Paul McInerney, Sharon Smith
Venue: ACM SIGCHI Bulletin (2000)

As web sites continue to grow in their complexity, one of the most important usability design decisions is how to structure the web site topic hierarchy. This decision lays the groundwork for designing other aspects of the site, e.g., the home page table of contents, and for categorizing new documents in the topic structure over the life of the site. Organizing web sites is a timely topic as evidenced by the recent spate of publications on this topic [1] [2] [3] and by NIST's recent release of a tool, WebCAT, to help users participate in organizing their web site. More significantly, the organization is probably the limiting factor on success for web sites that provide useful information.If anything is clear about the organization of web sites, it is that there is no single best way to go about it. Different types of web sites seem to demand different approaches to organization. For example, a site geared toward product support might use a task-oriented scheme that steps users through a process of problem-solving. Other sites, such as an online shopping site, might be organized according to categories of products, in order to allow efficient browsing. Other sites might be organized based on an analysis of user roles.Designers who must choose among these schemes must also choose appropriate analyses to inform the design of the web site structure. These include item clustering techniques, user performance at finding documents using various prototype web site organizations, studies of user roles and tasks, and analyses of the material to be included in the site.
The software component market on the internet current status and conditions for growth
Authors: Vincent Traas Jos van Hillegersberg
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Component Based Development (CBD) promises a large step forward in the quest for maximizing reuse in software development. Although a variety of definitions of CBD exists, key to CBD is the process of building systems by way of combination and integration of pre-engineered and pre-tested software components. For CBD to be the long awaited breakthrough in software development, the efficient reuse of software components has to be organized by a market system; "Components develop their full potential only in a component market" [5]. Organizations may benefit from organizing an internal component market. Software components can then be reused over multiple projects saving valuable resources. However, the most appropriate marketplace to buy and sell components would be the Internet: an international, freely accessible network, which is perfectly suited for offering, promoting and distributing components. A flourishing component market on the Internet would really allow organizations to buy and reuse against low-costs. Developers would only need to focus on functionality specific to the project, and on locating and integrating available components.Industry watchers have predicted huge growth figures for the software component market. Gartner predicts the component market will grow to $7 billion in 2001, of which $2 billion directly comes from component sales [1]. Giga information group predicts an off-the-shelf component market of $3,3 billion in 2001 [6]. Ovum goes further by estimating the size of the software component market to be $64 billion in 2002 [3].But does a component market on the Internet already exist, and if so, what is its status? Also, if a component market is so important for CBD to fulfil its promises, what are the conditions for growth towards maturity? Apart from rough estimations of the future size of the market, little research has been done to investigate the current component market and its growth. It is the objective of the research reported on in this paper to gain insight into these questions.The research described in this article contained two phases: First, an overview of the current status of the component market on the Internet was created. Next, based on this overview and a literature study, conditions for growth of the market were developed. An email-survey was held in which experts were asked to rate these conditions by importance and comment on them. Section two and three describe the results of these research phases respectively.
Technology Road Map to Methodologies for Mixed-Signal System Designand Simulation
Authors: Robert L. Ewing
Venue: Journal of VLSI Signal Processing Systems (1999)

Unfortunately, the best solution for one mixed-signal design, is not the best solution for all mixed-signal designs. This is especially true in light of today&lsquo;s microwave applications that span the range from low-power, low-performance type of devices, through high-power, high-frequency and high-performance applications. Digital designs are automated through the use of the VHDL hardware description language, while the mixed-signal counterparts are automated using the newly developed VHDL-AMS extension. The essential ingredients for mixed-signal design fall into the methodologies of scalable functionality, robust design and feedback techniques. Scalable functionality refers to the non-conventional methodology of dimensional analysis for establishing magnitude relationships between mixed-signal system variables. Robust design of a mixed-signal system, involves the blending of the z-domain (digital) and the s-domain (continuous), resulting in the wp-domain. Robust feedback involves the inherit feedback nature of mixed-signal systems, by providing a methodology of design that emphasizes the use of feedback for achieving the desired robust system performance tolerances despite device parameter uncertainty and noise disturbances.
Asymptotic Controllability and Exponential Stabilization of Nonlinear Control Systems at Singular Points
Authors: Lars Grüne
Venue: SIAM Journal on Control and Optimization (1998)

We discuss the relation between exponential stabilization and asymptotic controllability of nonlinear control systems with constrained control range at singular points. Using a discounted optimal control approach, we construct discrete feedback laws minimizing the Lyapunov exponent of the linearization. Thus we obtain an equivalence result between uniform exponential controllability and uniform exponential stabilizability by means of a discrete feedback law.
Generalization of the Gram-Charlier/Edgeworth Series andApplication to Time-Frequency Analysis
Authors: Leon Cohen
Venue: Multidimensional Systems and Signal Processing (1998)

We derive a general equation relating probability densities and as special cases we the obtain Gram-Charlier and Edgeworth series. This allows us to generalize these methods and clarify a number of issues pertaining to both probability theory and time-frequency analysis. In particular we show how the Gram-Charlier and Edgeworth series are related to the kernel method of time-frequency analysis. The approach allows us to construct densities that satisfy given constraints such as joint moments or conditional moments. Also, we show that the kernel has to be signal dependent and that to obtain a proper distribution it should be the ratio of two characteristic functions.
Behavioral equivalence in the polymorphic pi-calculus
Authors: Benjamin C. Pierce, Davide Sangiorgi
Venue: Journal of the ACM (JACM) (2000)

We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.
Unfounded sets and well-founded semantics for general logic programs
Authors: Allen Van Gelder, Kenneth Ross, John S. Schlipf
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

A general logic program (abbreviated to &ldquo;program&rdquo; hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consisting of rules (IDB) sitting above elementary relations (EDB, facts). It is desirable to associate one Herbrand model with a program and think of that model as the &ldquo;meaning of the program,&rdquo; or its &ldquo;declarative semantics.&rdquo; Ideally, queries directed to the program would be answered in accordance with this model. We introduce unfounded sets and well-founded partial models, and define the well-founded semantics of a program to be its well-founded partial model. If the well-founded partial model is in fact a model, we call it the well-founded model, and say the program is &ldquo;well-behaved&rdquo;. We show that the class of well-behaved programs properly includes previously studied classes of &ldquo;stratified&rdquo; and &ldquo;locally stratified&rdquo; programs Gelfand and Lifschits have proposed a definition of &ldquo;unique stable model&rdquo; for general logic programs. We show that a program has a unique stable model if it has a well-founded model, in which case they are the same. We discuss why the converse is not true.
Efficient Solution Of The Rank-Deficient Linear Least Squares Problem
Authors: Gregorio Quintana-Ortí, Enrique S. Quintana-Ortí, Antoine Petitet
Venue: SIAM Journal on Scientific Computing (1999)

In this paper we present several new fast and reliable algorithms for solving rank-deficient linear least squares problems by means of the complete orthogonal decomposition. Experimental comparison of our algorithms with the existing implementations in LAPACK on a wide range of platforms shows considerable performance improvements. Moreover, for full-rank matrices the performance of the new algorithm is very close to that of the fast method based on QR factorization, thus providing a valuable general tool for full-rank matrices, rank-deficient matrices, and those matrices with unknown rank.
Campus-based industrial software projects: risks and rewards
Authors: Helen Parker, Mike Holcombe
Venue: ACM SIGCSE Bulletin (1999)

The involvement of commercial companies as clients in software engineering project work adds a new dimension to our students' education, developing the communication, team-working and managerial skills demanded by employers, [1]. Commercial collaboration introduces risks into course work which, like the risks in any commercial software project, must be controlled if the outcomes for all parties are to count as a success.
Integrated Temperature Sensors for On-Line Thermal Monitoring of Microelectronic Structures
Authors: Karim Arabi, Bozena Kaminska
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Built-in temperature sensors increase the system reliability by predicting eventual faults caused by excessive chip temperatures. In this paper, simple and efficient built-in temperature sensors for the on-line thermal monitoring of microelectronics structures are introduced. The proposed temperature sensors produce a signal oscillating at a frequency proportional to the temperature of the microelectronics structure and therefore they are compatible to the oscillation-test method. The oscillation-test method is a low-cost and robust test method for mixed-signal integrated circuits based on transforming the circuit under test (CUT) to an oscillator. This paper presents the design and detailed characteristics of the sensors proposed based on the CMOS 1.2 &micro;m technology parameters of Mitel S.C.C. Extensive post-layout simulations show that the oscillation frequency is very sensitive to temperature variations. The sensors proposed require very small power dissipation and silicon area.
Multiscale Representation and Analysis of Spherical Data by Spherical Wavelets
Authors: Ta-Hsin Li
Venue: SIAM Journal on Scientific Computing (1999)

Classic wavelet methods were developed in the Euclidean spaces for multiscale representation and analysis of regularly sampled signals (time series) and images. This paper introduces a method of representing scattered spherical data by multiscale spherical wavelets. The method extends the recent pioneering work of Narcowich and Ward [Appl. Comput. Harmon. Anal., 3 (1996), pp. 324--336] by employing multiscale rather than single-scale spherical basis functions and by introducing a bottom-up procedure for network design and bandwidth selection. Decomposition and reconstruction algorithms are proposed for efficient computation. An analytical investigation confirms the localization property of the resulting spherical wavelets. The proposed method is illustrated by numerical examples. It is also employed to analyze and compress a real-data set consisting of the surface air temperatures observed on a global network of weather stations.
Generalized Fourier and Toeplitz Results for Rational Orthonormal Bases
Authors: Brett Ninness, Hakan Hjalmarsson, Fredrik Gustafsson
Venue: SIAM Journal on Control and Optimization (1999)

This paper provides a generalization of certain classical Fourier convergence and asymptotic Toeplitz matrix properties to the case where the underlying orthonormal basis is not the conventional trigonometric one but rather a rational generalization which encompasses the trigonometric one as a special case. These generalized Fourier and Toeplitz results have particular application in dynamic system estimation theory. Specifically, the results allow a unified treatment of the accuracy of least-squares system estimation using a range of model structures, including those that allow the inclusion of prior knowledge of system dynamics via the specification of fixed pole or zero locations.
Fast greedy weighted fusion
Authors: Ken Kennedy
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce the distance between accesses to the same datum and avoid costly cache misses. Unfortunately the problem of optimal loop fusion for reuse has been shown to be NP-hard, so compilers must resort to heuristics to avoid unreasonably long compile times. Greedy strategies are often excellent heuristics that produce high-quality solutions quickly. We present an algorithm for greedy weighted fusion, in which the heaviest edge (the one with the most reuse) is selected for possible fusion on each step. The algorithm is shown to be fast in the sense that it takes O(V(E+V)) time, which is arguably optimal for this problem.
International workshop on large-scale software composition
Authors: Rudolf K. Keller, Bruno Laguë, Reinhard Schauer
Venue: ACM SIGSOFT Software Engineering Notes (1999)

This report summarizes the International Workshop on Large-Scale Software Composition held at the University of Vienna, Austria, on August 28, 1998 in conjunction with the Database and Expert Systems Applications (DEXA'98) conference. An overall forty people attended the workshop consisting of seven presentations and plenary discussions. In the following, we outline the presentations and subsequent discussions in the four workshop sessions, which included Setting the Stage, Component Modeling, Migration towards Components, and Component-based Modelling of Distributed Systems. The workshop report can be found at .