ppxscal/embedding_network huggingface dataset:
WEAK-CONSISTENCY GROUP COMMUNICATION AND MEMBERSHIP (Ph.D. dissertation)
Authors: Richard A Golding
Venue:  (1992)

Many distributed systems for wide-area networks can be built conveniently, and operate efficiently and correctly, using a *weak consistency group communication* mechanism. This mechanism organizes a set of *principals* into a single logical entity, and provides methods to multicast messages to the members. A weak consistency distributed system allows the principals in the group to differ on the value of shared state at any given instant, as long as they will eventually converge to a single, consistent value. A group containing many principals and using weak consistency can provide the reliability, performance, and scalability necessary for wide-area systems. I have developed a framework for constructing group communication systems, for classifying existing distributed system tools, and for constructing and reasoning about a particular group communication model. It has four components: message delivery, message ordering, group membership, and the application. Each component may have a different implementation, so that the group mechanism can be tailored to application requirements. The framework supports a new message delivery protocol, called *timestamped anti-entropy*, which provides reliable, eventual message delivery; is efficient; and tolerates most transient processor and network failures. It can be combined with message ordering implementations that provide ordering guarantees ranging from unordered to total, causal delivery. A new group membership protocol completes the set, providing temporarily inconsistent membership views resilient to up to k simultaneous principal failures. The Refdbms distributed bibliographic database system, which has been constructed using this framework, is used as an example. Refdbms databases can be replicated on many different sites, using the group communication system described here.
List Processing in Parallel Languages
Authors: T. H. Axford, M. S. Joy
Venue:  (1992)

A new model of list processing is proposed which is more suitable as a basic data structure for architecture-independent programming languages than the traditional model of lists. Its main primitive functions are: concatenate, which concatenates two lists; split, which partitions a list into two parts; and length, which gives the number of elements in a list. This model contains a degree of non-determinism which allows greater freedom to the implementation to achieve high performance on both parallel and serial architectures.
OBJECTIVE-BASED ROUTING FOR PHYSICAL DESIGN-FOR-TEST (Ph.D. Thesis)
Authors: Richard McGowen
Venue:  (1995)

This dissertation describes how objective-based routing can be used to create circuits that are more testable. It presents techniques that allow the importance of routing time, routing area, and testing difficulty to be weighed against one another. These techniques vary the strength of an objective function to take the relative importance of differing goals into account. These techniques achieve significant improvements in testability with minimal time and area penalties. This dissertation presents methods for using the routing techniques to efficiently improve the testability of circuits under the static-voltage and pseudo-exhaustive testing methodologies and gives results for sample circuits. It discusses the relevancy of varying strength objectives to routing in general.
AN EMPIRICAL STUDY OF THE BRANCH COVERAGE OF DIFFERENT FAULT CLASSES
Authors: Melissa S. Cline, Linda L. Werner
Venue:  (1994)

The question "How much testing is enough?" has led many to structural testing methods. Much has been written about their fault detecting ability, but how does this vary by the class of fault? This paper introduces the term "Affected Branch Coverage". An affected branch is a branch which had to be modified in order to fix a fault. Affected Branch Coverage describes the percentage of affected branches that had been exercised in testing. The study was done on a leading on-line transaction processing product, analyzing ninety eight field errors. The specific questions addressed are: - Which classes of faults are most commonly observed? - Which fault classes can be associated with covered code and which with uncovered code? - Is affected branch coverage related to the maturity of the software? Our results show that whether or not a fault would appear in covered code depends strongly on the fault class. While this was true in both newer and older code, it was more vivid in newer code. Overall, we found that affected branch coverage was slightly less than 50%, suggesting that increasing branch coverage would offer limited gains in fault detection.
Clustering Declustered Data for Efficient Retrieval
Authors: Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi
Venue:  (1999)

As databases increasingly integrate multimedia information in the form of image, video, and audio data, both the dimensionality and the amount of data that need to be processed is increasing rapidly. It becomes necessary to support the efficient retrieval of large amounts of multimedia data. Declustering techniques for multi-disk architectures have been effectively used for storage in relational databases. In this paper, we first establish that besides exploiting the parallelism, a careful organization of each disk must be considered for fast searching. We introduce the notion of page allocation and data space mapping which can be used to organize and retrieve multidimensional data. We work on these notions based on three different partitioning strategies: regular grid partitioning, concentric hypercubes and hyperpyramids. We develop techniques that satisfy efficient retrieval by optimizing the number of buckets retrieved by the query, disk arm movement and I/O parallelism. We prove that concentric hypercube based mapping satisfies the optimal clustering and optimal parallelism. We develop techniques based on hyperpyramid partitioning which reduces the number of buckets retrieved by the query and has very efficient inter and intra disk organizations. We evaluate the performance of proposed techniques by comparing it with the current best approaches. The new techniques lead to very significant improvement, up to 43 times, over the existing techniques, therefore resulting in fast retrieval of multimedia data.
Performance Monitoring in Multi-transputer Networks
Authors: Jie C Jiang
Venue:  (1990)

Parallel architectures, like the transputer-based multicomputer network, offer potentially enormous computational power at modest cost. However, writing programs on a multicomputer to exploit parallelism is very difficult due to the lack of tools to help users understand the run-time behavior of the parallel system and detect performance bottlenecks in their programs. This thesis examines the performance characteristics of parallel programs in a multicomputer network, and describes the design and implementation of a real-time performance monitoring tool on transputers. \nWe started with a simple graph theoretical model in which a parallel computation is represented as a weighted directed acyclic graph, called the {\em execution graph}. This model allows us to easily derive a variety of performance metrics for parallel programs, such as program execution time, speedup, efficiency, etc. From this model, we also developed a new analysis method called {\em weighted critical path analysis} (WCPA), which incorporates the notion of parallelism into critical path analysis and helps users identify the program activities which have the most impact on performance. Based on these ideas, the design of a real-time performance monitoring tool was proposed and implemented on a 74-node transputer-based multicomputer. Major problems in parallel and distributed monitoring addressed in this thesis are: global state and global clock, minimization of monitoring overhead, and the presentation of meaningful data. New techniques and novel approaches to these problems have been investigated and implemented in our tool. Lastly, benchmarks are used to measure the accuracy and the overhead of our monitoring tool. We also demonstrate how this tool was used to improve the performance of an actual parallel application by more than 50\%. 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
Verification and Abstraction of Flow-Graph Programs with Pointers and Computed Jumps
Authors: M. Wahab
Venue:  (1998)

A flow-graph language which includes a simultaneous assignment, pointers and computed jumps is developed. The language is expressive enough that sequential composition can be defined as a function on commands, constructing a single command from its arguments. This allows the abstraction of a program to be constructed from the program text. This form of abstraction is the reverse of compilation: the abstraction of a program is also a program. The sequential composition operator can reduce the number of commands which must be considered when verifying a program. This provides a method for simplifying program verification. Proof rules are defined for reasoning about the liveness properties of flow-graph programs. The language is expressive enough to describe sequential object code programs and a program for the Alpha AXP processor is verified as an example.
Adaptive Performance Prediction for Distributed Data-Intensive Applications
Authors: Marcio Faerman, Alan Su, Richard Wolski, Francine Berman
Venue:  (1999)

The computational grid is becoming the platform of choice for large-scale distributed data-intensive applications. Accurately predicting the transfer times of remote data files, a fundamental component of such applications, is critical to achieving application performance. In this paper, we introduce a performance prediction method, ARM (Adaptive Regression Modeling), to determine data transfer times for network-bound distributed data-intensive applications. We demonstrate the effectiveness of the ARM method on two distributed data applications, SARA (Synthetic Aperture Radar Atlas) and SRB (Storage Resource Broker), and discuss how it can be used for application scheduling. Our experiments demonstrate that applying the ARM method to these applications predicted data transfer times in wide-area multi-user grid environments with accuracy of 88% or better.
Precision of Binary Matching Systems
Authors: Roger W. Ehrich, Visvanathan Ramesh
Venue:  (1987)

Inexpensive memory and fast processors have made it feasible to build binary matching inspection systems capable of very high measurement precision that operate at near-camera speeds. While the limitations of binary inspection are well known, its performance and cost advantage can be very large in situations in which it can be applied. When binary matching inspection systems are designed and when they are purchased and installed by end-users it becomes absolutely essential to understand the numerous sources that contribute to measurement error. That makes it possible to make precise statements about the accuracy of components whose tolerances they are used to certify. This paper considers quantitative precision issues for the inspection of strictly 2-dimensional objects using line scan cameras that integrate while the workpiece is in motion.
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
Authors: Chenyang Lu, Brian M. Blum, Tarek F. Abdelzaher, John A. Stankovic, Tian He
Venue:  (2002)

Large-scale wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from traditional networked systems. This paper presents RAP, a new real-time communication architecture for large-scale sensor networks. RAP provides convenient, high-level query and event services for distributed micro-sensing applications. Novel location-addressed communication models are supported by a scalable and light-weight network stack. We present and evaluate a new packet scheduling policy called velocity monotonic scheduling that inherently accounts for both time and distance constraints. We show that this policy is particularly suitable for communication scheduling in sensor networks in which a large number of wireless devices are seamlessly integrated into a physical space to perform real-time monitoring and control. Detailed simulations of representative sensor network environments demonstrate that RAP significantly reduces the end-to-end deadline miss ratio in the sensor network.
A Visual Simulation Support Environment Based on the DOMINO Conceptual Framework
Authors: Emory J Derrick, Osman Balci
Venue:  (1992)

The purpose of this paper is to present a Visual Simulation Support Environment (VSSE) based on the multifaceD coOnceptual fraMework for vIsual simulatioN mOdeling (DOMINO). The ever-increasing complexity of visual simulation model development is undeniable. There is a need for automated support throughout the entire visual simulation model development life cycle. This support is furnished by the VSSE which is composed of integrated software tools providing computer-aided assistance in the development and execution of a visual simulation model. The VSSE has been jointly developed with the DOMINO. Its architecture consists of three layers: hardware and operating system, kernel VSSE, minimal VSSE, and VSSEs. This paper focuses on the minimal VSSE toolset. Evaluation of the VSSE shows that it adequately satisfies all of its 13 design objectives.
A Qualitative Examination of Content-Based Image Retrieval Behavior using Systematically Modified Test Images
Authors: James C. French, Worthy M. Martin, James V. S. Watson
Venue:  (2002)

We describe the outcome of an effort to understand the behavior of content-based image retrieval (CBIR) technology by examining the behavior of a CBIR system in response to carefully constructed input query images. This work is preliminary and only considers a single CBIR system, SIMPLIcity. We chose this particular system for expediency. It is our intention to develop a methodology suitable for examining any CBIR system.
Counting and Reporting Red/Blue Segment Intersections
Authors: Larry Palazzi
Venue:  (1993)

We simplify the red/blue segment intersection algorithm of Chazelle et al: Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O(n log(n)) time using O(n) space or report them in additional time proportional to their number. Our algorithm uses a plane sweep to presort the segments; then it operates on a list of slabs that efficiently stores a single level of a segment tree. With no dynamic memory allocation, low pointer overhead, and mostly sequential memory reference, our algorithm performs well even with inadequate physical memory.
Formal Specifications: A Systematic Evaluation
Authors: Colleen DeJong, Matthew Gibble, John Knight, Luis Nakano
Venue:  (1997)

Industrial practitioners require constant improvements in the software development process and the quality of the resulting product in order to satisfactorily build larger and more complex systems. Academia praises formal specification techniques as a means to achieve these goals, yet formal specification has not been widely adopted by industry. The focus of this research is to study the disparity betweev industry and academia in their experience with formal specification methods. During the specification of a significant software system, a control system for a nuclear reactor, it became clear that the use of formal specification methods had potential benefits, but there were practical requirements thatt were not being met. Previous evaluations of formal specification failed to identify many of these flaws and a new comprehensive approach based on the requirements of the current software development process is needed. A comprehensive approach to evaluation was developed as part of this research. The evaluation method presented here does not examine theoretical qualities of language form and structure, rather it examines basic but vital practical issues involving the notation, tools, and methods for using them. There were two objectives of this research: - to identify these practical requirements and create a list of criteria for formal specification methods - to evaluate several formal specification methods based on these criteria. The criteria were systematically derived from current software development practice. This derivation links the criteria with specific activities in the software development process and supports their inclusion in the evaluation. Using this set of criteria, an evaluation of three formal specification methods, Z, PVS, and statecharts, was conducted by developing and examining specifications for a preliminary version of the reactor control system.
A regular N-node bounded degree network for sorting N^2 keys with optimalspeedup
Authors: Andreas Bieniek, Michael Nolle, Gerald Schreiber
Venue:  (1995)

In this paper we present a new parallel sorting algorithm called em Shuffle Ring Sort (SRS) for distributed memory systems with a regular bounded degree interconnection network. Our algorithm is optimal in the sense that it achieves a time complexity of O(N log N) for sorting at least N^2 keys on N processors. noindent The assumption that the problem size grows at least quadratic with the number of available processing elements does not restrict the applicability of the algorithm for most practical purposes. We present the results as well as an implementation on several interconnection networks. The results of the new algorithm are compared to the well known bitonic sorting algorithm.
S-PARAMETER BASED MACRO-MODEL OF DISTRIBUTED-LUMPED NETWORKS USING PADE'' APPROXIMATION
Authors: Haifang Liao, Rui Wang, Rajit Chandra, Wayne Dai
Venue:  (1992)

A Scattering-Parameters (S-Parameters) based macromodel of distributed-lumped networks is presented, The networks can include capacitive cutsets, inductive loops, RLC meshes, and lossy transmission lines. An efficient network reduction algorithm is developed to reduce the original network into a network containing one multiport component together with the sources and loads of interest. The S-Parameters of the circuit components are approximated by Taylor series to simplify the reduction process. Pade'' approximation is used to derive the macromodel. The macromodel is very flexible that the accuracy of the model can be controlled by adjusting the order of approximation. The experimental results indicate that our model can approach the accuracy of SPICE with one or two order less computing time.
Adaptive Scheduling with Client Resources to Improve WWW Server Scalability
Authors: Daniel Andresen, Tao Yang
Venue:  (1996)

WWW-based Internet information service has grown enormously during last few years, and major performance bottlenecks have been caused by WWW server and Internet bandwidth inadequacies. Augmenting the server with multi-processor support and shifting computation to client-site machines can substantially improve the system response time and for some applications, it may also reduce network bandwidth requirement. In this paper, we model client-server partitionable WWW applications and propose adaptive scheduling techniques that optimize the use of client-server resource by predicting the aggregate impact of I/O, CPU and network capabilities. We present a software system called SWEB++ which implements and supports the use of our scheduling strategies when programming WWW applications. We also provide a performance-analysis framework based on homogeneous client-server assumptions to identify the impact of system loads and network bandwidth and demonstrate the effectiveness of our scheduling strategies. Finally we present several experimental results to examine the system performance and verify the usefulness of the analytic model.
On Graphs of Large Girth
Authors: H. Regev
Venue:  (1995)

We improve two bounds [?], a lower bound on the number of vertices, and an upper bound on the number of edges, for (unweighted) graphs of girth bounded from below. We state three new, girth dependend lower bounds, considering the minimal degree in the graph, the minimal and the maximal degrees, and the size. The latter implies two new upper bounds on the size of the graph. We also compute the maximum value that the girth may assume in any graph of 2n edges or more. 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
The Space Overhead of Customization
Authors: Sylvia Dieckmann, Urs Holzle
Venue:  (1997)

Customization aims to improve the performance of pure object-oriented languages by compiling multiple copies of a source method, each of them specialized for a certain revceiver type. Like other code duplication techniques, it gains performance by trading code space for better speed. Unfortunately, customization can significantly increase code space, especially for larger programs. We show that customization increases memory usage by almost a factor of three for some applications in the Self-93 system. We analyze and quantify the factors that lead to this space overhead and identify strategies to eliminate most of it. We focus on dynamically-compiled systems like Self-93 where it is impractical or undesirable to use whole-program analysis or programmer-directed profiling to guide customization decisions. Our experiments show that a combination of relatively straightforward strategies can bring the code space consumption of customization to within 34% or less of a completely non-customizing system. Thus, even in dynamically-compiled systems customization and efficient memory usage need not be mutually exclusive.
PIk Mass Production and an Optimal Circuit for the Nechiporuk Slice
Authors: Alain P. Hiltgen, M. S. Paterson
Venue:  (1993)

Let D: {0,1}n $ {0, 1}m be an m-output Boolean function in n variables. The k-slice of D is the monotone function Dsl-k defined component-wise by D (i)sl-k = (D (i) [ Tn k ) Z Tn k +1 , where Tnk is the kth threshold function. Wegener showed that certain ''PIk - set circuits'' are at the heart of any optimum Boolean circuit for a k-slice D. We prove that, in PIk - set circuits, savings are possible for the mass production of any F l X, i.e., any collection F of ms output-sets given any collection X of ns input-sets, if their PIk - set complexity satisfies SCm (F lX) 3 3ns + 2ms. This PIk mass production, which can be used also in monotone circuits for slice functions, is exploited then in different ways to obtain a monotone circuit of complexity 3n + o(n) for the canonical slice of the Nechiporuk sums, thus disproving a conjecture by Wegener that this slice has monotone complexity O(n3/2). Finally, we prove that this new circuit for the Nechiporuk slice is asymptotically optimal, not only with respect to monotone, but also with respect to combinational, complexity.