Spelling suggestions: "subject:"parallelprocessing"" "subject:"parallelprocessors""
191 |
Parallel machine scheduling with time windowsRojanasoonthon, Siwate. Bard, Jonathan F. January 2004 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Jonathan F. Bard. Vita. Includes bibliographical references.
|
192 |
A compiler optimization framework for Concordia parallel C /Liang, Wen. January 1998 (has links)
Thesis (M.Comp.Sc.)--Dept. of Computer Science, Concordia University, 1998. / "September 1998" Includes bibliographical references (leaves 100-104). Available also on the Internet.
|
193 |
MDRIP : a hybrid approach to parallelisation of discrete event simulation : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the University of Canterbury /Chao, Daphne Yu Fen. January 2006 (has links)
Thesis (M. Sc.)--University of Canterbury, 2006. / Typescript (photocopy). Includes bibliographical references (p. 125-133). Also available via the World Wide Web.
|
194 |
Polymorphous architectures a unified approach for extracting concurrency of different granularities /Sankaralingam, Karthikeyan, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
|
195 |
Optimising communication structure for model checkingSaffrey, Peter. January 2003 (has links)
Thesis (Ph. D.)--University of Glasgow, 2003. / Ph. D. thesis submitted to the Computing Science Department, University of Glasgow, 2003. Includes bibliographical references. Print version also available.
|
196 |
Performance modeling and analysis of parallel processing and low earth orbit satellite communications systems /Raines, Richard A. January 1994 (has links)
Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1994. / Vita. Abstract. Includes bibliographical references (leaves 199-209). Also available via the Internet.
|
197 |
CSP++ : an object-oriented application framework for software synthesis from CSP specificationsGardner, William Bennett 09 May 2018 (has links)
One of the useful formalisms for designing concurrent systems is the process algebra called CSP, or Communicating Sequential Processes. CSP statements can be used to model a system's control and data flow in an intuitive way, constituting a kind of hierarchical behavioral specification. Furthermore, when coupled with simulation and model-checking tools, these statements can be executed and debugged until the desired behavior has been accurately captured. Certain properties (such as absence of deadlocks) can be proved, to help verify the correctness of the design.
To make the verified specifications executable in a practical sense, refinement to a programming language is required. In this work, an new object-oriented application framework is described which realizes the basic elements of CSP—processes, synchronizing events, and communication channels—in natural terms as C++ objects. In addition, a new software tool is provided to customize the framework by translating CSP statements into invocations of the framework elements. CSP specifications, thus reexpressed in C++ and compiled, form the control portion of a system, able to be linked with other software written in C++ that completes the functionality. / Graduate
|
198 |
Verification tools for communication protocol designChoy, Wai Hing 01 January 2000 (has links)
No description available.
|
199 |
Application of a parallel processor system to QUICKSORTTamirisa, Gopalachary. January 1983 (has links)
No description available.
|
200 |
Parallel Compositing of Multi-Temporal Satellite Imagery using Temporal Map AlgebraShrestha, Bijay 10 December 2005 (has links)
Spatio-temporal satellite image analysis is a technique for monitoring spatial and temporal changes of land cover and oceanic locations on earth. Temporal Map Algebra (TMA) is a novel technique developed by Jeremy Mennis and Roland Viger for analyzing a time series of satellite imagery using simple algebraic operators that treats time series of imagery as a threedimensional data set, where two dimensions encode planimetric position on earth surface and the third dimension encodes time. The high dimensionality of raster data leads to high computational cost, which is why parallel computation is attractive. This thesis describes the design, implementation, andmperformance evaluation of parallel compositing of vegetation indices derived from MODIS datasets using TMA.
|
Page generated in 0.0725 seconds