ppxscal/embedding_network huggingface dataset:
Broadcasting Multiple Messages in the Multiport Model
Authors: Amotz Bar-Noy, Ching-Tien Ho
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We consider the problem of broadcasting multiple messages from one processor to many processors in the k-port model for message passing systems. In such systems, processors communicate in rounds, where in every round, each processor can send k messages to k processors and receive k messages from k processors. In this paper, we first present a simple and practical algorithm based on variations of k complete k-ary trees. We then present an optimal algorithm up to an additive term of one for this problem for any number of processors, any number of messages, and any value for k.
A Framework for Networked Reactive Character
Authors: Dilza Szwarcman, Bruno Feijo, Mónica Costa
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The paper presents a framework for distributed reactive characters on a computer network and proposes innovative concepts for shared state management. Firstly, behavioral accuracy is defined in terms of three types of state (physical, procedural and emotional). Secondly, visual soundness, a concept inversely proportional to behavioral accuracy, is associated with the autonomy of clones. Thirdly, the usual concept of dead reckoning is relaxed by exploring the idea of autonomy, which is the basis for networked reactive characters. The framework, built on top of an open architecture toolkit called Bamboo, can gracefully cope with reactive environments producing good levels of visual soundness, which results in smooth animations, and behavioral accuracy.
Reducing data access penalty using intelligent opcode-driven cache prefetching
Authors: Chi-Hung Chi, Siu-Chung Lau
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

In the latest processor architectures such as IBM PowerPC and HP Precision Architecture (PA), it is found that certain important compound opcodes such as LOAD-UPDATE and LOAD-MODIFY contain accurate information about how data will be referenced in the near future. Furthermore, these opcodes have been fully utilized by the compiler in the program code generation. With the migration of data cache onto the processor chip, it is now possible for the on-chip cache controller to perform intelligent data prefetching based on the information from the instruction decode unit. In this paper, a novel hardware-driven data prefetching scheme, called the Instruction Opcode-Based Prefetching (IOBP), is proposed. Our simulation shows that this IOBP scheme is very effective in reducing processor stall time due to memory accesses, especially for array or pointer references with constant strides.
A Systolic Algorithm to Process Compressed Binary Images
Authors: Fikret Erçal, Mark Allen, Hao Feng
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

A new systolic algorithm which computes image differences in run-length encoded (RLE) format is described. The binary image difference operation is commonly used in many image processing applications including automated inspection systems, character recognition, fingerprint analysis, and motion detection. The efficiency of these operations can be improved significantly with the availability of a fast systolic system that computes the image difference as described in this paper. It is shown that for images with a high similarity measure, the time complexity of the systolic algorithm is small and in some cases constant with respect to the image size. The time for the systolic algorithm is proportional to the difference between the number of runs in the two images, while the time for the sequential algorithm is proportional to the total number of runs in the two images together. A formal proof of correctness for the algorithm is also given.
Semantic Query Optimization for Methods in Object-Oriented Database Systems
Authors: Karl Aberer, Gisela Fischer
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Although the main difference between the relational and the object-oriented data model is the possibility to define object behavior, query optimization techniques in object-oriented database systems are mainly based on the structural part of objects. We claim that the optimization potential emerging from methods has been strongly underestimated so far. In this paper we concentrate on the question of how semantic knowledge about methods can be considered in query optimization. We rely on the algebraic and rule-based approach for query optimization and present a framework that allows to integrate schema-specific knowledge by tailoring the query optimizer according to the particular application's needs. We sketch an implementation of our concepts within the OODBMS VODAK using the Volcano optimizer generator.
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
Authors: Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, Horst D. Simon
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

An important application of graph partitioning is data clustering using a graph model - the pairwise similarities between all data objects form a weighted graph adjacency matrix that contains all necessary information for clustering. Here we propose a new algorithm for graph partition with an objective function that follows the min-max clustering principle. The relaxed version of the optimization of the min-max cut objective function leads to the Fiedler vector in spectral graph partition. Theoretical analyses of min-max cut indicate that it leads to balanced partitions, and lower bonds are derived. The min-max cut algorithm is tested on news-group datasets and is found to outperform other current popular partitioning/clustering methods. The linkage-based refinements in the algorithm further improve the quality of clustering substantially. We also demonstrate that the linearized search order based on linkage differential is better than that based on the Fiedler vector, providing another effectivepartition method.
Towards the Verification of Scenarios with Time Petri-Nets
Authors: Jonathan Lee, Jong-Yih Kuo, Yong-Yi Fanjiang, Stephen J. H. Yang, Jiann-I Pan
Venue: 24th International Computer Software and Applications Conference (2000)

The focus of this paper is on the use of time Petri-nets to serve as the verification mechanism for the acquired scenarios. Use cases are used to elicit the user needs and to derive the scenarios. After specifying all possible scenarios, each of them can be transformed into its correspondent time Petri-nets model (TPN). Through the analysis of these TPN models, wrong information and missing information in scenarios can be detected. A course registration problem domain illustrates the proposed approach.
Learning a Hidden Matching
Authors: Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of vertices induces an edge. This is motivated by a problem that arises in molecular biology. In the deterministic nonadaptive setting, we prove a (\frac{1}{2} + 0(1))(_2^n ) upper bound and a nearly matching 0.32(_2^n ) lower bound for the minimum possible number of queries. In contrast, if we allow randomness then we obtain (by a randomized, nonadaptive algorithm) a much lower O(n log n) upper bound, which is best possible (even for randomized fully adaptive algorithms).
Knowledge Discovery from Telecommunication Network Alarm Databases
Authors: Kimmo Hätönen, Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

A telecommunication network produces daily large amounts of alarm data. The data contains hidden valuable knowledge about the behavior of the network. This knowledge can be used in filtering redundant alarms, locating problems in, the network, and possibly in predicting severe faults. We describe the TASA (Telecommunication Network Alarm Sequence Analyzer) system for discovering and browsing knowledge from large alarm databases. The system is built on the basis of viewing knowledge discovery as an interactive and iterative process, containing data collection, pattern discovery, rule postprocessing, etc. The system uses a novel framework for locating frequently occurring episodes from sequential data. The TASA system offers a variety of selection and ordering criteria for episodes, and supports iterative retrieval from the discovered knowledge. This means that a large part of the iterative nature of the KDD process can be replaced by iteration in the rule postprocessing stage. The user interface is based on dynamically generated HTML. The system is in experimental use, and the results are encouraging: some of the discovered knowledge is being integrated into the alarm handling software of telecommunication operators.
Data Replication in Mariposa
Authors: Jeff Sidell, Paul M. Aoki, Adam Sah, Carl Staelin, Michael Stonebraker, Andrew Yu
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. We present extensions to the economic model which support replica management, as well as our mechanisms for propagating updates among replicas. We show how our replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization. We present a rule-based conflict resolution mechanism, which can be used to enhance traditional time-stamp serialization. We discuss the effects of our replica system on query processing for both read-only and read-write queries. We further demonstrate how the replication model and mechanisms naturally support name service in Mariposa.
A Method for Structural Compatibility in Software Reuse Using Requirements Specifcation
Authors: Kasilingam Periyasamy, J. Chidambaram
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Software reuse can be attempted at any stage in the life cycle of a software. However, reuse will be more effective at a higher level of abstraction mainly because one can easily understand the functionalities of a reusable component when it is abstractly speci- ed, and can also justify that the component is indeed reusable. A software product can be reused if and only if its structure and behavior are compatible with those of the software that has to be developed. In this paper, we present a method to ensure structural compatibil- ity in software reuse, using formal requirements spec- i cation. We also describe algorithms to implement the method, and illustrate the method through a case study. The formal notation Z is used in this paper.
Space-Time Adaptive Processing on the Mesh Synchronous Processor
Authors: Janice S. McMahon, Ken Teitelbaum
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents an assessment of the applicability of the Mesh Synchronous Processor (MeshSP) architecture to a class of radar signal processing algorithms known as Space-Time Adaptive Processing (STAP). The MeshSP is a SIMD processor developed at MIT Lincoln Laboratory and marketed by Integrated Computing Engines, Inc. A high- level overview of the MeshSP architecture will be presented. Mappings of a matrix decomposition algorithm to the MeshSP architecture are described. A performance model for estimating computation and communication latencies for the Householder algorithm on the MeshSP using different mapping approaches will be presented. Results of the performance model will be presented.
Computers as Partners: A Technology Forecast for Decision-Making in the 21st Century
Authors: Joseph P. Cavano
Venue: 23rd International Computer Software and Applications Conference (1999)

By the end of the next decade, computers will not be just information gatherers who return reams of keyword- related information. Instead computers will become mobile intelligent helpers who will truly understand entire problems and provide just the right information to solve them. What capabilities will be needed to realize such advanced systems? This Technology Forecast Panel will project technology advances and assess the impact such systems might have on future decision- makers. The scenarios and ideas presented by the panelists will provide a reasonable starting point for discussion and solicitation of alternative views. alternatives, selecting the best choice and communicating decisions across the organization.
Network Management with Intelligent Trader
Authors: Shinichi Matsumoto, Makoto Amamiya
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper, we describe the concept of Intelligent Trader and the network management architecture based on it. First, we describe problems in the modern network system, from the viewpoint of network management. Next, we describe the similarity and difference between the network management and the application integration. Then we discuss the merits and problems of the application integration technique when applying it to the network management. Last, we propose the intelligent trader system that incorporates the application integration technique into the network management.
Eliminating Stale Data References through Array Data-Flow Analysis
Authors: Lynn Choi, Pen-Chung Yew
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper, we develop a compiler algorithm for detecting references to stale data in shared-memory multiprocessors. The algorithm consists of two key analysis techniques, stale reference detection and locality preserving analysis. While the stale reference detection finds the memory reference patterns that may violate cache coherence, the locality preserving analysis minimizes the number of such stale references by analyzing both temporal and spatial reuses. By computing the regions referenced by arrays inside loops, we extend the previous scalar algorithms for more precise analysis. We have implemented the algorithm on the Polaris parallelizing compiler, and using execution-driven simulations on Perfect Club benchmarks we demonstrate how unnecessary cache misses can be eliminated by the automatic stale reference detection.
Supporting Fine-grained Data Lineage in a Database Visualization Environment
Authors: Allison Woodruff, Michael Stonebraker
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The lineage of a datum records its processing history. Because such information can be used to trace the source of anomalies and errors in processed data sets, it is valuable to users for a variety of applications, including the investigation of anomalies and debugging. Traditional data lineage approaches rely on metadata. However, metadata does not scale well to fine-grained lineage, especially in large data sets. For example, it is not feasible to store all of the information that is necessary to trace from a specific floating-point value in a processed data set to a particular satellite image pixel in a source data set. In this paper, we propose a novel method to support fine-grained data lineage. Rather than relying on metadata, our approach lazily computes the lineage using a limited amount of information about the processing operators and the base data. We introduce the notions of weak inversion and verification. While our system does not perfectly invert the data, it uses weak inversion and verification to provide a number of guarantees about the lineage it generates. We propose a design for the implementation of weak inversion and verification in an object-relational database management system.
A Fully Abstract May Testing Semantics for Concurrent Objects
Authors: Alan Jeffrey, Julian Rathke
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language.
ECA Rule Integration into an OODBMS: Architecture and Implementation
Authors: Sharma Chakravarthy, V. Krishnaprasad, Z. Tamizuddin, R. H. Badani
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Making a database system active entails not only the specification of expressive ECA (event-condition-action) rules, algorithms for the detection of composite events, and rule management, but also a viable architecture for rule execution that extends a passive DBMS, and its implementation. We propose an integrated active DBMS architecture for incorporating ECA rules using the Open OODB Toolkit (from Texas Instruments). We then describe the implementation of the composite event detector, and rule execution model for object-oriented active DBMS. Finally, the functionality supported by this architecture and its extensibility are analyzed along with the experiences gained.
Fault-Tolerant Routing Algorithms for Hypercube Networks
Authors: Keiichi Kaneko, Hideo Ito
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

For hypercube networks which have faulty nodes, a few efficient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two improved versions of the algorithm of Chiu and Wu by using the notion of full reachability. A fully reachable node means that the node can reach all nonfaulty nodes which have Hamming distance h from the node via a path of length h. The simulation shows that the algorithms give sufficient effect when they are applied to low-dimensional hypercubes.
Mining California Vital Statistics Data
Authors: Du Zhang, Quoc Luan Ha, Meiliu Lu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Vital statistics data offer a fertile ground for data mining.In this paper, we discuss the results of a data miningproject on the causes of death aspect of the vital statisticsdata in the state of California. A data mining tool calledCubist is used to build predictive models out of two millioncases over a nine-year period. The objective of our studyis to discover knowledge that can be used to gain insightinto various aspects of mortality in California, to predicthealth issues related to the causes of death, to offer an aidto decision-or policy-making process, and to provideuseful information services to the customers. The resultsobtained in our study contain valuable new information.
MTIO - A Multi-Threaded Parallel I/O System
Authors: Sachin More, Alok N. Choudhary, Ian T. Foster, Ming Q. Xu
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Presents the design and evaluation of MTIO (Multi-Threaded Input/Output), a multi-threaded runtime library for parallel I/O. We extend the multi-threading concept to separate the computation and I/O tasks into two separate threads of control. Multi-threading in our design permits (a) asynchronous I/O even if the underlying file system does not support asynchronous I/O; (b) copy avoidance from the I/O thread to the compute thread by sharing address space; and (c) a capability to perform collective I/O asynchronously without blocking the compute threads. Further, this paper presents techniques for collective I/O which maximize load balance and concurrency while reducing communication overhead in an integrated fashion. Performance results on an IBM SP2 for various data distributions and access patterns are presented. The results show that there is a tradeoff between the amount of concurrency in I/O and the buffer size designated for I/O, and that there is an optimal buffer size beyond which the benefits of larger requests diminish due to large communication overheads.
Performance evaluation of a seismic data analysis kernel on the KSR multiprocessors
Authors: Weiming Gu
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The paper presents the results of performance analyses of a seismic analysis kernel code on the KSR multiprocessors. The purpose of such analysis is to understand the performance behaviors of a class of applications on shared memory parallel machines. The g5 kernel code, commonly used in seismic analysis applications, is parallelized, and its computational and I/O performance is analyzed on a 32-node KSR-1 and a 64-node KSR-2.
Clock-Delayed Domino for Adder and Combinational Logic Desig
Authors: Gin Yee, Carl Sechen
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

An innovative dynamic logic family, clock-delayed (CD) domino, was developed to provide gates with either inverting or non-inverting outputs, and the high speed and layout compactness of dynamic logic. The characteristics of CD domino are demonstrated in two carry lookahead adder designs and three MCNC combinational logic benchmark circuits. The CD domino designs are compared to designs using static CMOS and standard domino logic. A circuit design tool was developed to automate the design of CD domino circuits. Simulations show a 32-bit CD domino adder comprised of four 8-bit full adders to be 30% faster than a 32-bit standard domino adder, and a 32-bit CD domino adder comprised of a single 32-bit full adder to be 45% faster. In the combinational logic benchmark circuits, complex inverting and non-inverting gates were used to implement C1355, C3540, and b9. The CD domino circuits were 22%, 43% and 34% faster than their static CMOS counterparts of C1355, C3540 and b9, respectively.
The Computational Co-op: Gathering Clusters into a Metacomputer
Authors: Walfredo Cirne, Keith Marzullo
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

We explore the creation of a metacomputer by the aggregation of independent sites. Joining a metacomputer is voluntary, and hence it has to be an endeavor that mutually benefits all parties involved. We identify proportional-share allocation as a key component of such a mutual benefit. Proportional-share allocation is the basis for enforcing the agreement reached among the sites on how to use the metacomputer's resources. We introduce a resource manager that provides proportional-share allocation over a cluster of workstations, assuming applications to be master-slave. This manager is novel because it performs non-preemptive proportional scheduling of multiple processors. A prototype has been implemented and we report on preliminary results. Finally, we discuss how tickets (first-class entities that encapsulate allocation endowments) can be used in practice to enforce the meta-computer agreement, and also how they can ease the site selection to be performed by the application