By Topic

A realistic model for runtime incremental task scheduling in distributed memory multiprocessor systems

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

2 Author(s)
Subhasis Mallick ; B.P.Poddar Institute of Management & Technology, India ; Amitabha Sinha

Even though the area of parallel computing has existed for many decades, programming a parallel system for the execution of a single application is still a challenging problem than programming a sequential program on single processor. In this paper we investigate a partitioning and scheduling strategy for splitting a non-uniform parallel program into smaller tasks and map them into different processors at runtime. We propose a parallel program model which use explicit parallelism to identify independent section and a dynamic scheduling technique to schedule those independent sections (tasks) using message passing to different processors. Finally we show the accuracy of the scheduling by balance the loads in different processors and reduce the communication cost.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010