By Topic

Proceedings of 1994 International Conference on Parallel and Distributed Systems

19-21 Dec. 1994

Filter Results

Displaying Results 1 - 25 of 121
  • Proceedings of 1994 International Conference on Parallel and Distributed Systems

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (569 KB)
    Freely Available from IEEE
  • Panel 1: Are We Providing The Right Education For Computer Science/engineering Students?

    Publication Year: 1994, Page(s): 14
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Panel 2: Is It Possible to Fairly Compare Interconnection Networks?

    Publication Year: 1994, Page(s):16 - 18
    Request permission for commercial reuse | PDF file iconPDF (284 KB)
    Freely Available from IEEE
  • Panel 3: Taiwan's Information Superhighway: Technical Issues And Social Impacts

    Publication Year: 1994, Page(s): 20
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Panel 4: What Types Of Research Papers Should We Be Writing?

    Publication Year: 1994, Page(s): 22
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Panel 5: Parallel Processing: What Have We Done Wrong?

    Publication Year: 1994, Page(s): 24
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • Panel 6: Parallel And Distributed Processing Research In Some Asian Countries

    Publication Year: 1994, Page(s): 26
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Parallel block generalized WZ factorization

    Publication Year: 1994, Page(s):174 - 179
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (599 KB)

    In this paper we first present a block strategy for the generalized WZ factorization, which consists of block factorizing a matrix A in the form A=WZW/sup -1/. This study shows how a block strategy may be used to reduce a large eigenvalue problem into a number of smaller ones. Next, we develop a parallel multi-phase algorithm for this method, which requires processes such as matrices products, Gau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient Hough transform algorithm on SIMD hypercube

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

    This paper presents a fast algorithm for computing the Hough transform on SIMD hypercube architectures. For an image with N/spl times/N pixels and n quantized /spl theta/ values, our algorithm computes the Hough transform in O(logN) time on a hypercube of size N/spl times/N/spl times/n. An efficient algorithm for large Hough transform problems on a smaller fixed-size hypercube is also given. On a ... View full abstract»

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

    Publication Year: 1994, Page(s):769 - 771
    Request permission for commercial reuse | PDF file iconPDF (178 KB)
    Freely Available from IEEE
  • Thread migration on heterogeneous systems via compile-time transformations

    Publication Year: 1994, Page(s):634 - 639
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Describes a technique to provide multi-threading an an enhanced C language. In contrast to the traditional design of a thread library, which usually utilizes a few lines of assembly code to effect context-switching between threads, the technique we use is based on compile-time program transformations and a run-time library. Since this approach transforms a thread's physical states into logical for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Permanent Connection: network computing over switch-based high-speed networks

    Publication Year: 1994, Page(s):628 - 633
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Recent progress in switch based high speed local area networks (LANs) makes distributed network computing promising. Three evolving switch based high speed networks are the High Performance Parallel Interface (HIPPI), Fiber Channel (FC), and Asynchronous Transfer Mode (ATM) standards. We study how high performance computing can be carried out over such networks. High performance computing can be c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting communication latency hiding for parallel network computing: model and analysis

    Publication Year: 1994, Page(s):622 - 627
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Very large problems with high resource requirements of both computation and communication could be tackled with large numbers of workstations. However for LAN-based networks, contention becomes a limiting factor whereas latency appears to limit communication for WAN-based networks, nominally the Internet. We describe a model to analyze the gain of communication latency hiding by overlapping comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel implementation of the trie structure

    Publication Year: 1994, Page(s):538 - 543
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    We present two simple algorithms for implementing the trie structure based on the MIMD (Multiple Instruction Streams Multiple Data Streams) model of computation. Unlike the implementation, our schemes allow operations on the trie structure by multiple processes. No hash function will be employed and the problem due to collision is thus, eliminated. By making use of a simple segmentation scheme. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed routing schemes for strictly nonblocking networks

    Publication Year: 1994, Page(s):614 - 619
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Strictly nonblocking networks may hold the key for high performance multiprocessor systems. While a number of strictly nonblocking networks have been reported in the literature, their use in multiprocessors is hampered by a lack of efficient distributed routing at algorithms to set paths in these networks. As a step in this direction, the paper presents two distributed routing algorithms for D.G. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel run-time iterative load balancing algorithm for solution-adaptive finite element meshes on hypercubes

    Publication Year: 1994, Page(s):210 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    To efficiently execute a finite element program on a hypercube, we need to map nodes of the corresponding finite element graph to processors of a hypercube such that each processor has approximately the same amount of computational load and the communication among processors is minimized. If the number of nodes of a finite element graph will not be increased during the execution of a program the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient technique to remove transformations [program codes]

    Publication Year: 1994, Page(s):392 - 397
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Although the application of code transformations is critical to exploit parallelism in program code, few guidelines or tools are provided to determine what transformations should be applied and where they should be applied. In this paper, we approach this problem by first providing a taxonomy of code transformations to assist the user in parallelizing programs. We then present an efficient techniq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of sequencing constraints for specifying, testing, and debugging concurrent programs

    Publication Year: 1994, Page(s):280 - 287
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    This paper introduces the use of sequencing constraints for specifying, testing, and debugging concurrent programs. An execution of a concurrent program P nondeterministically exercises a sequence of synchronization events, called a synchronization sequence (or SYN-sequence). Sequencing constraints (or constraints) specify restrictions on the allowed SYN-sequences of P. Constraints for P are deriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallel transaction processing in a coupled system

    Publication Year: 1994, Page(s):662 - 669
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A performance study is conducted on parallel transaction processing in a coupled system, which is a multi-node system with a shared global buffer. We develop a multiple system simulator and obtain several performance results from it. This simulator has been run against three workloads, and the coupled system behavior with these three different inputs is studied. Several statistics, including those... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences in session layer conformance testing

    Publication Year: 1994, Page(s):438 - 444
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    A protocol standard can be implemented by different manufacturers. Therefore, conformance testing of protocol implementations to standards is important to achieve the main purpose of the open systems interconnection. In this paper, after briefly introducing the session layer protocol and the conformance testing methodology we depict important errors found in the session layer implementations and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting on faulty hypercubes

    Publication Year: 1994, Page(s):128 - 133
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spanni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear equation model for twisted cube networks

    Publication Year: 1994, Page(s):709 - 714
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The Twisted 3-cube is an interconnection network that twists the edges of the 3-dimensional hypercube to produce a network with diameter 2 and expected distance 11/8. A number of papers have shown that the Twisted 3-cube can be generalized into higher dimensional cube-like networks. We show that many of these networks can be described using a simple model. We place bounds on the diameter and expec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the imprecise-computation technique for congestion control on a real-time traffic switching element

    Publication Year: 1994, Page(s):202 - 208
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The broadband integrated services digital network provides communication services with different requirements, including real-time services such as voice and video. Real-time services are affected by the probabilistic behavior of such a network. In particular, when the network becomes congested, the end-to-end packet delay may exceed the maximum allowed. Fortunately, many real-time services are wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of a portable parallelizing compiler with loop partition

    Publication Year: 1994, Page(s):333 - 338
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    We have implemented a portable FORTRAN parallelizing compiler with loop partition on our experimental target system, Acer Altos 10000, running OSF/1 operating system. We have defined a minimal set of thread-related functions and data types, called B Threads, that is required to support the execution of this parallelizing compiler. Our compiler is highly modularized so that the porting to other pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of cache hashing functions for symbolic applications in micro-parallel processors

    Publication Year: 1994, Page(s):530 - 535
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    This paper presents a study of cache hashing functions for micro-parallel processors (e.g., superpipeline and super-scalar processors). Several novel cache hashing functions are experimented. Our simulation results show that an unconventional cache hashing function applied on a direct-mapped cache results in hit rates as good as a two-way set associative cache with traditional mapping, while the c... View full abstract»

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