A Study Optimal Model of Task Partitioning In a Heterogeneous Parallel Computing

Published in Journal

Journal of Advances and Scholarly Researches in Allied Education [JASRAE] (Vol:16/ Issue: 5) DOI: 10.29070/JASRAE
Authors: M. V. Kirankumar*, Anand Gupta,
Subjects: Multidisciplinary Academic Research

Year: Apr, 2019
Volume: 16 / Issue: 5
Pages: 1400 - 1408 (9)
Publisher: Ignited Minds Journals
Source:
E-ISSN: 2230-7540
DOI:
Published URL: http://ipublisher.in/p/231964
Published On: Apr, 2019

Article Details

A Study Optimal Model of Task Partitioning in a Heterogeneous Parallel Computing | Original Article

M. V. Kirankumar*, Anand Gupta, in Journal of Advances and Scholarly Researches in Allied Education | Multidisciplinary Academic Research

Download PDF

View HTML

ABSTRACT:

Optimal Task Partitioning with Duplication (OTPSD) restricts schedule duration just as the overhead correspondence. Duplication of functions has reduced the overhead coordination of the computational system. It is three step algorithms where the first stage requires the design of grain pack Sub DAG. The following stage is a task process of need. The processors are grouped in the third stage by their processing capacities. The proposed algorithm (OTPSD) constraints improve flexibility and display efficiency over MCP and HEFT algorithms over uniform calendar length and processor usage. Determined compute unified system architecture (CUDA) rendering length of OTPSD is (184.4 Sec) shorter than MCP (215.6 Sec) and HEFT (196.3 Sec) algorithms.