Dynamic Farm Skeleton Task Allocation Through Task Mobility

Gregory John Michaelson, Turkey Alsalkini

Research output: Contribution to conferencePaper

23 Downloads (Pure)

Abstract

Demand for multi-process resource invariably outstrips supply and users must often share some common provision. Where batch-based, whole processor allocation proves inflexible, user programs must compete at runtime for the same resource so the load is changeable and unpredictable. We are exploring a mechanism to balance the runtime load by moving computations between processors to optimize resource use. In this paper, we present a generic
algorithmic farm skeleton which is able to move worker tasks between processors in a heterogeneous architecture at runtime guided by a simple dynamic load model. Our experiments suggest that this mechanism is able to effectively compensate for unpredictable load variations.
Original languageEnglish
Publication statusPublished - Jul 2012
Event18th International Conference on Parallel and Distributed Processing Techniques and Applications - Las Vegas, United States
Duration: 16 Jul 201219 Jul 2012

Conference

Conference18th International Conference on Parallel and Distributed Processing Techniques and Applications
CountryUnited States
CityLas Vegas
Period16/07/1219/07/12

Fingerprint Dive into the research topics of 'Dynamic Farm Skeleton Task Allocation Through Task Mobility'. Together they form a unique fingerprint.

  • Cite this

    Michaelson, G. J., & Alsalkini, T. (2012). Dynamic Farm Skeleton Task Allocation Through Task Mobility. Paper presented at 18th International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, United States. http://www.macs.hw.ac.uk/~greg/publications/am.pdpta12.docx