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
  • 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.
  • 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 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.
  • Scouting: fully adaptive, deadlock-free routing in faulty pipelined networks

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

    Adaptive routing protocols based on message pipelining using wormhole routing (WR) can provide superior performance. However, the occurrence of faults can lead to situations that may produce deadlock. Variants of adaptive WR have been introduced (P.T. Gaughan and S. Yalamanchili, 1992) that employ backtracking and misrouting to first establish a path, followed by message pipelining (pipelined circ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Plenary Address 3: Heterogeneous Parallel Computing

    Publication Year: 1994, Page(s): 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (32 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.
  • Specification of stochastic properties with CSP

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

    The research in formal specification and verification of complex systems has often ignored the specification of stochastic properties of the system. We are exploring new methodologies and tools to permit stochastic analysis of CSP-based systems specifications. In doing so, we have investigated the relationship between specification models and stochastic models by translating the specification into... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delayed precise invalidation-a software cache coherence scheme

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

    Software-based cache coherence scheme is very desirable in scalable multiprocessor as well as massively parallel processor designs. We propose a software-based cache coherence scheme named delayed precise invalidation. The delayed precise invalidation is based on compiler time markings of references and a hardware-based local explicit invalidation of stale data in parallel and selectively. With a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theory of fault-tolerant routing in wormhole networks

    Publication Year: 1994, Page(s):600 - 607
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Fault-tolerant systems aim at providing continuous operations in the presence of faults. Multicomputers rely on an interconnection network between processors to support the message-passing mechanism. Therefore, the reliability of the interconnection network is very important for the reliability of the whole system. This paper analyzes the effective redundancy available in a wormhole network by com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Plenary Address 2: Computing in the '90s, Microsoft, and Supercomputers

    Publication Year: 1994, Page(s): 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (20 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.
  • 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.
  • 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.
  • A graph model for investigating memory consistency

    Publication Year: 1994, Page(s):516 - 523
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The complexity of a multiprocessor memory system grows with the endeavors people make to improve the performance. The pseudo and real execution graphs introduced here can formally describe the complex event ordering behavior of the multiprocessor memory system and to verify the correctness of a parallel program under a consistency model. A pseudo execution graph represents the programmer's abstrac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tree-based distributed algorithm for the K-entry critical section problem

    Publication Year: 1994, Page(s):592 - 597
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We present a token-based algorithm for solving the K-entry critical section problem. Based on Raymond's (1989) tree-based approach, we regard the nodes as being arranged in a directed tree structure, and all messages used in the algorithm are sent along the directed edges of the tree. There are K tokens in the system; we use a bag structure at each node to record the collection of the neighboring ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical distributed garbage collection for networks with asynchronous clocks and message delay

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

    Distributed garbage collection over a message passage network is discussed in this paper. Traditionally, this can be done by reference counting, which is fast but cannot reclaim cyclic structures or by graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage and guar... View full abstract»

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