{"id":"https://openalex.org/W2160723730","doi":"https://doi.org/10.5815/ijcnis.2014.07.07","title":"Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm","display_name":"Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm","publication_year":2014,"publication_date":"2014-04-28","ids":{"openalex":"https://openalex.org/W2160723730","doi":"https://doi.org/10.5815/ijcnis.2014.07.07","mag":"2160723730"},"language":"en","primary_location":{"id":"doi:10.5815/ijcnis.2014.07.07","doi":"https://doi.org/10.5815/ijcnis.2014.07.07","is_oa":true,"landing_page_url":"https://doi.org/10.5815/ijcnis.2014.07.07","pdf_url":"https://www.mecs-press.org/ijcnis/ijcnis-v6-n7/IJCNIS-V6-N7-7.pdf","source":{"id":"https://openalex.org/S2501737937","display_name":"International Journal of Computer Network and Information Security","issn_l":"2074-9090","issn":["2074-9090","2074-9104"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Network and Information Security","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.mecs-press.org/ijcnis/ijcnis-v6-n7/IJCNIS-V6-N7-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"R. Mohan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"R. Mohan","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054507472","display_name":"N. P. Gopalan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N.P. Gopalan","raw_affiliation_strings":["Department of Computer Applications, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Applications, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India","institution_ids":["https://openalex.org/I122964287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122964287"],"apc_list":null,"apc_paid":null,"fwci":0.9363,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78177411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"6","issue":"7","first_page":"50","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.4528999924659729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.4528999924659729,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.3230000138282776,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0820000022649765,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.9089999794960022},{"id":"https://openalex.org/keywords/iterated-greedy-algorithm","display_name":"iterated greedy algorithm","score":0.8629999756813049},{"id":"https://openalex.org/keywords/heterogeneous-computing","display_name":"heterogeneous computing","score":0.9589999914169312},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.7549999952316284},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9319999814033508},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.6890000104904175},{"id":"https://openalex.org/keywords/cost-minimization","display_name":"cost minimization","score":0.6389999985694885},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.5559999942779541},{"id":"https://openalex.org/keywords/mpi","display_name":"MPI","score":0.3540000021457672}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.841011106967926},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.7772693037986755},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.7713044285774231},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6866310834884644},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.6720860600471497},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5906683206558228},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5648210644721985},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5119472742080688},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.49048158526420593},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48607566952705383},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4647234082221985},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.4536620080471039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42900604009628296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42559170722961426},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42430272698402405},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42413222789764404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36208632588386536},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3596992492675781},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31259435415267944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10902386903762817},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5815/ijcnis.2014.07.07","doi":"https://doi.org/10.5815/ijcnis.2014.07.07","is_oa":true,"landing_page_url":"https://doi.org/10.5815/ijcnis.2014.07.07","pdf_url":"https://www.mecs-press.org/ijcnis/ijcnis-v6-n7/IJCNIS-V6-N7-7.pdf","source":{"id":"https://openalex.org/S2501737937","display_name":"International Journal of Computer Network and Information Security","issn_l":"2074-9090","issn":["2074-9090","2074-9104"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Network and Information Security","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.5815/ijcnis.2014.07.07","doi":"https://doi.org/10.5815/ijcnis.2014.07.07","is_oa":true,"landing_page_url":"https://doi.org/10.5815/ijcnis.2014.07.07","pdf_url":"https://www.mecs-press.org/ijcnis/ijcnis-v6-n7/IJCNIS-V6-N7-7.pdf","source":{"id":"https://openalex.org/S2501737937","display_name":"International Journal of Computer Network and Information Security","issn_l":"2074-9090","issn":["2074-9090","2074-9104"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-20","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Network and Information Security","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160723730.pdf","grobid_xml":"https://content.openalex.org/works/W2160723730.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1973092446","https://openalex.org/W1977133017","https://openalex.org/W1990392954","https://openalex.org/W1998824988","https://openalex.org/W2005123733","https://openalex.org/W2006751452","https://openalex.org/W2066484523","https://openalex.org/W2073308632","https://openalex.org/W2122753377","https://openalex.org/W2145986688","https://openalex.org/W2152408640"],"related_works":["https://openalex.org/W2005123733","https://openalex.org/W2133540772","https://openalex.org/W7098032864","https://openalex.org/W4210836868","https://openalex.org/W2006439712","https://openalex.org/W1972976761","https://openalex.org/W2151089374","https://openalex.org/W2317413710","https://openalex.org/W7098615439","https://openalex.org/W2020989631"],"abstract_inverted_index":{"The":[0],"problem":[1,44,74],"of":[2,7,32,57,63,70,93,123,132,145,149,157,203],"task":[3,72],"assignment":[4,56,73,158],"is":[5,19,152],"one":[6],"the":[8,15,50,54,60,64,68,71,88,110,130,133,138,143,150,155,163,166,171,185,188,198,201,204],"most":[9,92],"fundamental":[10],"among":[11],"combinatorial":[12],"optimization":[13],"problems.Solving":[14],"Task":[16,89,111],"Assignment":[17,90,112],"Problem":[18,113],"very":[20],"important":[21],"for":[22,75],"many":[23],"real":[24],"time":[25,173],"and":[26,81,98,169,197],"computational":[27],"scenarios":[28],"where":[29],"a":[30,115,120],"lot":[31],"small":[33],"tasks":[34,58],"need":[35],"to":[36,53,59,67,86,153,178,183],"be":[37],"solved":[38],"by":[39],"multiple":[40],"processors":[41,62,180],"simultaneously.A":[42],"classic":[43],"that":[45,127],"confronts":[46],"computer":[47],"scientists":[48],"across":[49],"globe":[51],"pertaining":[52],"effective":[55],"various":[61,139],"system":[65],"due":[66],"intractability":[69],"more":[76],"than":[77],"3":[78],"processors.Several":[79],"Algorithms":[80],"methodologies":[82],"have":[83],"been":[84,105],"proposed":[85],"solve":[87],"Problem,":[91],"which":[94],"use":[95],"Graph":[96,99],"Partitioning":[97],"Matching":[100],"Techniques.Significant":[101],"research":[102],"has":[103],"also":[104],"carried":[106],"out":[107],"in":[108,114,159],"solving":[109],"parallel":[116],"environment.Here":[117],"we":[118],"propose":[119],"modified":[121],"version":[122],"iterated":[124],"greedy":[125],"algorithm":[126,151,189],"capitalizes":[128],"on":[129],"efficacy":[131],"Parallel":[134],"Processing":[135],"paradigm,":[136],"minimizing":[137],"costs":[140],"along":[141],"with":[142],"duration":[144],"convergence.The":[146],"central":[147],"notion":[148],"enhance":[154],"quality":[156],"every":[160],"iteration,":[161],"utilizing":[162],"values":[164],"from":[165],"preceding":[167],"iterations":[168],"at":[170],"same":[172],"assigning":[174],"these":[175],"smaller":[176],"computations":[177],"internal":[179],"(i.e.parallel":[181],"processing)":[182],"hasten":[184],"computation.On":[186],"implementation,":[187],"was":[190],"tested":[191],"using":[192],"Message":[193],"Passing":[194],"Interface":[195],"(MPI)":[196],"results":[199],"show":[200],"effectiveness":[202],"said":[205],"algorithm.":[206]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}