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 commercial reuse | PDF file iconPDF (374 KB)
    Freely Available from IEEE
  • GSE: a generalized full-access multistage interconnection network with minimum cost

    Publication Year: 1996, Page(s):176 - 181
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    We propose a new multistage interconnection network (MIN) called Generalized Shuffle Exchange (GSE) to connect N processors and N resources where N need not be a power of 2, but only an even number. It uses N/2 switches per stage and the number of stages is equal to [log N]. We show that GSE is a full-access network. Routing between any input-output pair in GSE is simple and can be done by using a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A DSM-Based Structural Programming Environment for Distributed and Parallel Processing

    Publication Year: 1996, Page(s):469 - 473
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 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.
  • Index of authors

    Publication Year: 1996, Page(s):475 - 476
    Request permission for commercial reuse | PDF file iconPDF (127 KB)
    Freely Available from IEEE
  • A parallel algorithm for stereo vision based on correlation

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

    An important research topic in the field of image processing is stereo vision. Stereo vision is the process of constructing a 3D model of a scene through processing two 2D images of this scene. The main problem is the construction of a disparity map. This is a map that describes which points in the two images correspond to the same point in the 3D scene. This paper describes the design of a parall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of bit-serial and multi-bit processor elements in a real-time signal processing SIMD architecture

    Publication Year: 1996, Page(s):245 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    Today, it is accepted to say that the more bits you have got in your micro processor the better performance you will have. This is probably true if only the performance is concerned. However, if the chip size of the processor is taken into account this might not be the case. In massively parallel architecture, chip area is an important figure. This is especially true for air-borne and, to certain ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Independent node and process recovery in message passing distributed systems

    Publication Year: 1996, Page(s):283 - 288
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Consistent recovery from process failures is an essential component of reliable distributed systems. Many existing recovery techniques use asynchronous message logging and checkpoints. Most of the present approaches depend on logged states of non-fail processes for recovery. A model of recovery based on the current active states of processes has been proposed. The algorithm considers recoverable s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient encoding algorithm for image compression hardware based on cellular automata

    Publication Year: 1996, Page(s):239 - 244
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Analytical study of three neighbourhood two state per cell Cellular Automata (CA) behaviour is a comparatively recent phenomenon. A wide variety of applications have been developed utilizing the elegant structure of group CA. In this paper some of the characterizations of the state transition behaviour of non-group CA are reported. These results are subsequently utilized to develop an efficient pa... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (540 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.
  • A protocol for lossy transmission of digital video

    Publication Year: 1996, Page(s):277 - 282
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The transmission of digital video requires a large amount of bandwith. Such bandwidths are typically not available on typical computer networks. Apart from bandwidth, variable network latency has a considerable effect on video transmission. However, the human vision system is fairly tolerant to relatively poor quality moving images. It is argued that there are practical applications that can benef... 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
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 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.
  • Efficient edge extraction of images by directional tracing

    Publication Year: 1996, Page(s):233 - 238
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The ability to recognize edges of an object fast and accurately is a fundamental goal in computer vision and image processing. The facility is important in automatic manufacturing environment in industry. This paper defines and investigates an efficient method of edge extraction of image using directional tracing algorithm. Based on the approach of linear feature extraction presented by R. Nevatia... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (420 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.
  • Communicating data-parallel tasks: an MPI library for HPF

    Publication Year: 1996, Page(s):433 - 438
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    High Performance Fortran (HPF) has emerged as a standard dialect of Fortran for data-parallel computing. However, HPF does not support task parallelism or heterogeneous computing adequately. This paper presents a summary of our work on a library-based approach to support task parallelism, using MPI as a coordination layer for HPF. This library enables a wide variety of applications, such as multid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerant networks of workstations

    Publication Year: 1996, Page(s):271 - 276
    Cited by:  Patents (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Networks of workstations make cheap and powerful parallel processors and many systems have been demonstrated using Unix workstations. Personal computers, with their cheap, high performance CPUs, can also be used in a similar way. However, if we are to exploit the multitudes of PCs that sit on desks idle for much of the time, we need robust systems. The uncontrolled environment and physical separat... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (476 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.
  • Bounded dynamic data allocation in distributed systems

    Publication Year: 1996, Page(s):126 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 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.
  • Two-dimensional orthogonal tiling: from theory to practice

    Publication Year: 1996, Page(s):225 - 231
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    In pipelined parallel computations the inner loops are often implemented in a block fashion. In such programs, an important compiler optimization involves the need to statically determine the grain size. This paper presents extensions and experimental validation of the previous results of Andonov and Rajopadhye (1994) on optimal grain size determination 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (492 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.
  • Monte Carlo device simulation on PARAM

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

    Self-consistent ensemble Monte Carlo technique has been employed to obtain the velocity profiles for the n+-n-n+ 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 platfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized hypercube-connected-cycle: an efficient network topology

    Publication Year: 1996, Page(s):182 - 187
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A new family of interconnection network, called Generalized Hypercube-Connected-Cycle (GHCC), is proposed. The topology is defined with two integer parameters l and m such that the total number of nodes N=lml, degree of each node δ=m+1. The diameter D=[5l/2]-2, when l⩾4, m≠1 and D=[5l/2]-1 when l⩽3 m≠1. The topology offers a design flexibility in the sense that out o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing string-to-string correction and longest common subsequence problems on the Sequent Symmetry multiprocessor

    Publication Year: 1996, Page(s):330 - 335
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    This paper implements and analyzes the performance of parallel algorithms for the string-to-string correction and the longest common subsequence (LCS) problems, on the shared-memory Sequent Symmetry multiprocessor machine. The speedup of the first algorithm is 12.686 with 15 processors for a sequence of length 800, while the speedup of the LCS algorithm is 3.227 employing 8 processors for a sequen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive resource allocation for embedded parallel applications

    Publication Year: 1996, Page(s):425 - 431
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Parallel and distributed computer architectures are increasingly being considered for application in a wide variety of computationally intensive embedded systems. Many such applications impose highly dynamic demands for resources (processors, memory, and communication network), because their computations are data-dependent, or because the applications must constantly interact with a rapidly changi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing strategies for symbolic vision computations

    Publication Year: 1996, Page(s):263 - 269
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Most intermediate and high-level vision algorithms manipulate symbolic features. A key operation in these vision algorithms is to search symbolic features satisfying certain geometric constraints. Parallelizing this symbolic search needs a non-trivial algorithmic technique due to the unpredictable workload. In this paper, we propose load balancing strategies for parallelizing symbolic search opera... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (536 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.