Search Constraints

Start Over
Filtering by: Alternative title ssim Report no. 1666 Remove constraint Alternative title ssim: Report no. 1666 Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.) Subject Parallel processing (Electronic computers) Remove constraint Subject: Parallel processing (Electronic computers)

Search Results

  • Specification of parallel processing using production systems

    Creator:
    Gazaly, Mohammed
    Abstract:
    This research work investigates the use of production systems as a model of parallel processing. The purpose of the model is to provide a suitable medium within which parallel processing systems can be systematically specified, analyzed, and designed. Furthermore, the model provides a suitable means for deriving implementations of synchronization...
    Resource Type:
    Dissertation
    Full Text:
    circuits of the arithmetic and logical units, this is no longer true with the advent of integrated

  • 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:
    an_1an_2 ao rather than n-tuples (an -1, an_2, , ao) 5 when there is no confusion. If u and v are two

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

    Creator:
    Crandall, Phyllis E.
    Resource Type:
    Dissertation
    Full Text:
    decomposition. (a) A homoge- neous partitioning has no extraordinary communications. (b) The general

  • High-performance data-parallel input/output

    Creator:
    Moore, Jason Andrew
    Abstract:
    Existing parallel file systems are proving inadequate in two important arenas: programmability and performance. Both of these inadequacies can largely be traced to the fact that nearly all parallel file systems evolved from Unix and rely on a Unix-oriented, single-stream, block-at-a-time approach to file I/O. This one-size-fits-all approach to parallel...
    Resource Type:
    Dissertation
    Full Text:
    , subsequently impacting the next write, no matter which process issues it? Or, does each process have its own

  • Scheduling non-uniform parallel loops on MIMD computers

    Creator:
    Liu, Jie
    Abstract:
    Parallel loops are one of the main sources of parallelism in scientific applications, and many parallel loops do not have a uniform iteration execution time. To achieve good performance for such applications on a parallel computer, iterations of a parallel loop have to be assigned to processors in such a...
    Resource Type:
    Dissertation
    Full Text:
    5.3.2 Total Replication of Partial Array 79 5.3.3 K-Duplication of Partial Array 80 5.3.4 No

  • 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:
    superscalar, thus effectively reducing the ILP. Consequently, no matter what microar­ chitectural techniques

  • 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
    Full Text:
    transmission time for that branch. Node 1 has no predecessor, but node 1 is the immediate predecessor of nodes

  • 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:
    ACKNOWLEDGMENT All thanks are due to Allah the most generous the most merciful. There are no humans to whom

  • Fault-tolerant communications in parallel systems

    Creator:
    Park, Seungjin
    Resource Type:
    Dissertation
    Full Text:
    4.3.1 Case of a single link failure 46 4.3.2 Case when no node has more than one faulty link inci

  • Task partitioning and scheduling on arbitrary parallel processing systems

    Creator:
    El-Rewini, Hesham
    Abstract:
    Parallel programming is the major stumbling block preventing the parallel processing industry from quickly satisfying the demand for parallel computer software. This research is aimed at solving some of the problems of software development for parallel computers. ELGDF is a graphical language for designing parallel programs. The goal of ELGDF...
    Resource Type:
    Dissertation