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
  • A flexible protocol synthesis method for adopting requirement changes

    Publication Year: 1996, Page(s):319 - 326
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (736 KB)

    Communicating entities in a protocol specification communicate with each other and provide services to their users. Once the behaviours of the entities (specification of the protocol) are specified they are not changed. The entities provide a fixed set of services to their users. However, different users have different requirements and their requirements change often. The requirement changes in ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed fault detection in communication protocols using extended finite state machines

    Publication Year: 1996, Page(s):310 - 318
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (808 KB)

    Run-time fault detection in communication protocols is essential because of faults that occur in the form of coding defects, memory problems, and external disturbances. Finite State Machine models have been used in the past to detect and diagnose protocol faults. However, the fault coverage of these models is limited to vocabulary faults and sequencing faults. We present an Extended Finite State M... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant causal delivery in group communication

    Publication Year: 1996, Page(s):302 - 309
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (672 KB)

    In distributed systems, a group of processes are cooperated to execute an application program. A group is established among multiple processes and only processes in the group communicate with each other. This type of group communication is named intra-group communication. The communication system has to support the reliable intra-group communication in the presence of the process fault. In order t... 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.
  • 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.
  • Program dependence analysis of concurrent logic programs and its applications

    Publication Year: 1996, Page(s):282 - 291
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (948 KB)

    In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two language-independent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program. Then based on these representations, program dependences between literals in concurrent logic programs ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on call modelling for AIN/B-ISDN integration

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

    ITU-T has considered the Intelligent Network(IN) Capability Set 2(CS 2) phase, which includes the FPLMTS capabilities for providing mobile services in Advanced IN(AIN) based network. Simultaneously, AIN and B-ISDN integrated architecture would be recommended upto IN CS-3 phase. This paper describes the call model of new Service Switching Point(SSP) based on the integration technology of AIN and B-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PPD: A practical parallel loop detector for parallelizing compilers

    Publication Year: 1996, Page(s):274 - 281
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (640 KB)

    It is well known that extracting parallel loops plays a significant role in designing parallelizing compilers. The execution efficiency of a loop is enhanced when the loop can be executed in parallel or partial parallel, like a DOALL or DOACROSS loop. This paper reports on the practical parallelism detector (PPD) that is implemented in PFPC (a portable FORTRAN parallelizing compiler running on OSF... 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.
  • Multimedia task reliability analysis based on token ring network

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

    In this paper, we attempt to develop reliability models for the reliability analyses in distributed multimedia system. We propose two polynomial-time algorithms to compute the multimedia task reliability (MTR) and time-constraint multimedia task reliability (TCMTR) for distributed multimedia system based on token ring networks. Two main algorithms, multimedia task reliability for ring (MTRR) and m... 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.
  • 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.
  • Deadlock-free routing in an optical interconnect for high-speed wormhole routing networks

    Publication Year: 1996, Page(s):256 - 264
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (896 KB)

    The Supercomputer SuperNet (SSN) is a two-level hierarchical high-speed network. The lower level is a high speed electronic mesh fabric; the higher level is a WDM optical backbone network interconnecting the high-speed fabrics distributed across a campus or metropolitan area. The salient characteristics of this architecture are the use of wormhole routing and backpressure hop-by-hop flow control m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic modification of a protocol specification based on changes of a service specification

    Publication Year: 1996, Page(s):129 - 134
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 KB)

    The problem of modifying an existing protocol specification of a communicating system in Labelled Transition System (LTS) based on changes of it's service specification in LTS is discussed. Two types of changes of a service specification are treated: addition of a behaviour expression to the service specification and deletion of some parts of the behaviour expression from the service specification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transactional programming for distributed agent systems

    Publication Year: 1996, Page(s):64 - 71
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (812 KB)

    A new multiagent programming paradigm based on the transactional logic model is developed. This paradigm enables us to construct a distributed agent transactional program (DATRAP). Such a construction is carried out in two stages: first expressing a program into a production rule system, and then converting the rule applications into a set of transactions on a database of active objects represente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An alternative addressing scheme for conventional CDMA fiber-optic networks allows interesting parallel processing capabilities

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

    A different approach to addressing on a CDMA (code division multiple access) fiber based LAN (local area network) is investigated. This change serves to enable a network with unusual properties: specifically this implementation modification enables a network that provides: immediate and simultaneous access to all users (real-time); arbitrary length transmissions (including continuous); all data av... 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.
  • Fast sorting algorithms on reconfigurable array of processors with optical buses

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

    The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attention from the research community. By taking advantage of the unique properties of optical transmission, the RASOB provides flexible reconfiguration and strong connectivities with low hardware and control complexities. In this paper, we use this architecture for the design of efficient sorting algorithm... 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.
  • State reduction in the exact analysis of fork/join queueing systems with homogeneous exponential servers

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

    A state reduction technique for the exact analysis of fork/join queueing systems is presented in this paper. The technique is based on the standard Markov model and can be applied to systems having K homogeneous exponential servers. For a closed system with M jobs, the technique reduces the size of the state space from (M+1)K-M K states to (M+K-1/K-1) states. This amounts to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient asynchronous data transmission mechanism for data parallel languages

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

    Reducing the overhead of data transmissions is crucial to harnessing the potential of distributed memory multiprocessors. Some optimization techniques such as overlapping communication and computation have been proposed. However, the most overlapping techniques are still limited by the following factors. (1) There is no linguistic support for overlapping communication and computation in data paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient fault protection of block gradient-based adaptive filters

    Publication Year: 1996, Page(s):359 - 366
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (612 KB)

    Adaptive FIR filters are important in modern digital signal processing applications, and many situations require significant computational power attainable only through multi-processor configurations. Various block processing techniques have been proposed as viable alternatives to the sequential implementations to achieve the high throughput rate and reduce the effect of finite word length. While ... View full abstract»

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