• DocumentCode
    2133428
  • Title

    The parallel break construct, or how to kill an activity tree

  • Author

    Friedman, Yair I. ; Feitelson, Dror G. ; Exman, Iaakov

  • Author_Institution
    Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
  • fYear
    1996
  • fDate
    15-19 Apr 1996
  • Firstpage
    230
  • Lastpage
    234
  • Abstract
    Most parallel languages provide means to express parallelism, e.g. a parallel-do construct, but no means to terminate the parallel activities spawned by such constructs. We propose three high-level primitives for this purpose, which are defined by analogies with primitives that break out of sequential iterative constructs. The primitives are pcontinue, which terminates the calling activity, pbreak, which terminates all the activities in the construct that spawned the calling activity, and return, which terminates all the activities created in the current function call. These constructs are especially useful in search problems, where an activity that finds a solution can terminate other activities that are investigating inferior approaches. Given that parallel constructs can be nested, activities form a tree rooted at the original activity that started the program. The main challenge in implementing pbreak and return is identifying the subtree of activities that should be killed. Three algorithms were designed and implemented, and experiments show that using these constructs can provide significant performance benefits
  • Keywords
    parallel programming; search problems; calling activity; parallel activities; parallel break; parallel constructs; parallel languages; pbreak; pcontinue; search; Algorithm design and analysis; Computer science; Data structures; Force measurement; Intrusion detection; Packaging; Parallel languages; Programming profession; Search problems; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    0-8186-7255-2
  • Type

    conf

  • DOI
    10.1109/IPPS.1996.508063
  • Filename
    508063