Proceedings of 3rd International Conference on High Performance Computing (HiPC)

19-22 Dec. 1996

Filter Results

Displaying Results 1 - 25 of 76
  • 3rd International Conference on High Performance Computing [front matter]

    Publication Year: 1996, Page(s):i - x
    Request permission for reuse | PDF file iconPDF (374 KB)
    Freely Available from IEEE
  • A genetic algorithm for assembling optical computers using faulty optical arrays

    Publication Year: 1996, Page(s):4 - 9
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (525 KB)

    A digital optical computer architecture consists of several stages, or slots, of optical arrays. Each slot can be viewed as a rectangular array of locations which are classified as vital and extraneous, depending on whether or not the location is on an optical signal path. A defective optical array can be used in a slot provided that the defective locations of the array do not coincide with the vi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of parallelization strategies for simulation of aerodynamics problem

    Publication Year: 1996, Page(s):10 - 15
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (436 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 LU-ADI method with Baldwin-Lomax turbulence model. The report discusses how the code is parallelized using the techniques. The convergence rate and computational speed-up of these two methods... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • File allocation for a parallel Webserver

    Publication Year: 1996, Page(s):16 - 21
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (538 KB)

    This paper considers the problem of allocating files in a document tree among multiple processors in a parallel webserver. It is assumed that access patterns are characterized by branching probabilities for an access that starts at a node and progresses down the tree. A combinatorial optimization problem is formulated that includes load balancing and communication costs. The general problem is sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel genetic algorithms on PARAM for conformation of biopolymers

    Publication Year: 1996, Page(s):22 - 26
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (381 KB)

    A software is developed using genetic algorithms to predict the structure of a polypeptide chain. The algorithm is based on the principle of evolution and it improves the solution of the posed problem by genetic operations crossovers and mutations. Dihedral angles (/spl phi/,/spl psi/) are taken as the basic variables for the structure of the molecules and genetic operations are carried over on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel SOLVE for direct circuit simulation on a transputer array

    Publication Year: 1996, Page(s):27 - 32
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (582 KB)

    Sparse matrix solution (SOLVE) is a dominant part of the total execution time in a circuit simulation program such as SPICE. For simulation of modern VLSI circuit designs, it is important that this time be reduced. This paper presents a block partitionable sparse matrix solution algorithm in which a matrix is divided into equal size blocks, and blocks are assigned to different processors for paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monte Carlo device simulation on PARAM

    Publication Year: 1996, Page(s):33 - 35
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (257 KB)

    Self-consistent ensemble Monte Carlo technique has been employed to obtain the velocity profiles for the n/sup +/-n-n/sup +/ structure. The simulator solves the Poisson equation at regular time intervals to update the electric field distribution and uses cloud-in-cell method for charge assignment. This report presents the parallel implementation of the device simulation on 9000/AA platform of CDAC... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of handwritten alphanumeric characters: a fuzzy neural approach

    Publication Year: 1996, Page(s):36 - 41
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (474 KB)

    An efficient supervised feedforward fuzzy neural classifier (SFFNN) and its associated training algorithm for classification of handwritten English alphabets and arabic numerals are proposed in this paper. The utilized classifier is a five layer network and the number of the minimum fuzzy neurons in the third layer is dynamically organized during its training. This classifier learns the membership... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for increasing the stream capacity of a multimedia server

    Publication Year: 1996, Page(s):43 - 48
    Cited by:  Papers (2)  |  Patents (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (603 KB)

    A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization, and thus minimize cost, the load must be balanced among the server's disks, interconnection network and scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed. This paper prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling object-oriented programs for distributed execution

    Publication Year: 1996, Page(s):49 - 54
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (519 KB)

    Techniques based on formal semantics are discussed for automatically generating parallelizing compilers for object-oriented programming languages. The denotational semantics of object-oriented programming languages are used to derive the control and data dependencies that exist within programs and this information may then be used to produce parallel object code by a compiler. This approach also e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The RAID configuration tool

    Publication Year: 1996, Page(s):55 - 61
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (598 KB)

    Disk Arrays or RAIDs are a widely accepted I/O system architecture, useful for a wide range of applications. Before a RAID can be used, one needs to configure the RAID to select parameters such as the RAID level to use, the stripe unit to use, how large a cache to use, and so on. Selecting these configuration parameters can be quite complex, yet no aids are available today to help the user configu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient compilation of concurrent call/return communication in actor-based programming languages

    Publication Year: 1996, Page(s):62 - 67
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (566 KB)

    Concurrent call/return communication (CCRC) allows programmers to conveniently express a communication pattern where a sender invokes a remote operation and uses the result to continue its computation. The blocking semantics requires context switching for efficient utilization of computation resource. We present a compilation technique which allows programmers to use CCRC with the cost of non-bloc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating concurrency and object-orientation using boolean, access and path guards

    Publication Year: 1996, Page(s):68 - 72
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (347 KB)

    Inheritance Anomaly is considered as a major problem in integrating object-orientation and concurrency. The anomaly forces redefinitions of inherited methods to maintain the integrity of concurrent objects. In this paper we discuss how the use of boolean, access and path guards attached to methods solve the problem of inheritance anomaly. Synchronization using boolean guards have known to be free ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compilation to parallel programs from constraints

    Publication Year: 1996, Page(s):73 - 79
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (685 KB)

    This paper describes the first results from research on the compilation of constraint systems into task level parallel programs in a procedural language. This is the only research of which we are aware which attempts to generate efficient parallel programs for numerical computation from constraint systems. Computations are expressed as constraint systems. A dependence graph is derived from the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite element calculations at the parallel computers Intel/Paragon, IBM SP-2, and a cluster of DEC-ALPHA workstations

    Publication Year: 1996, Page(s):82 - 87
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (583 KB)

    In many natural and engineering science applications, systems of partial differential equations have to be solved. The finite element method represents an effective tool to solve these systems, but a disadvantage arises due to the very high computation times regarding conventional serial computers. Therefore, the finite element code SMART has been parallelized and can now be executed on different ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program-level control of network delay for parallel asynchronous iterative applications

    Publication Year: 1996, Page(s):88 - 93
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Software distributed shared memory (DSM) platforms on networks of workstations tolerate large network latencies by employing one of several weak memory consistency models. Fully asynchronous parallel iterative algorithms offer an additional degree of freedom to tolerate network latency. They behave correctly when supplied outdated shared data. However these algorithms can flood the network with me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive integration using evolutionary strategies

    Publication Year: 1996, Page(s):94 - 99
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (567 KB)

    Multivariate integration problems arising in the real world often lead to computationally intensive numerical solutions. If the singularities and/or peaks in the integrand are not known a priori, the use of adaptive methods is recommended. The efficiency of adaptive methods depends heavily on focusing on the sub-regions that contain singularities or peaks in the integrands. In this paper, we prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite element applications of parallel adaptive integration strategies

    Publication Year: 1996, Page(s):100 - 105
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (554 KB)

    We present strategies for the parallel computation of the integrals typically arising in finite element problems. In order to deal efficiently with difficulties in the integrands affecting the domain in areas of which the exact locations may be unknown, a parallel adaptive strategy is applied to the entire domain. The elements comprising the domain form the initial pool of subregions in the adapti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed computation of inverse dynamics of robots

    Publication Year: 1996, Page(s):106 - 112
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (451 KB)

    This paper presents a task scheduling to perform parallel computation of dynamics of robots. For illustration, the inverse dynamic analysis considered is based on the Newton-Euler recursive formulation. The results are presented for a robot with six degrees of freedom. The task scheduling has been prepared using the time taken to execute mathematical operations, transfer data between processors an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DiET: a distributed extended transaction processing framework

    Publication Year: 1996, Page(s):114 - 119
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    DiET provides a framework to experiment with extended transaction models and also to synthesize new models. As case studies nested and split-join transaction types have been implemented. DiET is a framework loosely coupled with a distributed storage manager and PVM. Such a coupling enables DiET to cope up with a wide variety of storage manager and distributed process manager without any difficulty... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BAG real-time distributed operating system

    Publication Year: 1996, Page(s):120 - 125
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (626 KB)

    In this paper, three main parts of BAG real-time distributed operating system are introduced: task migration, load balancing and distributed file system. Task migration, based on EFSM programming model, is implemented as a means of load balancing mechanism. A file system supporting the task migration mechanism is also designed and developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded dynamic data allocation in distributed systems

    Publication Year: 1996, Page(s):126 - 131
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (695 KB)

    Recently, an interesting dynamic data allocation algorithm for the management of replicated data in distributed systems has been presented by Wolfson and Jajodia. We analyze this approach from cost as well as from availability perspectives and suggest an improved algorithm that exhibits superior characteristics. Our approach establishes lower and upper bounds in the number of replicas for guarante... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transparent parallel replication of logically partitioned databases

    Publication Year: 1996, Page(s):132 - 137
    Cited by:  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (575 KB)

    This paper presents a protocol for efficient transaction management in an environment of replicated autonomous databases. Each replicated copy has ownership over mutually exclusive portions of the database. The protocol improves response time and throughput by exploiting parallelism although reducing the degree of transaction isolation. Most modifications to the database are assumed to be on the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed directory scheme for information access in mobile computers

    Publication Year: 1996, Page(s):138 - 143
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    In this paper, we discuss the design aspects of a dynamic distributed directory scheme (DDS) to facilitate efficient and transparent access to information files in mobile environments. The proposed directory interface enables users of mobile computers to view a distributed file system on a network of computers as a globally shared file system. In order to counter some of the limitations of wireles... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel parallel join algorithms for grid files

    Publication Year: 1996, Page(s):144 - 149
    Cited by:  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the... View full abstract»

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