Algorithms for Pre-Compiling Programs by Parallel Compilers

作     者：Fayez AlFayez 

作者机构：Department of Computer Science and InformationCollege of ScienceMajmaah UniversityAl-Majmaah11952Saudi Arabia 

出 版 物：《Computer Systems Science & Engineering》 (计算机系统科学与工程（英文）)

年 卷 期：2023年第44卷第3期

页      面：2165-2176页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：The author would like to thank the Deanship of Scientific Research at Majmaah University for supporting this work under Project Number No.R-2022-85 

主　　题：Compiler encryption scheduling big data algorithms 

摘      要：The paper addresses the challenge of transmitting a big number offiles stored in a data center(DC),encrypting them by compilers,and sending them through a network at an acceptable *** to the big number offiles,only one compiler may not be sufficient to encrypt data in an acceptable *** this paper,we consider the problem of several compilers and the objective is tofind an algorithm that can give an efficient schedule for the givenfiles to be compiled by the *** main objective of the work is to minimize the gap in the total size of assignedfiles between *** minimization ensures the fair distribution offiles to different *** problem is considered to be a very hard *** paper presents two research *** axis is related to *** propose a novel pre-compiler architecture in this *** second axis is algorithmic *** develop six algorithms to solve the problem,in this *** algorithms are based on the dispatching rules method,decomposition method,and an iterative *** algorithms give approximate solutions for the studied *** experimental result is imple-mented to show the performance of *** indicators are used to measure the performance of the proposed *** addition,five classes are proposed to test the algorithms with a total of 2350 instances.A comparison between the proposed algorithms is presented in different tables discussed to show the performance of each *** result showed that the best algorithm is the Iterative-mixed Smallest-Longest-Heuristic(ISL)with a percentage equal to 97.7%and an average running time equal to 0.148 *** other algorithms did not exceed 22%as a *** best algorithm excluding ISL is Iterative-mixed Longest-Smallest Heuristic(ILS)with a percentage equal to 21,4%and an average running time equal to 0.150 s.