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
  • Routing, scheduling, timing and intractability

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

    The management of the various cooperation modes and timing requirements in the case of a large number of tasks poses interesting theoretical problems in massively parallel environments. These systems are in general fully distributed ones, preventing coherent observability. Moreover, their configurations may change dynamically because of failures and/or modifications. Thus no optimal algorithms can... 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.
  • 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.
  • Experiences in using parallel systems for land information management

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

    In this paper we report about our experiences in research projects dealing with the use of parallel system technology for the management of land information. From these experiences we have derived a characterization in terms of user requirements, system requirements and system architecture. The basic feature of a system dealing with planning and decision making problems in the context of land mana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding tree structures in MPCs: application to the MasPar MP-2

    Publication Year: 1994, Page(s):132 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Trees are an important class of computational structures due to their favourable property of logarithmic path from the root to any leaf element. Mapping problems arise when the tree structure differs from the processor interconnection of the parallel computer. The MasPar's MP-2 is a massively parallel computer where processors are interconnected via the X-Net neighborhood two-dimensional mesh and ... 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.
  • A VLSI 128-processor chip for multiresolution image processing

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

    This paper presents the design of a multiprocessor chip integrating 128 simple processors arranged as a mesh of 8 rows by 16 columns. This mesh of PEs is intermingled with a dual mesh of switching elements, that interconnect the PEs and reconfigure them into one of three topologies. i) an 8-connected standard mesh, ii) a set of 4-connected independent meshes: iii) a quad-tree. This architecture is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping iterative algorithms onto processor arrays by the use of Petri Net models

    Publication Year: 1994, Page(s):140 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    In this paper, Petri Nets (PNs) are used for deriving efficient mapping transformations of a wide class of algorithms to processor arrays. In the proposed methodology, given an algorithm and the interconnections of the processor array, two PNs are constructed: one that is related to the algorithm and one that is related to the processor array. The former PN models the execution of the algorithm an... 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.
  • Technology against vision architectures

    Publication Year: 1994, Page(s):239 - 257
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1972 KB)

    Understanding what the problems are in robot-vision architecture, requires a better comparison of major features. But a zoology of vision machines is questioned when, aiming for a well informed architectural feature choice, a rapid presentation of technological trends in the field is proposed. Then an approach closer to physics prompts to a classification from a control point of view: it reveals s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High precision arithmetic units for fine-grain massively parallel computing

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

    In this paper we deal with new high precision arithmetic units (AUs). These AUs are specialized in the computation of one arithmetic operation (division, addition, etc.), but when hundreds of them are interconnected by a reconfigurable network, a parallel architecture that uses massive digit-level pipelining between floating-point arithmetic units (allowing fast computation of scientific jobs) bec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polygonal approximation of image contours on parallel machines

    Publication Year: 1994, Page(s):308 - 316
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    In this paper, we present the parallel implementation of an algorithm for polygonal approximation of image contours-one of the steps involved in image processing for two-dimensional machine vision. The proposed algorithm proved to be a very good compromise between performance-typical of fast, scan-along (i.e., single-pass) algorithms-and quality-usually maximized by slow, iterative algorithms. A c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divide-and-conquer minimal-cut bisectioning of task graphs

    Publication Year: 1994, Page(s):155 - 162
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    This paper proposes a method for partitioning the vertex set of an undirected simple weighted graph into two subsets so as to minimise the difference of vertex-weight sums between the two subsets and the total weight of edges cut (i.e., edges with one end in each subset). The proposed heuristic algorithm works in a divide-and-conquer fashion and is a modification of an algorithm suggested in the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel tabu search versus parallel evolution strategies

    Publication Year: 1994, Page(s):564 - 569
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    There exists in scientific, industrial and financial communities a very strong request for techniques able to efficiently solve complex optimization problems. Because of this, several techniques are being currently investigated. Among them evolutionary algorithms and tabu search seem very interesting, not only for their intrinsic features but also because they both are easily parallelizable, so th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process migration protocols for massively parallel systems

    Publication Year: 1994, Page(s):84 - 95
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    Process migration is known as the run time relocation of a process within a network of processors. This capability is mainly used for efficient management of resources in a distributed system. This paper deals with the construction of process migration mechanisms for Massively Parallel Systems (MPS). In particular, we are interested in the correction of communications in presence of migration. Man... 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.
  • 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.
  • 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.
  • The LoGo structuring scheme for distributed shared memory systems

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

    In page based distributed shared memory systems false sharing is caused by locating several consistency units into the same transportation unit. We introduce a structuring scheme which combines the transparent access model known from the shared memory approach and the knowledge of discrete events to make data consistent from the message passing approach. The local-global (LoGo) scheme switches bet... 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.
  • 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.
  • On the parallel execution of combinatorial heuristics

    Publication Year: 1994, Page(s):423 - 427
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The effectiveness of combinatorial search heuristics, such as genetic algorithms (GA), is limited by their ability to balance the need for a diverse set of sampling points with the desire to quickly focus search upon potential solutions. One of the methods often used to address this problem is to simulate the theory of punctuated equilibria in the GA. The GA introduced uses the basic premises deri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data parallel approach to Boolean function manipulation using BDDs

    Publication Year: 1994, Page(s):163 - 175
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The paper describes an Electronic CAD package exploiting the CM-200 architecture to manipulate boolean functions. The package exploits Binary Decision Diagrams (BDDs) to symbolically operate with boolean functions. The data parallel approach is based on distributing BDD nodes do the available Processing Elements and traversing BDDs in a breadth-first manner. The behaviour of the algorithm is studi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supports for performance evaluation in heterogeneous distributed environments

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

    In heterogeneous environments, very sophisticated modelling techniques and tools are required for the analysis of interactions between hardware and software subsystems. After a detailed discussion about performance evaluation of heterogeneous systems, an online monitoring tool for heterogeneous distributed systems is presented. Portability, modularity and a powerful graphic interface are the main ... View full abstract»

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