Spelling suggestions: "subject:"arallel computers."" "subject:"aparallel computers.""
51 |
Studies of turbulent boundary layer flow throughdirect numerical simulationSkote, Martin January 2001 (has links)
No description available.
|
52 |
Automatic Parallelization of Equation-Based Simulation ProgramsAronsson, Peter January 2006 (has links)
Modern equation-based object-oriented modeling languages which have emerged during the past decades make it easier to build models of large and complex systems. The increasing size and complexity of modeled systems requires high performance execution of the simulation code derived from such models. More efficient compilation and code optimization techniques can help to some extent. However, a number of heavy-duty simulation applications require the use of high performance parallel computers in order to obtain acceptable execution times. Unfortunately, the possible additional performance offered by parallel computer architectures requires the simulation program to be expressed in a way that makes the potential parallelism accessible to the parallel computer. Manual parallelization of computer programs is generally a tedious and error prone process. Therefore, it would be very attractive to achieve automatic parallelization of simulation programs. This thesis presents solutions to the research problem of finding practically usable methods for automatic parallelization of simulation codes produced from models in typical equationbased object-oriented languages. The methods have been implemented in a tool to automatically translate models in the Modelica modeling language to parallel codes which can be efficiently executed on parallel computers. The tool has been evaluated on several application models. The research problem includes the problem of how to extract a sufficient amount of parallelism from equations represented in the form of a data dependency graph (task graph), requiring analysis of the code at a level as detailed as individual expressions. Moreover, efficient clustering algorithms for building clusters of tasks from the task graph are also required. One of the major contributions of this thesis work is a new approach for merging fine-grained tasks by using a graph rewrite system. Results from using this method show that it is efficient in merging task graphs, thereby decreasing their size, while still retaining a reasonable amount of parallelism. Moreover, the new task-merging approach is generally applicable to programs which can be represented as static (or almost static) task graphs, not only to code from equation-based models. An early prototype called DSBPart was developed to perform parallelization of codes produced by the Dymola tool. The final research prototype is the ModPar tool which is part of the OpenModelica framework. Results from using the DSBpart and ModPar tools show that the amount of parallelism of complex models varies substantially between different application models, and in some cases can produce reasonable speedups. Also, different optimization techniques used on the system of equations from a model affect the amount of parallelism of the model and thus influence how much is gained by parallelization.
|
53 |
Studies of turbulent boundary layer flow throughdirect numerical simulationSkote, Martin January 2001 (has links)
No description available.
|
54 |
Principal design criteria influencing the performance of a portable, high performance parallel I/O implementationRajaram, Kumaran. January 2002 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.
|
55 |
Adapting Remote Direct Memory Access based file system to parallel Input-/OutputVelusamy, Vijay. January 2003 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science and Engineering. / Title from title screen. Includes bibliographical references.
|
56 |
Overlapping of communication and computation and early binding fundamental mechanisms for improving parallel performance on clusters of workstations /Dimitrov, Rossen Petkov. January 2001 (has links)
Thesis (Ph. D.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.
|
57 |
Best effort MPI/RT as an alternative to MPI design and performance comparison /Angadi, Raghavendra. January 2002 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.
|
58 |
A study of hypercube graph and its application to parallel computingSalam, Mohammed Abdul January 1991 (has links)
Recent studies have shown an increased interest and research in the area of parallel computing. Graphs offer ' an excellent means for the modelling of parallel computers. The hypercube graph is emerging as the preferred topology for parallel processing. It is a subject of intense research and study by both graph theorists and computer scientists.This thesis is intended to investigate several graph theoretic properties of hypercubes and one of its subgraphs (middle graph of the cube). These include edgedensity, diameter, connectivity, Hamiltonian property, Eulerian property, cycle structure, and crossing number.. Theproblem of routing using parallel algorithms for implementing partial permutation is also described. We also discuss the problem of multiplying matrices on hypercube, which is helpful in solving graph theoretic problems like shortest paths and transitive closure. The problem of graph embeddings is also discussed pertaining to hypercube graph. Lastly, several important applications of hypercubes are discussed. / Department of Computer Science
|
59 |
Performance of parallel I/O data distribution strategies for space-sharing policies /Wang, Liuhong, January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 81-86). Also available in electronic format on the Internet.
|
60 |
Lokale Realisierung von Vektoroperationen auf ParallelrechnernGroh, U. 30 October 1998 (has links) (PDF)
For the basic algebraic vector operations several variants of a local
implementation on distributed memory parallel computers are presented and discussed
systematically. In particular necessary and sufficient conditions are shown for the local realizability
of the multiplication matrix by vector.
|
Page generated in 0.0627 seconds