Algorithms for Pre-Compiling Programs by Parallel Compilers

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