ppxscal/embedding_network huggingface dataset:
Workload Evolution on the Cornell Theory Center IBM SP2
Authors: Steve Hotovy
Venue:  (1996)

The Cornell Theory Center (CTC) put a 512-node IBM SP2 system into production in early 1995, and extended traces of batch jobs began to be collected in June of that year. An analysis of the workload shows that it has not only grown, but that its characteristics have changed over time. In particular, job duration increased with time, indicative of an expanding production workload. In addition, there was increasing use of parallelism. As the load has increased and larger jobs have become more frequent, the batch management software (IBM''s LoadLeveler) has had difficulty in scheduling the requested resources. New policies were established to improve the situation. This paper will profile how the workload has changed over time and give an in-depth look at the maturing workload. It will examine how frequently certain resources are requested and analyze user submittal patterns. It will also describe the policies that were implemented to improve the scheduling situation and their effect on the workload.
C# in a Nutshell, 2 edition
Authors: Peter Drayton, Ted Neward, Ben Albahari
Venue:  (2003)

:C# in a Nutshell provides all C# programmers with a concise and thorough reference to the language in one straightforward and accessible volume. Designed as a handbook for daily use, this book is an essential guide to the C# language and the base class APIs of the .NET Framework. Programmers will want to keep this book next to their keyboards for years to come. The heart of this book is a succinct but detailed reference to the C# language and the .NET types most essential to C# programmers. Each chapter in the API reference begins with an overview of a .NET namespace and a diagram of its types, and provides a quick-reference entry for each type, with name, assembly, category, description, member availability, class hierarchy, and other relevant information, such as whether the type is part of the ECMA CLI specification.
A measurement-based analysis of multihoming
Authors: Aditya Akella, Bruce Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh Sitaraman
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Multihoming has traditionally been employed by stub networks to enhance the reliability of their network connectivity. With the advent of commercial "intelligent route control" products, stubs now leverage multihoming to improve performance. Although multihoming is widely used for reliability and, increasingly for performance, not much is known about the tangible benefits that multihoming can offer, or how these benefits can be fully exploited. In this paper, we aim to quantify the extent to which multihomed networks can leverage performance and reliability benefits from connections to multiple providers. We use data collected from servers belonging to the Akamai content distribution network to evaluate performance benefits from two distinct perspectives of multihoming: high-volume content-providers which transmit large volumes of data to many distributed clients, and enterprises which primarily receive data from the network. In both cases, we find that multihoming can improve performance significantly and that not choosing the right set of providers could result in a performance penalty as high as 40%. We also find evidence of diminishing returns in performance when more than four providers are considered for multihoming. In addition, using a large collection of measurements, we provide an analysis of the reliability benefits of multihoming. Finally, we provide guidelines on how multihomed networks can choose ISPs, and discuss practical strategies of using multiple upstream connections to achieve optimal performance benefits.
A Two Phase Algorithm for Solving a Class of Hard Satisfiability Problems
Authors: Joost P. Warners, H. Maaren
Venue:  (1998)

The DIMACS suite of satisfiability (SAT) benchmarks contains a set of instances that are very hard for existing algorithms. These instances arise from learning the parity function on 32 bits. In this paper we develop a two phase algorithm that is capable of solving these instances. In the first phase, a polynomially solvable subproblem is identified and solved. Using the solution to this problem, we can considerably restrict the size of the search--space in the second phase of the algorithm, which is an extension of the well--known Davis--Putnam--Loveland algorithm for SAT problems. We conclude with reporting on our computational results on the parity instances.
Elimination theory for differential difference polynomials
Authors: E. L. Mansfield, A. Szanto
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

In this paper we give an elimination algorithm for differential difference polynomial systems. We use the framework of a generalization of Ore algebras, where the independent variables are non-commutative. We prove that for certain term orderings, Buchberger's algorithm applied to differential difference systems terminates and produces a Gröbner basis. Therefore, differential-difference algebras provide a new instance of non-commutative graded rings which are effective Gröbner structures.
Improving Performance of Parallel Transaction Processing Systems by Balancing Data Load on Line
Authors: Jiahong Wang, Masatoshi Miyazaki, Hisao Kameda, Jie Li
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The performance of parallel transaction processing systems can be degraded significantly due to data skew, a phenomenon of unbalanced data distribution over nodes of a system. Rebalancing the data load of the system with data skew by redistributing its data has been known to be an effective approach to coping with data skew. Unfortunately, for most of the existing approaches, the data being redistributed is unavailable (off line). Numerous applications such as that for reservations, finance, process control, hospitals, police, and armed forces, however, cannot afford off-line data for any significant amount of time. These applications call for the ability of balancing data load on line. In this paper, a new on-line data redistribution approach is proposed. A prototype of the approach has been implemented, and experiments have been conducted. Experiment results confirm the substantial performance gains of the approach.
Improving application management process through qualitative framework
Authors: J. Taramaa, M. Makarainen, T. Ketola
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Industrial companies using software as a key technology have noticed the importance of software process development. We use the term "application management" to denote the software process activities related to software maintenance and evolution. We outline experience in the development of an application management process and in using a process modeling tool in an organization developing embedded systems applications. This paper shows the phases of improvement procedures and compares process modeling with a more comprehensive improvement framework called PR/sup 2/IMER. We use an embedded system of the aerospace domain as a case study. We model the software maintenance and evolution process of a small company which is acting as a subcontractor in large aerospace projects. A software process modeling tool called ProcessWEAVER is used to model the maintenance and evolution process.
Protein structure classification by structural transformatio
Authors: T. Ohkawa, D. Namihira, N. Komoda, A. Kidera, H. Nakamura
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Protein structure classification plays an important role in understanding the relationships among structure and sequence. Recently, as the number of known protein structure are increasing steeply, automatic classification is highly required. This paper presents a new method of classification of protein folds based on the structural similarities between a pair of proteins from the viewpoint of the secondary structural elements. The similarity can be evaluated through the structural transformation from one protein to the other, which is composed of a set of predefined primitive operations. Since the similarity is scored with the total cost of the transformation, the method requires no threshold value. The effectiveness of the method was empirically demonstrated through the experiments using the data in the Brookhaven Protein Data Bank.
Sparse Cholesky Factorization on a Multiprocessor
Authors: Earl Zmijewski
Venue:  (1987)

Systems of linear equations of the form $Ax = b,$ where $A$ is a large sparse symmetric positive definite matrix, arise frequently in science and engineering. The sequential computation of the solution vector $x$ is well understood and many algorithms for this problem employ the following steps. First, try to reorder the rows and columns of $A$ so that its Cholesky factor $L$ is sparse. Next, determine the structure of $L$ by symbolically factoring $A$ and allocate storage for $L$. Finally, numerically factor $A$ and then compute $x$ by solving the triangular systems $Ly=b$ and $L^{T}x=y$. In this thesis, we present parallel algorithms for the different steps of this computation. We design our algorithms for message-passing multiprocessors. The algorithms limit communication overhead and can solve problems that are too large to reside in the memory of any single processor. We provide numerical results based upon an implementation on an Intel hypercube. We begin by presenting a parallel column-oriented sparse numeric Cholesky factorization algorithm. Then, viewing $A$ as a graph, we develop a parallel graph partitioning algorithm that we use to order the columns of $A$ and partition them among the processors. In addition to producing a sparse $L$, the resulting ordering and partitioning allows for parallelism and reduces communication overhead during the remaining phases of the computation. The parallel graph partitioning algorithm is based on the sequential Kernighan-Lin algorithm for finding small edge separators. Since the computation of a particular column of $L$ may depend on columns stored on several processors, the processors cannot operate independently. The elimination forest of $A$ captures these dependencies and allows for efficient numeric factorization. We provide a parallel algorithm for computing the forest and prove its correctness. We also develop a parallel row-oriented symbolic factorization algorithm that uses the elimination forest. Finally, we describe fast parallel forward and backward triangular solve algorithms. These algorithms solve for the components of $x$ requiring information from other processors by using a variant of Li and Coleman''s dense triangular solve algorithms.
CMU Wearable Computers for Real-Time Speech Translation
Authors: Asim Smailagic, Dan Siewiorek, Richard Martin, Denis Reilly
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Carnegie Mellon's Wearable Computers Laboratory has built four generations of real - time speech translation wearable computers, culminating in the Speech Translator Smart Module. Smart Modules are a family of interoperable modules supporting real-time speech recognition, language translation, and speech synthesis. In this paper, we examine the effect of various design factors on performance with emphasis on modularity and scalability. A system-level approach to power / performance optimization is described that improved the metric of (performance / (weight * volume * power)) by over a factor of 300 through the four generations.
Dynamic Planar Graph Embedding
Authors: Roberto Tamassia
Venue:  (1989)

We present a dynamic data structure that allows for incrementally constructing a planar embedding of a planar graph with {\em n} vertices and {\em m} edges. The data structure supports the following operations: (1) testing if a new edge can be added to the embedding without introducing crossings; (2) adding and removing vertices and edges. In each case the time complexity is $O(\log m)$. The space used and the preprocessing time are $O(m)$. If the graph is simple (i.e., has no self-loops and no multiple edges), the above bounds become $O(\log n)$ and $O(n)$, respectively. This work finds applications in circuit layout, graphics, motion planning, and computer-aided design.
Temporal Locality in Web Request Streams: Sources, Characteristics, and Caching Implications
Authors: Shudong Jin, Azer Bestavros
Venue:  (1999)

Abstract Temporal locality of reference in Web request streams emerges from two distinct phenomena: the popularity of Web objects and the {\em temporal correlation} of requests. Capturing these two elements of temporal locality is important because it enables cache replacement policies to adjust how they capitalize on temporal locality based on the relative prevalence of these phenomena. In this paper, we show that temporal locality metrics proposed in the literature are unable to delineate between these two sources of temporal locality. In particular, we show that the commonly-used distribution of reference interarrival times is predominantly determined by the power law governing the popularity of documents in a request stream. To capture (and more importantly quantify) both sources of temporal locality in a request stream, we propose a new and robust metric that enables accurate delineation between locality due to popularity and that due to temporal correlation. Using this metric, we characterize the locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of temporal locality across these traces, and that these differences are effectively captured using our proposed metric. We illustrate the significance of our findings by summarizing the performance of a novel Web cache replacement policy---called GreedyDual*---which exploits both long-term popularity and short-term temporal correlation in an adaptive fashion. Our trace-driven simulation experiments (which are detailed in an accompanying Technical Report) show the superior performance of GreedyDual* when compared to other Web cache replacement policies.
ORCHESTRA: a probing and fault injection environment for testing protocol implementations
Authors: S. Dawson, F. Jahanian, T. Mitton
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

Ensuring that a distributed system meets its prescribed specification is a growing challenge that confronts software developers and system engineers. Meeting this challenge is particularly important for applications with strict dependability and/or timeliness constraints. We have developed a software fault injection tool, called ORCHESTRA, for testing dependability and timing properties of distributed protocols. ORCHESTRA is based on a simple yet powerful framework, called script-driven probing and fault injection. The emphasis of this approach is on experimental techniques intended to identify specific "problems" in a protocol or its implementation rather than the evaluation of system dependability through statistical metrics such as fault coverage. Hence, the focus is on developing fault injection techniques that can be employed in studying three aspects of a target protocol: i) detecting design or implementation errors, ii) identifying violations of protocol specifications, and iii) obtaining insights into the design decisions made by the implementers.
Three-Dimensional D4Z Renumbering For Iterative Solution of Ground-Water Flow And Transport Equations
Authors: Kenneth L. Kipp, Thomas F. Russell, James S. Otto
Venue:  (1994)

D4 zigzag (D4Z), previously introduced in two space dimensions, is a renumbering scheme for incomplete LU preconditionings of conjugate-gradient-like iterative solvers for linear systems arising from five-point (seven-point in three dimensions) stencils. Compared to other orderings, it reduces sensitivity of convergence to the sequence of coordinate directions for renumbering in anisotropic media. This paper extends D4Z to three dimensions and demonstrates its insensitive behavior o two test problems.
PROJECTION TECHNIQUES FOR ITERATIVE SOLUTION OF Ax = b WITH SUCCESSIVE RIGHT-HAND SIDES
Authors: Paul F. Fischer
Venue:  (1993)

We present two projection techniques for computing approximate solutions to linear systems of the form Ax^n=b^n, for a sequence n=1,2,..., e.g., such as arises from time discretization of a partial differential equation. The inexpensive approximate solutions can be used as initial guesses for iterative solution of the system, resulting in significantly reduced computational expense. Examples of two- and three-dimensional incompressible Navier-Stokes calculations are presented in which x represents the pressure, and A is a discrete Poisson operator. In flows containing significant dynamic activity, these projection techniques lead to as much as a two-fold reduction in solution time. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An asymmetric protocol for digital cellular communications
Authors: S. Paul, E. Ayanoglu, T. F. La Porta, K.-W. H. Chen, K. E. Sabnani, R. D. Gitlin
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Describes the design, validation, implementation and performance of an asymmetric link-layer protocol for a wireless link. The motivation for designing a new link-layer protocol is to obtain better performance in terms of end-to-end throughput and latency by correcting errors in an unreliable wireless link in addition to end-to-end correction rather than by correcting errors only by end-to-end retransmissions. The protocol described concentrates on asymmetry, although the concept of adaptive forward error correction is briefly introduced. The protocol also supports mobility. The asymmetry is needed in the design because the wireless terminals have limited power and smaller processing capability than the base stations. The key ideas in the design consist of placing the bulk of the intelligence in the base station as opposed to placing it symmetrically, in requiring the wireless terminal to combine several acknowledgments into a single acknowledgment to conserve power, and in designing the base stations to send periodic status messages, while making the acknowledgment from the wireless terminal event driven. The asymmetry in the protocol design results in a one-third reduction of the compiled code and a two-thirds reduction of processing overhead in the wireless terminal. Some performance results are also presented.
Model-Driven Development of Real-Time Software Using OMG Standards
Authors: Bran Selic
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The term "model-driven development" denotes an approach to software design and development characterized by the creation of software models as the focus and primary artifacts of development rather than programs. In this brief note, the essentials of model-drivendevelopment are explained first, followed by a discussion of how this approach is supported in the real-time and embedded system domains by two key OMG standards. A short overview of these standards is also included.
Relational methods in logic, language and information
Authors: Patrick Blackburn, Maarten Rijke, Yde Venema
Venue:  (1995)

This paper discusses the use of relational methods in the interdisciplinary field of Logic, Language and Information. We first sketch the developments that lead up to the current focus on dynamics in the area. After that we give examples of logics of transition that naturally arise in this setting, and we identify more general themes such as bisimulations, relativisations and dynamic modes of inference. We conclude with a discussion of newly emerging themes, and the limitations of the relational perspective.
Installing and Managing Workable Knowledge Management Systems
Authors: Albert H. Rubenstein, Eliezer Geisler
Venue:  (2003)

:Every organization should have some method of capturing, storing, transforming, retrieving, and using knowledge and lessons learned. This book has been written to help managers throughout the organization to design and develop knowledge management systems that are effective and lasting. Successful knowledge management systems are integrated into the corporate culture and the existing information systems apparatus. They are introduced gradually, so as not to clutter the testing phase with too many details. And simple and appropriate metrics are utilized at each stage of the design and operating process. The book concludes with a concise summary of all the necessary steps to ensure success.
Finding approximate repetitions under Hamming distance
Authors: Roman Kolpakov, Gregory Kucherov
Venue: Theoretical Computer Science (2003)

The problem of computing periodicities with K possible mismatches is studied. Two main definitions are considered, and for both of them an O(nK logK + S) algorithm is proposed (n the word length and S the size of the output). This improves, in particular, the bound obtained by G. Landan and J. Schmidt in 1993 (Proceedings of the Fourth Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 684, Springer, Berlin, Padova, Italy, pp. 120-133). Finally, other possible definitions are briefly analyzed.
List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
Authors: Thomas Zeitlhofer, Bernhard Wess
Venue: Signal Processing (2003)

This article focuses on register assignment problems for heterogeneous register-set VLIW-DSP architectures. It is assumed that an instruction schedule has already been generated. The register assignment problem is equivalent to the well-known coloring of an interference graph. Typically, machine-related constraints are mapped onto the structure of the interference graph. Thereby favorable characteristics with regard to coloring, the interval graph properties, get lost. In contrast, we present an approach that does not change the structure of the interference graph. Constraints implied by heterogeneous architectures are mapped to a specific coloring problem that is known as list-coloring. Exploiting the interval graph properties of the interference graph, we derive a list-coloring algorithm that allows us to generate optimum solutions even for large basic blocks. The proposed technique can also be applied to similar resource assignment problems like functional unit assignment.
Developing Visual Studio .Net Macros and Add-Ins, 1 edition
Authors: Jeff Cogswell
Venue:  (2003)

:Whether you simply need to automate a repetitive task or make a full-scale improvement to Visual Studio .NET, Jeff Cogswell will quickly teach you how in this comprehensive book. You'll find all the tools necessary to create customized macros and add-ins using the Macros Integrated Development Environment (IDE) of Visual Studio .NET, and the only print documentation available on how to gain complete control over the IDE's menus. With clear and concise details, Cogswell walks you through macro development, showing you how to automate processes in Visual Studio .NET. He explains how to use Visual Studio .NET to write add-ins for Microsoft Office, and how to integrate Microsoft Office products such as Word, Excel, and Outlook right into Visual Studio .NET. Along the way, he also uncovers the ins and outs of deploying your add-ins and presents expert tips and techniques on how to supercharge Visual Studio .NET.