• DocumentCode
    3204623
  • Title

    Optimal deterministic task distribution for multiprocessors

  • Author

    Gottlieb, Israel

  • Author_Institution
    Dept. of Math. & Comput. Sci., Bar Ilan Univ., Ramat Gan, Israel
  • fYear
    1992
  • fDate
    23-26 Mar 1992
  • Firstpage
    179
  • Lastpage
    185
  • Abstract
    Considers the problem of distributing tasks on a multiprocessor network. Some processors cannot accept any tasks, hence the problem is formulated as one of routing packets from an arbitrary subset S to an arbitrary subset T, where the exact target node for a particular packet is unspecified. The solution presented matches n2n tasks to target nodes in O(logn) time-on a butterfly, using a deterministic routing and with low (<10) constant factor. As a corollary, the paper also obtains a simple solution to the (n, K) token distribution problem
  • Keywords
    computational complexity; distributed algorithms; multiprocessor interconnection networks; protocols; scheduling; butterfly network; deterministic routing; deterministic task distribution; multiprocessor network; packet routing; target nodes; token distribution problem; Computer science; Gallium nitride; Graph theory; Joining processes; Multiprocessing systems; Protocols; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1992. Proceedings., Sixth International
  • Conference_Location
    Beverly Hills, CA
  • Print_ISBN
    0-8186-2672-0
  • Type

    conf

  • DOI
    10.1109/IPPS.1992.223050
  • Filename
    223050
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3204623