Cited 2 time in
Designing hybrid graph model and algorithmic analysis of workflow decomposition in mobile distributed systems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ali, Ihtisham | - |
| dc.contributor.author | Bagchi, Susmit | - |
| dc.date.accessioned | 2022-12-26T16:46:47Z | - |
| dc.date.available | 2022-12-26T16:46:47Z | - |
| dc.date.issued | 2018-09 | - |
| dc.identifier.issn | 0167-739X | - |
| dc.identifier.issn | 1872-7115 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/11327 | - |
| dc.description.abstract | The execution of data intensive workflow is challenging in the domain of mobile distributed systems due to the involvement of heterogeneous computing devices and dynamic network topology. Moreover, data intensive workflow execution requires frequent access to database servers for dataflow and control flow operations resulting in massive data transfer. The workflow decomposition and distribution are required to minimize data transfer and to reduce execution delay in mobile distributed systems. This paper proposes a hybrid graph model of workflow in mobile distributed systems relying on dynamic network topology and distributed database in order to facilitate workflow decomposition. The algebraic and numerical analysis of the hybrid graph model is represented providing inherent properties. Furthermore, we have presented an extensive analytical study of existing workflow decomposition approaches and have provided detailed analysis to determine the suitability of these approaches in mobile distributed systems. We have also proposed a novel framework and implementation directions for workflow decomposition based on multiple parameters for mobile distributed systems. (C) 2018 Elsevier B.V. All rights reserved. | - |
| dc.format.extent | 17 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | Designing hybrid graph model and algorithmic analysis of workflow decomposition in mobile distributed systems | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.future.2018.03.012 | - |
| dc.identifier.scopusid | 2-s2.0-85044919142 | - |
| dc.identifier.wosid | 000437555800012 | - |
| dc.identifier.bibliographicCitation | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, v.86, pp 145 - 161 | - |
| dc.citation.title | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | - |
| dc.citation.volume | 86 | - |
| dc.citation.startPage | 145 | - |
| dc.citation.endPage | 161 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
| dc.subject.keywordPlus | SCHEDULING WORKFLOWS | - |
| dc.subject.keywordPlus | EXECUTION | - |
| dc.subject.keywordPlus | CONSTRAINTS | - |
| dc.subject.keywordPlus | SOUNDNESS | - |
| dc.subject.keywordPlus | NETS | - |
| dc.subject.keywordAuthor | Workflow decomposition | - |
| dc.subject.keywordAuthor | Distributed database | - |
| dc.subject.keywordAuthor | Workflow graph | - |
| dc.subject.keywordAuthor | Algorithmic analysis | - |
| dc.subject.keywordAuthor | Mobile distributed systems | - |
| dc.subject.keywordAuthor | Adjacency matrices | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
