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
  • Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs

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

    In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs-known as regular stream flow graphs-commonly used in Digital Signal Processing applications. We relate the buffer sharing problem to that of finding independent sets in weighted circular arc graph. An important difference between the tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of dynamic scheduling techniques for multiscalar processors

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

    The multiscalar processing model is a recently proposed model for exploiting large amounts of instruction level parallelism from programs written in ordinary, high-level languages. It splits a sequential program into smaller tasks, and exploits instruction level parallelism by executing multiple tasks in parallel using multiple execution units. The parallelly executed tasks can have both control a... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (504 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.
  • A robust and flexible microeconomic scheduler for parallel computers

    Publication Year: 1996, Page(s):406 - 412
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    We compare the behavior of a microeconomic scheduler with three commonly used scheduling policies under a systematically designed set of experiments. We experiment with three different income distribution policies within the economic scheduling algorithm. We show that the other scheduling policies can be considered as limiting cases of the microeconomic scheduling policy. Our results show that the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast communication algorithm on a wormhole-routed star graph interconnection network

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

    A contention-free and deadlock-free unicast based multicast algorithm is developed for star graph interconnection networks. The algorithm is developed recursively, and is based on the hierarchical properties of the star graph. The wormhole communication technique is used, and it is assumed that one input channel can drive only one output channel at a time. In order to eliminate contention in the m... 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.
  • A new study for fault-tolerant real-time dynamic scheduling algorithms

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

    Many time-critical applications require predictable performance. Tasks corresponding to these applications have deadlines to be met despite the presence of faults. Failures can happen either due to processor faults or due to task errors. To tolerate both processor and task failures, the copies of every task have to be mutually excluded in space and also in time in the schedule. We assume, each tas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting parallelism in high performance embedded system scheduling

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

    This paper defines a new paradigm for high performance embedded systems. We present a model of distributed embedded control system software to capture the real-time computing requirements of complex computer-based systems. The hierarchical software architecture defines the notion of a software path the construct identified by studying embedded real-time applications. We present a technique for dyn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel prefix algorithms on fully connected message-passing computers

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

    Given n values ν(0), ν(1), …, ν(n-1) and an associative binary operation, denoted by o, the prefix problem is to compute the n prefixes ν(0) o ν(1) o…0 ν(i), 0⩽i⩽n-1. We are interested in prefix computation on message-passing fully connected multicomputers, in which each processor can only send or receive a message to or from any other processor in a communi... 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.
  • Distributed computation of inverse dynamics of robots

    Publication Year: 1996, Page(s):106 - 112
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 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.
  • 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (524 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.
  • 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.
  • 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.
  • On-line scheduling of hard real-time tasks on multiprocessors

    Publication Year: 1996, Page(s):392 - 399
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We consider the problem of on-line scheduling of a set of hard real-time tasks in an environment where future task parameters are not known a-priori. First, we derive necessary and sufficient conditions to determine whether a given set of tasks with known parameters is feasible using a set of m processors. Next, we consider two sets of tasks T0 and Tt where T0 is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cidre: programming with distributed shared arrays

    Publication Year: 1996, Page(s):439 - 444
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A programming model that is widely approved today for large applications is parallel programming with shared variables. We propose an implementation of shared arrays on distributed memory architectures: it provides the user with an uniform addressing scheme while being efficient thanks to a logical paging technique and optimized communication mechanisms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of piggybacked token-passing MAC protocol with variable buffer size for WDM star coupled photonic network

    Publication Year: 1996, Page(s):307 - 312
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The piggybacked token-passing protocol suitable for use with multichannel fibre optic network employing WDM is considered for its performance studies using the semi-Markov modelling technique. The protocol is then extended to include for a variable buffer size and a priority scheme to examine its suitability in real-time. Various expressions, like average delay and mean queue length are derived in... 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (560 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.
  • 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.
  • Compilation to parallel programs from constraints

    Publication Year: 1996, Page(s):73 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 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.
  • 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.