ppxscal/embedding_network huggingface dataset:
ODB-QOPTIMIZER: A Tool for Semantic Query Optimization in OODB
Authors: Sonia Bergamaschi, Domenico Beneventano, Claudio Sartori, Maurizio Vincini
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

ODB-QOptimizer is a ODMG 93 compliant tool for the schema validation and semantic query optimization. The approach is based on two fundamental ingredients. The first one is the OCDL description logics (DLs) proposed as a common formalism to express class descriptions, a relevant set of integrity constraints rules (IC rules) and queries. The second one are DLs inference techniques, exploited to evaluate the logical implications expressed by IC rules and thus to produce the semantic expansion of a given query.
A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes
Authors: Gerd Heber, Guang R. Gao, Rupak Biswas
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory results, e.g., excessive data migration among processors.Furthermore, special attention should be paid to their amenability to parallelization. In this paper, a novel parallel method for the dynamic partitioning of adaptive unstructured meshes is described. It is based on a linear representation of the mesh using self-avoiding walks.
The RACE network architecture
Authors: Bradley C. Kuszmaul
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The RACE parallel computer system provides a high-performance parallel interconnection network at low cost. This paper describes the architecture and implementation of the RACE system, a parallel computer for embedded applications. The topology of the network, which is constructed with 6-port switches, can be specified by the customer and is typically a fat-tree, a Clos network, or a mesh. The network employs a preemptable circuit switched strategy. The network and the processor-network interface work together to provide high performance: 160 megabytes per second transfer rates with about 1 microsecond of latency. Priorities can be used to guarantee tight real-time constraints of a few microseconds through a congested network. A self-regulating circuit adjusts the impedance and output delay of the pin-driver pads.
On Privatization of Variables for Data-Parallel Execution
Authors: Manish Gupta
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Privatization of data is an important technique that has been used bycompilers to parallelize loops by eliminating storage-related dependences. When a compiler partitions computations based on the ownership of data, selecting a proper mapping of privatizable data is cru- cial to obtaining the bene.ts of privatization. This pa- per presents a novel framework for privatizing scalar and array variables in the context of a data-driven ap- proach to parallelization. We show that there are nu- merous alternatives available for mapping privatized variables and the choice of mapping can signi.cantly a.ect the performance of the program. We present an algorithm that attempts to preserve parallelism and minimize communication overheads. We also introduce the concept of partial privatization of arrays that combines data partitioning and privatization, and enables e.cient handling of a class of codes with multi-dimensional data distribution that was not previously possible. Finally, we show how the ideas of privatization apply to the execution of control ow statements as well. An implementation of these ideas in the pHPF prototype compiler for High Performance Fortran on the IBM SP2 machine has shown impressive results.
Exploiting Global Structure for Performance on Clusters
Authors: Stephen R. Donaldson, Jonathan M. D. Hill, David B. Skillicorn
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Most parallel programming models for distributed-memory architectures are based on individual threads interacting via send and receive operations. We show that a more structured model, BSP, gains substantial performance improvements by exploiting the extra information implicit in its structure. In particular, each thread learns something about global state whenever it receives a message. This information can be used to modify its own behavior to improve collective use of the communication system. The programming model's semantics also provides implicit knowledge that can be exploited to increase performance. We show that these effects are useful at the application level by comparing the performance of BSP and MPI implementations of the NAS parallel benchmarks.
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
Authors: Bruno Ciciani, Claudio Paolucci, Michele Colajanni
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We present a new analytical approach for the performance evaluation of asynchronous wormhole routing in k- ary n-cubes. Through the analysis of network flows, our methodology furnishes a closed formula for the average message delay in wormhole deterministic routing. In this paper, the focus is on 3D asymmetric torus networks with uni-directional or bi-directional links. However, the model can be easily applied to evaluate the performance of deterministic wormhole policies in any hypercube and torus topology. The comparison with two simulation models demonstrates that our methodology gives accurate results for both low and high traffics.
Relaxing Causal Constraints in PDES
Authors: Narayanan V. Thondugulam, Dhananjai Madhava Rao, Radharamanan Radhakrishnan, Philip A. Wilsey
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

One of the major overheads that prohibits the wide spread deployment of parallel discrete event simulation (PDES) is the need to synchronize the distributed processes in the simulation. Considerable investigations have been conducted to analyze and optimize the two widely used synchronization strategies, namely the conservative and the optimistic simulation paradigms. However, little attention has been focussed on the definition and strictness of causality. Does causality need to be preserved in all types of simulations? Previously, we had suggested an answer to this question. We had argued that significant performance gains can be achieved by reconsidering this definition to decide if the parallel simulation really needs to subscribe to the preservation of causality. In this paper, we investigate this issue even more closely. An in depth analysis using several example simulation models is presented in this paper. In addition, a comparative analysis between unsynchronized and Time Warp simulation is presented.
A Common Framework for Classifying and Specifying Deductive Database Updating Problems
Authors: Ernest Teniente, Toni Urpí
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We propose two interpretations of the event rules which provide a common framework for classifying and specifying deductive database updating problems such as view updating, materialized view maintenance, integrity constraints checking, integrity constraints maintenance, repairing inconsistent databases, integrity constraints satisfiability or condition monitoring. Moreover, these interpretations allow us to identify and to specify some problems that have received little attention up to now like enforcing or preventing condition activation. By considering only a unique set of rules for specifying all these problems, we want to show that it is possible to provide general methods able to deal with all these problems as a whole.
Combining dependence and data-flow analyses to optimize communication
Authors: Ken Kennedy, Nenad Nedeljkovic
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Reducing communication overhead is crucial for improving the performance of programs on distributed-memory machines. Compilers for data-parallel languages must perform communication optimizations in order to minimize this overhead. In this paper, we show how to combine dependence analysis, traditionally used to optimize regular communication, and a data-flow analysis method originally developed to improve placement of irregular communication. Our approach allows us to perform more extensive optimizations message vectorization, elimination of redundant messages, and overlapping communication with computation. We also present preliminary experimental results that demonstrate the benefits of the proposed method.
A Partitioning Programming Environment for a Novel Parallel Architecture
Authors: Reiner W. Hartenstein, Jürgen Becker, Michael Herz, Rainer Kress, Ulrich Nageldinger
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

The paper presents a partitioning and parallelizing programming environment for a novel parallel architecture. This universal embedded accelerator is based on a reconfigurable datapath hardware. The partitioning and parallelizing programming environment accepts C programs and carries out both a profiling-driven host/accelerator partitioning for performance optimization in a first step, and in a second step a resource-driven sequential/structural partitioning of the accelerator source code to optimize the utilization of its reconfigurable resources.
Role-based Decomposition for Improving Concurrency in Distributed Object-Oriented Software Development Environments
Authors: Tae-Hoon Kim, Yeong-Gil Shin
Venue: 23rd International Computer Software and Applications Conference (1999)

This paper presents a role-based decomposition model for improving concurrency in distributed object-oriented software development environments. In software development process, the target software system consists of a large number of components closely related with one another. This results in potential operation conflicts in cooperative works among the project members. This problem can be much reduced by decomposing the target software system into the relatively independent components. Our system incorporates hierarchical role-based decomposition model to reduce operation conflicts frequently occur in synchronous/asynchronous collaboration. The decomposed components are also used as basic units of the role-based access control. Once the target software system is properly decomposed according to this model, its subsystems can migrate to the other sites, and thus, the components can be evenly distributed over networked computers.
Electronic contract negotiation as an application niche for mobile agents
Authors: Frank Griffel, M. Tuan Tu, Malte Münke, Michael Merz, Winfried Lamersdorf, Miguel Mira da Silva
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

We propose electronic contract negotiation-a sub-part of the more general area of electronic commerce-as an example application for mobile agents. We start by presenting a set of requirements that an application should fulfil in order to take advantage of mobile agents and show that not all distributed applications meet these requirements. We then present contract negotiation, an example of an application that can potentially take full advantage of mobile agents. The paper also contains an introduction to a mobile agent system being developed at Hamburg University and show how it can be used to implement contract negotiation.
Adding Full Text Indexing to the Operating System
Authors: Kyle Peltonen
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Many challenges must be faced when incorporating full text retrieval into the operating system. The search engine must be a nearly invisible, natural extension to the operating system, just like the file system and the network. The search engine must meet user expectations of an operating system, specifically in areas such as performance, fault tolerance, and security. It must handle a very heterogeneous collection of documents, in many formats, many languages and many styles. The search engine must scale with the operating system, from small laptop computers to large multiprocessor servers. The paper is an overview of the challenges faced when incorporating full text indexing into the Microsoft Windows NT/sup TM/ operating system. Specific solutions used by the Microsoft 'Tripoli' search engine, are offered.
Integrated Query Processing Strategies for Spatial Path Queries
Authors: Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

We investigate optimization strategies for processing path queries with embedded spatial constraints, such as avoiding areas with certain characteristics. To resolve complex spatial constraints during path finding, we consider two decisions: (1) the spatial relation operations (e.g., intersect) between areas and links can be preprocessed or intermixed with path finding and (2) areas satisfying the query constraint can be prefiltered or dynamically selected during path finding. Based on these two decisions, we propose and implement the resulting four integrated query processing strategies, utilizing state-of-the-art technologies such as spatial joins for intersect computation, R-tree access structure for spatial overlap search, and spatial clustering for efficient path search. In this paper, we also report an experimental evaluation to show which strategies perform best in different scenarios.
Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems
Authors: Azer Bestavros
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We present two server-initiated protocols to improve the performance of distributed information systems WWW. Our first protocol is a hierarchical data dissemination mechanism that allows information to propagate from its producers to servers that are closer to its consumers. This dissemination reduces network traffic and balances load amongst servers by exploiting geographic and temporal locality of reference properties exhibited in client access patterns. Our second protocol relies on speculative service, whereby a request for a document is serviced by sending, in addition to the document requested, a number of other documents that the server speculates will be requested in the near future. This speculation reduces service time by exploiting the spatial locality of reference property. We present results of trace-driven simulations that quantify the attainable performance gains for both protocols.
Storage System and the Multimedia Challenges
Authors: Ramzi R. Yehia, Imadeldin O. Mahgoub
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

With the increasing processing speeds, there is a shift away from the paradigm of centralized, sequential storage systems towards distributed and network based storage systems. Further, with the new imaging and real time multimedia applications, it is becoming more than ever important to design powerful, efficient and scaleable I/O systems. In this paper, the requirements of storage subsystems in multimedia environment were presented. The storage system components relating to those requirements were analyzed. Current solutions were surveyed and classified. Then we proposed approaches to improve storage subsystem performance for multimedia. The first approach applies constrained layout currently used for single disk model to multi-disk system. The second calls for using a striping unit that meets both media and storage system optimization criteria. The third uses a pool of buffers instead of single buffer per stream.
Control-Driven Coordination Based Assembling of Components
Authors: Avraam Chimaris, George A. Papadopoulos
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The coordination paradigm has been used extensively as a mechanism for software composition and integration. Consequently, a number of associated models and languages have been proposed which address issues of CBSE from the coordination point of view. In this paper we use the control-driven approach to coordination and we present a framework within which it is possible to assemble components written in contemporary programmingenvironments. In particular, we show how the coordination model IWIM, advocating a black-box approach to component development, can be realized in ActiveX. We map the fundamental building blocks of the IWIM model to ActiveX controls and we then show by means of an example the applicability of our approach, presenting also the results in a visual way, thus taking advantage of the features offered by the ActiveX environment.
Embedding of binomial trees in hypercubes with link faults
Authors: Jie Wu, Eduardo B. Fernandez, Yingquiu Luo
Venue: Proceedings of the international Conference on Parallel Processing (1997)

We study the embedding of binomial trees with variable roots in n-dimensional hypercubes (n-cubes) with faulty links. A simple embedding algorithm is first proposed that can embed an n-level binomial tree in an n-cube with up to n-1 faulty links in log(n-1) steps. We then extend the result to show that spanning binomial trees exist in a connected n-cube with up to [3(n-1)/2]-1 faulty links. Our results reveal the fault tolerance property of hypercubes and they can be used to predict the performance of broadcasting and reduction operations, where the binomial tree structure is commonly used.
Implementing Efficient MPI on LAPI for IBM RS/6000 SP Systems: Experiences and Performance Evaluation
Authors: Mohammad Banikazemi, Rama Govindaraju, Robert Blackmore, Dhabaleswar K. Panda
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The IBM RS/6000 SP system is one of the most cost-effective commercially available high performance machines. IBM RS/6000 SP systems support the Message Passing Interface standard (MPI) and LAPI. LAPI is a low level, reliable and efficient one sided communication API library, implemented on IBM RS/6000 SP systems. This paper explains how the high performance of the LAPI library has been exploited in order to implement the MPI standard more efficiently than the existing MPI. It describes how to avoid unnecessary data copies at both the sending and receiving sides for such an implementation. The resolution of problems arising from the mismatches between the requirements of the MPI standard and the features of LAPI is discussed. As a result of this exercise, certain enhancements to LAPI are identified to enable an efficient implementation of MPI on LAPI. The performance of the new implementation of MPI is compared with that of the underlying LAPI itself. The latency (in polling and interrupt modes) and bandwidth of our new implementation is compared with that of the native MPI implementation on RS/6000 SP systems. The results indicate that the MPI implementation on LAPI performs comparably or better than the original MPI implementation in most cases. Improvements of up to 17.3% in polling mode latency, 35.8% in interrupt mode latency, and 20.9% in bandwidth are obtained for certain message sizes. The implementation of MPI on top of LAPI also outperforms the native MPI implementation for the NAS Parallel Benchmarks. It should be noted that the implementation of MPI on top of LAPI is not a part of any IBM product and no assumptions should be made regarding its availability as a product.
Class Specification Implementation Graphs and their Application in Regression Testing
Authors: Sami Beydeda, Volker Gruhn
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Most techniques proposed for regression testing are either black- or white-box techniques, i.e. they solely consider either the specification or implementation of a program. However, a combined technique can lead to significant savings in testing costs as some testing tasks need to be carried out once. Furthermore, the same test cases can cover both specification and implementation, reducing the total number of test cases.This paper shows the application of class specification implementation graphs (CSIGs) in regression testing. The distinguishing feature of CSIGs from existing representations is that each method of a class is shown from two perspectives, namely the specification and implementation view. Moreover, a test suite reduction strategy has been incorporated to the CSIG construction algorithm to decrease the total number of test cases required. In this paper, we show how CSIGs can be combined with an existing test case selection algorithm for regression testing.
Classification of Microstructures by Morphological Analysis and Estimation of the Hydration Degree of Cement Paste in Concrete
Authors: Alexandre L. Gonçalves, Roberto de Alencar Lotufo, Franklin César Flores
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Cement is an essential material for the development of the civil construction. The analysis of cement-based materials is useful in the evaluation of mechanical properties, water absorption, air permeability and evolution of hydration degree. The latter is the motivation of this paper. New advantageous techniques of analysis based on the image information are possible using electronic microscopy. We propose here an alternative procedure to the segmentation of microstructures of cement and aggregates in concrete. The central idea consists of a particular use of the morphological operator watershed. We report the results of the analysis of about 450 Scanning Electron Microscope (SEM) images.
The DIAsDEM Framework for Converting Domain-Specific Texts into XML Documents with Data Mining Techniques
Authors: Henner Graubitz, Myra Spiliopoulou, Karsten Winkler
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Modern organizations are accumulating huge volumesof textual documents. To turn archives into valuable know-ledge sources, textual content must become explicit andqueryable. Semantic tagging with markup languages suchas XML satisfies both requirements. We thus introduce theDIAsDEM* framework for extra ting semantics from structural text units (e.g., sentences), assigning XML tags to them and deriving a flat XML DTD for the archive. DIAsDEM focuses on archives characterized by a peculiar terminologyand by an implicit structure such as court filings and company reports. In the knowledge discovery phase, text units are iteratively clustered by similarity of their content. Eachiteration outputs clusters satisfying a set of quality criteria.Text units contained in these clusters are tagged with semi-automatically determined luster labels and XML tags respectively. Additionally, extracted named entities (e.g.,per-sons) serve as attributes of XML tags. We apply the frame-work in a case study on the German Commercial Register.