By Topic

Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000

Date 4-7 July 2000

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings Seventh International Conference on Parallel and Distributed Systems: Workshops

    Publication Year: 2000
    Save to Project icon | Request Permissions | PDF file iconPDF (457 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2000 , Page(s): 561 - 563
    Save to Project icon | Request Permissions | PDF file iconPDF (160 KB)  
    Freely Available from IEEE
  • Fault tolerant shared-object management system with dynamic replication control strategy

    Publication Year: 2000 , Page(s): 524 - 529
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (500 KB)  

    This paper is based on a dynamic replication control strategy for minimizing communications costs. In dynamic environments where the access pattern to share resources cannot be predicted statically, it is required to monitor such parameter during the whole lifetime of the system so as to adapt it to new requirements. The shared-object management system is implemented in a centralized manner in which a master processor deals with the serialization of invocations. On one hand, we attempt to provide fault tolerance as a way to adjust the system parameters to work only with a set of correct processors so as to enhance system functionality. On the other hand, we attempt to furnish availability by masking the failure of the master processor. A new master processor is elected that resumes the master processor processing. Our shared-object management system modularity is realized through a meta level implementation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based system for electronic commerce using recipes

    Publication Year: 2000 , Page(s): 399 - 405
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (384 KB)  

    The paper proposes an agent-based system, called SAGE:Francis, to search a commodity or sets of commodities for electronic commerce. This system has the following functions: (1) seamlessly integrating information about commodities distributed over networks by conversational agents; (2) searching for a commodity required by compound conditions; and (3) creating a menu for a search for sets of commodities from legacy knowledge such as cooking recipes. The paper describes the system configuration, interface between agents, and experimental results. As a result, SAGE:Francis successfully supports users when searching for sets of commodities by recipe-based menus and integrated information about commodities stored in databases over networks by conversational agents View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Influence of the dynamic page aggregation on the speedup of Nautilus DSM system

    Publication Year: 2000 , Page(s): 530 - 535
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (508 KB)  

    This paper introduces the dynamic aggregation of pages in Nautilus, which main features are: lock-based scope consistency, multithreaded and page-based DSM system. The dynamic aggregation consists in considering a larger granularity's unit than a page, in a page-based DSM system. The first results show that this technique can improve the Nautilus's speedup up to 29%. The benchmarks evaluated in this study are SOR (from Rice University), LU and Water N-Squared (both from SPLASH-2) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed auction servers resolving winner and winning bid without revealing privacy of bids

    Publication Year: 2000 , Page(s): 307 - 312
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (528 KB)  

    We have developed an electronic auction system with a set of distributed servers that collaborate to resolve a winning bid without revealing the secrecy of bids. This paper describes the system architecture and shows the performance in terms of the round complexity and the bandwidth consumption for a message. Based on the actual measurements, the upper bound of number of bidding prices is identified. In addition, by adding some steps to the basic auction protocol in Kikuchi, Harkavy, and Tygar, 1998, we improve the security of protocol so that the second highest bid must not be known even by the winner View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretic framework of network feedback control with long delays

    Publication Year: 2000 , Page(s): 275 - 280
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (360 KB)  

    It is well known that feedback control may be difficult in a network with long propagation delays (with large bandwidth-delay products). The focus of this article is to provide a theoretical framework of various feedback-based congestion control techniques. Two broad classes of control algorithms are presented: source- and switch (network)-intelligence models. In a source-intelligence model, traffic sources adjust their transmission rates according to congestion information provided by the network. Theoretical models based on queueing theory and delay differential equations are presented. In a network-intelligence model, network switches evaluate appropriate transmission rates of sources. It is believed that any reactive control in a network with long delays is not effective. A control theoretic framework is presented, which attempts to exercise a degree of prediction of traffic patterns in the near future. Algorithms predicting the future input rates and the topological distribution of sources are presented. Finally, a unified approach combining both source- and network-intelligence models may be of interest for further study View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS-based recovery of multimedia objects

    Publication Year: 2000 , Page(s): 43 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (476 KB)  

    Distributed applications such as teleconferencing using high-speed networks are realized by using multiple multimedia objects. It is critical to discuss how a multimedia object supports quality of service (QoS) required by applications in the presence of object faults. We newly define global states of objects, which are consistent with respect to QoS supported by objects. Based on the QoS-based consistency, we discuss the recovery of objects from some states which do not satisfy QoS View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on a road-vehicle communication system for the future intelligent transport systems

    Publication Year: 2000 , Page(s): 343 - 348
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (620 KB)  

    This paper presents an example of a future intelligent transport system (ITS) and the results of the examination of the system configuration. It proposes a road-vehicle communication system for the future ITS. As an evaluation of the proposed system, propagation characteristics of the radio link using 45 GHz band millimeter-wave are examined, such as the vehicular interval for the line-of-sight communication, the received power level at the mobile station in adopting the transmitting power control and the diversity and attenuation caused by rain, which will clarify the feasibility of this system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining WWW user agents from server access log

    Publication Year: 2000 , Page(s): 173 - 178
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (532 KB)  

    It is a common practice to analyze an access log of an WWW server to obtain data, such as user agent vendor percentage, supplying information more suitably, or to measure information exposure rate (mainly for advertisement effectiveness). HTTP does have an “User-Agent” header to let user agents supply their product names for these kinds of use, but in fact relying solely on this tends to be inaccurate. This paper presents some considerations needed for log analysis to determine the user agent in a more precise way, and application to an actual access log resulted in 2 percent difference compared to conventional method View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural language programming for multimedia information

    Publication Year: 2000 , Page(s): 167 - 172
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (376 KB)  

    Learning a programming language is difficult for the beginner of the computer. Therefore, it is necessary to build an intelligent programming environment in which the program can be written directly in the grammar of one's mother tongue. In this paper, we propose a model of an intelligent programming environment that is oriented to the Japanese. In this model, the text that describes in Japanese the layout of multimedia contents and the relationship between two multimedia contents can be parsed with the technology of machine translation translated into an executable program, and executed. As an application of the proposed model, an environment called ACORNS is implemented. The performance study of ACORNS is performed. The results of the performance study shows that the proposed model is robust View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance comparison between TCP Reno and TCP Vegas

    Publication Year: 2000 , Page(s): 61 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (508 KB)  

    Following the development of TCP Vegas, the performance comparison between TCP Reno and TCP Vegas has not been discussed thoroughly. The discussion of the revised TCP version, TCP Vegas, remains insufficient to decide whether or not to use it. This paper attempts to compare the performance, throughput and fairness, of Reno and Vegas in the network environments with homogeneous and heterogeneous versions of TCP. Results in this study indicate that while TCP Vegas obtains better throughput and fairness in homogeneous cases, it fails to outperform Reno in heterogeneous cases. This phenomenon prevents users from adopting TCP Vegas despite its better performance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study on participatory redesign of web site with scenario-based techniques

    Publication Year: 2000 , Page(s): 161 - 166
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (412 KB)  

    Participatory design has been used to bring user requirements into design of interactive multimedia systems. The case study of participatory design, discussed in this paper, employs scenario-based techniques for redesigning a Web site of Computer Science Department. It reveals that scenarios can encourage real users to participate in redesign activities and to identify usability problems on Web sites, yet they may feel that scenario writing process becomes an effort. This paper discusses some issues on conducting scenario-based participatory redesign of Web sites also View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of vortical flow using multiple slices

    Publication Year: 2000 , Page(s): 201 - 204
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (336 KB)  

    In the present paper, a new technique is proposed for visualizing a vortical flow field using multiple texture-mapped slices. First, the vortex centers are identified by finding and classifying critical points in the flow field. Then the flow field is projected onto the slicing planes which pass through the critical points and are perpendicular to the vortex axes. Finally, the projected flow fields are visualized intuitively by advecting tracers located around the critical points. The resulting images are mapped to rectangles having transparent attributes in a VRML format. The proposed technique is applied to various flow fields and the effectiveness of this technique is confirmed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multimedia training environment that assists users to study jewel programs

    Publication Year: 2000 , Page(s): 137 - 142
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (764 KB)  

    Jewel programs are invaluable assets for human beings. Thoroughly studying these programs will dramatically promote one's understanding and skills. This kind of knowledge promotion has many implications. It will not only improve one's programming skill, but also will strengthen the capabilities of one's imagination and creativity. However tens of thousands of lines of source code are rather tedious and time consuming to study. We need a good instructor to guide us to study efficiently and effectively. However, a twenty-four hour instructor is hard to find. In this paper, a multimedia jewel program training environment is introduced. This environment provides functions for both content designing and jewel program learning. Within this system, a jewel program instructor can edit the jewel program into incremented versions. Associated with each version, multimedia explanation will be added. Via carefully designed versions, learners can study jewel programs very efficiently View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new model of exploiting loop parallelization using knowledge-based techniques

    Publication Year: 2000 , Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (592 KB)  

    We concentrate on three fundamental phases, data dependence testing, parallel loop transformation, and parallel loop scheduling, for loop parallelization in parallelizing compilers, running on multiprocessor systems. A new model of exploiting loop parallelization by using knowledge-based techniques is first proposed. The knowledge-based approach integrates existing data dependence tests, loop transformations and loop schedules, to make good use of their abilities for extracting more parallelism. Three rule-based systems, called the K-Test, IPLS and KPLT, are then developed by repertory grid analysis and an attribute ordering table to construct the knowledge base, respectively. These systems can choose an appropriate test, transform and schedule, then apply the resulting methods to perform loop parallelization and gain a high speedup rate. For example, the KPLT can choose the appropriate loop transformations to reorder the execution of statements and loop iterations for parallelization. Unlike the previous researches that must use the one-pass approach, we introduce the idea of multipass which may explore more parallelism of loops. Experimental results show that our new model can achieve higher speedup on parallelizing compilers. Furthermore, for system maintenance and extensibility, our approach is obviously superior to others View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual simulation of crack pattern based on 3D surface cellular automaton

    Publication Year: 2000 , Page(s): 181 - 186
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (688 KB)  

    This article describes a method for modeling the propagation of cracks on any 3D surface. Taking a previous cellular automata model as basis, this method allows any type of cracks on any type of triangulated 3D object. Our model's main advantage is that it proposes a semi-physical solution, making it at the same time user controllable and easily extensible. After summarizing works in the literature, we make a brief and simple description of what physically are cracks and how they are generated. Based on this idea, we detail our model of crack propagation. We first introduce the general development of cracks. We then propose our original model of spectrum stress. This is followed by the description of the mutual interaction between cracks and stresses. Finally, a set of graphical examples, with their respective parameters, concludes this paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible Network Layer in dynamic networking architecture

    Publication Year: 2000 , Page(s): 473 - 478
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (660 KB)  

    The authors propose an architecture of global communication networks with dynamic functions based on the concept of Flexible Network. The dynamic function enhances the capability of communication networks to deal with various changes detected in both human users and networked environment. In our architecture, a new Flexible Network Layer is introduced between the application layer and the IP network layer of the global communication networks. To elaborate the functions of the Flexible Network Layer, we demonstrate an agent based model of the Flexible Network Layer for a multimedia communication application and discuss the properties of the proposed architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational Petri nets with start/stop place

    Publication Year: 2000 , Page(s): 509 - 514
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (444 KB)  

    We have adapted Petri nets and functional dependencies amongst objects in parallel rule languages. After this adaptation, the yielded Petri net-we will call it Relational Petri Nets (RPNs) with Start/Stop Place-is analysed in this paper. Liveness, reversibility, no conservation and boundedness in practice, consistency, strongly connected of this kind of net have been specified in this work. The properties of transitions are also analysed in this work View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A totally ordered and secure multicast protocol for distributed virtual environment

    Publication Year: 2000 , Page(s): 55 - 60
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB)  

    Sharing a virtual space with many users, a distributed virtual reality environment (DVE) provides high level communication and cooperative design facilities. For a large-scale DVE in a wide area network, a reliable and efficient multicast protocol on the Internet is necessary. We have developed a reliable multicast protocol based on the sequence server and evaluated it using simulation. From the simulation result, our protocol is more scalable than RMP (reliable multicast protocol). However, the protocol has an obvious drawback in that the ordering cost is centralized to the sequence server. Therefore, the scalability and extensibility is limited. Furthermore, security support is not provided. It is an important factor for reality of the DVE system. We propose a method to distribute the workload to some servers to make the protocol scalable and extensile. From our simulation result, the message arrival time to members is drastically reduced. We also propose a key distribution mechanism for secure multicast communication View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traditional Japanese crafting presentation system based on VR and Kansei information processing techniques

    Publication Year: 2000 , Page(s): 225 - 230
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (500 KB)  

    Technical evolution of traditional crafting industries by multimedia and network technologies performs very important role to survive in modern industrialization in the world. In this paper we propose a three-dimensional CG presentation system using Kansei information processing and Virtual Reality technologies. A large number of data concerned with traditional Japanese fittings are stored in the database distributed over Internet. User can easily retrieve the desired fittings according to his/her Kansei and design not only the traditional Japanese interior but also combine those with western interior to build creative and original houses, hotels and other buildings. We built a prototype system in which user can also walk through the designed virtual space as a Japanese room organized by Japanese traditional fitting in. Taturu-Hama-Cho and interactively change those fittings by the selected ones based on his Kansei from the distributed databases over Internet. As a result, we could verified the usefulness of our suggested system not only for Japanese crafting presentation fields but also for worldwide design industries View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Open distributed autonomous multi-agent coordination on the Web

    Publication Year: 2000 , Page(s): 461 - 466
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (568 KB)  

    Agent technology is becoming more prevalent as the availability of network access, and the demand for the end uses of agents becomes greater. Intelligent agents for information filtering and retrieval applications and tools are being employed in a variety of ways on the Web. A centralized agent for information discovery has usually limited capabilities for finding diverse and distributed information online. The main thrust of the paper is to present a framework that allows distributed adaptive information KODAMA agents to work together to browse and retrieve distributed information based on the preexisting hyperlink structure on the Web and how this community of agents can automatically extract meta-information and cooperate to retrieve online distributed relevant information. We have developed the software architecture, and a working prototype showing the benefits to the Web of interactive architectures based on the coordination of the hyperlink structure on the network. The authors summarize the current results of the project, and discuss some ideas on future work View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the parallel performance of IQMR method for unsymmetric large and sparse linear systems

    Publication Year: 2000 , Page(s): 539 - 546
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (632 KB)  

    For the solutions of linear systems of equations with unsymmetric coefficient matrices, we have proposed an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. In this paper, we mainly present the qualitative analysis of the parallel performance with Store-and-Forward routing and Cut-Through routing schemes and topologies such as ring, mesh, hypercube and balanced binary tree. Theoretically it is shown that the hypercube topology can give us the best parallel performance with regards to parallel efficiency, speed-up, and runtime, respectively. We also study theoretical aspects of the overlapping effect in the algorithm. Some timing results are shown to verify the theoretical studies View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proposal on FlexibleCUG service architecture

    Publication Year: 2000 , Page(s): 315 - 320
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (504 KB)  

    VPN provides logical and secure communication groups independent of physical network configurations. When network users request to construct a VPN path, a network administrator has to check the consistency between the user request and the organization's security policy and to manually change the configurations of VPN equipment. In this paper we propose a FlexCUG (Flexible Closed User Group) service architecture which provides secure communication groups without any configuration by network administrators. This architecture is based on a three-layer model, in which network users can generate FlexCUG in accordance with the organization's security policy. As a result, this architecture achieves higher usability of VPN while complying with the organization's security policy View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAC level access protocol for continuous media applications on hybrid-fiber-coax (HFC) networks

    Publication Year: 2000 , Page(s): 421 - 426
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (620 KB)  

    In this paper, admission control issue is considered in the MAC level access protocol design for supporting the continuous media applications on HFC network. We treat service admission requests and interactive requests the different priority level requests. And the number of contention minislots of upstream channel for these two priority levels are not fixed. The headend checks the system resources and dynamically allocate the contention minislots for the service admission requests. For example, if there are not enough system resource to admit a new service request, the contention minislots for the service admission requests will be decreased and more contention minislots will be allocated to the interactive requests. A set of simulation scenarios is presented to show that the proposed scheme is suitable for continuous media applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.