Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 117 for “"Multiprocessors"”.
-
Thread Scheduling For Chip Multiprocessors
Large, high frequency single-core chip designs are increasingly being replaced with larger chip multiprocessor (CMP) designs that tradeoff frequency for greater numbers of cores. Power has become a first-order design constraint, leading to designs optimized for computing efficiency, defined as the …
-
Proximity coherence for chip-multiprocessors
… implement the most efficient solution for chip-multiprocessors, placing limits on the performance of these complex systems. In an era of increasingly power limited silicon design, efficiency is now a primary concern that motivates designers to look again at the challenge of cache coherence. The …
-
Reactive synchronization algorithms for multiprocessors
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Cache Coherence in Embedded -Ring Multiprocessors
In this work, we propose to logically embed a ring in a point-to-point network topology. Snoop messages use the logical ring, while other messages can use any link in the network. The resulting design is simple and low cost. Perhaps the main drawback of the embedded ring approach is that snoop …
-
Parallel input/output architectures for multiprocessors
This thesis looks at several aspects of solving the Input/Output problem. The increasing processor speeds and the emerging multiprocessor machines have improved the processing power of a system at a tremendous pace. This has not been followed by corresponding improvements in other parts of the …
-
Capacity Metric for Chip Heterogeneous Multiprocessors
… evaluates the performance of Chip Heterogeneous Multiprocessors (CHMs) that process multiple heterogeneous channels. Performance metrics are required in order to evaluate any system, including computer systems. A lack of appropriate metrics can lead to ambiguous or incorrect results, something …
-
Parallel architectural simulations on shared memory multiprocessors
… computer simulations is to execute them on multiprocessors.
-
Boundary method-based domain decomposition on multiprocessors
An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in …
-
Processor Memory Integration: How It Affects Scalable Multiprocessors
Because off-the-shelf processors are so fast, these non-computing nodes can manage the coherence operations and the storage of data in memory in software. A high-level evaluation of the proposed architecture shows that it is significantly better than idealized versions of the traditional COMA and …
-
Compiling for parallel multithreaded computation on symmetric multiprocessors
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
-
Control and reliability of optical networks in multiprocessors
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
The raven kernel: a microkernel for shared memory multiprocessors
… lightweight operating system for shared memory multiprocessors. Raven is characterized by its movement of several traditional kernel abstractions into user space. The kernel itself implements tasks, virtual memory management, and low level excep-tion dispatching. All thread management, device …
-
Fine-grain producer-initiated communication in cache-coherent multiprocessors
Shared-memory multiprocessors are becoming increasingly popular as a high-performance, easy to program, and relatively inexpensive choice for parallel computation. However, the performance of shared-memory multiprocessors is limited by memory latency. Memory latencies are higher in multiprocessors …
-
Efficient parallel computation on multiprocessors with optical interconnection networks
This dissertation studies optical interconnection networks, their architecture, address schemes, and computation and communication capabilities. We focus on a simple but powerful optical interconnection network model - the Linear Array with Reconfigurable pipelined Bus System (LARPBS). We extend …
-
Record and deterministic replay of parallel programs on multiprocessors
Record and deterministic Replay (RnR) is a primitive with many proposed applications in computer systems, including debugging, security and fault tolerance. RnR is typically a two phase process: in the first phase (record) enough information about an execution is logged which is then used in the …
-
Compiler Memory Management and Compound Function Definition for Multiprocessors
The first part of this thesis deals with managing data in the multi-level memories of a tightly-coupled multiprocessor. One of the problems with this type of multiprocessor is the slow global memory. We examine how a compiler can use data dependence information to determine how data is used in a …
-
Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Generating multithreaded code from Parallel Haskell for symmetric multiprocessors
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Compiling reductions in data parallel programs for distributed memory multiprocessors
… even more important for distributed-memory multiprocessors. As part of the dHPF parallel compiler project, we developed reduction recognition and parallel code generation strategies for distributed-memory multiprocessors. Using combination of dependence analysis and pattern matching our …
-
Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis
… parallelizing techniques for distributed memory multiprocessors. In the research, an ordinary Fortran 77 program is assumed as input, and no information is required from the programmers. Only the abilities of the compiler are used to detect parallelism from the input program, to distribute data, …
Page 1 of 6