Search Constraints

Start Over
Filtering by: Creator Lee, Chau-Hwang Remove constraint Creator: Lee, Chau-Hwang Subject Parallel processing (Electronic computers) Remove constraint Subject: Parallel processing (Electronic computers)

Search Results

  • Allocation of SISAL program graphs to processors using BLAS

    Creator:
    Raisinghani, Manoj H.
    Abstract:
    There are a number of well known techniques for extracting parallelism from a given program. They range from hardware implementations, building restructuring compilers or reorganizing of programs so as to specify all the available parallelism. The success rate of any of the known techniques is rather poor over all types...
    Resource Type:
    Masters Thesis
    Full Text:
    To Processors Using BLAS Abstract approved: Dr. Ben Lee There are a number of well known

  • Program allocation for hypercube based dataflow systems

    Creator:
    Freytag, Vincent R.
    Abstract:
    The dataflow model of computation differs from the traditional control-flow model of computation in that it does not utilize a program counter to sequence instructions in a program. Instead, the execution of instructions is based solely on the availability of their operands. Thus, an instruction is executed in a dataflow...
    Resource Type:
    Masters Thesis
    Full Text:
    Based Dataflow Systems Redacted for Privacy Abstract approved: Ben Lee The dataflow model of

  • Simulation studies of routing algorithms for multicomputer systems

    Creator:
    Choi, Jangmin
    Abstract:
    Efficient routing of messages is critical to the performance of multicomputers. Many adaptive routing algorithms have been proposed to improve the network efficiency; however, they can make only short-sighted decisions to choose a channel for message routing because of limited information about network condition. The short-sighted decisions may cause unnecessary...
    Resource Type:
    Masters Thesis
    Full Text:
    Multicomputer Systems Abstract approved. Ben Lee Efficient routing of messages is critical to the

  • A performance study of multithreading

    Creator:
    Kwak, Hantak
    Abstract:
    As the performance gap between processor and memory grows, memory latency will be a major bottleneck in achieving high processor utilization. Multithreading has emerged as one of the most promising and exciting techniques used to tolerate memory latency by exploiting thread-level parallelism. The question however remains as to how effective...
    Resource Type:
    Dissertation
    Full Text:
    presented on December 7, 1998. Title: A Performance Study of Multithreading. Abstract approved: Ben Lee

  • Interface design and system impact analysis of a message-handling processor for fine-grain multithreading

    Creator:
    Metz, David
    Abstract:
    There appears to be a broad agreement that high-performance computers of the future will be Massively Parallel Architectures (MPAs), where all processors are interconnected by a high-speed network. One of the major problems with MPAs is the latency observed for remote operations. One technique to hide this latency is multithreading....
    Resource Type:
    Masters Thesis
    Full Text:
    . Abstract approved: Ben Lee There appears to be a broad agreement that high-performance computers of the

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    constructive comment on this work. Thanks also to my friends and colleagues, Dokyoung Ok, Seokjun Lee, Bob

  • On resource placements and fault-tolerant broadcasting in toroidal networks

    Creator:
    AlMohammad, Bader Fahed AlBedaiwi
    Abstract:
    Parallel computers are classified into: Multiprocessors, and multicomputers. A multiprocessor system usually has a shared memory through which its processors can communicate. On the other hand, the processors of a multicomputer system communicate by message passing through an interconnection network. A widely used class of interconnection networks is the toroidal...
    Resource Type:
    Dissertation
    Full Text:
    1.4.1 Mixed Radix Notation 4 1.4.2 Lee Weight 4 1.4.3 Lee Distance 4 1.4.4 Torus 5 1.4.5

  • Embeddings in parallel systems

    Creator:
    Kwon, Younggeun
    Resource Type:
    Dissertation
    Full Text:
    pursue my ph.D work. I am deeply indebted to Prof. Sangbae Lee of Yonsei University and to Prof

  • Data decomposition and load balancing for networked data-parallel processing

    Creator:
    Crandall, Phyllis E.
    Resource Type:
    Dissertation
    Full Text:
    network flow scheduling technique [91]. Ni and Hwang [68] provide an optimal probabilistic policy and Gao

  • Static task scheduling and grain packing in parallel processing systems

    Creator:
    Kruatrachue, Boontee
    Abstract:
    We extend previous results for optimally scheduling concurrent program modules, called tasks, on a fixed, finite number of parallel processors in two fundamental ways: (1) we introduce a new heuristic which considers the time delay imposed by message transmission among concurrently running tasks; and (2) we introduce a second heuristic...
    Resource Type:
    Dissertation