• English
    • norsk
  • English 
    • English
    • norsk
  • Login
View Item 
  •   All institutions
  • Norges teknisk-naturvitenskapelige universitet
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
  •   All institutions
  • Norges teknisk-naturvitenskapelige universitet
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Seismic processing using Parallel 3D FMM

Borlaug, Idar
Master thesis
Thumbnail
View/Open
347529_ATTACHMENT01.zip (34.28Kb)
347529_FULLTEXT01.pdf (776.7Kb)
347529_COVER01.pdf (47.51Kb)
Permanent link
http://hdl.handle.net/11250/250544
Issue date
2007
Share
Metadata
Show full item record
Collections
  • Institutt for datateknologi og informatikk [2227]
Abstract
This thesis develops and tests 3D Fast Marching Method (FMM) algorithm and apply these to seismic simulations. The FMM is a general method for monotonically advancing fronts, originally developed by Sethian. It calculates the first arrival time for an advancing front or wave. FMM methods are used for a variety of applications including, fatigue cracks in materials, lymph node segmentation in CT images, computing skeletons and centerlines in 3D objects and for finding salt formations in seismic data. Finding salt formations in seismic data, is important for the oil industry. Oil often flows towards gaps in the soil below a salt formation. It is therefore, important to map the edges of the salt formation, for this the FMM can be used. This FMM creates a first arrival time map, which makes it easier to see the edges of the salt formation. Herrmann developed a 3D parallel algorithm of the FMM testing waves of constant velocity. We implemented and tested his algorithm, but since seismic data typically causes a large variation of the velocities, optimizations were needed to make this algorithm scale. By optimising the border exchange and eliminating much of the roll backs, we delevoped and implemented a much improved 3D FMM which achieved close to theoretical performance, for up to at least 256 nodes on the current supercomputer at NTNU. Other methods like, different domain decompositions for better load balancing and running more FMM picks simultaneous, will also be discussed.
Publisher
Institutt for datateknikk og informasjonsvitenskap

Contact Us

Search NORA
Powered by DSpace software

Service from BIBSYS
 

 

Browse this CollectionIssue DateAuthorsTitlesSubjectsDocument TypesJournalsBrowse all ArchivesArchives & CollectionsIssue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

Google Analytics StatisticsView Usage Statistics

Contact Us

Search NORA
Powered by DSpace software

Service from BIBSYS