ppxscal/embedding_network huggingface dataset:
On deriving data parallel code from a functional program
Authors: Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We discuss a translation methodology for transforming a high level algorithmic specification written in ALPHA to an imperative data parallel language. We informally introduce the ALPHA language with the aid of an example and explain how it is adapted for doing static analysis and transformation. An ALPHA program can be naively compiled (P. Quinton et al., 1985) using applicative caching. Our compilation method makes incremental transformations on the abstract syntax tree of can ALPHA program in order to make efficiency and performance improvements over the naive code and optimize it for a given architecture. The compilation steps described include scheduling, alignment, partitioning, allocation, loop nest generation, and code generation and they are illustrated with an example.
A Case for Exploiting Self-Similarity of Network Traffic in TCP
Authors: Guanghui He, Yuan Gao, Jennifer C. Hou, Kihong Park
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Analytical and empirical studies have shown the self-similar traffic can have detrimental impact on network performance including amplified queuing delay and packet loss ratio. On the flip side, the ubiquity of scale-invariant burstiness observed across diverse networking contexts can be exploited to better design resource control algorithms. In this paper, we explore the issueof exploiting the self-similar characteristics of network traffic in TCP congestion control. We show that the correlation structure present in long-range dependent traffic can be detected on-line and used to predict the future traffic. We then devise a novel scheme, called TCP with traffic prediction (TCP-TP), that exploits the prediction result to infer, in the context of AIMD steady state dynamics, the optimal operational point at which a TCP connection should operate. Through analytical reasoning, we show that the impact of prediction errors on fairness is minimal. We also conduct ns-2 simulation and freeBSD, 4.1-based implementation studies to validate the design and to demonstrate the performance improvement in terms of packet loss ratio and throughput attained by connections.
Predictable Safety in the Control of High Consequence Systems
Authors: John M. Covan, J. Arlin Cooper
Venue: The 3rd IEEE International Symposium on High-Assurance Systems Engineering (1998)

Many industries transmit large amounts of energy under the control of safety critical systems. Inadvertent release of energy by such systems can result in negative high consequences. This paper describes a principle-based strategy for preventing inadvertent release due to normal operational stresses or abnormal (e.g., accident) stresses. The safety principles, developed by Sandia National Laboratories for imbedding detonation safety in nuclear weapons, include isolation, inoperability and incompatibility. These principles will be defined in the paper. They are illustrated and contrasted to conventional practice via the application to a gas furnace control system.
Pushing Semantics Inside Recursion: A General Framework for Semantic Optimization of Recursive Queries
Authors: Laks V. S. Lakshmanan, Rokia Missaoui
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We consider a class of linear query programs and integrity constraints and develop methods for (i) computing the residues and (ii) pushing them inside the recursive programs, minimizing redundant computation and run-time overhead. We also discuss applications of our strategy to intelligent query answering.
Enterprise Workflow Architecture
Authors: Weimin Du, Steve Peterson, Ming-Chien Shan
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Workflow builders are designed to facilitate development of automated processes and support flexible applications that can be updated, enhanced or completely revamped. The Hewlett-Packard WorkManager is an open product data management solution with workflow management capabilities. WorkManager supports the entire product lifecycle by providing a single, logical repository for all data, and it manages and tracks enterprise-wide processes. With a strong information management platform at its core, WorkManager provides central administration capabilities, including supervision and intervention, where necessary. Because enterprise data is usually fragmented and stored in a variety of legacy systems, and different organizations have different amount of control over their data, an enterprise workflow system needs to support processes accessing data from different sites and applications. This paper describes the architecture of distributed workflow, Hewlett-Packard's solution to the enterprise workflow problem. The architecture is an extension of the existing WorkManager architecture. Its development is based on user requirements and four high-level user models. The user models and the architecture are described.
Evaluation of a Method for Reliable Message Transfer Communication in CORBA
Authors: Kouji Iida, Junichi Kikuchi
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

A communication infrastructure for enterprise information systems requires not only interoperability but also high reliability. An effective way to allow for differences in operation time and administrative policies is to provide non-blocking communication interface. In the CORBA 2.0 specification, however, non-blocking communication is not defined as a delivery reliability aspect. The OMG is working on standards for Messaging Service, and has taken up reliability as one QoS property. This does not mean, however, that reliability will always be defined as a function when ORB is implemented. It is therefore important to realize reliability on CORBA at the application level. This paper proposes and implements a communication method whereby the client is not blocked while communicating, and a method for realizing this as an application on CORBA. It then evaluates the implemented system and show the effectiveness of the proposed method for enterprise information systems.
Supporting the Partitioning of Distributed Systems with Function-Class Decomposition
Authors: Jane Cleland-Huang, Carl K. Chang
Venue: 24th International Computer Software and Applications Conference (2000)

Function-Class Decomposition is a hybrid method that integrates structured analysis with an object-oriented approach to decompose a system. The task of class identification is performed in parallel to the decomposition of the system into a hierarchy of functional modules. This hierarchy provides the infrastructure for a systematic approach to partitioning components for distribution and for evaluating key attributes of the resulting architecture. Complexity is reduced by the fact that partitioning decisions are made along the boundaries of previously identified groupings. Early evaluation of the resulting component distribution is also a key factor in mitigating the risks associated with developing distributed applications.
Effects of Multithreading on Data and Workload Distribution for Distributed-Memory Multiprocessors
Authors: Andrew Sohn, Mitsuhisa Sato, Namhoon Yoo, Jean-Luc Gaudiot
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

While data and workload distribution can be tailored to fit a particular problem to a particular distributed-memory architecture, it is often difficult to do so for various practical issues. This report presents our study on multithreading for distributed-memory multiprocessors. Specifically, we investigate the effects of multithreading on data distribution and workload distribution with variable thread granularity. Various types of workload distribution strategies are defined along thread granularity. Three types of data distribution strategies are investigated, including row-wise cyclic, k-way partial-row cyclic, and blocked distribution. We have implemented all of these on the 80-processor EM-4 distributed-memory multiprocessor using highly sequential Gaussian Elimination with Partial Pivoting and highly parallel Matrix Multiplication. Experimental results indicated that multithreading can offset the loss that is due to the mismatch of data distribution to workload distribution for even sequential and irregular problems while giving high absolute performance.
Weighted Hough Transform on a Gridded Image Plane Kazuhide Sugawara
Authors: Kazuhide Sugawara
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Detection of skews in input images is an important preprocess for analyzing document images. We propose a new skew detection method based on vertical as well as horizontal splitting of an image. The center of gravity of the black pixels in each section is used as a sample point for performing the Hough transform, which gives the skew angle of the document image. We extend the Hough transform to incorporate the notion of weight, and apply it to reducing spurious line detection caused by the presence of large non-text areas with many black pixels. The weighting function is defined according to the proportion of black pixels in the area, giving a low weight to an area with an extremely high proportion of black pixels. We conducted skew detection experiments on several document images. By using the Hough transform on connected components, our method works four times faster than the conventional method, and it has no restrictions on the detection range within which skew angles can be detected.
Categorizing Network Traffic in Update-Based Protocols on Scalable Multiprocessors
Authors: Ricardo Bianchini, Thomas J. LeBlanc, Jack E. Veenstra
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper we categorize the coherence traffic in update-based protocols and show that, for most applications, more than 90% of all updates generated by the protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These techniques include dynamic and static hybrid protocols, a data re-mapping strategy, and coalescing write buffers. Our simulations show that these techniques are effective for different types of useless updates. Overall, software caching (where dynamic data re-mapping is performed under programmer or compiler control) has the potential to significantly increase the percentage of useful traffic in applications. When software caching is not applicable, either the static or the dynamic protocol generates the least useless traffic. Although coalescing write buffers provide great reductions in the total number of messages transferred, these buffers do not necessarily increase the percentage of useful traffic.
A Pattern Decomposition (PD) Algorithm for Finding All Frequent Patterns in Large Datasets
Authors: Qinghua Zou, Wesley W. Chu, David Johnson, Henry Chiu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Efficient algorithms to mine frequent patterns are crucial to many tasks in data mining. Since the Apriori algorithm was proposed in 1994, there have been several methods proposed to improve its performance. However, most still adopt its candidate set generation-and-testapproach. We propose a pattern decomposition (PD) algorithm that can significantly reduce the size of the dataset on each pass making it more efficient to mine frequent patterns in a large dataset. The proposed algorithm avoids the costly process of candidate set generation and saves time by reducing dataset. Our empirical evaluation shows that the algorithmoutperforms Apriori by one order of magnitude and is faster than FP-tree. Further, PD is more scalable than both Apriori and FP-tree.
Reject Management in a Handwriting Recognition System
Authors: J. M. Gloger, Alfred Kaltenmeier, Eberhard Mandler, L. Andrews
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The most scientific papers dealing with handwriting recognition systems make statements relating to the recognition performance based on a forced-recognition rate. This rate describes the ratio between the number of the correct recognized samples and the number of all possible samples. For systems applied in real applications this rate is not very relevant. They have to work with a very low error-rate, which can be only achieved by introducing effective reject criteria. So the real interesting thing is a function describing the recognition rate in relation to a specific error rate, including implicitly a corresponding reject rate. This paper presents two approaches how to handle rejects in a hidden Markov based handwriting recognition system. The features to determine a reject are values which are derived from the hidden Markov recognizer. One of the techniques relies on relative frequencies of those values, the other one utilizes standard classification techniques to train a reject decision unit, the reject classifier. Both methods are presented with some noteworthy results.
Agents Paradigm to Solve a Complex Optimization Problem
Authors: Amar Ramdane-Cherif, Nicole Lévy, Hicham Djenildi, Chakib Tadj
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Agents are computational systems interacting with dynamic, and non-entirely predictable environments. They decide for themselves, on the basis of their individual beliefs, goals, etc., how to respond to the environment. An agent is usually motivated to achieve a feasible objective by means of the collaboration of other agents. For example, lifting a heavy table may be impossible without help. However, it can be done by simply asking others for help. The process of gaining collaboration can take many forms. However, some tasks need more detailed communication to generate an explicit mutually acceptable agreement through negotiation. This paper presents a new method to solve the inverse kinematic problem of redundant robot using the agents paradigm. This method guaranties rapid convergence ofthe robot to desired position, with substantially good accuracy. The originality of the proposed approach is its ability to overcome some of the standard problems such as the computation of the inverse or pseudoinverse Jacobian matrix, problem of singularity, redundancy, andconsiderably increased computational complexity, etc.
Architecture and Performance of the Hitachi SR2201 Massively Parallel Processor System
Authors: Hiroaki Fujii, Yoshiko Yasuda, Hideya Akashi, Yasuhiro Inagami, Makoto Koga, Osamu Ishihara, Masamori Kashiyama, Hideo Wada, Tsutomu Sumimoto
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

RISC-based Massively Parallel Processors (MPPs) often show low efficiency in real-world applications because of cache miss penalty, insufficient throughput of the memory system, and poor inter-processor communication performance. Hitachi's SR2201, an MPP scalable up to 2048 processors and 600 GFLOPS peak performance, overcomes these problems by introducing three novel features. First, its processor, the 150 MHz HARP-1E, solves the cache miss penalty by "pseudo vector processing" (PVP). In PVP, data is loaded by prefetching to a special register bank, bypassing the cache. Second, a multi-bank memory architecture that operates like a pipeline eliminates the memory system bottleneck. Third, the inter-processor communication achieves high performance on the three-dimensional crossbar network, using a "remote DMA transfer" protocol and a hardware-based cache coherency. As the result of these improvements, the SR2201 achieved 220.4 GFLOPS with 1024 processors in the LINPACK benchmark, which is almost 72% of the peak performance.
Capturing and automating performance diagnosis: the Poirot approach
Authors: B. Robert Helm, Allen D. Malony, Stephen Fickas
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Performance diagnosis, the process of finding and explaining performance problems, is an important part of parallel programming. Effective performance diagnosis requires that the programmer plan an appropriate method, and manage the experiments required by that method. This paper presents Poirot, an architecture to support performance diagnosis. It explains how the architecture helps automatically, adaptably plan and manage the diagnosis process. The paper evaluates the generality and practicality of Poirot, by reconstructing diagnosis methods found in several published performance tools.
On Computing the Upper Envelope of Segments in Parallel
Authors: Wei Chen, Koichi Wada
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Given a collection of segments in the plane that intersect pairwise at most k times, regarding the segments as opaque barriers, their upper envelope consists of the portions of the segments visible from the infinite upper point. In this paper, we give efficient parallel methods for finding the upper envelope of k-intersecting segments for any positive integer k, in the weakest shared-memory model, the EREW PRAM. We show that the upper envelope of n k-intersecting segments can be found in O(log ^{1+c} n) time using O(a_{k+1} (n)/ log ^c n) processors for any c>0, where a_{k+2} (n) (a_k (n)=O(n), O(nb(n))$, and O(nb(n)^{b(n)^{k-3}}) for k=1, 2, k=3 and k>3, respectively, and b(n) is the extremely slowly growing functional inverse of Ackermann's function) is the size of the upper envelope. In particular, for line segments we show the following optimal algorithms: the upper envelope of n line segments can be found in O(log n) time using O(n) processors, and if the line segments are nonintersecting and sorted, the envelope can be found in O(log n) time using O(n/log n) processors. We also show that our methods imply a fast sequential result: the upper envelope of $n$ sorted line segments can be found in O(nlog log n) time sequentially, which improves the known lowest upper bound O(nlog n).
Interpolation of Scattered Data: Investigating Alternatives for the Modified Shepard Method
Authors: Karen Basso, Paulo Ricardo de Ávila Zingano, Carla Maria Dal Sasso Freitas
Venue: Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (1999)

Many scientific applications use scattered data originated from samples. Interpolation techniques are necessary to estimate the values on non-sampled regions. In a previous work, the Modified Shepard interpolation method was implemented and some unpredictable results occurred. Due to the flexibility of parameter definition for the interpolant generation in this method we decided to investigate solutions for those problems. In this paper we present four versions for the Modified Shepard method, and compare their results through the analysis of the images, processing time and accuracy. Future work for further improvements in the method is also discussed.
Dynamic Grain-Size Adaptation on Object Oriented Parallel Programming The SCOOPP Approach
Authors: João Luís Sobral, Alberto José Proença
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents the SCOOPP (SCalable Object Oriented Parallel Programming) approach to support the design and execution of scalable parallel applications. The SCOOPP programming model aims the portability, dynamic scalability and efficiency of parallel applications. The SCOOPP is an hybrid compile and run-time system, which can perform parallelism extraction, supports explicit parallelism and performs dynamic granularity control at run-time.The mechanism that supports dynamic grain-size adaptation is presented and performance evaluated on two parallel systems. The measured results show the feasibility of the proposed dynamic grain-size adaptation and a scalability improvement of parallel applications over static parallel OO environments, which suggests cost benefits to develop scalable parallel applications to run on multiple platforms
E-Discourses with Zeno
Authors: Angi Voß
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Zeno is an open-source platform for e-discourses. Its key concepts are protected sections with configurable discourse grammars, articles with labels and attachments, and two-way traversable labled links to form threads or even cyclic networks. We show how discourses can be set up and moderated, how readers can choose between different views, and how writers can contribute. Illustrations are taken from a range of application projects.
Privacy-Enabled Services for Enterprises
Authors: Günter Karjoth, Matthias Schunter, Michael Waidner
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The IBM Enterprise Privacy Architecture (EPA) is a methodology for enterprises to provide an enhanced and well-defined level of privacy to their customers. EPA is structured in four building blocks. The privacy regulation analysis identifies and structures the applicable regulations. The management reference model enables an enterprise to define and enforce an enterprise privacy strategy and the resulting privacy practices. The privacy agreement framework is a methodology for privacy-enabling business process re-engineering. It outputs a detailed model of the privacy-relevant players and activities as well as the privacy policies thatgovern these activities. The technical reference architecture defines the technology needed for implementing the identified practices.
Logic extraction based on normalized netlengths
Authors: Hirendu Vaishnav, Massoud Pedram
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

We present a cost function which can be used to minimize the routing contribution of a circuit during logic synthesis. Instead of estimating the absolute routing cost of a net, this function captures the relative routing costs of nets based on the number of terminals on the nets. Unlike the routing cost functions proposed earlier, the proposed cost function does not require layout-parameters or any tuning of the variables to achieve acceptable estimation of the routing cost. The usefulness of the proposed routing cost is verified by minimizing it during the process of logic extraction in logic synthesis, leading to an average of 10% improvement in the routing area and 8% improvement in the chip area at no performance loss.
Reconfiguration and experiments on a faulty hypercube
Authors: Guanghua Lin, Nian-Feng Tzeng
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

It is often desirable to reconfigure a faulty hypercube so as to retain as many fault-free nodes as possible. This inspires us to identify maximal incomplete subcubes in a faulty hypercube, as the subcube so reconfigured is often much larger than a complete subcube obtainable and is likely to retain performance batter. An efficient algorithm is first presented to find incomplete subcubes in a faulty hypercube. To study the actual performance difference on an incomplete system and a complete one, tree applications are then implemented on both systems. Among the three applications, Gaussian elimination takes exactly the same mapping scheme on an incomplete system as on a complete one, while FFT requires some efforts to make it adaptive to the incomplete topology. Our experimental results collected on the Intel iPSC/860 show that an incomplete system may outperform its complete counterpart significantly. The measured results of the three applications indicate that reconfiguring a faulty hypercube into an incomplete subcube is beneficial in practice.