• DocumentCode
    2346248
  • Title

    Dynamically allocating sets of fine-grained processors to running computations

  • Author

    Middleton, David

  • Author_Institution
    ICASE, NASA Langley Res. Center, Hampton, VA, USA
  • fYear
    1988
  • fDate
    10-12 Oct 1988
  • Firstpage
    191
  • Lastpage
    194
  • Abstract
    An approach to using general-purpose parallel computers is explored which involves mapping hardware resources onto computations instead of mapping computations onto hardware. Problems such as processor allocation, task scheduling and load balancing change significantly under this approach and may become amenable to new attacks. The implementation of this approach used by the FFP machine, whose computation and communication resources are repeatedly partitioned into disjoint groups that match the needs of available tasks from moment to moment, is described. Several consequences of this system are examined
  • Keywords
    parallel processing; FFP machine; communication resources; disjoint groups; fine-grained processors; general-purpose parallel computers; load balancing; mapping hardware resources; processor allocation; running computations; sets allocation; task scheduling; Communication switching; Concurrent computing; Flexible structures; Hardware; Load management; NASA; Processor scheduling; Switches; Tree data structures; Virtual machining;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
  • Conference_Location
    Fairfax, VA
  • Print_ISBN
    0-8186-5892-4
  • Type

    conf

  • DOI
    10.1109/FMPC.1988.47472
  • Filename
    47472