{"id":"https://openalex.org/W2183669417","doi":null,"title":"An Efficient Dual Objective Grid Workflow Scheduling Algorithm","display_name":"An Efficient Dual Objective Grid Workflow Scheduling Algorithm","alternate_titles":[],"publication_year":2011,"publication_date":"2011-11-29","ids":{"openalex":"https://openalex.org/W2183669417","mag":"2183669417"},"language":"en","primary_location":{"id":"mag:2183669417","doi":null,"is_oa":false,"landing_page_url":"https://research.ijcaonline.org/volume33/number1/pxc3875625.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computer Applications","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2183669417"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059713979","display_name":"George Amalarethinam","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Amalarethinam D.I.George","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080645757","display_name":"Malai Selvi F.Kurus","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Malai Selvi F.Kurus","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.6808,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73223846,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":"33","issue":"1","first_page":"7","last_page":"12"},"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-computing","display_name":"grid computing","score":0.8190000057220459},{"id":"https://openalex.org/keywords/workflow-scheduling","display_name":"workflow scheduling","score":0.9399999976158142},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.9229999780654907},{"id":"https://openalex.org/keywords/dual-objective-optimization","display_name":"dual-objective optimization","score":0.7649999856948853},{"id":"https://openalex.org/keywords/resource-utilization","display_name":"resource utilization","score":0.7419999837875366},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.7379999756813049},{"id":"https://openalex.org/keywords/task-dependencies","display_name":"task dependencies","score":0.4950000047683716},{"id":"https://openalex.org/keywords/min-min-algorithm","display_name":"Min-Min algorithm","score":0.7049999833106995},{"id":"https://openalex.org/keywords/heft-algorithm","display_name":"HEFT algorithm","score":0.9610000252723694}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8914705514907837},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7311092019081116},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6154910326004028},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5880646109580994},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.587838888168335},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.575154185295105},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5696499347686768},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.5456649661064148},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5190468430519104},{"id":"https://openalex.org/C140824633","wikidata":"https://www.wikidata.org/wiki/Q2808660","display_name":"Workflow management system","level":3,"score":0.4812169373035431},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.4751741290092468},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46277013421058655},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4559633433818817},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4501606225967407},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4224311113357544},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2981194853782654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28999653458595276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19461777806282043},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08337059617042542},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.060075730085372925},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2183669417","doi":null,"is_oa":false,"landing_page_url":"https://research.ijcaonline.org/volume33/number1/pxc3875625.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Computer Applications","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.259.1280","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.1280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.ijcaonline.org/volume33/number1/pxc3875625.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W130148835","https://openalex.org/W1802742953","https://openalex.org/W1903036498","https://openalex.org/W1973531467","https://openalex.org/W1976716439","https://openalex.org/W2100550451","https://openalex.org/W2106212505","https://openalex.org/W2109024115","https://openalex.org/W2134654387","https://openalex.org/W2135190791","https://openalex.org/W2149294210","https://openalex.org/W2165068354"],"related_works":["https://openalex.org/W2943101136","https://openalex.org/W1963928426","https://openalex.org/W7100065871","https://openalex.org/W2355330350","https://openalex.org/W2280994996","https://openalex.org/W2071248074","https://openalex.org/W2355256425","https://openalex.org/W2351095699","https://openalex.org/W2109024115","https://openalex.org/W130148835"],"abstract_inverted_index":{"ABSTRACT-":[0],"Grid":[1],"computing":[2,37,58],"is":[3,48,61,72,81,125,142,202],"a":[4,49,68,84,133,150,179],"mainstream":[5],"technology":[6],"to":[7,144,153],"integrate":[8],"large":[9],"scale":[10],"distributed":[11,21],"sharing":[12],"resources.":[13,214],"To":[14],"achieve":[15],"the":[16,33,65,95,108,114,120,123,146,158,164,183,188,199],"promising":[17],"potentials":[18],"of":[19,32,67,110,122,213],"tremendous":[20],"resources,":[22],"effective":[23],"and":[24,102,152,162,192,196,210],"efficient":[25],"scheduling":[26,47,70,79,194],"algorithms":[27,195],"are":[28,185],"fundamentally":[29],"important.":[30],"Most":[31],"applications":[34],"in":[35,52,56,149,160,178],"grid":[36,57,76,151],"fall":[38],"into":[39],"interdependent":[40],"task":[41,78,90,165,176],"model":[42],"called":[43],"workflow":[44,77,111],"application.":[45],"Task":[46],"fundamental":[50],"issue":[51],"achieving":[53],"high":[54],"performance":[55,121],"systems.":[59],"It":[60],"well":[62,189],"known":[63,190],"that":[64,117,198,206],"complexity":[66],"general":[69],"problem":[71,80],"NP-Complete":[73],"[1].":[74],"The":[75,92,168],"described":[82],"by":[83,156],"Directed":[85],"Acyclic":[86],"Graph":[87],"(DAG)":[88],"or":[89],"graph.":[91],"graph":[93],"represents":[94],"dependency":[96],"among":[97],"tasks,":[98],"their":[99],"computation":[100],"time":[101,104],"communication":[103],"between":[105],"them.":[106],"In":[107,130],"management":[109],"execution":[112],"scheduling,":[113],"key":[115],"issues":[116],"impact":[118],"on":[119,127,166],"system":[124],"based":[126],"proper":[128],"scheduling.":[129],"this":[131],"paper,":[132],"new":[134],"algorithm,":[135],"named":[136],"Efficient":[137],"Dual":[138],"Objective":[139],"Scheduling":[140],"(EDOS)":[141],"proposed":[143,169,200],"maximize":[145],"resource":[147],"utilization":[148,212],"minimize":[154],"makespan":[155,209],"reserving":[157],"resources":[159],"advance":[161],"schedule":[163],"priority.":[167],"algorithm":[170,201],"has":[171],"been":[172],"implemented":[173],"for":[174],"arbitrary":[175],"graphs":[177],"simulated":[180],"environment.":[181],"Finally,":[182],"results":[184],"compared":[186],"with":[187],"Min-Min":[191],"HEFT":[193],"showing":[197],"yielding":[203],"better":[204],"results,":[205],"is,":[207],"minimizing":[208],"higher":[211]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2183669417","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
