Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
DaParT: a data-parallel programming tool
Download
093271.pdf
Date
2000
Author
Şener, Cevat
Metadata
Show full item record
Item Usage Stats
173
views
0
downloads
Cite This
Subject Keywords
Parallel Programming (Computer science).
,
Parallel processing (Electronic computers).
URI
https://hdl.handle.net/11511/3174
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Computation of viscous flows over flapping airfoils and parallel optimization of flapping parameters
Kaya, Mustafa; Tuncer, İsmail Hakkı; Department of Aerospace Engineering (2003)
Parallelization of K-Means and DBSCAN clustering algorithms on a HPC cluster
Durrani, Hunain; Coşar, Ahmet; Department of Computer Engineering (2013)
The amount of information that must be processed daily by computer systems has reached huge quantities. It is impossible, or would be prohibitively expensive, to build such a powerful supercomputer that could process such large data in the required time limits. Cluster computing has emerged to address this problem by connecting hundreds of small computers using ultra-fast switches so that their combined computational power and parallel processing techniques make it possible to quickly solve many difficult p...
Accelerating of line of sight analysis algorithms with parallel programming
Yılmaz, Gökhan; Temizel, Alptekin; Sürer, Elif; Department of Modeling and Simulation (2017)
Line of sight (LOS) analysis is a set of methods and algorithms to determine the visible points in a terrain with reference to a specific observer point. This analysis is used in simulations, Geographic Information System (GIS) applications and games. For this reason, it is important to have a capability to get results quickly and facilitate analysis in such a way that the interaction with the changing reference points is possible. Van Kreveld, R2 and R3 are the most frequently used algorithms in line of si...
Parallel computation of the diagonal of the inverse of a sparse matrix
Fasllija, Edona; Manguoğlu, Murat; Department of Computer Engineering (2017)
We consider the parallel computation of the diagonal of the inverse of a large sparse matrix. This problem is critical in many applications such as quantum mechanics and uncertainty quantification, where a subset of the entries of the inverse matrix, usually the diagonal, is required. A straightforward approach involves inverting the matrix explicitly and extracting the diagonal of the computed inverse. This approach, however, almost always is too costly for large sparse matrices since the inverse is often ...
Parallelization of the forward and inverse problems of electro-magnetic source imaging of the human brain
Acar, Can Erkin; Gençer, Nevzat Güneri; Department of Electrical and Electronics Engineering (2003)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Şener, “DaParT: a data-parallel programming tool,” Ph.D. - Doctoral Program, Middle East Technical University, 2000.