- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 91 to 100 of 153 (0.018 seconds)| 91 |
Transparent process migration for parallel Java computing /Ma, Ka-kui. January 2001 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 63-65).
|
| 92 |
Transparent process migration for parallel Java computing馬家駒, Ma, Ka-kui. January 2001 (has links)
published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy
|
| 93 |
Scheduling with flexible parallelismXu, Hua 05 1900 (has links)
No description available.
|
| 94 |
A spectral method for mapping dataflow graphsElling, Volker Wilhelm January 1998 (has links)
No description available.
|
| 95 |
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
|
| 96 |
An investigation of parallel algorithms developed for graph problems and their implementation on parallel computersKondo, Boubacar January 1991 (has links)
With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms. / Department of Computer Science
|
| 97 |
Program structures and computer architectures for parallel processingMontagne, Euripides. January 1985 (has links)
No description available.
|
| 98 |
Data flow implementations of a lucid-like programming language /Wendelborn, Andrew Lawrence. January 1985 (has links) (PDF)
Thesis (Ph. D.)--University of Adelaide, 1985. / Includes bibliographical references (leaves [238]-244).
|
| 99 |
Effective runtime management of parallelism in a functional programming context /Dermoudy, Julian Richard. January 2002 (has links)
Thesis (Ph.D.)--University of Tasmania, 2002. / Includes bibliographical references.
|
| 100 |
Common subexpression detection in dataflow programs /Jones, Philip E. C. January 1989 (has links) (PDF)
Thesis (M. Sc.)--Dept. of Computer Science, University of Adelaide, 1990. / Processed. Includes bibliographical references (leaves 123-124).
|
Page generated in 0.0253 seconds