By Topic

How to share a bag of tasks optimally in a heterogeneous cluster - three models, three answers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rosenberg, A.L. ; Massachusetts Univ., Amherst, MA, USA

Summary form only given. In the world of sequential computers, the abstract RAM model enables one to design provably efficient algorithms for a broad range of actual architectures and a broad range of workloads. In the world of multiprocessors, the abstract BSP model serves a similar function. No analogue of the RAM and BSP models is known for modern computing platforms such as clusters of workstations - especially heterogeneous ones, whose constituent workstations may differ in computational power - and the various modalities of Internet-based computing. In this talk, we present circumstantial evidence that no such single algorithmic model can exist for heterogeneous clusters. We describe three quite similar computational problems related to computing a large collection of mutually independent tasks on a cluster. (Two of the problems can be shown formally to be equivalent.) Despite their similarities, the three problems require drastically different algorithmic approaches if one wants provably optimal solutions.

Published in:

Simulation Symposium, 2004. Proceedings. 37th Annual

Date of Conference:

18-22 April 2004