- 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 71 to 80 of 882 (0.08 seconds)Spelling suggestions: "subject:"parallelprocessing"" "subject:"parallelprocessors""
| 71 |
Optoelectronic computing : interconnects, architectures and a systems demonstratorDines, Julian A. B. January 1997 (has links)
No description available.
|
| 72 |
Artificial neural networks for parallel finite element computationsBahreininejad, Ardeshir January 1996 (has links)
No description available.
|
| 73 |
Parallel computational techniques for explicit finite element analysisSziveri, Janos January 1997 (has links)
No description available.
|
| 74 |
Parallel adaptive search techniques for structural optimizationLeite, Joao Paulo de Barros January 1996 (has links)
No description available.
|
| 75 |
Coordinating heterogeneous parallelism : distributing collections in LispBatey, Duncan J. January 1995 (has links)
No description available.
|
| 76 |
Fault-tolerant embedded multi-processing system with bus switchingOzcerit, Ahmet Turan January 1999 (has links)
No description available.
|
| 77 |
On the convergent dynamics of cellular neural networksJoy, Mark Patrick January 1996 (has links)
No description available.
|
| 78 |
On the synthesis of integral and dynamic recurrencesRapanotti, Lucia January 1996 (has links)
Synthesis techniques for regular arrays provide a disciplined and well-founded approach to the design of classes of parallel algorithms. The design process is guided by a methodology which is based upon a formal notation and transformations. The mathematical model underlying synthesis techniques is that of affine Euclidean geometry with embedded lattice spaces. Because of this model, computationally powerful methods are provided as an effective way of engineering regular arrays. However, at present the applicability of such methods is limited to so-called affine problems. The work presented in this thesis aims at widening the applicability of standard synthesis methods to more general classes of problems. The major contributions of this thesis are the characterisation of classes of integral and dynamic problems, and the provision of techniques for their systematic treatment within the framework of established synthesis methods. The basic idea is the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity, so that corresponding regular arrays can be obtained by a direct application of the standard mapping techniques. We will complement the formal development of the techniques with the illustration of a number of case studies from the literature.
|
| 79 |
Scheduling tasks with conditional and preemptive attributes on a parallel and distributed system /Huang, Lin, January 1999 (has links) (PDF)
Thesis (Ph.D.) -- University of Adelaide, Dept. of Computer Science, 1999. / Bibliography: leaves 231-246.
|
| 80 |
Concurrency in multi-core processor designClancy, Patrick January 1900 (has links)
Thesis (B.A.)--Haverford College, [Dept. of Computer Science, 2007]. / Includes bibliographical references.
|
Page generated in 0.0866 seconds