Cluster partitioning approaches to parallel Monte Carlo simulation on multiprocessors Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/1r66j404p

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We consider the parallelization of Monte Carlo algorithms for analyzing numerical models of charge transport used in semiconductor device physics. Parallel algorithms for the standard k-space Monte Carlo simulation of a three band model of bulk GaAs on hypercube multicomputers are first presented. This Monte Carlo model includes scattering due to polar-optical, intervalley, and acoustic phonons, as well as electron-electron scattering. The k-space Monte Carlo program, excluding electron-electron scattering, is then extended to simulate a semiconductor device by the addition of the real space position of each simulated particle and the assignment of particle charge, using a cloud in cell scheme, to solve the Poisson's equation with particle dynamics. Techniques for effectively partitioning this device so as to balance the computational load while minimizing the communication overhead are discussed. Approaches for improving the efficiency of the parallel algorithm, either by dynamically balancing of load or by employing the usual techniques for enhancing rare events in Monte Carlo simulations are also considered. The parallel algorithms were implemented on a 64-node NCUBE multiprocessor and test results were generated to validate the parallel k-space, as well as the device simulation programs. Timing measurements were also made to study the variation of speedups as both the problem size and number of processors are varied. The effective exploitation of the computational power of message passing multiprocessors requires the efficient mapping of parallel programs onto processors so as to balance the computational load while minimizing the communication overhead between processors. A lower bound for this communication volume when mapping arbitrary task graphs onto distributed processor systems is derived. For a K processor system this lower bound can be computed from the K (possibly) largest eigenvalues of the adjacency matrix of the task graph and the eigenvalues of the adjacency matrix of the processor graph. We also derive the eigenvalues of the adjacency matrix of the processor graph for a hypercube and give test results comparing the lower bound for the communication volume with the values given by a heuristic algorithm for a number of task graphs.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 8-bit Grayscale) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Kaylee Patterson (kdpscanner@gmail.com) on 2013-01-28T21:53:05Z No. of bitstreams: 1 RanawakeUdayaA1992.pdf: 4253238 bytes, checksum: 34c767cab13e471dbded26121fe1c82a (MD5)
  • description.provenance : Rejected by Patricia Black(patricia.black@oregonstate.edu), reason: Replace file on 2013-01-28T21:51:19Z (GMT)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-01-29T16:21:23Z (GMT) No. of bitstreams: 1 RanawakeUdayaA1992.pdf: 4253238 bytes, checksum: 34c767cab13e471dbded26121fe1c82a (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-01-28T21:54:58Z (GMT) No. of bitstreams: 1 RanawakeUdayaA1992.pdf: 4253238 bytes, checksum: 34c767cab13e471dbded26121fe1c82a (MD5)
  • description.provenance : Submitted by Kaylee Patterson (kdpscanner@gmail.com) on 2013-01-28T20:56:39Z No. of bitstreams: 1 RuangruchiraNatsuda1992.pdf: 6324182 bytes, checksum: e4a41e490520f9f46818e3d80feb3aea (MD5)
  • description.provenance : Made available in DSpace on 2013-01-29T16:21:23Z (GMT). No. of bitstreams: 1 RanawakeUdayaA1992.pdf: 4253238 bytes, checksum: 34c767cab13e471dbded26121fe1c82a (MD5) Previous issue date: 1992-04-23

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items