By Topic

High Performance Computing on the Information Superhighway, 1997. HPC Asia '97

April 28 1997-May 2 1997

Filter Results

Displaying Results 1 - 25 of 139
  • Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (832 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1997, Page(s):757 - 760
    Request permission for commercial reuse | PDF file iconPDF (241 KB)
    Freely Available from IEEE
  • Finding Hamiltonian cycles on incrementally extensible hypercube graphs

    Publication Year: 1997, Page(s):361 - 366
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The existence of a Hamiltonian cycle is the premise of usage in an interconnection network. A novel interconnection network, the incrementally extensible hypercube (IEH) graph, has been proposed. The IEH graphs are derived from hypercubes and also retain most of the properties of hypercubes. Unlike hypercubes without incremental extensibility, IEH graphs can be constructed in any number of nodes. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear least squares solutions by Householder transformations with column pivoting on a parallel machine

    Publication Year: 1997, Page(s):134 - 136
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Using Householder transformations to solve linear least squares problems is very efficient. We have found a computational form especially suitable for BBN Butterfly, a parallel computer. We modified the algorithm for parallel processing using various constructs from the BBN Mach 1000 system. We were able to obtain a speed-up of 3 with 4 processors, and 3.83 with 6 processors for M=1000, and N=200,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant time algorithms for Euler tour and tree operations on CRAP

    Publication Year: 1997, Page(s):355 - 360
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    A cross-bridge reconfigurable array of processors (CRAP) is a parallel processing system which has the ability to change dynamically its interconnection scheme during the execution of an algorithm. In this paper, given an unrooted tree T with n vertices, we propose an O(1) time algorithm for constructing an Euler tour of T on a 2-D (dimensional) n≫MULT(n-1) CRAP. Then, given a root vertex r, we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convertible undeniable signature scheme

    Publication Year: 1997, Page(s):700 - 703
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    In this study, a convertible undeniable signature scheme based on the El-Gamal signature scheme is proposed. The proposed scheme satisfies the undeniable property and can convert the undeniable signature to the ordinary one. The number of public keys and signatures are less than those of Boyar's scheme (1991). It also reduces the number of communication steps of the signature confirmation protocol View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel implementation of the unit commitment problem on NOWs

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

    This paper proposes the application of parallelization techniques for solving the unit commitment problem (UCP) on NOWs (networks of workstations). A modified parallel dynamic programming method that takes advantage of NOWs is presented. Our algorithm performs better than the general parallel dynamic programming algorithm for UCP. In order to demonstrate the usefulness of our technique, we apply o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topology optimal transformation for reconstructing 3-dimensional mandible structure

    Publication Year: 1997, Page(s):716 - 719
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Triangulation and topology optimization methods are proposed for optimal matching of the two-dimensional elements which are obtained from the complicated three-dimensional structure. To improve the matching performance in constructing the three-dimensional elements, the topology optimal transformation method among the triangulated elements has been proposed. The probability of optimal matching bet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regular grids dynamic nesting model TIFLOW-2DN for inter-tidal zones

    Publication Year: 1997, Page(s):732 - 735
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A technique to combine different size grids in a computational domain is proposed. While existing nesting methods which link two or more grids for hydrodynamic problems cannot treat the inter-tidal zones, the present model can be applied to the areas which repeat dry and wet conditions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of various node configurations for fine-grain multithreading on stock processors

    Publication Year: 1997, Page(s):349 - 354
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    It becomes more and more interesting to construct multi-threaded parallel machines using stock processors due to their high performance/price ratio. However no quantitative analysis has been reported on the effectiveness of various node configurations and its impact on the overall performance. In this paper we explore three different node configurations in detail and compare their dynamic characte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A loop transformation for maximizing parallelism from single loops with nonuniform dependencies

    Publication Year: 1997, Page(s):696 - 699
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This paper describes several loop splitting methods for exploiting parallelism from single loops, and also proposes a generalized and optimal loop transformation technique for exploiting parallelism from single loops with nonuniform dependencies. The proposed algorithm is based on partitioning a serial loop by using the size of dependence distance such that it varies between different instances of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel double sort-merge algorithm for object-oriented collection join queries

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

    In object-oriented databases (OODBs), although path expressions through pointer connections may exist, it is sometimes necessary to perform an explicit join operation between two classes. Since a class may contain collection attributes as well as simple attributes, join queries in OODBs may be based on collections. A need for collection join algorithms arises, since the conventional join algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance RAID system by using dual head disk structure

    Publication Year: 1997, Page(s):325 - 330
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    An approach for designing high performance disk array systems using a dual head disk structure is presented. In general, both I/O bandwidth and reliability can be significantly improved by using disk array systems, i.e., RAID. However, the performance of RAID systems can be significantly degraded where small read/write accesses are frequently requested. Thus, the dual head disk structure is applie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shifted Recursive Torus interconnection for high performance computing

    Publication Year: 1997, Page(s):61 - 66
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    We propose the Shifted Recursive Torus (SRT) interconnection network for high performance computing. By adding multi level links to the torus network recursively, the SRT can achieve excellent interconnection features such as a smaller diameter, a limited number of links per node, an easy implementation in VLSI, and an expandible hierarchical structure. The paper considers the problem of achieving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved lookahead instruction prefetching

    Publication Year: 1997, Page(s):712 - 715
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    A new lookahead instruction prefetching mechanism is proposed in this paper. Though significant performance improvement can be obtained by improving both the cache miss ratio and average access time for successfully prefetched blocks, most conventional prefetching mechanisms improve only one out of the two factors. To achieve balanced improvement of the two factors, a lookahead prefetching scheme ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SMESH3D: an interactive structured mesh generation system

    Publication Year: 1997, Page(s):728 - 731
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    A multi-block structured mesh generation system, SMESH3D (S_tructured M_e_s_h_ In 3_ D_imensions) has been developed for the generation of grids for Computational Fluid Dynamics (CFD) applications. This paper gives an overview of SMESH3D software architecture and highlight its major features, namely: multi-block connectivity computation and associat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I/O placement strategies and their data locality sensitivities in k×k toroidal networks

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

    Various I/O placement strategies have been proposed for a k×k toroidal distributed system. In previous studies, it has been shown that the I/O placement strategy has a major impact on average network latency. In this study the sensitivity of different strategies toward I/O data locality is investigated. An intensive simulation was carried out for this purpose. The simulation considers both s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient polling protocol for the management information gathering over TCP/IP

    Publication Year: 1997, Page(s):466 - 471
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    The polling protocol that gathers network management information is an important feature of network performance. This paper shows the design of a polling protocol that can gather management information from agents in an efficient way. Existing polling protocols-current polling with the same polling intervals or separated polling with different intervals-have some defects in that the probability of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An intelligent architecture for traffic controls in ATM network

    Publication Year: 1997, Page(s):242 - 247
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    An asynchronous transfer mode (ATM) network is a high-speed multimedia network which handles various kinds of traffic with different bit-rates and different qualities of service (QoS). In order to maintain the QoS for each traffic source and to avoid possible congestion problems, an ATM network requires highly sophisticated and flexible controllers to insure that this demanding performance can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster-oriented software development environment and its applications

    Publication Year: 1997, Page(s):692 - 695
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    We briefly describe the interconnection topology of our prototype cluster system, then we analyze and discuss the development methods, the framework and the contents of the software development environment for the cluster system. We develop the user-friendly environment containing the cluster system by restructuring and modifying existing popular parallel software, such as PVM etc., keeping their ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solution of viscoelastic scattering problems in linear acoustics using hp boundary/finite element method

    Publication Year: 1997, Page(s):611 - 616
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    The interaction of acoustic waves with submerged structures remains one of the most difficult and challenging problems in underwater acoustics. Many techniques such as coupled Boundary Element (BE)/Finite Element (FE) or coupled Infinite Element (IE)/Finite Element approximations have evolved. In this paper, we focus on the steady-state formulation only, and study a general coupled hp-adaptive BE/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local density functional study of Hg-based high Tc superconductors

    Publication Year: 1997, Page(s):748 - 751
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    As an application of the high performance CRAY supercomputers, we presented the results of our total energy study on the electronic structure and lattice dynamic properties of high Tc Hg-Ba-Cu-O superconductors. For the calculations, we employed the self consistent FLAPW method under the density functional formalism within the local density approximation. The excellent agreement of our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffer management for high performance database systems

    Publication Year: 1997, Page(s):633 - 638
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    This paper presents the development of a buffer algorithm named RESBAL, which exploits parallelism in order to offer high performance for query execution in relational database systems. The algorithm aims to provide both efficient and predictive data buffering by exploiting the use of prior knowledge of query reference behaviour. Designed to offer a high level of flexibility, RESBAL employs a mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel generation of k-ary trees

    Publication Year: 1997, Page(s):117 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The only published algorithms for generating k-ary trees in parallel are those of Akl and Stojmenovicˇ (1996) and Vajnovszki and Phillips (1997). In the first of these two papers, trees are represented by an inversion table and the processor model is a linear array multicomputer. In the second paper, trees are represented by bit-strings and the algorithm executes on a shared-memory multiproc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of aerodynamics problem on a distributed shared-memory machine

    Publication Year: 1997, Page(s):93 - 98
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    A complex compressible Navier-Stokes equation using a time-accurate implicit difference scheme is parallelized using domain decomposition (DD) and loop parallelization methods. The numerical scheme used is a lower-upper alternating direction implicit (LU-ADI) factorization method with a Baldwin-Lomax (1978) turbulence model. This paper gives a preliminary result on the performance of the code on a... View full abstract»

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