Abstract
Abstract In this paper, a cost function considering execution time, communication time and even idle time, is employed to measure the performance of task assignment in a distributed computing system. We successfully develop a new mathematical model to describe this kind of cost function. The task assignment problem is formulated as one of directed‐to‐undirected graph mapping (DU‐mapping) which maps a directed acyclic task graph onto an undirected system graph. The search of optimal DU‐mapping is NP‐complete and is transformed into a state space search problem. Using an underestimation to A* algorithm, we can obtain an optimal DU‐mapping and prune the most nodes in a state space tree. An alternative overesti‐mation is applied to prune more nodes but also obtain a suboptimal DU‐mapping. Results of a wide range of experiments reveal that both estimates perform very well due to close evaluation of the real cost.
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.
