By Topic

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Date 14-16 Dec. 1994

Filter Results

Displaying Results 1 - 25 of 58
  • Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (444 KB)
    Freely Available from IEEE
  • Comprehensive operating system for highly parallel machine

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

    This paper describes the design and implementation of a comprehensive operating system (COS) for highly parallel machine. This is one of the research themes in the Japanese University Highly Parallel Research Project supported by the Special Grant of the Research Funds of Ministry of Education. The target machine is called JUMP-1 originally developed in this project. Several design policies are di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel graph isomorphism detection with identification matrices

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

    In this paper, we investigate some properties of identification matrices and exhibit some uses of identification matrices in studying the graph isomorphism problem, a well-known long-standing open problem. We show that, given two m×n identification matrices representing two graphs according to a certain relation, isomorphism can be decided efficiently in parallel if an m×(n-c) submatri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel relational database algorithms revisited for range declustered data sets

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

    Today available parallel database systems use conventional parallel hardware architectures employing a highly parallel software architecture. It is an emerging technique to speed up the execution by declustering the stored data sets among a number of parallel and independent disk drives. In this paper we revisit parallel relational database algorithms for range declustering. We adapt the conventio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gossiping on mesh-bus computers by packets

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

    A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel connectivity algorithms on permutation graphs

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

    In this paper, we shall present several algorithms for determining the maximum number of vertex connectivity, testing k-vertex connectivity, determining the maximum number of vertex disjoint s-t paths and finding k-vertex disjoint s-t paths problems on a permutation graph, respectively. We first give several O(n2) time sequential algorithms for determining the maximum number of vertez c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A detailed analysis of random polling dynamic load balancing

    Publication Year: 1994, Page(s):382 - 389
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Dynamic load balancing is crucial for the performance of many parallel algorithms. Random polling, a simple randomized load balancing algorithm, has proved to be very efficient in practice for applications like parallel depth first search. This paper presents a detailed analysis of the algorithm taking into account many aspects of the underlying machine and the application to be load balanced. It ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed validation of massively parallel machines

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

    In this paper, a distributed algorithm for validating message passing-machines is presented and evaluated. Our approach is based on adaptive distributed diagnosis of multiprocessor systems in a user environment where a full self-diagnosis is not needed. We analyze the algorithm performance using a model based on an open queueing network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message transfer algorithms on the recursive diagonal torus

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

    Recursive diagonal torus (RDT) is a class of interconnection network for massively parallel computers with 216 nodes. In this paper, message transfer algorithms on the RDT are proposed and discussed. First, a simple one-to-one message routing algorithm called the vector routing is introduced and the result of its practical extension called the floating vector routing is reported. Next, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for maintaining consistent view of processes in distributed systems

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

    In the paper, the problem of determining the global properties of distributed systems is addressed. At each moment during the execution of a system, every process has its knowledge about the system. By message passing the processes can exchange their knowledge. We present a general algorithm for a process to synthesize the knowledge that it obtains, and to maintain its consistent view about the sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel hypercube with lower latency

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

    In this paper, we present a hypercube with reduced diameter and latencies. This is achieved by reconnecting the hypercube with twisted and random connections while keeping the number of wires constant. This new topology is called RT-cube. The RT-cubes offer smaller diameter and reduced latencies compared to the normal hypercubes, resulting in a faster interconnection network topology. A packet swi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A greedy task clustering heuristic that is provably good

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

    A simple greedy algorithm is presented for task clustering with duplication (or recomputation) which, for a task graph with arbitrary granularity, produces a schedule whose makespan is at most twice optimal. Furthermore, the quality of the schedule improves as the granularity of the task graph increases. For example, if the granularity is at least ½, the makespan of the schedule is at most ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance evaluation procedure for a class of growable ATM switches

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

    We propose a modular ATM switching network by modifying the original delta network. It is composed of several stages of switching modules, and all the switching modules are of the same type of basic building block. In order to improve the performance, the channel group connecting the switching modules in all stages are expanded to contain more then one link. The switching system is in fact a discr... View full abstract»

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

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

    A fundamental problem in designing massively parallel computer systems and fast communication networks is the maximization of the number of nodes given a diameter and degree of a network. This maximal number is bounded above by the Moore bound. For undirected circulant graphs, an upper bound is also given but no exact formula has been found yet for degree ⩾6. A refinement on this upper bound i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining message switching with circuit switching in the Interconnection Cached Multiprocessor Network

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

    In distributed memory parallel machines, data access times can vary greatly depending on data location. This makes locality considerations important for improving performance. Switching locality is a special kind of locality which conventional networks fail to exploit fully. It refers to the phenomenon in which each computation entity in a parallel application switches most of its communication be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logic semantics for a class of nondeterministic concurrent constraint logic programs

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

    M.J. Maher (1987) proposed the ALPS class of committed-choice languages, which can be seen as a further development of concurrent logic programming languages in the direction of CLP(X). However, due to the lack of OR-nondeterminism, ALPS is a class of declarative algorithmic programming languages. In this paper, we present the FENG class of concurrent constraint logic programming languages and giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cube-connected modules: a family of cubic networks

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

    A family of cubic networks, named cube-connected modules, is proposed in this paper. The cube-connected modules network consists of modules which are interconnected as a hypercube. Any connected graph, e.g., cycle, hypercube graph, and complete graph, can serve as a module. Topological properties are investigated, and the problems of routing, broadcasting, embedding, and finding parallel routing p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathematic-physical engine: parallel processing for modeling and simulation of physical phenomena

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

    Mathematical modeling of various physical phenomena, ranging from fluid flow to electromagnetic field dynamics, from thermal patterns inside a semiconductor wafer to thermal patterns on a geophysical scale, and from combustion inside an automotive cylinder to ion transport across a biological membrane, is a challenge for the 1990s and beyond. These processes share in common a basic underlying stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for conservative parallel simulation of interconnection networks

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

    This paper addresses the use of parallel simulation techniques to speedup the simulation of multistage interconnection networks. The conventional null-message approach to resolving deadlock problem in conservative simulation is based on a lookahead mechanism. For some application domains, unfortunately, the lookahead information is not available. Consequently, the simulation using null messages wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for solving the token distribution problem on k-ary d-cube networks

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

    In parallel programs where the problem data is dynamically generated, it is very useful to be able to rely on an efficient load balancing algorithm. The token distribution problem (TDP) is a generalization of the static load balancing problem. The paper describes a novel algorithm for solving the TDP for k-ary d-cube topology networks. Compared to other algorithms, our method is more general and d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cenju-3 parallel computer and its application to CFD

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

    The exploitation of the effectiveness of parallel computers for computational fluid dynamics (CFD) requires an efficient parallel algorithm for numerical solution of the Navier-Stokes equations. This paper discusses the parallelization of an incompressible Navier-Stokes equation solver, and its implementation to the Cenju-3 parallel computer. We mainly focus our attention to the parallel solution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture analysis for image processing on general-purpose parallel machines

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

    The problem considered in this paper is the definition of an efficient parallel algorithm for texture analysis of an image. The target architectures are distributed-memory general-purpose MIMD parallel machines. The solutions proposed here are based on two different methods, the Statistic Feature Matrix and the Wavelet Decomposition View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementation techniques for vector memory systems

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

    Existing vector machines' memory systems use heavy interleaving and SRAM technology for faster data access. In this paper, we present an efficient vector memory architecture that adopts prime-degree memory interleaving and exploits the capabilities of new-generation DRAM chips with small SRAM cache. The major contribution of this paper is an incremental indexing scheme for prime-degree memory inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systems

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

    Dynamic load balancing schemes are essentially significant for efficiently executing non-uniform problems in highly parallel multicomputer systems. Their objective is to minimize the total execution time of single applications. This paper proposes adaptive receiver initiated diffusion (ARID) strategy for distributed dynamic load balancing. Its principle and control protocol are described. The comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel maximal cliques algorithms for interval graphs with applications

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

    In this paper, an O(n log n) time algorithm for finding all the maximal cliques of an interval graph is proposed. This algorithm can also be implemented in parallel in O(log n) time using O(n2) processors. The maximal cliques of an interval graph contain important structural information. Many problems on interval graphs can be solved after all the maximal cliques are known. It is shown ... View full abstract»

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