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
  • Communication protocol for group of distributed objects

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

    In distributed applications, a group of multiple objects are cooperated. On receipt of request messages, the objects send back the responses. The kinds of group communication protocols discussed so far, support the reliable and ordered delivery of messages at the network level. Only messages to be ordered at the application level, not necessarily all messages, are required to be causally delivered... 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.
  • 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.
  • Distribution transparent MIB based on MSA (Management System Agent) model

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

    OSI Management model defines only peer to peer communication process between a managing application (AP) and a managed AP. Thus, when more than one managed AP stores portions of Management Information Base (MIB) distributively, the managing AP needs a sophisticated distributed processing function. This paper proposes an agent, called Management System Agent (MSA) which provides location transparen... 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.
  • Adaptive routing in k-ary n-cube multicomputers

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

    Wormhole routing makes the communication latency insensitive of the network diameter and reduces the buffer size of each router. It has been widely adopted in many new generation distributed memory multiprocessor systems (DMMPs). The concept of virtual system is invented for deadlock-free routing design. Using a great deal of virtual channels is quite expensive to be implemented in practice and is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and analysis of channel transferability in mobile computing environments

    Publication Year: 1996, Page(s):198 - 205
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Mobile computers use wireless channels to communicate with other computers. The finite number of channels should be efficiently allocated to maximize throughput and to avoid co-channel interference. Temporal variations in, channel demand (load) require channel allocation to adapt dynamically to the changing demand. The presence of load imbalance does not automatically imply the usefulness of chann... 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.
  • A management information repository for distributed applications management

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

    The management of distributed applications and systems (MANDAS) project addresses problems arising in the management applications. The MANDAS information repository (MIR) provides database support for the management applications and supports their integration into a single management environment. We examine the problem of distributed applications management to extract the requirements for an MIR. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-based approach for information gathering on highly distributed and heterogeneous environment

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

    The core of the problem of Information Gathering is how to generate a concise, high-quality response to the information needs of a user. However, this task is becoming difficult due to the explosion in the amount of electronic information. Agent-based solutions have become an popular approach for locating information in an growing distributed heterogeneous environment like Internet. We first surve... 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.
  • Fault-tolerant routing strategy using routing capability in hypercube multicomputers

    Publication Year: 1996, Page(s):396 - 403
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper addresses fault-tolerant routing which is concerned with finding feasible minimum paths in a faulty hypercube. The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing function. The amount of information that is useful for message routing is increased with our scheme. The proposed algorithm routes a message in an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable routing schemes for massively parallel processing using reconfigurable optical interconnect

    Publication Year: 1996, Page(s):500 - 507
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    We consider the message routing/broadcasting problem in an optically interconnected massively parallel processing system, where each node in the system sends/broadcasts randomly generated packets to others. The network model considered is the reconfigurable optical interconnect (ROI). It is based on the new device capabilities enabled by recent advances in optical technology. A ROI node can use li... 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.
  • A new scheduling strategy for NUMA multiprocessor systems

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

    This study examined the impact of multiprocessor scheduling strategies on the performances of non-uniform memory access (NUMA) shared-memory multiprocessor systems. A new scheduling algorithm named the Longest Extended Critical Path First (LECPF) algorithm is proposed here. The proposed algorithm schedules parallel tasks by considering complex communication options and the contentions of shared co... 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.
  • Programming concurrency and synchronisation in Actel

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

    This paper introduces mechanisms for exploiting concurrency and synchronisation in Actel: a concurrent object based language. It focuses on issues of combining parallelism with object orientation, performance, and synchronisation. Actel offers several mechanisms such as a new mode of message passing called `semi-reference' to achieve an efficient inter-object concurrency. Parallel functions and pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Register renaming for x86 superscalar design

    Publication Year: 1996, Page(s):336 - 343
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Register renaming eliminates storage conflicts for registers to allow more instruction level parallelism. This idea requires nontrivial implementation, however, especially when registers are accessible with different fields and data lengths. As a result, not all bits in a register are to be updated upon a register write, and a register read may be data-dependent on multiple register writes. We pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases

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

    We introduce and formalize the concept of two-level-hierarchies (t-l-hs) of objects. The t-l-hs are special partial directed acyclic graphs having as vertices objects. An equivalence relation is also defined on their edges. They are used for modelling complex objects by supporting, in a uniform way, the well known abstractions like association, aggregation, grouping as well as specialization and g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-balanced cooperation protocol in multi-agent robotic systems

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

    This paper proposes a cooperation protocol based on the cost-balanced strategy for the Object-Sorting Task in multi-agent robotic systems. The protocol coordinates agents for carrying objects to destinations efficiently and effectively. Each agent autonomously makes subjective optimal decision, then the coordination algorithm resolves their conflicts by balancing the load, which is measured in ter... 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.
  • 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.