A general performance model for parallel sweeps on orthogonal grids for particle transport calculations /

There is a growing need to accurately simulate physical systems whose evolution depends on the transport of subatomic particles. It has long been recognized that the huge computational demands of the transport problem mean that practical solution times will be obtained only by the efficient utiliza...

Full description

Bibliographic Details
Main Author: Mathis, Mark Michael, 1976-
Format: Thesis eBook
Language:English
Published: [Place of publication not identified] : [publisher not identified] ; 2000.
Subjects:
Online Access:Link to OAKTrust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000ctm a2200000Ka 4500
001 in00001619829
005 20220103114501.0
007 cr unu a
008 010719s2000 xx a b 000 0 eng d
035 |a (OCoLC)ocm47443318 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM  |a TXAR 
099 |a 2000  |a Thesis M381 
100 1 |a Mathis, Mark Michael,  |d 1976- 
245 1 2 |a A general performance model for parallel sweeps on orthogonal grids for particle transport calculations /  |c by Mark Michael Mathis. 
264 1 |a [Place of publication not identified] :  |b [publisher not identified] ;  |c 2000. 
300 |a ix, 56 leaves :  |b illustrations ;  |c 28 cm. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major subject: Computer Science". 
500 |a Vita. 
502 |b M.S.  |c Texas A&M University  |d 2000. 
504 |a Includes bibliographical references (leaves 54-55). 
520 |a There is a growing need to accurately simulate physical systems whose evolution depends on the transport of subatomic particles. It has long been recognized that the huge computational demands of the transport problem mean that practical solution times will be obtained only by the efficient utilization of parallel processing. For example, since estimates place the time devoted to particle transport in multi-physics simulations at 50-80% of total execution time, parallelizing deterministic particle transport calculations is an important problem in many applications targeted by the Accelerated Strategic Computing Initiative of the United States Department of Energy. One common approach to deterministic particle transport calculations is the discrete-ordinates method, whose most time consuming step is the transport sweep which involves multiple sweeps through the spatial grid, one for each direction of particle travel. The efficient parallel implementation of the transport sweeps is the key to parallelizing the discrete-ordinates method. The key contribution of this thesis is a new general model that can be used to compare the running times of transport sweeps on three-dimensional orthogonal grids for various mappings of the grid cells to processors. Our model, which includes machine-dependent parameters such as computation cost and communication latency, can be used to analyze and compare the effects of various spatial decompositions on the running time of the transport sweep. Insight obtained from the model yields two significant contributions to the theory of optimal transport sweeps on orthogonal grids. First, our model provides a theoretical basis that explains why, and under what circumstances, the column decomposition of the current standard KBA algorithm is superior to the 'balanced' decomposition obtained by classic domain decomposition techniques. Second, our model enables us to identify a new decomposition, which we call Hybrid, that proves to be almost as good as and often better than the current standard KBA method. We obtain expressions for the completion time and discuss theoretical results. 
530 |a Also available online. 
530 |a Issued also on microfiche from Lange Micrographics. 
650 4 |a Major computer science. 
856 4 1 |u https://hdl.handle.net/1969.1/ETD-TAMU-2000-THESIS-M381  |z Link to OAKTrust copy  |t 0 
948 |a cataloged  |b h  |c 2001/7/19  |d c  |e eneff  |f 3:13:02 pm 
994 |a E0  |b TXA 
999 |a MARS 
999 f f |s ad279d9a-2236-3d5b-9b56-9f5ce9c3644d  |i 1031859a-5af5-3b48-bd9b-e66a0aac999b  |t 0 
952 f f |p noncirc  |a Texas A&M University  |b College Station  |c Cushing Memorial Library & Archives  |s cush tdrm  |d Cushing: Theses & Dissertations Microforms (Does not check out)  |t 0  |e 2000 Thesis M381  |h Other scheme  |i computer -- online resource 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e 2000 Thesis M381  |h Other scheme 
998 f f |a 2000 Thesis M381  |t 0  |l Cushing: Theses & Dissertations Microforms (Does not check out) 
998 f f |a 2000 Thesis M381  |t 0  |l Available Online