Hsu, Chiun-ChiehChiun-ChiehHsuSHENG-DE WANGKuo, Te-SonTe-SonKuo2007-04-192018-07-062007-04-192018-07-06198907306512http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032158/1/00065047.pdfhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-0024882023&partnerID=40&md5=282fa38984917cf78ea5850688cc384bThe problem of assigning a partitioned task to a distributed computing system is studied. Considering communication overhead and idle time, it is possible to develop a mathematical model to describe the cost function, which is defined to evaluate the task turnaround time, under a general model of distributed computing systems. Task assignment is formulated as a 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. An approach called critical sink underestimate is developed to attain an optimal DU-mapping. This approach allows the most nodes in the state-space tree to be pruned. Experimental results reveal that this method performs very well due to its close evaluation to the real cost.450564 bytesComputer Software--Software Engineering; Distributed Computing Systems; Parallel Processing; Software Development; Computer Systems, Digitalconference paper10.1109/CMPSAC.1989.65047http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032158/1/00065047.pdf