Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205)

14-14 Aug. 1998

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205)

    Publication Year: 1998
    Request permission for commercial reuse | |PDF file iconPDF (396 KB)
    Freely Available from IEEE
  • Efficient backtracking in and-parallel implementations of non-deterministic languages

    Publication Year: 1998, Page(s):338 - 345
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (82 KB)

    We consider the problem of efficiently supporting backtracking in independent and-parallel non-deterministic systems. We consider this problem in the context of logic programming, although the solution proposed is sufficiently general to be applicable to any non-deterministic language or system. Our model employs various optimizations, as well as a novel memory organization scheme in which process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of provably correct parallelizing compilers

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

    We show how parallelizing compilers can be automatically derived from denotational definitions of programming languages. In our approach, the denotational definition is expressed using definite clause grammars (syntax specification) and Horn Logic or Constraint Logic (semantic specification). The conditions for executing two or more statements in parallel (e.g. GCD test, Banerjee test, or exact te... View full abstract»

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

    Publication Year: 1998, Page(s):629 - 630
    Request permission for commercial reuse | |PDF file iconPDF (252 KB)
    Freely Available from IEEE
  • A memory-layout oriented run-time technique for locality optimization on SMPs

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

    Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout oriented approach to exploit cache locality for parallel loops at run-time on symmetric multi-processor (SMP) systems. Guided by application-dependent hints and the targeted cache architecture, it reorganizes and partitio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing data and synchronization costs in one-way communication

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

    In contrast to the conventional send/receive model, the one-way communication model using Put and Synch allows the decoupling of message transmission from synchronization. This opens up new opportunities not only to further optimize communication but also to reduce synchronization overhead. We present a general technique which uses a global dataflow framework to optimize communication and synchron... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis and optimization of a parallel carbon molecular dynamic code on a Cray T3E

    Publication Year: 1998, Page(s):62 - 69
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (308 KB)

    An analysis of the primary factors influencing the performance of a parallel implementation on a Cray T3E of a Carbon Molecular Dynamics code developed at Department of Physics and Astronomy at Michigan State University is presented. We show that classical load-sharing techniques combined with careful analysis of Amdahl's law can be successfully used to significantly increase the performance of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal task scheduling to minimize inter-tile latencies

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

    This work addresses the issue of exploiting intra-tile parallelism by overlapping communication with computation removing the restriction of atomicity of tiles. The effectiveness of tiling is then critically dependent on the execution order of tasks within a tile. We present a theoretical framework based on equivalence classes that provides an optimal task ordering under assumptions of constant an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel algorithm for timing-driven global routing for standard cells

    Publication Year: 1998, Page(s):54 - 61
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB)

    The timing-driven global routing problem is an extremely important and time consuming phase of any automated layout system. In this paper, by integrating high performance interconnection tree construction, wire-sizing, and switch-able segment channel optimization together, we propose an adaptive timing-driven global routing algorithm which minimizes the timing delay as well as circuit area. Our ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rerouting connections in mobile ATM networks

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

    This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in networks with hierarchical link state routing protocols such as PNNI (Private Network-to-Network Interface)-based ATM (Asynchronous Transfer Mode) networks. The route optimiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schemes for reducing communication latency in regular computations on DSM multiprocessors

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

    This paper proposes two schemes for reducing the communication latency in the computations with local and regular communication patterns. The primary scheme is the local protocol for enhancing spatial locality of the coherence actions, and the second is for the communication via stream data. The local protocol is a subsidiary of a traditional coherence protocol and activated on a memory block basi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the impossibility of min-process non-blocking checkpointing and an efficient checkpointing algorithm for mobile computing systems

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

    Mobile computing raises many new issues, such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. R. Prakash and M. Singhal (1996) proposed the first coordinated checkpointing algorithm for mobile computing systems. However we showed that their algorithm may result in an incons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group protocol for distributed replicated objects

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

    In group protocols, larger computation and communication are consumed to causally order all messages transmitted in the network. Transactions in clients manipulate objects in servers by sending read and write requests to the servers. In this paper we define significant messages, which are to be ordered at the application level, by using a conflicting relation among the transactions. We newly propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-cost fault-tolerance in barrier synchronizations

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

    We show how fault-tolerance can be effectively added to several types of faults in program computations that use barrier synchronization. We divide the faults that occur in practice into two classes, detectable and undetectable, and design a fully distributed program that tolerates the faults in both classes. Our program guarantees that every barrier is executed correctly even if detectable faults... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The postal network: a versatile interconnection topology

    Publication Year: 1998, Page(s):612 - 619
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (144 KB)

    The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibonacci cubes as its special cases. The postal network can also be considered as a flexible version of the hypercube which relaxes the restriction on the number of nodes and thus makes it possible to construct multicomputers ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient multicast on Myrinet using link-level flow control

    Publication Year: 1998, Page(s):381 - 390
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (136 KB)

    This paper studies the implementation of efficient multicast protocols for Myrinet, a switched, wormhole-routed Gigabit-per-second network technology. Since Myrinet does not support multicasting in hardware, multicast services must be implemented in software. We present a new, efficient, and reliable software multicast protocol that uses the network interface to efficiently forward multicast traff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line configuration of a time warp parallel discrete event simulator

    Publication Year: 1998, Page(s):28 - 35
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (100 KB)

    In time warp simulations, the overheads associated with rollbacks, state-saving and the communication induced by rollbacks are the chief contributors to the cost of the simulation; thus, these aspects of the simulation have been primary targets for optimizations. Unfortunately, the behavior of the time warp simulation is highly dynamic and greatly influenced by the application being simulated. Thu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study of admission control strategies in video servers

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

    A video server guarantees the I/O bandwidth required for the smooth playback of a video access request once it has been admitted into the system. To ensure that new video access requests will not jeopardize the bandwidth guarantees promised to existing streams, an admission control module that decides whether a new request should be granted based on the resource usage is essential in the design of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient sleep/wake-up protocols for user-level IPC

    Publication Year: 1998, Page(s):560 - 569
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB)

    We present a new facility for cross-address space IPC that exploits queues in memory shared between the client and server address space. The facility employs only widely available operating system mechanisms, and is hence easily portable to different commercial operating systems. It incorporates blocking semantics to avoid wasting processor cycles, and still achieves almost twice the throughput of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network planning and tuning in switch-based LANs

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

    Switch-based networks have received much attention in local area networks (LANs) due to their higher network bandwidth and greater interconnect scalability than shared-medium networks. While arbitrary topologies are allowed to provide the needed flexibility and scalability, the design of an appropriate network topology is a challenging issue. In this paper, we discuss design considerations and pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing algorithms for anycast messages

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

    We propose and analyze three routing algorithms for anycast packets: source-destination based routing with weighted random selection (SD/WRS); destination based routing with weighted random selection (D/WRS); and the shortest shortest path first (SSPF) algorithms. The SSPF algorithm is a simple extension to the traditional SPF algorithm for routing unicast packets. The SD/WRS and D/WRS algorithms ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • nD-dBPN: new self-routing permutation networks based on the de Bruijn digraphs

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

    A new class of self-routing permutation networks based on the de Bruijn digraphs is proposed. The new networks are modular and scalable, and have an optimal crosspoint complexity. Compared to the crossbar switches of the same size, nD-dBPN uses less cross-points, and operates faster. With its optimal configuration, the new network uses O (N log N) cross-points compared to O (N2) cross-p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant multicasting in multistage interconnection networks

    Publication Year: 1998, Page(s):156 - 162
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (96 KB)

    We study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerant multicasting, which employs the restricted header encoding schemes. The propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-phase multicast in wormhole-switched bidirectional multistage Banyan networks

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

    A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage Banyan networks f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DRIL: dynamically reduced message injection limitation mechanism for wormhole networks

    Publication Year: 1998, Page(s):535 - 542
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (84 KB)

    Deadlock avoidance and recovery techniques are alternatives to deal with the interconnection network deadlock problem. Both techniques allow fully adaptive routing on some set of resources while providing dedicated resources to escape from deadlock. They mainly differ in the way they supply escape paths and when those paths are used. As the escape paths only provide limited bandwidth to escape fro... View full abstract»

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