A MODIFIED A* ALGORITHM FOR ALLOCATING TASK IN HETEROGENEOUS DISTIRBUTED COMPUTING SYSTEMS

Nirmeen A Bahnasawy,Magdy A Koutb,Mervat Mosa,Gamal Attiya

doi:10.47839/ijc.8.2.666

Abstract

Distributed computing can be used to solve large scale scientific and engineering problems. A parallel application could be divided into a number of tasks and executed concurrently on different computers in the system. This paper provides an optimal task assignment algorithm under memory constraints to minimize required time of finishing a parallel application. The proposed algorithm is based on the optimal assignment sequential search (OASS) of the A* algorithm with additional modifications. This modified algorithm yields optimal solution, lower time complexity, reduces the turnaround time of the application and considerably faster compared with the sequential search algorithm.

Highlights

The format of graphic files of PNG was created on October, 1, 1996 for the effective preserving of bitmapped images without losses after the company “Unisys” began to require paying for the using of format of GIF [1]
In accordance to this format, the compressed blocks contain results of he using of the input stream of predictors and algorithm of the LZH [3], according to which the results of contextdependent dictionary algorithm of the LZ77 [4] are compressed by the context-independent Huffman’s codes
In the case of absence of the similar sequence of literals in a dictionary, the first literal of buffer is transferred in the output stream began without changes. After this coded literals are transferred from the beginning of buffer to the end of the dictionary and coding continues in the same way up to the ending of literals of input stream

Summary

ОБЧИСЛЕННЯ РОЗМІРУ БЛОКУ КОДІВ ХАФМАНА ЗА АБСОЛЮТНИМИ

У форматі DEFLATE для кожного стиснутого блоку генерується два блоки кодів Хафмана – для літералів/довжин та для зміщень. Наведемо фрагмент програми мовою C, що реалізує обчислення довжини блоку кодів Хафмана з використанням описаних підходів і бінарного пошуку позиції вставки частот у відсортований масив (тут ділення на 2 замінено побітовим зсувом):. MasFreq[prev[index]]

РЕЗУЛЬТАТИ ЕКСПЕРИМЕНТІВ

ВИСНОВКИ

INTRODUCTION

RESULTS

CONCLUSIONS