Abstract
This paper presents the new method, which is promising for circuit partitioning problem (CPP) solving in distributed computer-aided systems (DCADs) in terms of fog-computing environments. The circuit partitioning problem belongs to NP-hard one. Nowadays parallel computing is widely used for NP-hard problem solving. One of the most important criteria of DCADs performance is the speed of a workload distribution problem solving. The time needed for this procedure can be long enough to affect the computational process. Fog-computing environments have some peculiarities, which affect the workload distribution problem solving. A proposed method allows getting a solution of a satisfactory quality. The fundamental difference of this method is an ontological analysis, which is based on applied algorithms and available resources. It allows decreasing the search space of candidate nodes for workload distribution problem. The novelty of this paper is an ontological approach to workload distribution problem solving in DCADs in fog-computing environments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
