By Topic

Proceedings of 1996 International Conference on Parallel and Distributed Systems

3-6 June 1996

Filter Results

Displaying Results 1 - 25 of 71
  • Proceedings of 1996 International Conference on Parallel and Distributed Systems

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (543 KB)
    Freely Available from IEEE
  • A distributable algorithm for optimizing mesh partitions

    Publication Year: 1996, Page(s):544 - 549
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB)

    Much effort has been directed towards developing mesh partitioning strategies to distribute a finite element mesh among the processors of a distributed memory parallel computer. The distribution of the mesh requires a partitioning strategy. This partitioning strategy should be designed such that the computational load is balanced and the communication is minimized. Unfortunately, many of the exist... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (112 KB)
    Freely Available from IEEE
  • Support of cooperating and distributed business processes

    Publication Year: 1996, Page(s):22 - 31
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Workflow management systems/business process management systems (BPMS) provide for an integral support of computer-based information processing, personal activities, business procedures and their relationships to organizational structures. They support the modeling and analysis of so-called business processes and offer means for the application-near design and implementation of computer-based busi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified media presentation method for multimedia information networks

    Publication Year: 1996, Page(s):16 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Hypermedia systems are very important as platforms in the future multimedia information network services. In order to provide more flexible and sophisticated multimedia presentation, it is desirable to simply and efficiently transmit various media data from the databases distributed over network and present them on the user station depending on scenario so as to semantically integrate into multime... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Info-Plaza: A social information filtering system for the World-Wide Web

    Publication Year: 1996, Page(s):10 - 15
    Cited by:  Patents (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    We have prototyped a social information filtering system based on personal interests. The system is called Info-Plaza and is accessed via the World-Wide Web. Info-Plaza helps people to get new URLs which likely point to interesting web pages. Info-Plaza is a client-server system, which consists of XPlaza and Plaza-Server. XPlaza is a GUI-editor to create and arrange URL-Maps. The URL-Maps are used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization model for multimedia communication and presentation in distributed systems

    Publication Year: 1996, Page(s):122 - 128
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The integration of time dependent media in applications requires the synchronization of media streams. The problem of synchronization is more important if we consider multimedia data presented in distributed systems. The specification of synchronization is supported by the synchronization editor, the creation and the transport of synchronization objects are managed by the synchronization coordinat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed connection manager interface for web services on IBM SP systems

    Publication Year: 1996, Page(s):2 - 9
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    In essence, the World Wide Web is a worldwide string of computer databases using a common information retrieval architecture. With the increasing popularity of the World Wide Web, more and more functions have been added to retrieve not only documents written in HTML (Hypertext Markup Language), but also those in other forms through the Common Gateway Interface (CGI), by constructing HTML documents... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of MAP: A system for mobile assistant programming

    Publication Year: 1996, Page(s):116 - 121
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    We have define a network programming model called Mobile Assistant Programming (MAP) for development and execution of communication applications in large scale networks of heterogeneous computers. MAP assistants are high-level interpreted programs that can move between nodes, create clones and report results. Their execution is asynchronous and persistent to take into account client disconnections... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for implementation of first-order multiparty interactions

    Publication Year: 1996, Page(s):537 - 543
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    First-order multiparty interactions, a generation of multiparty synchronization, are a powerful communication mechanism that allows a set of processes to enroll into different roles of an interaction and to execute the interaction in a synchronous way, and guarantees conflict interactions to be executed exclusively. It is not a trivial problem to implement first-order multiparty interactions in a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting the locality of data structures in multithreaded architecture

    Publication Year: 1996, Page(s):352 - 358
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Multithreaded architectures taking a hybrid approach of von Neumann computers and dataflow computers are recently in active research. Multithreaded architectures can improve the performance by the locality exploitation within threads and asynchronous parallel execution among threads. However, it has been overlooked how to exploit effectively the locality of large shared data structures among threa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What features really make distributed minimum spanning tree algorithms efficient?

    Publication Year: 1996, Page(s):106 - 114
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Since Gallager, Humblet and Spira first introduced the distributed Minimum Spanning Tree problem, many authors have suggested ways to enhance their basic algorithm to improve its performance. Most of these improved algorithms have even been shown to be very efficient in terms of reducing their worst-case communications and/or time complexity measures. In this paper, however, we take a different ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant distributed match-making with weights

    Publication Year: 1996, Page(s):530 - 536
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed match-making provides a method of creating the subsets, and the lower bound of the number of messages to solve the issues. This paper discusses the fault-tolerant and weighted case, in which a protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Studies for realizing soft TCCS residing on top of Ethernet LAN

    Publication Year: 1996, Page(s):141 - 148
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    In this paper, the theoretical studies and solutions regarding problems for realizing Soft TCCS (Time Critical Communication System), residing on top of Ethernet LAN are presented. We analyze Ethernet LAN including its precise back off sequence to obtain throughput and delay characteristics in a light loaded circumstances. We also analyze the same performance characteristics effected by multi-moda... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a WDMA OIDSM multiprocessors

    Publication Year: 1996, Page(s):162 - 168
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Optically interconnected distributed shared memory (OIDSM) systems offer significant performance advantages due to the fast interconnection network. The photonic network of the proposed approach is based on a wavelength-division multiplexed (WDMA) passive star-coupled configuration. Optical self-routing is achievable which partitions the traffic, relaxing the design constraints on the receiver sub... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of conditional branches using SSA form for superscalar/VLIW processors

    Publication Year: 1996, Page(s):344 - 351
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    Global scheduling and optimization techniques are proposed to get more enough speedup for superscalar and VLIW (Very Long Instruction Word) processors. When we consider global scheduling and optimization, one of the most important issue is how to schedule conditional branches. Control dependences are caused by conditional branches and limit the scope of scheduling. Most of previous scheduling sche... View full abstract»

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

    Publication Year: 1996, Page(s):292 - 299
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Griffin is a statically typed language designed specifically for the rapid prototyping of Ada software. In this paper we describe the Griffin language constructs for expressing concurrency. There are two salient innovations: (1) an extended select statement that provides greater flexibility in managing non-deterministic behavior and (2) the capability of a receiving thread to concurrently rendezvo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes

    Publication Year: 1996, Page(s):98 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Set-to-set node-disjoint paths problem is that given two sets S={s 1,...,sk} and T={t1,...,tk} of nodes in a graph, find k node disjoint paths si→tji, where (j1,...,jk) is a permutation of (1,...,k). For general undirect graphs G(V,E), this problem is usually solved by applying flow techniques which take Poly(|V|) ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping asynchronous parallel simulation on a network of workstations

    Publication Year: 1996, Page(s):456 - 463
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    This paper examines the performance of mapping schemes used in parallel simulation on a network of workstations. A conservative parallel simulation of multistage interconnection networks is used as an example in our analytical model. Performance metrics such as elapsed time, speedup and simulation bandwidth associated with different schemes for partitioning/mapping parallel simulation onto physica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relaxed consistency requirements for replicated objects

    Publication Year: 1996, Page(s):522 - 527
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    Shared objects are usually replicated in a distributed environment for higher availability and fault tolerance. Coherent or strongly consistent implementation of replicated objects have been studied extensively in the literature. This paper concentrates on a general method for specifying and implementing replicated objects that only require weaker consistency conditions. The weakness of the object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection rerouting strategy applicable to various connection-oriented mobile communication networks

    Publication Year: 1996, Page(s):214 - 220
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    To date, various connection rerouting methods for connection-oriented mobile network services have been proposed. The previous methods, however, are limited to specific topologies or environments. In this paper, we propose CI(Connection Information)-based rerouting widely applicable to various connection-oriented mobile networks. This method requires neither a specific topology nor a complex conne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bubblesort star graphs: a new interconnection network

    Publication Year: 1996, Page(s):41 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    In this paper, we propose and analyze a new interconnection network called bubblesort star graph, which is the merger of the bubblesort graph and the star graph. We present the deadlock-free wormhole routing algorithm for the proposed network. We also develop the method to embed a mesh into a bubblesort star graph with dilation two and expansion one. Besides, we use the recursive scheme to embed t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some sparse time-relaxed broadcast communication networks

    Publication Year: 1996, Page(s):135 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Broadcasting is the process of information dissemination in communication networks (modelled as graphs) whereby a message originated at one vertex becomes known to all members under the constraints that each call requires one unit of time and at every step any member can call at most one of its neighbours. A broadcast graph on n vertices is a network in which message can be broadcast in minimum po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed arithmetic-based architectures for high speed IIR filter design

    Publication Year: 1996, Page(s):156 - 161
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Dedicated VLSI has been considered as an effective method to realize the DSP algorithms which require massive amount of computations. To speed up the computing, parallel processing and pipelining techniques are often employed. However, for those recursive algorithms where the available computing concurrency is very limited, these design tactics do not help. Previous results suggest a Look-ahead tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optical Bus Computer Cluster with a deferred cache coherence protocol

    Publication Year: 1996, Page(s):175 - 182
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    In this paper, we first propose a class of workstation cluster which utilizes optical wavelength-division multiplexing (WDM) technology to connect nodes (work-stations) of the cluster. The Optical Bus Computer Cluster (OBCC) falls in the class of cache coherent non-uniform memory access (CC-NUMA) multiprocessors. The basic topology of the cluster is star-shaped with an optical star-coupler in the ... View full abstract»

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