{"id":"https://openalex.org/W400909941","doi":null,"title":"TAAG: An Efficient Task Allocation Algorithm for Grid Environment","display_name":"TAAG: An Efficient Task Allocation Algorithm for Grid Environment","alternate_titles":[],"publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W400909941","mag":"400909941"},"language":"en","primary_location":{"id":"mag:400909941","doi":null,"is_oa":false,"landing_page_url":"https://www.enggjournals.com/ijet/docs/IJET14-06-04-085.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W400909941"],"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/A5053757357","display_name":"S. Vaaheedha Kfatheen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Vaaheedha Kfatheen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114093395","display_name":"M. Nazreen Banu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Nazreen Banu","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.3121,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62634424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grid-computing","display_name":"grid computing","score":0.871999979019165},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.8889999985694885},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.8980000019073486},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.7229999899864197},{"id":"https://openalex.org/keywords/min-min-scheduling","display_name":"min-min scheduling","score":0.7609999775886536},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.8330000042915344},{"id":"https://openalex.org/keywords/makespan","display_name":"makespan","score":0.8939999938011169},{"id":"https://openalex.org/keywords/completion-time","display_name":"completion time","score":0.8090000152587891},{"id":"https://openalex.org/keywords/resource-heterogeneity","display_name":"resource heterogeneity","score":0.6039999723434448}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8347203731536865},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.7179329991340637},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.69701087474823},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6870735287666321},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6682655215263367},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6205695271492004},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4948558211326599},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.47244173288345337},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4688110649585724},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4353812336921692},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43136897683143616},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4283938407897949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3091522455215454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2425660490989685},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06465926766395569},{"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:400909941","doi":null,"is_oa":false,"landing_page_url":"https://www.enggjournals.com/ijet/docs/IJET14-06-04-085.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.570.5823","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.5823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.enggjournals.com/ijet/docs/IJET14-06-04-085.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1896158609","https://openalex.org/W1998937695","https://openalex.org/W2054400581","https://openalex.org/W2102916293","https://openalex.org/W2103165404","https://openalex.org/W2108167744","https://openalex.org/W2111259717","https://openalex.org/W2135938932","https://openalex.org/W2152270876","https://openalex.org/W2167030112","https://openalex.org/W2171439285","https://openalex.org/W2474548372","https://openalex.org/W3147678922"],"related_works":["https://openalex.org/W1896158609","https://openalex.org/W2133573162","https://openalex.org/W2170511200","https://openalex.org/W2006424468","https://openalex.org/W2891766280","https://openalex.org/W1502719030","https://openalex.org/W2389315711","https://openalex.org/W1989145048","https://openalex.org/W2348011252","https://openalex.org/W2006421471"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"Grid":[2,109],"computing":[3,9,165],"is":[4,31,64],"a":[5,20,29,39,76,87,141],"form":[6],"of":[7,13,26,75,103,119,151,167,182],"distributed":[8],"where":[10],"the":[11,43,48,55,65,69,80,108,117,120,149,152,164,168,174,192],"resources":[12,106,160],"various":[14],"computers":[15],"are":[16,154,157],"shared":[17],"to":[18,24,46,54,115,163,191],"solve":[19],"particular":[21],"problem.":[22],"Due":[23],"heterogeneity":[25],"resources,":[27],"scheduling":[28,62,89,124],"task":[30,61,78,123,153],"significantly":[32],"complex":[33],"in":[34,42,79,107,180],"nature.":[35],"Scheduling":[36,131],"strategy":[37],"plays":[38],"vital":[40],"role":[41],"grid":[44,57],"environment":[45],"schedule":[47],"user":[49],"tasks":[50,104],"and":[51,135,156,187],"dispatch":[52],"them":[53],"appropriate":[56],"resources.":[58],"A":[59],"good":[60],"method":[63],"one":[66],"which":[67],"reduces":[68],"total":[70],"time":[71],"taken":[72],"for":[73,98,100],"execution":[74],"given":[77],"grid.":[81],"In":[82,146],"this":[83,147],"paper,":[84,148],"we":[85],"propose":[86],"new":[88,142],"algorithm":[90,113,125,176],"called":[91],"TAAG":[92],"(An":[93],"Efficient":[94],"Task":[95,130],"Allocation":[96],"Algorithm":[97,132],"Grid)":[99],"efficient":[101],"allocation":[102,144],"on":[105],"environment.":[110],"The":[111],"proposed":[112,175],"tries":[114],"use":[116],"advantages":[118],"recent":[121],"popular":[122],"known":[126],"as":[127],"\u201cImproved":[128],"Min-Min":[129],"\u201d":[133],"[2]":[134],"covers":[136],"its":[137],"disadvantages":[138],"by":[139],"using":[140],"resource":[143],"model.":[145],"loads":[150],"divided":[155],"allocated":[158],"into":[159],"with":[161],"respect":[162],"capacity":[166],"resource.":[169],"Experimental":[170],"results":[171],"show":[172],"that":[173],"obtain":[177],"better":[178],"solution":[179],"terms":[181],"completion":[183],"time,":[184],"cost,":[185],"makespan":[186],"load":[188],"balancing":[189],"compared":[190],"existing":[193],"algorithms.":[194]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W400909941","counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
