Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

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
  • 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.
  • 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.
  • Transit: reliable high speed interconnection technology

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

    Important improvements in network bandwidth, latency, and fault tolerance can be provided by careful selection of the protocols, choice of network topology, details of interconnection wiring, and basic wire driving technologies. We examine the improvements in some of these areas as part of the Transit project at the MIT Artificial Intelligence Laboratory 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.
  • Architectural issues in designing heterogeneous parallel systems with passive star-coupled optical interconnection

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

    This paper investigates architectural and communication issues in designing heterogeneous parallel systems. The emerging high speed passive star-coupled optical interconnection using wavelength division multiplexing is considered as the system interconnect to provide high bandwidth communication demanded by heterogeneous systems. A representative master-slave computational model together with two ... 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 (2)
    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.
  • Matrix multiplication on the MasPar using distance insensitive communication schemes

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

    Two parallel matrix multiplication algorithms are presented in this paper. These algorithms execute on a grid with toroidal connections. Their novelty is the utilization of communication schemes which theoretically are distance insensitive; the impact on the communication and computational complexities and costs compared with a theoretical analysis, is analyzed and evaluated. The proposed algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Organization of a parallel virtual machine

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

    A virtual parallel machine is presented. The virtual machine includes the following programs: loop parallelization, dependence graph building, scheduling job programs, compiler and simulating programs. The basic principles and ideas, on which the programs were realized, are expounded. It is enumerated the basic opportunities and advantages of the virtual machine. The results of simulation on the v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the VLSI layout complexity of homogeneous product networks

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

    In this paper we obtain bounds on the area and wire length required by VLSI layouts of homogeneous product networks with any number of dimensions. The lower bounds are obtained by computing lower bounds on the bisection width and the crossing number. The upper bounds are derived by using traditional frameworks like separators and bifurcators, as well as a new method based on combining collinear la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal total exchange in linear arrays and rings

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

    In this paper we consider the problem of total exchange (or multi-scattering) in the context of linear arrays and rings. Such a communication mode occurs when each node has a distinct message to send to every other node in the network. The problem has been studied extensively, although no optimal algorithm has been proposed for the two networks of interest. We present simple algorithms for the two... 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.
  • Massively Parallel Processing Project as a Priority Area of Research for the Ministry of Education

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

    Massively Parallel Processing Project started in 1992 as a Priority Area of Research for the Ministry of Education in Japan. The objective of this research project is to establish the basic technology of massively parallel processing which is expected to be the fundamental tool to develop the high-level technologies of 21 century. The main goal of this project is to build up a system prototype of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message-based efficient remote memory access on a highly parallel computer EM-X

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

    Communication latency is central to multiprocessor design. This report presents the design principles of EM-X multiprocessor towards tolerating communication latency. Multi-threading principle is built in the EM-X to overlap communication and computation for latency tolerance. In particular, we present two types of hardware support for remote memory access: (1) priority-based packet scheduling for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Increase analysis in the total execution time of a parallel program

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

    Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of 4-dimensional PANDORA networks

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

    The Melbourne University Optoelectronic Multicomputer Project is investigating dense optical interconnection networks capable of providing low latency data transfers of small data items. Such capabilities are useful in the exploitation of small grain parallelism. In many cases, reducing the grain size of tasks increases the amount of parallelism which can be found in the program. Our networks use ... 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
    Cited by:  Papers (3)
    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.
  • 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.
  • Overview of the JUMP-1, an MPP prototype for general-purpose parallel computations

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

    We describe the basic architecture of JUMP-1, an MPP prototype developed by collaboration between 7 universities. The proposed architecture can exploit high performance of coarse-grained RISC processor performance in connection with flexible fine-grained operation such as distributed shared memory, versatile synchronization and message communications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm

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

    We first present a unified formulation to three problems in VLSI physical design: layout compaction, wire balancing and integrated layout compaction and wire balancing problem. The aim of layout compaction is to achieve minimum chip width. Whereas wire balancing seeks to achieve minimum total wire length, integrated layout compaction and wire balancing seeks to minimize wire length maintaining the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem

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

    In this paper we consider the simple polygon visibility problem: Given a simple polygon P with N vertices and a point z in the interior of the polygon, find all the boundary points of P that are visible from z. We present an O(logN loglogN) time algorithm that solves the simple polygon visibility problem on a √N×√N RMESH. Previously, the best known algorithm for the problem on a ... 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.
  • NCIC's research and development in parallel processing

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

    National Research Center for Intelligent Computing Systems (NCIC) is the unique national hi-tech R/D center for advanced computing technology in China. We introduce China's Hi- Tech R&D Programme (863 programmes) and NCIC, and we report on the state of the art of parallel processing at NCIC. The article discusses the key technologies being exploited by the representative Chinese R & D team... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quicksort and permutation routing on the hypercube and de Bruijn networks

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

    We consider the problems of sorting and routing on some unbounded interconnection networks, namely hypercube and de Bruijn network. We first present two efficient implementations of quicksort on the hypercube. The first algorithm sorts N items on an N-node hypercube, one item per node, in O((log2 N)/(log log N)) time with high probability, while the other one sorts N items on an (N/log ... View full abstract»

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