ppxscal/embedding_network huggingface dataset:
A Performance Modeling Technique for Mesh-Connected Multicomputers
Authors: Byung S. Yoo, Chita R. Das, Jong Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Modeling the performance of space-shared multicomputers is a non-trivial task mainly due to difficulty in modeling the effect of external fragmentation on system performance. Mesh-connected multicomputers are hard to model in particular because of great variance in job sizes. Therefore, researchers have relied on simulation method to evaluate the mesh performance. We propose a novel modeling technique called hybrid method in this paper. The proposed technique utilizes simulation method to estimate the capacity of a system. Then, a queueing model with multiple servers is constructed using the system capacity as the number of servers in the queueing system. The technique is validated through simulation experiments. The results reveal that the hybrid method provides very close estimation of the mesh performance with very little overhead. The proposed technique can also be used for performance modeling of other multicomputers with different topologies.
Analysis of Task Morphologies for Networking Behavioral Skills via Virtual Realit
Authors: Tetsuo Sawaragi, Yukio Horiguchi
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

This paper presents a method for detecting invariant task structures that are commonly shared by the two different actors (i.e., a human performer and a mobile robot), who have different perception-acting capabilities. We call such a property of having common structures as morphology of task structures, and we discuss about how this property functions well for the design of a mobile robot teleoperation system via VR-based (i.e., virtual reality based) interface.
Index Design for Structured Documents Based on Abstraction
Authors: Jyh-Herng Chow, Josephine M. Cheng, Daniel T. Chang, Jane Xu
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

HTML has been the standard format for delivering information on the web. However, automated information processing on these documents for data exchange and interoperability has been difficult. XML, a subset of SGML, has been proposed to be the next standard format that allows user-defined tags for better describing nested document structures and associated semantics. Operations on structured documents, such as searching in nested document structures, require new functions not currently available on most systems today. We describe a general framework for manipulating structured documents based on document abstractions. An abstraction is an approximation of an actual document, while possessing useful properties for analyses of interest. The framework provides a wide design space for tradeoff between cost and capability. This general framework can be applied to index design, document searching, and categorizations.We present this framework by focusing on indexing and searching of structured documents in the XML domain, and prove their soundness. We also address the issues of rich data types in XML documents.
Virtual Studios for TV Productions-Limits and Chances
Authors: Wolfgang Vonolfen
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Virtual Studios as they are used today for professional TV productions can be seen as being just add-ons to state-of-the-art broadcast technology and devices. As a consequence, there are a couple of restrictions concerning different aspects (e.g. positioning and orientation in the studio) that make Virtual Studio productions complicated and expensive. However, they also offer a wide range of new visual effects and new ways for TV shows that often came up while playing with this technology. Further research can help to overcome the problems of the current architecture and thus Virtual Studios can be an important base for steps towards the digital revolution of broadcast business. This article provides a brief overview over the technology being used so far. It highlights its problems and benefits and gives examples of different TV shows that take advantage of the special features of Virtual Studio systems. Finally, it mentions related research areas. 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
Competitive Execution: A Method to Exploit Idle Workstations
Authors: Sung Hyun Cho
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper presents competition protocols to speed up distributed programs on a network of shared workstations in the background by exploiting their wasted computing capacity, without interfering with foreground processes. Competition protocols are transparent operating system facilities that involve creating multiple instances (called clones) p1, p2, etc. of a process P on different processors, and making clones "compete", i.e., attempting to guarantee on a moment-by-moment basis that the output of the clone that is farthest ``ahead'' is fed to the rest of the computation, and that the entire application's performance tracks that of the clone which is farthest ahead. We show that competition protocols speed up distributed programs, especially with smaller granularity. We also show that competition protocols offer more speedup for distributed programs than for sequential programs.
Internet and Intranet Usage in a Communications Infrastructure for Virtual Construction Project Teams
Authors: Chimay J. Anumba, Alistair Duke
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Construction project teams are virtual enterprises which often comprise several disciplines, are usually non-collocated, and collaborate for relatively short periods in the design and construction of facilities. It is important for effective collaboration within such project teams that an appropriate and efficient communications infrastructure is established. This paper is concerned with the usage of Internet and intranet technologies in a collaborative communications infrastructure for construction project teams, within the context of the European project CICC (Collaborative Integrated Communications for Construction). It describes how these technologies have been applied to people and information retrieval, project team communications, progress monitoring and publicity. A pilot project on which the performance of the communications infrastructure is being evaluated is also included.
Mobile Adaptive Applications for Ubiquitous Collaboration in Heterogeneous Environments
Authors: Allan Meng Krebs, Ivan Marsic, Bogdan Dorohonceanu
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Mobile teamwork applications are often deployed in heterogeneous environments with various devices and connections. To support a broad variety of platforms for mobile teamwork in heterogeneous environments, this paper presents a framework for development ofapplications adaptive to the client's computing platform. The framework supports both shared data adaptation and user interface adaptation to user's preferences and display characteristics. Both shared data and the user interface are specified in two XML documents. The user interface XML document specifies the application interface by a generic "view" graph (should also specify the valid data types). Global view graph is transformed into a device-dependant view graph for individual client devices.
Using Multiple Mobile Agents for Distributed Transactions
Authors: Hartmut Vogler, Alejandro P. Buchmann
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Agent systems are well suited for applications requiring great flexibility. In this paper we propose a mechanism that uses multiple mobile agents to implement distributed transactions in a wide area network. Of special interest are applications in which resources change over time. By using multiple, mobile and autonomous agents in our model we are able to monitor resources in a distributed system and to react to changes in a very flexible manner. Each agent is responsible for a single resource and corresponds with the Object Transaction Service (OTS) for the coordination of the global transaction. For the management and the control of the agents we propose X-TRA, our extensible trusted agent system which offers a trust service for agent identification and control with exactly once semantics for agent migration, controlled agent termination, grouping of agents, and a bank service.
Peer-to-Peer for Collaborative Applications
Authors: Gianpaolo Cugola, Gian Pietro Picco
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Peer-to-peer systems recently captured the attention of practitioners and researchers as they provide an attractive alternative to client-server architectures. Peer-to-peer enables the creation of massively distributed networks of data repositories that can be setup and discarded easily according to applicative needs. Nevertheless, the current popularity of these systems is due mostly to their use for file sharing over the Internet.In this paper, we argue that the advantages of a peer-to-peer architecture reach well beyond the realm of Internet file sharing. In particular, they become key in supporting enterprise processes and especially collaborative work involving mobile users. To support ourview, in this paper we report about the design of an architecture and a core communication middleware in the EU project MOTION, where a peer-to-peer architecture is exploited to support collaboration among mobile and geographically distributed users.
A Design and Implementation of Savepoints and Partial Rollbacks Considering Transaction Isolation Levels of SQL2
Authors: Sun Hwan Kim, Mi Suk Jung, Jun Hyun Park, Young Chul Park
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

A partial rollback of a transaction restores the state of the transaction and the database to the state in which they have been right after the savepoint to be rolled back has been established. Contributions of this paper toward the correctness of savepoints and partial rollbacks are the followings.First, a savepoint sequence number is assigned to each savepoint. According to that, without generating any savepoint log record upon establishing savepoints, all the valid savepoints of a transaction can have different savepoint sequence numbers and the order of establishment of each valid savepoint can be discriminated efficiently.Second, the lock request entries of the manual duration are not deleted from the lock table as far as some savepoints which are established after the locks are requested but before the locks are released are valid. That guarantees the correctness of savepoints and partial rollbacks under the circumstances of supporting the four transaction isolation levels of SQL2. Third, the concept of the mini-savepoint that preserves the atomicity of update operations of the SQL level is extended and adopted to triggers and stored procedures. According to that, the atomicity of triggers and stored procedures is supported and the scope of savepoint names is restricted to the internal of the corresponding triggers or stored procedures.
Framework for Role-Based Specification and Evaluation of Awareness Support in Synchronous Collaborative Applications
Authors: Jill Drury, Marian G. Williams
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The contribution of this paper is a framework for specifying and evaluating awareness-related features of synchronous collaborative computing applications. While previous work acknowledges that roles are important to understanding awareness needs, no method has yet been developed to provide a fine-grained, role-based approach to both specifying the awareness-related characteristics of collaborative computing applications and evaluatingwhether the application meets the awareness requirements. We have been developing a means of specifying and evaluating awareness needs in synchronous collaborative systems based on the framework presented in this paper. We feel this framework can be used by other researchers, as well, to develop methods of specifying and evaluating the ability of collaborative applications to support awareness.
Materialized View Maintenance Using Version Numbers
Authors: Tok Wang Ling, Eng Koon Sze
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data sources. In this paper, we define a new compensation algorithm that is used in removing the anomalies, caused by interfering updates at the base relations, of incremental computation for updating the view. Unlike existing methods on view maintenance, our algorithm does not assume that messages from a data source will reach the view maintenance machinery in the same order as they are generated, and we are also able to detect update notification messages that are lost in their transit to the view, which would otherwise cause the view to be updated incorrectly. These are achieved with the use of version numbers that reflect the states of the base relations. Our algorithm also does not require that the system be quiescent before the view can be refreshed.
Load Balancing strategies for Parallel Forward Search Algorithm with Conflict Based Backjumping
Authors: Zineb Habbas, Francine Herrmann, Pierre-Paul Mérel, Daniel Singer
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Constraints Satisfaction Problems (CSP) is a well studied example of the NP-complete family which is usually solved by backtracking search algorithms. Performance comparisons of different algorithms led us to consider FC or FC-CBJ as ones of the best sequential algorithms to solve a great family of CSP's. In this paper, we give an explicit formulation for a generic parallel search algorithm based on typical parallel behaviors, such as load balancing policy. From this paradigm, we exhibit parallel FC-CBJ. The experimental study is up now restricted to the performance of this within the scope of phase transition phenomenon for randomly generated binary CSPs and more particularly in the mushy region where the hardest problems are encountered. We discuss the performances of our algorithm relatively to a server initiated load balancing strategy with four techniques of tree-search splitting and four partner selection policies.
An Effective Boolean Algorithm for Mining Association Rules in Large Databases
Authors: Suh-Ying Wur, Yungho Leu
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

In this paper, we present an effective Boolean algorithm for mining association rules in large databases of sales transactions. Like the Apriori algorithm, the proposed Boolean algorithm mines association rules in two steps. In the first step, logic OR and AND operations are used to compute frequent itemsets. In the second step, logic AND and XOR operations are applied to derive all interesting association rules based on the computed frequent itemsets. By only scanning the database once and avoiding generating candidate itemsets in computing frequent itemsets, the Boolean algorithm gains a significant performance improvement over the Apriori algorithm. We propose two efficient implementations of the Boolean algorithm, the BitStream approach and the Sparse-Matrix approach. Through comprehensive experiments, we show that both the BitStream approach and the Sparse-Martrix approach outperform the Apriori algorithm in all database settings. Especially, the Sparse-Matrix approach shows a very significant performance improvement over the Apriori algorithm.
Experiences with Evaluating System QoS and Channel Performance on Media-On-Demand Systems
Authors: Wonjun Lee, Jaideep Srivastava
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper presen ts the design and implementation of a continuous media file system, which has been implemented in the context of a distributed multimedia application development environment that has been prototyped. To make a performance analysis of file systems and distributed object services for continuous media provisioning, we validate the performance analysis of file system on media-on-demand (MOD) systems against that of a conventional file system through an experimental evaluation.
MultiDisciplinary Design for Uninhabited Air Vehicles
Authors: Max Blair, Steven R. LeClair, Jeffrey V. Zweber, Adel Chemaly
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Contemporary product design and process development is based on an iterative specify-evaluate-revise approach which is often time-intensive and therein non-responsive to customer needs. The engineering of a product incorporates numerous stages, involving conceptual through to detailed design. For small quantities or lot sizes (1-25 parts), the product design and process planning steps account for an inordinate share of the overall development cycle. An integrated geometric, performance analysis and materials processing evaluation environment for concurrent, multidisciplinary design is needed to not only address design-through-production efficiencies and costs but to enable more responsive product development cycles. The environment should enable the user to interactively evaluate alternative designs, not only of individual components or subsystems but combinatorial alternatives varying in materials, performance envelopes and sizing. All of these issues are particularly relevant to a new class of aircraft, an uninhabited air vehicle (UAV), which is unique in terms of its mission and its vehicle life, environmental constraints and components through system reliability and maintainability.
P-Tree: A B-Tree Index for Lists
Authors: Ke Wang, Beng Chin Ooi, Sam Yuan Sung
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set through positioning and nesting elements within the list. Directly supporting such position-related operations will greatly improve the performance of database systems targeting at the above applications. Unlike other attributes, the position will be changed by insertion and deletion within a list and known methods are not appropriate for indexing the position. We present an indexing structure, called the P-tree (where P for position), to index a set of lists. The P-tree generalizes the B-tree by dealing with a set of lists rather than a set of records, while preserving all the properties of the B-tree.
Design and Implementation of a Structured Information Retrieval System for SGML Documents
Authors: Sung-Geun Han, Jeong-Han Son, Jae-Woo Chang, Zong-Cheol Zhoo
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

The SGML has become very popular as the source language of structured documents because its usefulness has already been verified by CALS (Commerce At Light Speed) project. The traditional information retrieval systems (IRSs), however, cannot support retrieval based on the logical structures of SGML documents. In this paper, we design a structured information retrieval system(SIRS) supporting both content-based retrieval and structure-based retrieval and implement our SIRS using the O2 Store storage system with the standard C language under UNIX OS environment. In order to make our SIRS easy to write a user query and to obtain relevant SGML documents to the query, we also implement a WWW-based user interface by using CGI. Finally, we evaluate the performance of our SIRS in terms of insertion time, deletion time, retrieval time, and storage overhead.
Fault tolerant cluster computing through replication
Authors: Kam Hong Shum
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Long-lived parallel applications running on work station clusters are vulnerable to single-node or multiple-node failures. Fault recovery is therefore required to prevent immature program termination. However, much of the runtime overhead imposed by fault tolerance schemes is generally due to the cost of transferring the checkpoint states of applications by disk I/O operations. In this paper, we propose a fault tolerant model in which checkpoint states are transferred between replicated parallel applications. We also describe how the resource consumption of the replicated applications can be minimized. The fault tolerant model has been implemented and tested on a workstation cluster and a Fujitsu AP3000 multi-processor machine. The measurements of our experiments have showed that efficient fault tolerance can be achieved by replicating parallel applications on clusters of computers.
Performance Predictor for HPF Compilers
Authors: Dong-Soo Han, Manpyo Hong
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In HPF programming environment, program behavior needs to be reported for the development of well-tuned application programs. Performance predictor has been regarded as a proper approach for such requirement. In this paper, we propose a performance predictor which includes profiler, static performance predictor and dynamic performance predictor. Profiler generates execution count of each statement by profiling run of the program. While the static performance predictor generates general performance data, dynamic performance predictor reports some advanced performance data such as computation/communication overlapping and performance degradation by cache mis hit. Program slicing technique is applied to profiler and skeleton program is extracted from source program in dynamic performance predictor to speed up prediction time.
Poster on Transparent Access to a Network of Information Sources and Service Providers via a Universal Relation Interface
Authors: Christine Reck
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Summary form only given. We propose the use of the universal relation as a user interface to provide transparent access to a network of distributed, heterogeneous, and autonomous information sources. We implement this interface in two layers. The lower layer consists of access scripts, which encapsulate knowledge about information sources and are capable of answering basic queries. The upper layer uses combinations of these scripts to answer user queries phrased in terms of a universal relation. In this paper we address the problem of defining the semantics of a user query posed against the universal relation and of finding a sequence of access script invocations that gathers the information requested in the query.