| Status | 已發表Published |
| MRMT: An algorithm of matching resource for multi-tasks | |
| Yan M.; Zhou J. | |
| 2011-05-11 | |
| Source Publication | International Conference on Advanced Communication Technology, ICACT
 |
| Pages | 1253-1257 |
| Abstract | While most of work on task-resource matching in centreless network has focus on evaluating multi-QoS constraints in quantity, our work addresses this problem from types of QoS constraints, objectivity of matching process, and concurrency of multiple matches. An algorithm of matching resources for multi-tasks synchronously, MRMT, is presented. Firstly, an improved analytic hierarchy process (AHP) method is introduced. Secondly, the Gale-Shapley principle and methods are applied to optimize synchronous matches. The algorithm MRMT is preventive for accumulation of inconsistency with multi-QoS constraints, is especially effective for selecting optimal resources synchronously, and is available for maximizing efficiency for matched resources as possible. © 2011 Global IT Research Inst. |
| Keyword | AHP Concurrency Gale-Shapley Multi-Tasks Resource |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | Inner Mongolia University China |
| Recommended Citation GB/T 7714 | Yan M.,Zhou J.. MRMT: An algorithm of matching resource for multi-tasks[C], 2011, 1253-1257. |
| APA | Yan M.., & Zhou J. (2011). MRMT: An algorithm of matching resource for multi-tasks. International Conference on Advanced Communication Technology, ICACT, 1253-1257. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment