ppxscal/embedding_network huggingface dataset:
Potentials and limitations of parallel computing on a cluster of workstation
Authors: Mounir Hamdi, Yi Pan, Babak Hamidzadeh, F. M. Lim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Parallel computing on clusters of workstations is receiving much attention from the research community. Unfortunately, many aspects of parallel computing over this parallel computing engine is not very well understood. Some of these issues include the workstation architectures, the network protocols, the communication-to-computation ratio, the load balancing strategies, and the data partitioning schemes. The aim of this paper is to assess the strengths and limitations of a cluster of workstations by capturing the effects of the above issues. This has been achieved by evaluating the performance of this computing environment in the execution of a parallel ray tracing application through analytical modeling and extensive experimentation.
A data allocation considering data availability in distributed database systems
Authors: Seong-Jin Park, Doo-Kwon Baik
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In designing distributed databases, data allocation is one of the key design issues. Some advantages of optimal data allocation are reducing cost, increasing performance and availability. However, because of that most of current data allocation techniques have considered only cost and performance, those techniques cannot maintain the availability; and are not proper to the system requiring high-availability. In this paper, we suggested the TCOP (Transaction COmmit Probability) model, which is a new availability model considering multiple path failures occurred during the execution time for distributed transactions. In addition, we proposed a data allocation technique using the genetic algorithms, which can maintain the availability and minimize the processing cost. According to the experimental results, the proposed TCOP model and data allocation technique have shown improvement of the data availability.
An Agent-Based Model of Anonymous Communication Protocols
Authors: Shigeki Kitazawa, Masakazu Soshi, Atsuko Miyaji
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

So far various anonymous communication protocols have been proposed independently and aimed at different situations. As a result, it is hard to understand the essential structures of those protocols and each protocol must be evaluated and implemented independently. To solve these problems, we propose an anonymous communication model that can represent a wide variety of anonymous protocols. In our model, we introduce agents that work in cooperation to realize anonymous communication. This modeling is based on the observation that most of practical anonymous protocols have much commonality in that they have several relay nodes en route from the sender to the receiver to provide anonymity. On our model, such agents' behaviors are expressed in a small set of primitive functions. Using these primitive functions, the essential structures of anonymous communication protocols can be described clearly.
Gradual Clustering Algorithms
Authors: Fei Wu, Georges Gardarin
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: Clustering is one of the important techniques in Data Mining. The objective of clustering is to group objects into clusters such that objects within a cluster are more similar to each other than objects in different clusters. The similarity between two objects is defined by a distance function, e.g., the Euclidean distance, which satisfies the triangular inequality. Distance calculation is computationally very expensive and many algorithms have been proposed so far to solve this problem. This paper considers gradual clustering problem. From practice, we noticed that user often begin clustering on a small number of attributes, e.g., two. If the result is partially satisfying, user will continue clustering on a higher number of attributes, e.g., ten. We refer to this problem as gradual clustering problem. In fact gradual clustering can be considered as vertically incremental clustering. Approaches are proposed to solve this problem. The main idea is to reduce the number of distance calculations by using the triangle inequality. Our method first stores in an index the distances between a representative object and objects in n-dimensional space. Then these pre-computed distances are used to avoid distance calculations in (n+m)-dimensional space. Two experiments on real data sets demonstrate the added value of our approaches. The implemented algorithms are based on DBSCAN algorithm with an associated M-Tree as index tree. However the principles of our idea can well be integrated with other tree structures such as MVP-Tree, R*-Tree, etc., and with other clustering algorithms.
An Algorithmic Framework for Parallelizing Vision Computations on Distributed-Memory Machines
Authors: Yongwha Chung
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

With advances in processor and networking technologies, current distributed-memory machines can achieve hundreds of Giga Floating-Point Operations Per Second (GFLOPS) of performance. By using such machines, many application problems having regularly structured computations have been successfully parallelized using the explicit message passing paradigm. However, it is difficult to parallelize vision problems having irregularly structured computations. Parallel solutions to these problems are characterized by uneven distribution of symbolic features among the processors, unbalanced workload, and irregular inter-processor data dependency caused by the input image. It is therefore necessary to develop efficient algorithmic techniques to achieve large speed-ups.In this paper, we propose an algorithmic framework to design efficient and portable parallel algorithms for irregular vision problems on distributed-memory machines. Based on this algorithmic framework, we develop techniques for task scheduling, load balancing, and overlapping communication with computation. 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
Distributed network computing over wireless links
Authors: Janche Sang, Chien-Hua M. Lin, Shalini Varadaraja, Mu-Cheng Wang
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

With the advances of wireless communication technology, using the wireless LAN as a platform to perform distributed network computing becomes feasible. We study the characteristics of end-to-end communication over wireless links. With the advantage of reduced bandwidth competition in each LAN segment separated by the wireless bridges, and with the overlap of wireless and wired communications, an analytical comparison showed that the group communications over wireless links can be more efficient than over a single segment wired LAN. We conducted experiments of running distributed applications and the results showed that with the support of threads, wireless network computing can achieve the same performance as the wired networks. Furthermore, the statistical results from our survey showed that the users cannot tell the difference between wireless and wired settings in terms of the data access speed.
A parallel Cholesky factorization routine with a new version of PB-BLAS
Authors: Jaeyoung Choi, Sung-Hoon Moon
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

PB-BLAS (Parallel Block Basic linear Algebra Subprograms) is the first parallel implementation of BLAS, whose data are decomposed based on a block cyclic data distribution. It is functionally an extended subset of the Level 2 and 3 BLAS for distributed-memory systems. The authors present a new modified version of PB-BLAS, which eliminated the positional restrictions of the data matrices from the old version. And it is more efficient in memory space management as well as in performance for PB-BLAS routines which handle a triangular, symmetric, or Hermitian matrix. The paper outlines PB-BLAS and ScaLAPACK, which is a library of high performance linear algebra routines for distributed-memory computers. And it describes a parallel Cholesky factorization routine, and shows the performance with the old and the new version of PB-BLAS on the Intel Paragon computer.
Materialized View Evolution Support in Data Warehouse Environment
Authors: Chuan Zhang, Jian Yang
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

As a sufficiently abstract level, the data in the data warehouse can be seen as a set of materialized views, where the base data resides at the information sources. These materialized views are designed based on the users requirements (e.g., frequently asked queries). However Data Warehouse is a dynamic environment, i.e., when user query requirement changes, the existing materialized views should evolve to meet the new requirement. These changes will demand schema changes at the warehouse and should be handled with as little disruption or modification to other components of the warehousing system as possible.In this paper, we proposed a framework to determine if the existing materialized views will be affected by the requirement changes, and how they are affected. Algorithms are proposed to deal with the situation when a new query is added in. The aim of the algorithms are to efficiently get the new materialized views by analysing the relationships among queries using MVPP (a specification for query processing plan).
Minimizing Broadcast Costs under Edge Reductions in Tree Networks
Authors: Susanne E. Hambrusch, Hyeong-Seok Lim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

We study the broadcasting of messages in the single-port, blocking communication model under edge reductions. Edge reductions model the decrease or elimination of broadcast costs on edges. Let T be an n-vertex tree and B be a target broadcast cost. We present an O(n) time algorithm for determining which edges to reduce (i.e., assign cost 0) such that the number of reduced edges is a minimum and a broadcast initiated at a vertex in a determined center set costs at most B. We present an O(n \log n) time algorithm to minimize the cost of a broadcast initiated at an arbitrary vertex.
Switchboard: Secure, Monitored Connections for Client-Server Communication
Authors: Eric Freudenthal, Lawrence Port, Tracy Pesin, Edward Keenan
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Prolonged secure communication requires trust relationships that extend throughout a connection's life cycle. Current tools to establish secure connections such as SSL/TLS and SSH authenticate PKI identities, validate credentials and authorize a trust relationship at the time a connection is established, but do not monitor the trust relationship there-after.To maintain security over the duration of a prolonged connection, we extend the semantics of SSL to support continuous monitoring of a credential's liveness and the trustrelationships that authorize it. Our implementation isolates trust management into a pluggable trust authorization module. We also present an initial design for a host-level securecommunication resource that provides secure channels for multiple connections.
Workshop Report on Integrating XML Distributed Object Technologies
Authors: V. Jagannathan, M. Fuchs
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The Internet world is being transformed before our eyes as open standards such as XML are being rapidly adopted. XML technologies are viewed as harbingers of new functionality in numerous domains ranging from electronic commerce to electronic publishing to healthcare delivery to manufacturing to insurance. Various object-oriented technologies and standards such as Java, CORBA and DCOM have also progressed rapidly in the past few years. At this time, the industry and academia are seriously looking at the intersection of these technologies and what it means to the future of the object-web paradigm. This workshop aims to bring together participants who are seriously investigating the combined use of these technologies to support practical application needs in a variety of domains. The goal of this workshop is to investigate how XML and Distributed Object technologies such as Java, CORBA and DCOM can be integrated, leveraging the strengths each have to offer.
Process-Centered Environments for Web-Based Instructional Modules
Authors: Hany H. Ammar, AbdulMobeen Mohammad, Osama Abdalla, S. Kankanahalli
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Given the substantial development effort internationally to extend the Web as the basic interface for distributed information systems, it is appropriate to adopt the Web technologies as the primary user interface and primary server interface for computer-delivered educational modules. The Web interface gives, a coherent and standard framework for integration of visual, audio, and text information, and for moving among elements of the educational module (local or remote). The process of developing Web-based educational modules for distance learning, often requires significant investment of time and efforts. This is sometimes hampered by a lack of resources and tools to support embedding of graphics, voice, and video clips. This paper surveys the current state of the art of Web-based instruction and presents a process model for a process-centered environment for generating Web-based course lectures. The tools surveyed include ClassNet, a tool developed at Iowa State University for managing Internet class activities, and WebCT, a tool developed at the University of British Colombia which facilitates the creation of integrated Web-base educational environments.
Towards Dynamic Configuration of Distributed Applications
Authors: Mireille Blay-Fornarino, Anne-Marie Pinna-Dery, Michel Riveill
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Configuring distributed applications at deployment time requires the introduction of high-level features such as transaction and synchronization into application's code. Component models like CORBA Component Model (CCM) or Enterprise Java Beans (EJB) allow programmers to declare in deployment descriptors which services have to be plugged into components. However, these approaches do not allow a dynamic integration of new services. In this paper,we propose a reflexive approach allowing service integration into component at runtime. When a new service is added to a component, the combination with existing services is managed dynamically by the platform.
Intelligent Agent in Electronic Commerce-XMLFinder
Authors: Yanping Ma, Esma Aïmeur
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

E-commerce is a rapidly growing area on the Internet. There are various types of online shopping sites that help consumers find products to purchase. The intelligent agent is among the most promising technologies in recommender systems and CBR (case-based reasoning) is a highly effective mechanism for developing intelligent agents. We introduce an intelligent agent based on CBR that we developed-XMLFinder-which recommends products to users. In this paper, we describe its three-tier architecture, in which XML documents take a key role in each tier, and a methodology that combines the long-term and short-term user profiles to adjust the weights according to user preferences. In this manner, it allows the efficient determination of products that meet the user's requirements.
Forward-Secure Commercial Key Escrow Systems
Authors: Jeeyeon Kim, Seungjoo Kim, Hyunjo Kwon, Sungjae Lee, Sangjoon Park, Dongho Won
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Key escrow system has been studied widely in recent years to reduce the gab between the needs for individual privacy and the needs for public security. In this paper, we survey three popular key escrow products of Netscape's, VeriSign's and Entrust's. And we also propose forward-secure KESs (Key Escrow Systems) and analyze their security.
Run-time parallelization for partially parallel loops
Authors: Chao-Tung Yang, Shian-Shyong Tseng, Shih-Hung Kao, Ming-Hui Hsieh, Mon-Fong Jiang
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper, a run-time technique based on inspector-executor scheme is proposed to find available parallelism on loops in this paper. Our inspector can determine the wavefronts by building a DEF-USE table. Additionally, the process of inspector for finding the wavefronts, can be parallelized fully without any synchronization. Our executor can perform the loop iterations concurrently. For each wavefront in a loop, the auto-adapted function is used to get a tailored thread number rather than using fixed thread number for execution. Experimental results show that our new parallel inspector can handle complex data dependency patterns and reduce itself execution time obviously. Besides, the new partitioning strategy for executor can also improve the performance of run-time parallelization obviously.
Superphony: Towards Ubiquitous Audio Communication Services
Authors: Marc Lacoste, Patrick Paniez, Aimé Vareille
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

With the expansion of mobility in communication technologies, the increasing individual audio solicitations require a definition of priorities in audio information. A new concept called superphony is identified which improves communication abilities by reconstructing an audio sphere around each user and filtering audio information based on user and environment profiles. Requirements and elements for an architecture are presented. Guaranteeing real-timeaudio stream management based on profiles in mobile contexts, without compromising security, are key issues. Several potential applications are also discussed.
Using Aspect Oriented Programming to Build a Portable Load Balancing Service
Authors: Erik Putrycz, Guy Bernard
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Scaling applications to large networks and an increasing number of users has been since years a technical challenge. Today, technologies are well known to scale applications to local networks but scaling to large networks with high latency is still a challenge.DLBS (Dynamic Load Balancing Service) brings new solutions regarding large scale load balancing for middleware based applications. DLBS offers a multi-criteria and easily customizable load balancing service. It consists of a scalable monitoring infrastructure, a connection manager (integrated into the middleware) and customizable load balancing strategies.Implementation of a low level service requires in order to stay efficient to avoid the necessity for high overhead. DLBS aims to be a generic load balancing service and an easy and efficient portability with a CORBA Object Request Broker has been possible thanks to Aspect Oriented Programming.
Concept as Knowledge Handles in Collaborative Document Management
Authors: Angi Voß, Keiichi Nakata, Marcus Juhnke
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

With the increasing availability of electronic documents, it is essential that people can navigate through document spaces for information effectively through an index, in a collaborative manner. In this paper, we describe a system that supports the collaborative construction of indexes of concepts rather than terms. In a concept index, a concept can be described by more than one term, phrase, arbitrary text piece, and other concepts. These concepts can be structured and associated with one another without strict restrictions.Software agents work in the background to find occurrences of concepts in a document collection, enabling users to navigate documents based on concepts. Users can extract concepts by simply highlighting pieces of text while browsing documents. Through collaborative index construction, a user benefits from contributions of other users, and the system enables a group of users to collaboratively manage information.
Stability of Autonomous Decentralized Flow Control Schemes in High-Speed Networks
Authors: Masaki Aida, Chisa Takano
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper focuses on flow control in high-speed networks. Each node in the networks handles its local traffic flow only on the basis of the information it knows, but it is preferable that the decision-making of each node leads to high performance of the whole network. To this end, we investigated the behavior of packet flow when a node is congested, and show an appropriate flow control model through simulation results.
Secure Mobile IP using IP Security Primitives
Authors: Atsushi Inoue, Masahiro Ishiyama, Atsushi Fukumoto, Toshio Okamoto
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

As the commercial use of the Internet becomes common and the demand for mobile computing through the Internet is emerging, it is necessary to construct a secure mobile environment. This paper presents an implementation example of such a system which employs a secure mobile IP protocol on stationary security gateways and mobile hosts. The IETF standard Mobile IP protocol is modified with IP security primatives, which control the packet flow from a mobile host through multiple security gateways. Using IP security primitives, the packet going into a corporate network and the packet going out the visiting network are both securely processed. This IP security based packet control allows transparent mobile access from anywhere on an IP network even with sufficient security support by encrypting and authenticating IP packets. The current implementation status and the performance evaluation is also reported.
PFTPD: An FTP Proxy System to Assure the Freshness of Files
Authors: Junichi Funasaka, Masato Bito, Kenji Ishida
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

As a lot of softwares are developed and distributed via the Internet, the number of accesses to the file servers, such as ftp servers or WWWservers, is increasing. To reduce the concentrated accesses to the original file server, the mirror servers which have the same directories and files as what the original server stores have been introduced. However, the inconsistency among the mirror servers and the original server is often observed because of the transferring latency, traffic congestion on the network, and management policy of the mirror servers. Hence, we develop an intermediate ftp proxy server system PFTPD (Proxy FTP Daemon) which guarantees the freshness of the files as well as the dispersal of the accesses concentrated to the original ftp server. We found out that the proposed system can dispersethe accesses to the mirror servers with a little overhead. This technology can assure files to be the latest version and adapt to the heterogeneous network environment such as the Internet.