{"id":"https://openalex.org/W2002107027","doi":"https://doi.org/10.4018/jghpc.2011010105","title":"An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication","display_name":"An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2002107027","doi":"https://doi.org/10.4018/jghpc.2011010105","mag":"2002107027"},"language":"en","primary_location":{"id":"doi:10.4018/jghpc.2011010105","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jghpc.2011010105","pdf_url":null,"source":{"id":"https://openalex.org/S43307632","display_name":"International Journal of Grid and High Performance Computing","issn_l":"1938-0259","issn":["1938-0259","1938-0267"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Grid and High Performance Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5077756248","display_name":"Amrit Kumar Agrawal","orcid":"https://orcid.org/0000-0002-1176-1716"},"institutions":[{"id":"https://openalex.org/I153954893","display_name":"Jaypee University of Information Technology","ror":"https://ror.org/00hshrf16","country_code":"IN","type":"education","lineage":["https://openalex.org/I153954893"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amrit Agrawal","raw_affiliation_strings":["Jaypee University of Information Technology, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jaypee University of Information Technology, India","institution_ids":["https://openalex.org/I153954893"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108198812","display_name":"Pranay Chaudhuri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pranay Chaudhuri","raw_affiliation_strings":["Heritage Institute of Technology, India","Heritage Institute of Technology (India)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heritage Institute of Technology, India","institution_ids":[]},{"raw_affiliation_string":"Heritage Institute of Technology (India)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11673517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"1","first_page":"89","last_page":"97"},"is_retracted":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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.800659716129303},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7026972770690918},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6285499334335327},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6015692949295044},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5811849236488342},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.571763813495636},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5529999136924744},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.49565231800079346},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.49496883153915405},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4814862012863159},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.41422903537750244},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3475494384765625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3186969459056854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16666972637176514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12230893969535828}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.800659716129303},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7026972770690918},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6285499334335327},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6015692949295044},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5811849236488342},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.571763813495636},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5529999136924744},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.49565231800079346},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.49496883153915405},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4814862012863159},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.41422903537750244},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3475494384765625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3186969459056854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16666972637176514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12230893969535828},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jghpc.2011010105","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jghpc.2011010105","pdf_url":null,"source":{"id":"https://openalex.org/S43307632","display_name":"International Journal of Grid and High Performance Computing","issn_l":"1938-0259","issn":["1938-0259","1938-0267"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Grid and High Performance Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jghpc0:v:3:y:2011:i:1:p:89-97","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jghpc.2011010105","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2019356799","https://openalex.org/W2023753260","https://openalex.org/W2031415642","https://openalex.org/W2043331236","https://openalex.org/W2065689629","https://openalex.org/W2096709532","https://openalex.org/W2097911714","https://openalex.org/W2107351313","https://openalex.org/W2114603764","https://openalex.org/W2118396891","https://openalex.org/W2129403399","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W2155951254","https://openalex.org/W2164631467","https://openalex.org/W2166843422","https://openalex.org/W3137896427"],"related_works":["https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2167574351","https://openalex.org/W2184166483","https://openalex.org/W2545511463","https://openalex.org/W1526709096","https://openalex.org/W4300092030","https://openalex.org/W2225350526","https://openalex.org/W1935185185","https://openalex.org/W2978148977"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,59],"in":[2],"heterogeneous":[3,39],"parallel":[4,16,32],"and":[5],"distributed":[6],"computing":[7],"environment":[8],"is":[9,49,94],"a":[10,35],"challenging":[11],"problem.":[12],"Applications":[13],"identified":[14],"by":[15,21,42],"tasks":[17,33,93],"can":[18],"be":[19],"represented":[20],"directed-acyclic":[22],"graphs":[23],"(DAGs).":[24],"Scheduling":[25],"refers":[26],"to":[27],"the":[28,67,72,77,85,92,102],"assignment":[29,48],"of":[30,37,54,70,76,91,101],"these":[31],"on":[34,64,99],"set":[36],"bounded":[38],"processors":[40],"connected":[41],"high":[43],"speed":[44],"networks.":[45],"Since":[46],"task":[47,97],"an":[50,56],"NP-complete":[51],"problem,":[52],"instead":[53],"finding":[55],"exact":[57],"solution,":[58],"algorithms":[60],"are":[61],"developed":[62],"based":[63],"heuristics,":[65],"with":[66],"primary":[68],"goal":[69],"minimizing":[71],"overall":[73,86],"execution":[74,87],"time":[75,88],"application":[78],"or":[79],"schedule":[80],"length.":[81],"In":[82],"this":[83],"paper,":[84],"(schedule":[89],"length)":[90],"reduced":[95],"using":[96],"duplication":[98],"top":[100],"Critical-Path-On-a-Processor":[103],"(CPOP)":[104],"algorithm.":[105]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}