• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 108
  • 11
  • 11
  • 4
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 153
  • 153
  • 153
  • 153
  • 50
  • 46
  • 46
  • 24
  • 24
  • 23
  • 21
  • 20
  • 19
  • 17
  • 16
  • 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.
41

Design and performance analysis of MPI-SHARC a high-speed network service for distributed digital signal processor systems /

Kohout, James, January 2001 (has links) (PDF)
Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains ix, 69 p.; also contains graphics. Vita. Includes bibliographical references (p. 66-68).
42

The design and implementation of a region-based parallel programming language /

Chamberlain, Bradford L., January 2001 (has links)
Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 362-373).
43

Achieving robust performance in parallel programming languages /

Lewis, E Christopher, January 2001 (has links)
Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 104-113).
44

Pointer analysis : building a foundation for effective program analysis

Hardekopf, Benjamin Charles 16 October 2012 (has links)
Pointer analysis is a fundamental enabling technology for program analysis. By improving the scalability of precise pointer analysis we can make a positive impact across a wide range of program analyses used for many different purposes, including program verification and model checking, optimization and parallelization, program understanding, hardware synthesis, and more. In this thesis we present a suite of new algorithms aimed at improving pointer analysis scalability. These new algorithms make inclusion-based analysis (the most precise flow- and context-insensitive pointer analysis) over 4x faster while using 7x less memory than the previous state-of-the-art; they also enable flow-sensitive pointer analysis to handle programs with millions of lines of code, two orders of magnitude greater than the previous state-of-the-art. We present a formal framework for describing the space of pointer analysis approximations. The space of possible approximations is complex and multidimensional, and until now has not been well-defined in a formal manner. We believe that the framework is useful as a method to meaningfully compare the precision of the multitude of existing pointer analyses, as well as aiding in the systematic exploration of the entire space of approximations. / text
45

A framework, tools, and methodology for the visualization of parallel and distributed systems

Kraemer, Eileen T. 08 1900 (has links)
No description available.
46

General purpose parallel machine design and analysis /

Moseley, Philip A. Unknown Date (has links)
Thesis (MAppSc) -- University of South Australia, 1993
47

Parallel intrusion detection systems for high speed networks using the divided data parallel method

Kopek, Christopher Vincent. January 2007 (has links)
Thesis (M.S.)--Wake Forest University. Dept. of Computer Science, 2007. / Vita. Includes bibliographical references (leaves 69-71)
48

Turbo codes

Yan, Yun. January 1999 (has links)
Thesis (M.S.)--Ohio University, November, 1999. / Title from PDF t.p.
49

Parallelism in declarative languages /

Chronaki, Catherine Eleftherios. January 1990 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1990. / Typescript. Includes bibliographical references (p. 70-80).
50

The dynamic speculation and performance prediction of parallel loops /

Zier, David A. January 1900 (has links)
Thesis (Ph. D.)--Oregon State University, 2009. / Printout. Includes bibliographical references (leaves 103-109). Also available on the World Wide Web.

Page generated in 0.0249 seconds