By Topic

Load balancing in parallel and distributed processing of tree-based multiple-task jobs

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
$33 $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)
L. Borzemski ; Inst. of Control & Syst. Eng., Tech. Univ. Wroclaw, Poland

The efficient processing of tree based multiple task jobs arriving in batches to parallel and distributed systems is presented. This type of processing can be found in such application fields as, for example, automatic diagnostics and document recognition. A key management issue in such systems is task allocation. Load balancing is often proposed as the task allocation approach. The load balancing algorithms are employed to improve the throughput of the system by distribution of the incoming workload evenly among the processors in the system. The problem-specific static algorithms as well as general dynamic load balancing algorithms have been developed for supporting batch processing of tree based multiple task jobs. The proposed algorithms have been studied through simulation. Prescheduling load balancing algorithms have been evaluated as superior to other algorithms investigated

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Euromicro Workshop on

Date of Conference:

25-27 Jan 1995