Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

1994 Internatonal Conference on Parallel Processing Vol. 2

15-19 Aug. 1994

Filter Results

Displaying Results 1 - 25 of 65
  • 1994 International Conference on Parallel Processing - Cover

    Publication Year: 1994, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • 1994 International Conference on Parallel Processing - Copyright notice

    Publication Year: 1994, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • 1994 International Conference on Parallel Processing - Title page

    Publication Year: 1994, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • 1994 International Conference on Parallel Processing - Table of contents

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 1994, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 1994, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Keynote Speakers

    Publication Year: 1994, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Panel Sessions

    Publication Year: 1994, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Conference Awards

    Publication Year: 1994, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • List of referees

    Publication Year: 1994, Page(s):xx - xxii
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • Communication Optimizations Used in the Paradigm Compiler for Distributed-Memory Multicomputers

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

    The PARADIGM (PARAllelizing compiler for DIstributed-memory General-purpose Multicomputers) project at the University of Illinois provides a fully automated means to parallelize programs, written in a serial programming model, for execution on distributed-memory multicomputers. To provide efficient execution, PARADIGM automatically performs various optimizations to reduce the overhead and idle tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Region Execution of Loops with Irregular Dependencies

    Publication Year: 1994, Page(s):11 - 19
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Several compile time transformations of loops with simple dependencies have been developed in order to expose possible parallelism in these loops. However, once an irregular data dependence is detected, no attempt is usually made to extract any parallel thread from the loop. In this paper, we present the parallel region execution, a new compile time approach for improving the execution of loops wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid Transformations: A New Class of Loop Transformations

    Publication Year: 1994, Page(s):20 - 23
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    In this paper we present a new class of loop optimizing transformations called valid transformations. This class of transformations are different from existing ones in that valid transformations can be illegal and can result in incorrect non-pipelined designs. Nevertheless, valid transformations have feasible pipeline schedules which is important for scheduling loops. We present an example valid t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statement Re-ordering for DOACROSS Loops

    Publication Year: 1994, Page(s):24 - 28
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (418 KB)

    In this paper, we propose a new statement reordering algorithm for DOACROSS loops that overcomes some of the problems in the previous schemes. The new algorithm uses a hierarchical approach to locate strongly dependent statement groups and to order these groups considering critical dependences. A new optimization problem, dependence covering maximization, which was not discussed before is also int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors

    Publication Year: 1994, Page(s):29 - 38
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (497 KB)

    Until now little research has addressed the problem of on line scheduling of sporadic parallel tasks with hard deadlines in partitionable multiprocessor systems In this paper we present two on-line scheduling algorithms - Buddy/RTand Stacking, for such environments Both the algorithms either guarantee or reject a task at the time of its arrival Buddy/RT is a straight-forward extension of the well-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Adjusting Scheduling: An On-Line Optimization Technique for Locality Management and Load Balancing

    Publication Year: 1994, Page(s):39 - 46
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Techniques for scheduling parallel tasks on to the processors of a multiprocessor architecture must tradeoff three interrelated factors: 1) scheduling and synchronization costs, 2) load balancing, and 3) memory locality. Current scheduling techniques typically consider only one or two of these three factors at a time. We propose a novel Self- Adjusting Scheduling (SAS) algorithm that addresses all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Approach to Scheduling Parallel Programs Using Task Duplication

    Publication Year: 1994, Page(s):47 - 51
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    In this paper, we explore the problem of scheduling parallel programs using task duplication for message-passing multicomputers. Task duplication means scheduling a parallel program by redundantly executing some of the tasks on which other tasks of the program critically depend. This can reduce the start times of tasks waiting for messages from tasks residing in other processors. There have been a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Task Duplication Based Optimal Scheduling Algorithm for Variable Execution Time Tasks

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

    Efficient scheduling algorithm is one of the key factors in determining the performance of distributed memory machines. This paper presents an enhanced Search and Du plication Based Scheduling (SDBS) algorithm which car schedule Directed Acyclic Graphs (DA Gs) with variable execution time tasks. Since the DAGs are based on data dependencies of the tasks, the control dependencies are clustered with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Memo: A Heterogeneously Distributed and Parallel Software Development Environment

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

    Heterogeneously distributed and parallel computing environments are highly dependent on hardware, data migration, and protocols. The result is significant difficulty in software reuse, portability across platforms, and an increased overall development effort. The appearance of a shared directory of unordered queues can be provided by integrating heterogeneous computers transparently. This integrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Large-Grain Parallel Programming Environment for Non-Programmers

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

    Banger is a parallel programming environment used by non-professional programmers to write explicitly parallel large-grain parallel programs. The goals of Banger are: 1. extreme ease of use, 2. immediate feedback, and 3. machine-independence. Banger is based on three principles: 1. separation of parallel programming-in-the-large from sequential programming-in-the-small, 2. separation of programmin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs

    Publication Year: 1994, Page(s):69 - 72
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB)

    Deadlock, livelock, starvation, and other terms have been used to describe undesirable situations involving blocking or not making progress for processes in a concurrent program However, definitions of these terms are inconsistent and often informal This paper provides formal definitions of deadlock, livelock, and starvation in terms of the reachability graph of a concurrent program Also, this pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Fly Testing of Regular Patterns in Distributed Computations

    Publication Year: 1994, Page(s):73 - 76
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    A class of properties of distributed computations is described and an algorithm which detects them is presented. This class of properties called regular patterns allows the user to specify an expected (or unwanted) behavior of a computation as sequences of relevant events (or as sequences of local predicates that must be successively verified). The sequences are defined by a finite state automaton... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Solution to the Critical Section Problem

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

    In a distributed system of N sites an efficient solution to the critical section problem is proposed to allow multiple simultaneous entries to the Critical Section. The proposed solution is token-based, deadlock-free and free from starvation. In all cases except during the book keeping cycle of the algorithm, the number of message exchanges per Critical Section execution is less than or equal to 5... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perturbation Analysis: A Static Analysis Approach for the Non-Intrusive Monitoring of Distributed Programs

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

    Programs written in distributed programming languages are often non-deterministic in nature and hence the execution of such programs is not only dependent upon the program input, but also on the timing of the execution. Thus, an attempt to monitor the run-time behavior of a non-deterministic distributed program through code instrumentation, such as during debugging, can potentially alter the progr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cachier: A Tool for Automatically Inserting CICO Annotations

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

    Shared memory in a parallel computer provides programmers with the valuable abstraction of a shared address space--through which any part of a computation can access any datum Although uniform access simplifies programming, it also hides communication, which can lead to inefficient programs The check-in, check-out (CICO) performance model for cache-coherent, shared-memory parallel computers helps ... View full abstract»

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