Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing

2-6 May 1994

Filter Results

Displaying Results 1 - 25 of 77
  • Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • On scientific research, applications software development, and industrial use of massively parallel computing systems

    Publication Year: 1994, Page(s):217 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A healthy massively parallel computing system industry requires a well-defined market for their products. The market for massively parallel computing systems has remained stubbornly ill-defined for at least a decade. The primary reason for this is that industrial corporations have not been able to measure value in the new computing technology, due to the absence of commercially supported applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved bounds on linear size expander

    Publication Year: 1994, Page(s):96 - 101
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Linear size expanders have been studied in many fields for their practical use, which is the possibility to connect large numbers of device chips in parallel communication systems. One of the critical points in parallel computer designs has been very high cost of communication between processors and memories. Currently, linear size expanders can be used to construct theoretically optimal interconn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication techniques for a self-timed massively parallel architecture

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

    A self-timed bit-serial massively parallel architecture is currently being developed to behave correctly independent of intra- and inter-module delays. The self-timed approach abolishes the global clock thus overcoming the limitations associated with global control. These limitations include problems of fixed processing time, clock skew and restricted scalability. This paper introduces self-timed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward a tool for automatic implementation of parallel image processing applications

    Publication Year: 1994, Page(s):382 - 390
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    This paper describes a research proposal related to the design of parallel software for image processing. The proposal focuses on the design of a tool, which generates the best implementation of a given application taking into account different parallel programming models available on different parallel (heterogeneous) computers. All steps needed for the automatic mapping of applications are prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of a MSIMD system with resequencing

    Publication Year: 1994, Page(s):339 - 342
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    In this work we study the performance of a multi-processor system model which executes multiple SIMD jobs. Such a parallel computer organization contains multiple Control units (CUs) which share a resource pool of a finite number of Processing Elements (PEs) and operates multiple single-instruction-multiple-data streams (MSIMD). We assume that after the CUs service, resequencing of SIMD jobs takes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of parallel machine models from the point of view of scalability

    Publication Year: 1994, Page(s):258 - 267
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    We compare various models of parallel machines and show that they can be classified in two classes: algorithm oriented or execution oriented. None of them are really satisfying from the user's point of view. Hence bridging models have been proposed. Contrarily to what is done in sequential where a two-level decomposition is used (programmimg-compiling), we assert that a parallel programming method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General purpose massively parallel systems: the role of programming environments

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

    One of the key obstacles to the widespread adoption of massively parallel computers is the lack of programming environments to support the development of software that can achieve both portability and high performance. The paper discusses alternative methodologies to define static and dynamic tools of this environment. While the main problems posed by a static tool are input dependant behaviour an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic partitioning of large multicomputer systems

    Publication Year: 1994, Page(s):413 - 417
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RETRAN: a recurrent paradigm for massively parallel array computing

    Publication Year: 1994, Page(s):478 - 487
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    An applicative paradigm of parallel array processing based on recurrence relations and a data-parallel overloading of constants is presented. It is shown that the suggested principle of anti-currying together with introduction of function-based, eager arrays result in a denotational system superior to array extensions of pragmatic languages in that it can exploit spatial symmetries of arrays to un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing policy in a massively parallel semantic database

    Publication Year: 1994, Page(s):328 - 332
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    We are developing a massively parallel semantic database machine. Our basic semantic storage structure insures balanced load for most parts of the database. For the other parts of the database, a load balancing algorithm is proposed herein, which allows inexpensive dynamic rebalancing without substantial negative impact on queries and transactions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massive parallelism on a chip-VLSI aspects involving dynamic logic

    Publication Year: 1994, Page(s):230 - 237
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    In most cases performance of parallel machines is proven with special applications that enable for adequate granularity, and thus are able to show the performance. Looking at common machine types, the involved techniques do not solve the problem of fast communication among processing elements. In fact, nearly any of these types is capable of really fine grain granularity. In most real applications... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load distribution in massively parallel architectures: the parallel objects example

    Publication Year: 1994, Page(s):318 - 322
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The paper presents the mechanisms for dynamic load distribution implemented within the support for the Parallel Objects (PO for short) programming environment. PO applications evolve depending on their dynamic need of resources, enhancing application performance. The goal is to show how dynamic load distribution can be successfully applied on a massively parallel architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workshop on parallel and distributed spatial data structures (P-SPADS)

    Publication Year: 1994, Page(s):221 - 222
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    The main objective of this workshop is to investigate parallel and distributed architectures, algorithms and data structures for the processing of spatial data. The aim is to identify advantages and disadvantages of the different combinations of hard and soft technologies for different classes of applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conservative and optimistic distributed simulation in massively parallel computers: a comparative study

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

    The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservative and parallel optimistic. For the proposed model, the conservative simulator shows better speedups. The obtained results show that a significant improvement on execution time can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controlling (virtual) multicomputers

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

    A multicomputer is a number of interconnected heterogeneous computing systems being used as a single computing system. To factor out the actual number and kinds of the resources available in any one (physical) multicomputer we propose the virtual multicomputer in which an abstract archetype of each kind (workstation, shared-memory multiprocessor, distributed-memory multiprocessor, array processor)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of dynamic load balancing algorithms for multicomputers

    Publication Year: 1994, Page(s):538 - 540
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Multicomputers are often dedicated to specialized applications. However, they are increasingly based on general purpose microprocessors, so they can be used for general purpose applications if they provide some support to users, as load balancing. To better understand the behavior of load-balancing algorithms on multicomputers, we have developed a simulation environment using QNAP. The originality... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Problems on routing bounded distance assignments in hypercubes

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

    The problem of whether an assignment in the hypercube Hn, where the distance from the source to the destination is bounded, can be routed with minimum distance and bounded congestion is considered. It is shown that this is so, if assignments of given “type” can be so routed. Of particular interest is whether for distance 3 and fixed type, minimum distance and congestion 1 ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Paprica massively parallel processor

    Publication Year: 1994, Page(s):16 - 30
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    This paper describes a complete 6-year project, starting from its theoretical basis up to the hardware and software system implementation, and to the description of its future evolution. The main goal of the project is to develop a subsystem that operates as a processing unit attached to a standard workstation and in perspective as a low-cost low-sized specialized embedded system devoted to low le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of the matching unit of a massively parallel dataflow computing system

    Publication Year: 1994, Page(s):62 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    This paper describes a Massively Parallel Computing System, named Recursively Structured Parallel Computer-RSPC, designed to work as a dataflow distributed computer, and presents the design of the matching store of each node. That machine, structured as a multicomputer based on hierarchical buses, can have thousands of nodes. Each node, acting as a dataflow processor, can execute a part of a dataf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional and iterative structures using a homogeneous static dataflow graph model

    Publication Year: 1994, Page(s):391 - 401
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    This paper presents a static dataflow graph model, where only data tokens are allowed to flow. The proposed model is formally described, and the dataflow graph is obtained by employing only actors with homogeneous I/O conditions. Each actor, which executes an elemental operation, is characterized by having one output and two input arcs. Even though no control tokens are allowed, so that no T-gate,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Avoiding memory contention on tightly coupled multiprocessors

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

    We propose a novel method of scheduling memory access on a non blocking interconnection network that provides only one-to-one communication. Conflicts at the switches can be avoided if the accesses are scheduled so that no two processors attempt to access the same memory at the same time. We show how such a scheduling problem can be mapped to an edge coloring problem for a directed graph and prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelined microprocessor-based architecture: on-the-fly processing

    Publication Year: 1994, Page(s):196 - 200
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    This paper presents a new pipelined microprocessor-based architecture (PMA) using On-The Fly processing. The effectiveness of the PMA has been investigated for several applications such as database operations and very large databases using WORM (Write-Once-Read-Many) optical disk technology. In this paper, a pipelined information retrieval algorithm and a pipelined join algorithm are presented and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance implications of task routing and task scheduling strategies for multiprocessor systems

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

    In distributed task ready queue organizations, task routing refers to how ready tasks are assigned to processors in the system and task scheduling refers to how these tasks are scheduled on the assigned processor. In this paper, we consider the interaction between task routing and task scheduling strategies and their impact on the performance of the distributed task queue organization. We consider... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast algorithm for data exchange in reconfigurable tree structures

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

    The paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination n... View full abstract»

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