• DocumentCode
    3185526
  • Title

    Solution of a parallel divide-and-conquer model in the presence of overheads

  • Author

    Saha, Arindam ; Muthukumar, Nagarajan

  • Author_Institution
    ERC, Mississippi State, MS, USA
  • fYear
    1993
  • fDate
    4-7 Apr 1993
  • Firstpage
    0.75
  • Abstract
    The authors describe the model for a parallel divide-and-conquer algorithm incorporating both the symmetric and nonsymmetric overheads inherent in any parallel computing environment. An algorithm for computing optimal partitions is derived. This algorithm separates problem sizes into classes of problems that may use the same optimal partition size
  • Keywords
    parallel algorithms; nonsymmetric overheads; optimal partitions; parallel computing environment; parallel divide-and-conquer algorithm; parallel divide-and-conquer model; parallel processing algorithm; symmetric overheads; Algorithm design and analysis; Computational modeling; Concurrent computing; Costs; Equations; Minimax techniques; Optical wavelength conversion; Parallel machines; Parallel processing; Partitioning algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Southeastcon '93, Proceedings., IEEE
  • Conference_Location
    Charlotte, NC
  • Print_ISBN
    0-7803-1257-0
  • Type

    conf

  • DOI
    10.1109/SECON.1993.465741
  • Filename
    465741
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3185526