Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings. Advances in Parallel and Distributed Computing

19-21 March 1997

Filter Results

Displaying Results 1 - 25 of 60
  • Proceedings. Advances in Parallel and Distributed Computing

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (2262 KB)
    Freely Available from IEEE
  • Enlarging the scope of vector-based computations: extending Fortran 90 by nested data parallelism

    Publication Year: 1997, Page(s):66 - 73
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    This paper describes the integration of nested data parallelism into Fortran 90. Unlike flat data parallelism, nested data parallelism directly provides means for handling irregular data structures and certain forms of control parallelism, such as divide-and-conquer algorithms thus enabling the programmer to express such algorithms far more naturally. Existing work deals with nested data paralleli... View full abstract»

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

    Publication Year: 1997, Page(s):425 - 426
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • Efficient implementation of portable C*-like data-parallel library in C++

    Publication Year: 1997, Page(s):398 - 405
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    The C* language is a data-parallel extension of the C language which incorporates parallel data types. Since the C++ language provides operator overloading, a C++ library can implement the C* parallel extensions with a similar syntax. Although library implementations are highly portable, some overheads make them impractical. The two major overheads incurred are temporaries in each operator applica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of parallel compiler-partial evaluation of parallel lambda language

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

    We describe in this paper a partial evaluator for a parallel programming language. The parallel language we present is a combination of lambda calculus and message passing communication mechanism. By improving some techniques originally used for partial evaluation of sequential language and introducing some new methods, we successfully solve the problems caused by some internal semantic difference... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive hybrid scheduling of nonuniform loops on UMA models

    Publication Year: 1997, Page(s):383 - 387
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    It is very difficult to keep load balancing among processors for the nonuniform loop in compile-time and it must be at the price of extra overhead to use dynamic methods. This paper proposes an adaptive hybrid scheduling way, in which the processes of distribution of loop are divided into a few rounds and the block size in each round is determined adaptively according to the average overhead due t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement on data dependence analysis supporting software pipelining technique

    Publication Year: 1997, Page(s):378 - 382
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The accuracy of the data dependence analysis of a client program will decide in what an extent the compiler can unleash the power of the potential parallelism of the client program. Most of the current works on dependence analysis are based on the dependence equation and constraint inequalities of loop variable bounds (sometimes augmented with the direction vector). Unfortunately, they can not giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of efficient and reliable multicast servers

    Publication Year: 1997, Page(s):253 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Reliable multicast services in a group of autonomous distributed processes/sites are desirable to maintain the consistent state of shared information accessed by transactions in distributed systems. Many existing protocols are complicated and thus quite expensive and not efficient for availability of distributed systems. This paper discusses the design and implementations of a new logical token ri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependence analysis of parallel and distributed programs and its applications

    Publication Year: 1997, Page(s):370 - 377
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    This paper surveys the program dependence analysis technique for parallel and/or distributed programs and its applications from the viewpoint of software engineering. We present primary program dependences which may exist in a parallel and/or distributed program, a general approach to define, analyze, and represent these program dependences formally, and applications of an explicit program depende... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of multimedia server in a distributed multimedia system

    Publication Year: 1997, Page(s):248 - 252
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    The framework of constructing a distributed multimedia system based on the server/client architecture is described in this paper. We focus our attention on the realization of synchronization presentation of different media in a multimedia application, and a set of QoS (qualify of service) parameters is given as a criterion to make a trade-off between overall performance of the system and the synch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of multidimensional loops with non-uniform dependences

    Publication Year: 1997, Page(s):362 - 369
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    For a parallelizing compiler, mainly based on loop transformations, dependence information that is as complete and precise as possible is required. In this paper, we propose a generalized method for computing, in any multi-dimensional loop, information which proved to be useful in the case of irregular dependences. Firstly, we solve the basic problem of the existence of a dependence with an algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new architecture for branch-intensive loops

    Publication Year: 1997, Page(s):241 - 246
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    A new VLIW architecture, called GPMB (Global Pipelining of Multi-Branch), is discussed in this paper. The GPMB architecture can handle branch-intensive programs efficiently. With the concept of next address function, GPMB regards branching as correctly calculating the next address. The next address function is implemented by hardware and software in GPMB. A brief description of GPMB and a detailed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel replacement mechanism for multithread

    Publication Year: 1997, Page(s):338 - 344
    Cited by:  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    This paper presents a new rapid thread replacement mechanism which is important in multithread technology. Analysis to the memory system indicates that the memory utilization decreases with the increase of cache hit ratio. The parallelism between thread computation and thread replacement is found by analyzing their working processes. Based on these, we advance a rapid multithread replacement mecha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language support for synchronous parallel critical sections

    Publication Year: 1997, Page(s):92 - 99
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We introduce a new parallel programming paradigm, namely synchronous parallel critical sections. Such parallel critical sections must be seen in the context of switching between synchronous and asynchronous modes of computation. Thread farming allows to generate bunches of threads to solve independent subproblems asynchronously and in parallel. Opposed to that, synchronous parallel critical sectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilization of disk drives for RAID

    Publication Year: 1997, Page(s):186 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    A stochastic Petri nets (SPN) model of RAID-5 is constructed. With the model and its isomorphic Markov chain, the average utilization of disk drives in RAID for small write and large I/O request can be calculated. It provides us a good method to evaluate the performance of RAID in the paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precise dependence test for scalars within nested loops

    Publication Year: 1997, Page(s):356 - 361
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Exact direction and distance vectors are essential for detecting hierarchical parallelism and examining legality of loop transformation for a multiple level loop nest. Much of this work has been concentrated on array references. Little has been done to address the problems of finding precise dependences between scalar references, except to use extended SSA form with factored use-def links. In this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coherent parallel programming in C∥

    Publication Year: 1997, Page(s):116 - 122
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    This paper presents the coherent parallel programming concept using a new parallel language called C|| (pronounced C Parallel). The C|| language is based on the standard C language with a small set of extended constructs for parallelism and process interaction. At the core of C|| is a structured construct called coherent region, which facilitates the development of coherent programs, i.e., paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural implications of the NAS MG and FT parallel benchmarks

    Publication Year: 1997, Page(s):235 - 240
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    This paper characterizes the structure and resource requirements of the NAS Parallel Benchmarks (NPB), a popular benchmark suite used to evaluate various parallel computers. The phase parallel model is used to obtain parameter values for memory, I/O, and communication latency and bandwidth requirements. These quantitative parameters are useful in the design and evaluation of various parallel compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistent state restoration in shared memory systems

    Publication Year: 1997, Page(s):330 - 337
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    In many systems, backward recovery constitutes a classical technique to ensure fault-tolerance. It consists in restoring a computation in a consistent global state, saved in a global checkpoint, from which this computation can be resumed. A global checkpoint includes a set of local checkpoints, one from each process which correspond to local states dumped onto stable storage. In this paper we are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “SEQ OF PAR” style structured parallel programming

    Publication Year: 1997, Page(s):82 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    This paper presents a new structured parallel programming model, “SEQ OF PAR”, based on the Communication Closed Layer (CCL) principle of causal composition for parallel programs and Bird-Meertens formalism (BMF) of locality-based parallel computation. This model is to support for more general, architecture-independent parallel programming. It provides a structured approach to integrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dual-processors multithreaded architecture and its driven execution model

    Publication Year: 1997, Page(s):214 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The software overhead which includes interprocess communication latency and the overhead of management processes or threads, is a crucial factor to affect the performance of massively parallel processors system. Multiple threaded architecture can effectively reduce and hide the software overhead. Many models need to be implemented inside a microprocessor. Conversely, this paper addresses a multipl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A versatile directory scheme (Dir2NB+L) and its implementation on BY91-1 multiprocessors system

    Publication Year: 1997, Page(s):180 - 185
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    Cache coherence and synchronization between processors have been two critical issues in designing a shared memory multiprocessors system. From the perspective of hardware design, a directory based cache coherence protocol and lock mechanism are employed to prevent inconsistency of caches and warrant atomic memory accesses. The BY91-1 multiprocessors efficiently integrate supports for cache coheren... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimization by redundancy using an extended LogP model

    Publication Year: 1997, Page(s):149 - 155
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    We present a strategy for optimizing parallel algorithms introducing redundant computations. In order to calculate the optimal amount of redundancy, we generalize the LogP model to capture messages of varying sizes using functions instead of constants for the machine parameters. We validate our method for a wave simulation algorithm on a Parsytec PowerXplorer with eight processors and a workstatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable parallel workstation cluster system

    Publication Year: 1997, Page(s):307 - 313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    In this paper, we argue that because of recent advance of network & CPU technologies, workstation clusters are poised to become the primary parallel computing infrastructure for science and engineering computing. After analyzing and comparing the communication performance of three popular networks: 10 Mbps Ethernet, 100 Mbps Ethernet and 640 Mbps Myrinet on an experimental workstation cluster,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lifetime-sensitive scheduling method

    Publication Year: 1997, Page(s):351 - 354
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    This paper presents a lifetime-sensitive scheduling method. By shortening lifetimes of variables in scheduling phase, it can lighten register pressure in register allocation phase, lessen spill codes and result in more efficient object codes. The preliminary experimental results show that this method is an effective scheduling method View full abstract»

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