rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Parallel FFT algorithms for cache based shared memory multiprocessors
  name:
    name part: Kumar, Akhilesh.
    role:
      role term: creator
  name:
    name part: Bhuyan, Laxmi N.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 1993
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: 19 leaves : illustrations ; 28 cm.
  abstract: Abstract: "Shared memory multiprocessors with cache require careful consideration of cache parameters while developing or implementing an algorithm to obtain optimal performance. Implementing synchronous algorithms on shared memory multiprocessors also needs synchronization steps to properly order the steps of execution in the algorithm. These synchronization steps are costly in terms of execution time and should be minimized. In this report, we study the implementation of some existing parallel FFT algorithms and analyze the number of cache misses based on the problem size, number of processors, cache size, and block size. We also propose a new FFT algorithm which minimizes the number of cache misses as well as the synchronization steps in the algorithm."
  note: Akhilesh Kumar, Laxmi N. Bhuyan.
  note: Cover title.
  note: "April 12, 1993"--Leaf 1.
  note: Includes bibliographical references.
  note: Supported in part by NSF. MIP-9002353
  note: Supported in part by Texas ATP. 999903-165
  subject:
    topic: Multiprocessors
  related item:
    title info:
      title: Technical report (Texas A & M University. Computer Science Department) ; 93-022
  record info:
    record content source: PMC
    record creation date: 940223
    record change date: 20151003083228.0
    record identifier: in00001246820