{"id":"https://openalex.org/W2943101136","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","title":"A Task Duplication Based Efficient Multi-Objective Grid Workflow Scheduling Algorithm","display_name":"A Task Duplication Based Efficient Multi-Objective Grid Workflow Scheduling Algorithm","alternate_titles":[],"publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2943101136","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","mag":"2943101136"},"language":"en","primary_location":{"id":"pmh:oai:ijarcs.info:article/1060","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","is_oa":true,"landing_page_url":"http://ijarcs.info/index.php/index/article/view/1060","pdf_url":null,"source":{"id":"https://openalex.org/S2764748552","display_name":"International Journal of Advanced Research in Computer Science","issn_l":"0976-5697","issn":["0976-5697"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324013418","host_organization_name":"International Journal of Advanced Research in Computer Science","host_organization_lineage":["https://openalex.org/P4324013418"],"host_organization_lineage_names":["International Journal of Advanced Research in Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.26483/ijarcs.v3i2","raw_type":"info:eu-repo/semantics/article"},"parent_works":[],"lineage":["https://openalex.org/W2943101136"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://ijarcs.info/index.php/index/article/view/1060","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019604188","display_name":"F. Kurus Malai Selvi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"F. Kurus Malai Selvi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110773609","display_name":"D. I. George Amalarethinam","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"DR. D.I.GEORGE AMALARETHINAM","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"2","first_page":"87","last_page":"92"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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":1.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/grid-workflow-scheduling","display_name":"grid workflow scheduling","score":0.972000002861023},{"id":"https://openalex.org/keywords/task-duplication","display_name":"task duplication","score":0.9559999704360962},{"id":"https://openalex.org/keywords/multi-objective-scheduling","display_name":"multi-objective scheduling","score":0.9449999928474426},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9110000133514404},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8880000114440918},{"id":"https://openalex.org/keywords/communication-overhead","display_name":"communication overhead","score":0.7310000061988831},{"id":"https://openalex.org/keywords/resource-utilization","display_name":"resource utilization","score":0.906000018119812},{"id":"https://openalex.org/keywords/heterogeneous-systems","display_name":"heterogeneous systems","score":0.7310000061988831},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.6150000095367432},{"id":"https://openalex.org/keywords/task-graphs","display_name":"task graphs","score":0.36399999260902405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8938013315200806},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7216857671737671},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6981908082962036},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6179609894752502},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6156246662139893},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5661754608154297},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5562616586685181},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.5377137660980225},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5351117253303528},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.525297224521637},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5178794860839844},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49212807416915894},{"id":"https://openalex.org/C140824633","wikidata":"https://www.wikidata.org/wiki/Q2808660","display_name":"Workflow management system","level":3,"score":0.4846552014350891},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.48206454515457153},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.45730334520339966},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4362756013870239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4311724901199341},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3380805253982544},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.13430219888687134},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13111206889152527},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12026366591453552},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08809089660644531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ijarcs.info:article/1060","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","is_oa":true,"landing_page_url":"http://ijarcs.info/index.php/index/article/view/1060","pdf_url":null,"source":{"id":"https://openalex.org/S2764748552","display_name":"International Journal of Advanced Research in Computer Science","issn_l":"0976-5697","issn":["0976-5697"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324013418","host_organization_name":"International Journal of Advanced Research in Computer Science","host_organization_lineage":["https://openalex.org/P4324013418"],"host_organization_lineage_names":["International Journal of Advanced Research in Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.26483/ijarcs.v3i2","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2943101136","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","is_oa":true,"landing_page_url":"https://www.ijarcs.info/index.php/Ijarcs/article/view/1060","pdf_url":null,"source":{"id":"https://openalex.org/S2764748552","display_name":"International Journal of Advanced Research in Computer Science","issn_l":"0976-5697","issn":["0976-5697"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324013418","host_organization_name":"International Journal of Advanced Research in Computer Science","host_organization_lineage":["https://openalex.org/P4324013418"],"host_organization_lineage_names":["International Journal of Advanced Research in Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Advanced Research in Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:ijarcs.info:article/1060","doi":"https://doi.org/10.26483/ijarcs.v3i2.1060","is_oa":true,"landing_page_url":"http://ijarcs.info/index.php/index/article/view/1060","pdf_url":null,"source":{"id":"https://openalex.org/S2764748552","display_name":"International Journal of Advanced Research in Computer Science","issn_l":"0976-5697","issn":["0976-5697"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4324013418","host_organization_name":"International Journal of Advanced Research in Computer Science","host_organization_lineage":["https://openalex.org/P4324013418"],"host_organization_lineage_names":["International Journal of Advanced Research in Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.26483/ijarcs.v3i2","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2183669417","https://openalex.org/W1963928426","https://openalex.org/W2778267977","https://openalex.org/W4392965238","https://openalex.org/W2392148678","https://openalex.org/W2355330350","https://openalex.org/W2379381593","https://openalex.org/W1995059063","https://openalex.org/W113198150","https://openalex.org/W1991078962"],"abstract_inverted_index":{"Grid":[0,47,187],"computing":[1,39],"facilitates":[2],"global":[3],"infrastructure":[4],"for":[5],"user":[6],"to":[7,29,106],"consume":[8],"the":[9,12,16,34,64,80,86,113,126,132,158,180],"services":[10],"over":[11],"network.":[13],"To":[14],"achieve":[15],"promising":[17],"potentials":[18],"of":[19,33,63,82],"enormous":[20],"distributed":[21,87],"resources,":[22],"effective":[23],"and":[24,78,121,130,146,168,177],"efficient":[25,70],"scheduling":[26,49,66,175],"algorithms":[27,176],"have":[28],"be":[30],"used.":[31],"Most":[32],"parallel":[35],"applications":[36],"in":[37,116,128,149,173],"grid":[38],"fall":[40],"into":[41],"interdependent":[42,83],"task":[43,133,144],"model":[44],"called":[45],"workflow.":[46],"workflow":[48,65],"represented":[50],"by":[51,124],"Directed":[52],"Acyclic":[53],"Graph":[54],"(DAG)":[55],"is":[56,67,73,104,183],"a":[57,74,92,117,150],"typical":[58],"NP-Complete":[59],"problem.":[60],"The":[61,136,153],"performance":[62],"based":[68],"on":[69,85,134],"scheduling.":[71],"Scheduling":[72,101,172],"process":[75],"that":[76,179],"maps":[77],"manages":[79],"execution":[81],"tasks":[84],"resources.":[88],"In":[89],"this":[90],"paper,":[91],"new":[93],"algorithm,":[94],"named":[95],"Task":[96],"Duplication":[97,171],"Based":[98],"Efficient":[99],"Multi-Objective":[100],"(TDB-EMOS)":[102],"algorithm":[103,138,182],"proposed":[105,137,181],"satisfy":[107],"multi":[108],"objective":[109],"functions.":[110],"It":[111],"maximizes":[112],"resource":[114],"utilization":[115],"grid,":[118],"minimizes":[119],"makespan":[120],"communication":[122],"cost/time":[123],"reserving":[125],"resources":[127],"advance":[129],"schedules":[131],"priority.":[135],"has":[139],"been":[140],"implemented":[141],"with":[142,157],"arbitrary":[143],"graphs":[145,148],"application":[147],"simulated":[151],"environment.":[152],"results":[154],"are":[155],"compared":[156],"well":[159],"known":[160],"Min-Min,":[161],"HEFT,":[162],"EDOS":[163],"(Efficient":[164],"Dual":[165],"Objective":[166],"Scheduling)":[167],"EDS-G":[169],"(Economical":[170],"grid)":[174],"showing":[178],"yielding":[184],"better":[185],"results.Keywords:":[186],"Computing;":[188],"DAG;":[189],"Workflow":[190],"scheduling;":[191],"Heterogeneous":[192],"systems;":[193],"Parallel":[194],"processing.":[195]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2943101136","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2019-05-09T00:00:00"}
