The Grand Challenge problem presented by simulation of perpendicular magnetic recording requires an algorithm scaling close to linearly with the number of elements in the simulation cell. We derive an appropriate algorithm based on 2D FFT’s of field and magnetization in the disk plane, combined with a novel treatme nt of field propagation in the z-direction. The near-linear scaling of the algorithm with number of elements is demonstrated by computer experiments. Although the computation contains a strong data-parallel element, in that an ensemble of 20 members is required in order to achieve statistics, some parallelization is desirable. Adequate parallelization is achieved on an SP machine. On an Intel cluster, speed-up saturation is observed, and is understood in terms of bandwidth limitations.
By: Dennis M. Newns, Wilm E. Donath, Glenn J. Martyna, Manfred E. Schabes, III, Byron H. Lengsfield, Thomas Schrefl
Published in: RC22414 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .