Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Efficient Parallel Algorithms For Closest Point Problems, Peter Su
Efficient Parallel Algorithms For Closest Point Problems, Peter Su
Dartmouth College Ph.D Dissertations
This dissertation develops and studies fast algorithms for solving closest point problems. Algorithms for such problems have applications in many areas including statistical classification, crystallography, data compression, and finite element analysis. In addition to a comprehensive empirical study of known sequential methods, I introduce new parallel algorithms for these problems that are both efficient and practical. I present a simple and flexible programming model for designing and analyzing parallel algorithms. Also, I describe fast parallel algorithms for nearest-neighbor searching and constructing Voronoi diagrams. Finally, I demonstrate that my algorithms actually obtain good performance on a wide variety of machine architectures. …
Bmmc Permutations On A Decmpp 12000/Sx 2000, Kristin Bruhl
Bmmc Permutations On A Decmpp 12000/Sx 2000, Kristin Bruhl
Dartmouth College Undergraduate Theses
Increasingly, modern computing problems, including many scientific and business applications, require huge amounts of data to be examined, modified, and stored. Parallel computers can be used to decrease the time needed to operate on such large data sets, by allowing computations to be performed on many pieces of data at once. For example, on the DECmpp machine used in our research, there are 2048 processors in the parallel processor array. The DECmpp can read data into each of these processors, perform a computation in parallel on all of it, and write the data out again, theoretically decreasing the execution time …
Human Creativity Through Computer Gaming, Christine Mcgavran
Human Creativity Through Computer Gaming, Christine Mcgavran
Dartmouth College Undergraduate Theses
No abstract provided.