Show simple item record

dc.contributor.authorKaya, Kameren_US
dc.contributor.authorUçar, B.en_US
dc.date.accessioned2016-02-08T11:34:29Z
dc.date.available2016-02-08T11:34:29Z
dc.date.issued2009en_US
dc.identifier.issn0129-6264
dc.identifier.urihttp://hdl.handle.net/11693/26741
dc.description.abstractWe consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A* search. We report simulation results over a wide range of parameters where the largest solved instance contains about three hundred tasks to be assigned to eight processors. © World Scientific Publishing Company.en_US
dc.language.isoEnglishen_US
dc.source.titleParallel Processing Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1142/S012962640900033Xen_US
dc.subjectAen_US
dc.subjectHeterogeneous computing systemsen_US
dc.subjectSearchen_US
dc.subjectTask assignmenten_US
dc.subjectTask interaction graphen_US
dc.subjectComputational complexityen_US
dc.subjectHeterogeneous networksen_US
dc.subjectTraveling salesman problemen_US
dc.subjectComputer scienceen_US
dc.titleExact algorithms for a task assignment problemen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage451en_US
dc.citation.epage465en_US
dc.citation.volumeNumber19en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1142/S012962640900033Xen_US
dc.publisherWorld Scientific Publishing Companyen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record