• DocumentCode
    1556867
  • Title

    A randomized parallel backtracking algorithm

  • Author

    Janakiram, Virendra K. ; Agrawal, Dharma P. ; Mehrotra, Ravi

  • Author_Institution
    Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
  • Volume
    37
  • Issue
    12
  • fYear
    1988
  • fDate
    12/1/1988 12:00:00 AM
  • Firstpage
    1665
  • Lastpage
    1676
  • Abstract
    A technique for parallel backtracking using randomization is proposed. Its main advantage is that good speedups are possible with little or no interprocessor communication. The speedup obtainable is problem-dependent. In those cases where the problem size becomes very large, randomization is extremely successful achieving good speedups. The technique also ensures high reliability, flexibility, and fault tolerance
  • Keywords
    parallel algorithms; search problems; fault tolerance; flexibility; high reliability; interprocessor communication; parallel backtracking; randomization; speedups; Artificial intelligence; Communication channels; Fault tolerance; Fault tolerant systems; Military computing; Parallel algorithms; Parallel processing; Processor scheduling; Scheduling algorithm;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.9745
  • Filename
    9745
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1556867