Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

23-25 June 1999

Filter Results

Displaying Results 1 - 25 of 70
  • Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (340 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s):438 - 439
    Request permission for commercial reuse | PDF file iconPDF (8 KB)
    Freely Available from IEEE
  • A VLSI architecture for cellular automata based Reed-Solomon decoder

    Publication Year: 1999, Page(s):158 - 165
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    The design of cellular automata (CA)-based SbEC-DbED (single-byte error correcting, double-byte error detecting) code, which is analogous to the extended Reed-Solomon (RS) code, was proposed by D.R. Chowdhury et al. (1994). This code has the same restriction on error correction capability as that of the extended RS code. In this paper, a new scheme has been proposed for pipeline implementation of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and simulation of a hybrid replication control protocol

    Publication Year: 1999, Page(s):210 - 215
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Replica control protocols in distributed database systems are responsible for the management and maintenance of replicated (redundant) data. Maintaining replicated data improves performance and increases availability. Keeping the replicated data consistent and available during the presence of failures can however become quite difficult. The paper presents the design of a hybrid replica control pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new look at multimedia synchronization in distributed environments

    Publication Year: 1999, Page(s):322 - 327
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A multimedia system requires to handle automatically and uniformly the generation, manipulation, presentation, storage, and communication of independent discrete and continuous media data. The synchronization between various kinds of media data is a key issue in an integrated multimedia system, and has drawn a considerable attention. In this paper we investigate the synchronization problem in dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPI backend for an automatic parallelizing compiler

    Publication Year: 1999, Page(s):152 - 157
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Many naive parallel processing schemes were not as successful as many researchers thought, because of the heavy cost of communication and synchronization resulting from parallelization. In this paper, we identify the reasons for this poor performance and the compiler requirements for performance improvement. We realized that the parallelizing decisions should be derived from the overhead informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of a semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems

    Publication Year: 1999, Page(s):204 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling the subtasks of the application onto the processors. When some of the characteristics of the application subtasks are unknown a priori and will change from iteration to iteration during execution time, a semi-static method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedup of lockout-free mutual exclusion algorithms

    Publication Year: 1999, Page(s):172 - 177
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We propose three lockout-free mutual exclusion algorithms for the asynchronous multi-writer/reader shared memory model. The first two algorithms are modifications of the n-process algorithm by G.L. Peterson (1981), and the third algorithm is a modification of the tournament algorithm by G.L. Peterson and M.J. Fischer (1977). The correctness and efficiency of these modified algorithms are shown. By... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Powerful and feasible processor interconnections with an evaluation of their communications capabilities

    Publication Year: 1999, Page(s):222 - 227
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Scalable networks with very good topological properties are often impossible to build because of their prohibitively high wiring complexity. Such a network is the generalized hypercube (GH). It supports full-connectivity of all its nodes in each dimension and is characterized by outstanding topological properties. We propose a new class of scalable interprocessor connections, namely HOWs (Highly-O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message scheduling on trees under a generalized line-communication model

    Publication Year: 1999, Page(s):10 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    In this paper, we generalize the line-communication model by relaxing the notion of conflictness between paths. We show that the problem of finding optimal schedules to route any set of messages under both our generalized line-communication model and the bufferless routing model is NP-hard even if restricted to binary trees. Finally, a simple offline 2-approximation algorithm for our model on tree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using SADTs to support irregular computational problems

    Publication Year: 1999, Page(s):338 - 343
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    There are well defined methods for supporting regular problems with scalable performance, typified by the HPF language and the BSP model. Less well understood is the solution of more irregular problems, supporting complex shared data structures and task dependencies, and typically requiring dynamic load balancing to sustain high performance. It is demonstrated how the use of Shared Abstract Data T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A task scheduling algorithm to package messages on distributed memory parallel machines

    Publication Year: 1999, Page(s):236 - 241
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    In this paper, we report a performance gap between a schedule with good makespan on the task scheduling model and the corresponding parallel program on distributed memory parallel machines. The main reason is the software overhead in the interprocessor communication. Therefore, speedup ratios of schedules on the model do not well approximate to those of parallel programs on the machines. The purpo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deciding strictly non-blocking generalized-concentration properties with constrained network parameters

    Publication Year: 1999, Page(s):22 - 27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    Concentrators and generalized concentrators are interconnection networks that provide respectively pair wise vertex-disjoint directed paths and trees to satisfy interconnection requests. An interconnection network is non-blocking in the strict sense if every compatible interconnection request can be satisfied by a path regardless of any existing interconnections. We present an interconnection prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic computation scheduling for load balancing in home-based software DSMs

    Publication Year: 1999, Page(s):248 - 253
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Load balancing is a critical issue for achieving good performance in parallel and distributed systems. However, this issue is neglected in the research area of software DSMs in the past decade. In this paper, we present and evaluate a dynamic computation scheduling scheme for load balancing of iterative applications in software DSM system. The experiment platform is a home based DSM system named J... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for algorithm visualization on the reconfigurable mesh

    Publication Year: 1999, Page(s):406 - 411
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Many parallel algorithms on the reconfigurable mesh have been developed so far. However it is hard to understand the behavior of these algorithms, because the bus topology is dynamically changing during the execution. This paper describes VMesh, a tool for visualizing parallel algorithms on the reconfigurable mesh. The purpose of the VMesh is to provide a comprehensive environment for development,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for all nearest neighbors of binary images on the BSP model

    Publication Year: 1999, Page(s):394 - 399
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We present two parallel algorithms for computing the nearest neighbors of an n×n binary image on the Bulk-Synchronous Parallel (BSP) model. The first algorithm is for weighted distance, and the second algorithm is for Lp distance. Both algorithms run in O(n2/p+L) computation time and O(gn/√p+L) communication time using p (1⩽p⩽n) processors and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving performance of adaptive media access control protocols for high-density wireless networks

    Publication Year: 1999, Page(s):316 - 321
    Cited by:  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    The problems of intermittent disconnection, high error rate and collision in high-density wireless networks cause degradation in the performance of wireless media access control protocols, such as slotted ALOHA Time Division Multiple Access (slotted ALOHA/TDMA) and Direct Sequence Code Division Multiple Access (DS/CDMA). We propose adaptive techniques for improving performance of media access prot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BSP Pro: a Java-based BSP performance profiling system

    Publication Year: 1999, Page(s):54 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    The paper introduces a new parallel performance profiling system for the Bulk Synchronous Parallel (BSP) model. The profiling system, called BSP Pro, consists of a performance profiling tool, BSP Profiler and a performance visualisation tool, BSP Visualiser. The aim of BSP Pro is to assist in the analysis and improvement of BSP program performance by minimising load imbalance among processes. BSP ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized adaptive routing based on mobile agents

    Publication Year: 1999, Page(s):380 - 385
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    The mobile agent has been shown to be a convenient, efficient, and robust approach to designing distributed protocols. This paper introduces an adaptive, mobile agent-based routing algorithm. While performing a random walk through the network, mobile agents sense changes in the network state, and trigger the computation of updated values for the routing tables. The randomized moving strategy exert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison between PVM on RHODOS and Unix

    Publication Year: 1999, Page(s):144 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Presents the architecture, services and performance results obtained from the implementation of the PVM (Parallel Virtual Machine) parallel processing tool supported by either the Unix operating system or the RHODOS distributed operating system. It is shown that the provision of several advanced services in RHODOS allow the implementation of PVM to be greatly simplified, and significant speed-ups ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A convergence algorithm to help enhance the performance of distributed systems on large networks

    Publication Year: 1999, Page(s):302 - 307
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The proposed convergence algorithm quickly and accurately predicts the mean message response time and communication channel. From the predicted value the correct window size of the desired percentage of time-out tolerance in message transmission and response can be computed. A correct window size is a necessity for reducing excessive message retransmissions caused by time-outs. The convergence alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Java Internet computing environment with effective configuration method

    Publication Year: 1999, Page(s):42 - 47
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    For an effective Internet based distributed parallel computing platform, Java-Internet Computing Environment (JICE) is designed and implemented with multithreading and remote method invocation mechanisms provided in Java. Specifically, JICE supports a shared memory system model for communication between any two nodes. Under the JICE, communication time is a major candidate of performance bottlenec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating a mesh with separable buses by a mesh with partitioned buses

    Publication Year: 1999, Page(s):198 - 203
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    We propose an algorithm that simulates a mesh with separable buses (MSB) by a mesh with partitioned buses (MPB). The MSB and the MPB are the two-dimensional mesh-connected computers which have additional broadcasting buses along every row and column. The broadcasting buses of the MSB can be dynamically sectioned into smaller bus segments of various lengths by the program control, while those of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting hierarchy and heterogeneous interfaces in multi-hop wireless ad hoc networks

    Publication Year: 1999, Page(s):370 - 375
    Cited by:  Papers (87)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Much progress has been made toward solving the problem of routing packets inside an ad hoc network, but there are presently no complete proposals for connecting ad hoc networks together to form larger networks, or for integrating them with wired Internets. We describe a technique that allows a single ad hoc network to span across heterogeneous link layers. Using this technique, we can both integra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance and granularity control in the SPaDES parallel simulation system

    Publication Year: 1999, Page(s):94 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Parallel simulation has the potential to accelerate the execution of simulation applications. However developing a parallel discrete-event simulation from scratch requires an in-depth knowledge of the mapping process from the physical model to the simulation model, and a substantial effort in optimising performance. This paper presents an overview of the SPaDES (Structured Parallel Discrete-Event ... View full abstract»

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