Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)

20-20 Dec. 1998

Filter Results

Displaying Results 1 - 25 of 63
  • Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (95 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1998, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (250 KB)
    Freely Available from IEEE
  • How to improve local load balancing policies by distorting load information

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

    The paper focuses on local load balancing policies for massively parallel architectures and introduces a new scheme for load information exchange between neighbor nodes. The idea is to distort the exchanged load information to let the policy keep into account a more global view of the system and overcome the limits of the local scope. The presented scheme has been integrated into two variants of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near optimal algorithms for scheduling independent chains in BSP

    Publication Year: 1998, Page(s):310 - 317
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The aim of this work is to show that scheduling a set of independent chains on a parallel machine under the BSP model is a difficult optimization problem which can be easily approximated in practice. BSP is a machine independent computational model which is becoming more and more popular. Finding the optimal solution when the number of processors is fixed is shown to be hard. Efficient heuristics ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor allocation using user directives in mesh-connected multicomputer systems

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

    Contemporary processor allocation schemes for multicomputers suffer from a fragmentation problem which causes underutilization of the processing nodes. The RSR and ANCA schemes, based on the concepts of size-reduction and non-contiguous allocation, show considerable performance improvement. However the penalties associated with these schemes limit their usage in environments with memory-bounded or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical architecture for parallel query processing on networks of workstations

    Publication Year: 1998, Page(s):351 - 358
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Networks of workstations (NOWs) are cost-effective alternatives to multiprocessor systems. Recently, NOWs have been proposed for parallel query processing. Idle CPU cycles of workstations in a NOW-based system can be used to process database query operations. We report on the performance of the hierarchical architecture for parallel query processing on a NOW. We have implemented the hierarchical a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extrapolation in distributed adaptive integration

    Publication Year: 1998, Page(s):88 - 95
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    The paper addresses the design of distributed methods which incorporate numerical extrapolation into adaptive multivariate integration, in order to increase the functionality of the integration algorithms. When attempting to deal with singularities, adaptive integration algorithms need a very fine subdivision in the proximity of these “hot spots”. This is not practical in higher dimens... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GLB: a low-cost scheduling algorithm for distributed-memory architectures

    Publication Year: 1998, Page(s):294 - 301
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    This paper proposes a new compile time scheduling algorithm for distributed-memory systems, called Global Load Balancing (GLB). GLB is intended as the second step in the multi-step class of scheduling algorithms. Experimental results show that compared with known scheduling algorithms of the same low-cost complexity, the proposed algorithm improves schedule lengths up to 30%. Compared to algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One to all broadcast in hyper butterfly networks

    Publication Year: 1998, Page(s):155 - 162
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    The authors further investigate the topological properties of the hyper butterfly networks; they develop algorithms for constructing edge disjoint spanning trees in wrapped butterfly graphs and hyper butterfly networks and they use those results to design asymptotically optimal one-to-all broadcast algorithms in those two classes of networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PERL-a registerless architecture

    Publication Year: 1998, Page(s):33 - 40
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Reducing processor memory speed gap is one of the major challenges computer architects face today. Efficient use of CPU registers reduces the number of memory accesses. However, registers do incur extra overhead of load/store, register allocation and saving of register context across procedure calls. Caches however do not have any such overheads and cache technology has matured to the extent that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selection algorithms for parallel disk systems

    Publication Year: 1998, Page(s):343 - 350
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    With the widening gap between processor speeds and disk access speeds, the I/O bottleneck has become critical. Parallel disk systems (PDS) have been introduced to alleviate this bottleneck. We present deterministic and randomized selection algorithms for parallel disk systems. The algorithms to be presented, in addition to being asymptotically optimal, have small underlying constants in their time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global reactive congestion control in multicomputer networks

    Publication Year: 1998, Page(s):179 - 186
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    In this paper we develop a general approach to global reactive congestion control in multicomputer networks. The approach uses a timeout mechanism to detect congestion, and exploits control lines such as those used for handshaking in the flit-level flow control of wormhole routers to distribute information about congestion. It is also based on a mechanism that limits the demands placed by the netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple optimal list ranking algorithm

    Publication Year: 1998, Page(s):60 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We consider the problem of ranking an N element list on a P processor EREW PRAM. Recent work on this problem has shown the importance of grain size. While several optimal O(N/P+log P) time list ranking algorithms are known, Reid-Miller and Blelloch (1994) recently showed that these do not lead to good implementations in practice, because of the fine-grained nature of these algorithms. In Reid-Mill... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of penetration measures for convex polygons and polyhedra for graphics applications

    Publication Year: 1998, Page(s):81 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    Algorithms to compute measures of penetration between convex polygonal objects in ℜ2 and convex polyhedral objects in ℜ3 are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WADE: a Web-based automated parallel CAD environment

    Publication Year: 1998, Page(s):473 - 480
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    We present a novel framework of a Web-based automated parallel CAD environment. The goal of this project is to make available to the CAD community a growing number of design and test applications that support standard interfaces and execute efficiently in a parallel environment. The design files of a user working on a remote machine are transparently shipped to the local Compute Center, the releva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategies for parallel implementation of a global spectral atmospheric general circulation model

    Publication Year: 1998, Page(s):452 - 458
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    We discuss the parallel implementation of a global spectral atmospheric general circulation model on a message passing platform. We also discuss strategies that need to be employed to improve performance on parallel machines which will have multiprocessor nodes sharing an intra-node memory space. A brief discussion of the cause of load imbalances and simple methods to reduce the same are also pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Augmented Composite Banyan Network

    Publication Year: 1998, Page(s):285 - 292
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A new multipath multistage interconnection network called the Augmented Composite Banyan Network (ACBN) is proposed. The ACBN is created by adding a link to each SE of the Composite Banyan Network (CBN), which is a multipath network with at least two disjoint paths and was originally proposed in (Seo and Feng, 1995). Therefore, the basic building blocks in the ACBN are 4×4 SEs with log2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message passing support on StarT-Voyager

    Publication Year: 1998, Page(s):228 - 237
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    No single message passing mechanism can efficiently support all types of communication that commonly occur in most parallel or distributed programs. MIT's StarT-Voyager, a hybrid message passing/shared memory parallel machine, provides four message passing mechanisms to achieve high performance over a wide spectrum of communication types and sizes. Hardware and address translation enforced protect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual channel multiplexing in networks of workstations with irregular topology

    Publication Year: 1998, Page(s):147 - 154
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Networks of workstations are becoming a cost-effective alternative for small-scale parallel computing. Although they may not provide the closely coupled environment of multicomputers and multiprocessors, they meet the needs of a great variety of parallel computing problems at a lower cost. However in order to achieve a high efficiency, the interconnects used to build the network of workstations mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A conservative parallel simulation algorithm for entity-oriented modeling

    Publication Year: 1998, Page(s):429 - 435
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. In these conservative protocols, time-bound information for an LP is computed from the other LPs. We propose a variant form of conservative parallel simulation protocol in which the time-bound for an L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple token distributed loop local area networks: analysis

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

    With increased data rates, the packet transmission time of a LAN could approach or even become less than the medium propagation delay. The performance of many LAN schemes degrades rapidly under these conditions. Generally, the overhead associated with the medium access protocol increases with the increase in propagation time relative to packet transmission time. In token ring networks this overhea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data prefetching with co-operative caching

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

    Recent research in data cache prefetching is found to be selective in nature: achieving high prediction accuracy over a set of selected references such as array access with constant strides. As a result, for applications where the memory latency is mainly due to data accesses in the set of non selected references of a program, they lose their effectiveness. In fact, their performance might be wors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulo-variable expansion sensitive scheduling

    Publication Year: 1998, Page(s):334 - 341
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Modulo scheduling is an aggressive scheduling technique for loops that exploit instruction-level parallelism by overlapping successive iterations of the loop. Due to the nature of modulo scheduling, the lifetime of a variable can overlap with a subsequent definition of itself. To handle such overlapping lifetimes, modulo-variable expansion (MVE) is used, wherein the constructed schedule is unrolle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skew-insensitive parallel algorithms for relational join

    Publication Year: 1998, Page(s):367 - 374
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Join is the most important and expensive operation in relational databases. The parallel join operation is very sensitive to the presence of the data skew. In this paper we present two new parallel join algorithms for coarse grained machines which work optimally in presence of arbitrary amount of data skew. The first algorithm is sort-based and the second is hash-based. Both of these algorithms em... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for vehicle routing problems

    Publication Year: 1998, Page(s):171 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time hi, and the job must start within a prespecified time window [ri, di]. A vehicle can move on the arcs of the graph, at unit speed and that has to execute the jobs within their respective time windows. We consider three differe... View full abstract»

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