By Topic

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
  • Message ring-based channel reallocation scheme for cellular networks

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

    Wireless communication suffers from many restrictions due to the inherent limitations of the wireless media and existing wireless communication protocols. Limited radio frequency spectrum (or bandwidth) is one of the major issues in wireless communication. In order to efficiently share the limited bandwidth, different channel allocation (or channel assignment) schemes have been developed. In this ... 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.
  • Improvements in parallel job scheduling using gang service

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

    Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a class o... 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 (85)  |  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.
  • Distributed clustering for ad hoc networks

    Publication Year: 1999, Page(s):310 - 315
    Cited by:  Papers (363)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network: (ad hoc network) into clusters, this giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterion that allows the choice of the nodes that coordinate the clustering process based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meta-QoS performance of earliest-deadline-first and rate-monotonic scheduling of smoothed video data in a client-server environment

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

    In this paper we present an extensive performance study of two modified EDF and RM scheduling algorithms which are enhanced to provide quality of service (QoS) guarantees for smoothed video data. With a probabilistic definition of QoS, we incorporate admission control conditions into the two algorithms. Furthermore, we also include a counter-based scheduling module as the core scheduling mechanism... 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 (5)
    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.
  • An adaptive parallel grouping algorithm for B-WLL MAC protocol

    Publication Year: 1999, Page(s):376 - 379
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We propose an adaptive parallel grouping algorithm that may reduce the number of collisions and increase overall throughput of B-WLL (Broadband Wireless Local Loop) MAC (Media Access Control) protocol. Also, we present a method for independently executing the adaptive parallel grouping algorithm to reduce the signaling traffic overheads View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete exchange algorithms in wormhole-routed torus networks : a divide-and-conquer strategy

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

    We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach to reduce the start-up latency significantly, which is a good metric for network performance in wormhole networks. The first algorithm recursively divides the whole network into 2×2 networks. After specially desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of practical parallel computation model LogPQ

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

    Massively parallel computers consisting of a large number of processing elements have been developed and expected as high performance computers in advanced science and technology. Practical parallel computation model has been required to analyze parallel algorithms on massively parallel computers. We present a practical parallel computation model LogPQ taking account of communication queues into t... 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.
  • An NC approximation algorithm for optimal k-edge connectivity augmentation

    Publication Year: 1999, Page(s):290 - 295
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Given an undirected graph G=(V, E0) with |V|=n, and a feasible weighted edge set E such that G(V, E0∪E0 ∪E) is k-edge connected, the optimal k-edge connectivity augmentation problem is to find a subset S⊆E such that G(V, E0 ∪S) is k-edge connected and the weighted sum of the edges in S is minimum, where k is a fixed integer. Since this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile IP registration protocol: a security attack and new secure minimal public-key based authentication

    Publication Year: 1999, Page(s):364 - 369
    Cited by:  Papers (13)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    The ubiquity of the Internet and explosive growth in wireless networking in recent years increasingly urge the demand to support mobility within the Internet, which is what Mobile IP aims to provide. This paper is concerned with the security aspect of the registration protocol in Mobile IP. The paper shows that despite the use of authenticated registration messages and replay protection, the curre... View full abstract»

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

    Publication Year: 1999, Page(s): 282
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse networks tolerating random faults

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

    Proposes a general method to construct a fault-tolerant network G*, for any network G with N processors, such that G* has O(N) processors and contains a fault-free isomorphic copy of G with high probability, even if processors fail independently with constant probability. Based on the construction, we also show that we can construct such fault-tolerant networks with O(N) processors and O(M log N) ... 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.
  • Using stochastic intervals to predict application behavior on contended resources

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

    Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However when these platforms are shared by multiple users, performance prediction becomes increasingly difficult due to the dynamic behavior of the system. This paper addresses the use of stochastic values, represented by intervals, to parameterize performance models. We descr... 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.
  • Cluster technologies for high performance computing

    Publication Year: 1999, Page(s):168 - 170
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    A cluster system is extending its ability, owing to the increase of transmission speed and interface speed between nodes and interconnect. Synfinity interconnect can carry out the routing and transfer the massages at the speed of gigabyte/s. The bottleneck problem raised in a conventional cluster system must be solved by improvements such as transmission speed and protocol. Based on the standard i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A randomized BSP/CGM algorithm for the maximal independent set problem

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

    This paper presents a randomized parallel algorithm for the Maximal Independent Set problem. Our algorithm uses a BSP-like computer with p processors and requires that n+m/p=Ω(p) for a graph with 72 vertices and m edges. Under this scalability assumption, and after a preprocessing phase, it computes a maximal independent set after O(log p) communication rounds, with high probability, each ro... 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.
  • Parallel efficiency: the dataflow advantage

    Publication Year: 1999, Page(s):356 - 361
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs. This paper enumerates some advantages of using the dataflow model; it argues that the programming model is simple and easily managed by a programmer and demonstrates some of the efficiencies that the dataflow model allows an underlying run-t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Why the mean is inadequate for accurate scheduling decisions

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

    In a distributed environment, the generalized scheduling problem attempts to optimize some performance criteria by assigning tasks to resources and by determining the order in which those tasks will be executed. Although most resource management systems in use today have the goal of maximizing the use of idle processors, several, such as LSF and SmartNet attempt to minimize the time at which the l... View full abstract»

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