Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load...
Uložené v:
| Vydané v: | International journal of parallel, emergent and distributed systems Ročník 21; číslo 5; s. 303 - 321 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Taylor & Francis Group
01.10.2006
|
| Predmet: | |
| ISSN: | 1744-5760, 1744-5779 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical results are provided to show the advantages of GA methodology. |
|---|---|
| AbstractList | Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical results are provided to show the advantages of GA methodology. |
| Author | Mani, V. Suresh, S. Kim, H. J. Omkar, S. N. |
| Author_xml | – sequence: 1 givenname: S. surname: Suresh fullname: Suresh, S. organization: Indian Institute of Science Bangalore, Department of Aerospace Engineering – sequence: 2 givenname: V. surname: Mani fullname: Mani, V. email: mani@acro.iisc.ernet.in organization: Indian Institute of Science Bangalore, Department of Aerospace Engineering – sequence: 3 givenname: S. N. surname: Omkar fullname: Omkar, S. N. organization: Indian Institute of Science Bangalore, Department of Aerospace Engineering – sequence: 4 givenname: H. J. surname: Kim fullname: Kim, H. J. organization: Kangwon National University, Department of Control and Instrumentation Engineering |
| BookMark | eNp9kM1KAzEUhYNUsK0-gLu8QDWZziSpuJH6CwU3uh5uMsk0kklKklrq0ztDxYWiq_tz7nfgngka-eA1QueUXFAiyCXlZVlxRhghFeOiLI7QeNjNKs4Xo--ekRM0SemNkLIoGR-jj1v7bpOVTmMXoMFJrXWzdda32Hrc2JSjlduse2Wfsu7wzuY1lltjdMQq-F4H63O6wq32OluFwbUh9kcdBt_g3klDxJsY2ghdN_jCpp9ArU_RsQGX9NlXnaLX-7uX5eNs9fzwtLxZzVRB53lWGE0rZrhhTDHQlJZCaVIVouRSMFDApTFMcipBMCrMQgmqqkZLCgvRgJxPET34qhhSitrUm2g7iPuaknoIr_4VXs_wH4yyGbINfvjX_UteH0jrTYgd7EJ0TZ1h70I0EbyyqZ7_jX8CxF2Lxg |
| CitedBy_id | crossref_primary_10_1016_j_neunet_2012_02_035 crossref_primary_10_1109_TAES_2014_130201 crossref_primary_10_1109_TAES_2018_2798378 crossref_primary_10_1109_TAES_2012_6129670 crossref_primary_10_1007_s11227_021_03960_9 crossref_primary_10_1016_j_asoc_2014_07_021 crossref_primary_10_1109_TCBB_2010_13 crossref_primary_10_1007_s11227_011_0677_2 |
| Cites_doi | 10.1109/71.790600 10.1023/A:1020971118034 10.1109/71.308534 10.1016/0898-1221(96)00156-3 10.1109/71.790598 10.1109/21.120070 10.1016/S0140-3664(03)00181-6 10.1109/7.381944 10.1109/7.259524 10.1109/ICEC.1994.349995 10.1007/978-3-662-07418-3 10.1023/A:1020910932147 10.1016/S0898-1221(03)90190-8 10.1109/7.18637 10.1109/TPDS.2004.1264811 10.1109/TPDS.2002.1036068 10.1109/7.892677 10.1109/71.895794 10.1145/225545.225546 10.1109/7.106129 10.1109/TPDS.2004.1271181 10.1007/11572961_43 10.1109/71.265940 10.1109/7.481247 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 2006 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 2006 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/17445760600567842 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1744-5779 |
| EndPage | 321 |
| ExternalDocumentID | 10_1080_17445760600567842 156767 |
| GroupedDBID | .7F .QJ 0BK 0R~ 29J 30N 4.4 5GY 5VS AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFS ACTIO ACTTO ADCVX ADGTB ADXPE AEISY AEOZL AEPSL AEYOC AFBWG AFION AFKVX AFRVT AGDLA AGMYJ AGVKY AGWUF AHDZW AIJEM AIYEW AJWEG AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU ALRRR AQRUH AQTUD AVBZW AWYRJ BLEHA BWMZZ CAG CCCUG CE4 COF CS3 CYRSC DAOYK DGEBU DKSSO EBS EJD E~A E~B GTTXZ H13 HZ~ H~P J.P KYCEM M4Z NA5 NX~ O9- OPCYK PQQKQ RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ~S~ AAYXX ADUMR AGBKS ARCSS CITATION HF~ IPNFZ LJTGL NUSFT RIG |
| ID | FETCH-LOGICAL-c213t-2fe156f7f66c6ae1148ce052847b86aca7bff6b71ba8618f9c81c5deb1a98dab3 |
| IEDL.DBID | TFW |
| ISSN | 1744-5760 |
| IngestDate | Sat Nov 29 02:32:35 EST 2025 Tue Nov 18 21:38:09 EST 2025 Mon Oct 20 23:46:24 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c213t-2fe156f7f66c6ae1148ce052847b86aca7bff6b71ba8618f9c81c5deb1a98dab3 |
| PageCount | 19 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_17445760600567842 crossref_primary_10_1080_17445760600567842 crossref_citationtrail_10_1080_17445760600567842 |
| PublicationCentury | 2000 |
| PublicationDate | 10/1/2006 2006-10-00 |
| PublicationDateYYYYMMDD | 2006-10-01 |
| PublicationDate_xml | – month: 10 year: 2006 text: 10/1/2006 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | International journal of parallel, emergent and distributed systems |
| PublicationYear | 2006 |
| Publisher | Taylor & Francis Group |
| Publisher_xml | – name: Taylor & Francis Group |
| References | David L. (CIT0030) 1991 CIT0032 CIT0012 CIT0011 CIT0033 Drozdowski M. (CIT0015) 2002; 27 CIT0014 CIT0036 CIT0013 CIT0035 CIT0016 CIT0038 CIT0037 CIT0018 Agrawal R. (CIT0026) 1988; 37 CIT0017 CIT0019 CIT0040 CIT0021 CIT0020 CIT0001 CIT0023 CIT0022 Goldberg D.E. (CIT0029) 1989 Bharadwaj J. (CIT0006) 1996 Goldberg D.E. (CIT0039) 1985 CIT0003 CIT0025 CIT0002 CIT0024 CIT0005 CIT0027 CIT0004 CIT0007 Holland H.J. (CIT0028) 1975 Frieder O. (CIT0034) 2003; 3 Michalewicz Z. (CIT0031) 1994 CIT0009 CIT0008 |
| References_xml | – ident: CIT0040 – ident: CIT0033 doi: 10.1109/71.790600 – ident: CIT0021 doi: 10.1023/A:1020971118034 – ident: CIT0011 – ident: CIT0009 – ident: CIT0007 doi: 10.1109/71.308534 – ident: CIT0027 – ident: CIT0016 doi: 10.1016/0898-1221(96)00156-3 – ident: CIT0035 doi: 10.1109/71.790598 – volume-title: Scheduling Divisible Loads in Parallel and Distributed Systems year: 1996 ident: CIT0006 – ident: CIT0025 – ident: CIT0003 doi: 10.1109/21.120070 – start-page: 154 volume-title: Presented at the First International Conference on Genetic Algorithms year: 1985 ident: CIT0039 – ident: CIT0022 doi: 10.1016/S0140-3664(03)00181-6 – ident: CIT0008 doi: 10.1109/7.381944 – volume: 27 start-page: 43 year: 2002 ident: CIT0015 publication-title: Found Comput Decision Sci. – ident: CIT0004 doi: 10.1109/7.259524 – ident: CIT0038 doi: 10.1109/ICEC.1994.349995 – volume: 37 start-page: 1272 year: 1988 ident: CIT0026 publication-title: IEEE Trans Comput. – volume-title: Genetic Algorithms+Data Structures = Evolution Programs year: 1994 ident: CIT0031 doi: 10.1007/978-3-662-07418-3 – ident: CIT0023 doi: 10.1023/A:1020910932147 – ident: CIT0014 doi: 10.1016/S0898-1221(03)90190-8 – volume: 3 start-page: 1785 year: 2003 ident: CIT0034 publication-title: IEEE Trans Knowledge Data Eng. – ident: CIT0001 doi: 10.1109/7.18637 – ident: CIT0020 – ident: CIT0017 doi: 10.1109/TPDS.2004.1264811 – volume-title: Genetic Algorithms in Search, Optimization and Machine Learning year: 1989 ident: CIT0029 – ident: CIT0036 doi: 10.1109/TPDS.2002.1036068 – ident: CIT0019 doi: 10.1109/7.892677 – volume-title: Handbook of Genetic Algorithms year: 1991 ident: CIT0030 – ident: CIT0013 doi: 10.1109/71.895794 – ident: CIT0037 doi: 10.1145/225545.225546 – ident: CIT0024 – ident: CIT0002 doi: 10.1109/7.106129 – ident: CIT0012 doi: 10.1109/TPDS.2004.1271181 – ident: CIT0018 doi: 10.1007/11572961_43 – volume-title: Adaptation in Natural and Artificial Systems year: 1975 ident: CIT0028 – ident: CIT0032 doi: 10.1109/71.265940 – ident: CIT0005 doi: 10.1109/7.481247 |
| SSID | ssj0042467 |
| Score | 1.7147485 |
| Snippet | Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load... |
| SourceID | crossref informaworld |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 303 |
| SubjectTerms | Divisible loads Genetic algorithms Processing time Scheduling problems Sequencing |
| Title | Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach |
| URI | https://www.tandfonline.com/doi/abs/10.1080/17445760600567842 |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 1744-5779 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0042467 issn: 1744-5760 databaseCode: TFW dateStart: 20050301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV05T8MwFLZQxcBCOUW55IEJySKHk9hsCKiYKoYiukW2Y6NKaYqalIFfj5_joFYcA8x5tl5iv8t5_j6ELozkQplIEsF1QWhiNAGYMWLSiBUBMzZLkI5sIhuN2GTCH31vTu3bKqGGNi1QhPPVYNxC1l1H3JVNoqlNk4MUcCwzRsED27APZjkePnd-mEbU8ceCNAHx7p_mdzOsRaU1zNKVaDPs_1PPHbTt00x80-6LXbShqz3U7ygcsLfoffR-N4Xb5bLUuJyLAtta18YeuKKOpxUuAFUXCLG0feIgnzGc22K5BFYVrCC3BIqJpr7GdiPCfUgsypf5wgrNsNUbg9ZigX0X2Azm7VDMD9DT8H58-0A8HQNRURg3JDLaFnsmM2mqUqGhkFI6SCC-SZYKJTJpTCqzUAqWhsxwxUKVFDYYCM4KIeND1KvmlT5COGEi5lQozhJJw4JL6zjiTMXCUBkZkQxQ0C1HrjxWObxPmYce0vTLtx2gy88hry1Qx2_Cyeoa5407HTEtlUke_zju-I_jTtCWO7pxTYCnqNcslvoMbaq3Zlovzt22_QC3Ou0o |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV05T8MwFLYQIMFCOUU5PTAhWeSOzYaAqohSMRTRLbIdG1VKU5SmDPx6_JwEteIYYM6z5cT2u_Le9yF0pgXjUnuCcKZSEoRaEYAZIzryaOpQbbwEYckm4n6fDofssU64TeuySoihdQUUYXU1XG5IRjclcRfGiw6Mn-xEAGQZ08Co4JXQ2FnAzh90nhtNHHiBZZAFcQLyzV_N76ZYsEsLqKVz9qbT-u9KN9FG7Wniq-pobKEllW-jVsPigOtLvYPeb0bQYC4yhbMJT7EJd435gS51PMpxCsC6wImlzBOL-owhdYvFDIhVsAT3ElgmyuklNmcRWiIxz14mhREaY7NwDMvmBa4LwcYwbwNkvoueOreD6y6pGRmI9Fy_JJ5WJt7TsY4iGXEFsZRUTggmTtCISx4LrSMRu4LTyKWaSerKMDX2gDOacuHvoeV8kqt9hEPKfRZwyWgoAjdlwugOP5Y-14HwNA_byGn2I5E1XDm8T5a4Narpl2_bRuefQ14rrI7fhMP5TU5KmyDRFZtJ4v847uCP407RWnfw0Et6d_37Q7RuMzm2JvAILZfFTB2jVflWjqbFiT3DH7ib8VI |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JS8QwFA6iIl4cVxzXHDwJxa5p6k0ci6IMcxhxbiVJExnoLHQ6Hvz15qWpzOBy0GPpS0ibl7ckL9-H0IXiCRPK5w5LZO6EkZIOwIw5ivg0d6nSUQI3ZBNxt0sHg6Rna3NmtqwScmhVA0UYWw2Le5qrpiLuSgfRoQ6TXQI4ljENtQVe088EFLyfvjSGOPRDQyAL4g7IN4ea33Wx5JaWQEsX3E3a-udAt9GWjTPxTa0YO2hFjndRq-FwwHZJ76H3zhCul_NC4mLCcqyTXe184I46Ho5xDrC6wIgl9RuD-Yxh4xbzOdCqYAHBJXBMVLNrrDURLkRiVrxOSi00wnrcGEbNSmzLwEbQbwNjvo-e07v-7b1j-Rgc4XtB5fhK6mxPxYoQQZiETEpINwIHxylhgsVcKcJjjzNKPKoSQT0R5dobsITmjAcHaHU8GctDhCPKgiRkIqERD7084dpyBLEImAq5r1jURm4zHZmwYOXwPUXmWUzTL_-2jS4_m0xrpI7fhKPFOc4qsz2iai6TLPix3dEf252jjV4nzZ4euo_HaNNs45iCwBO0WpVzeYrWxVs1nJVnRoM_APIV8AQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Divisible+load+scheduling+in+distributed+system+with+buffer+constraints%3A+genetic+algorithm+and+linear+programming+approach&rft.jtitle=International+journal+of+parallel%2C+emergent+and+distributed+systems&rft.au=Suresh%2C+S.&rft.au=Mani%2C+V.&rft.au=Omkar%2C+S.+N.&rft.au=Kim%2C+H.+J.&rft.date=2006-10-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=1744-5760&rft.eissn=1744-5779&rft.volume=21&rft.issue=5&rft.spage=303&rft.epage=321&rft_id=info:doi/10.1080%2F17445760600567842&rft.externalDocID=156767 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1744-5760&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1744-5760&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1744-5760&client=summon |