{"id":"https://openalex.org/W2072307788","doi":"https://doi.org/10.4018/jbdcn.2010010104","title":"Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication","display_name":"Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2072307788","doi":"https://doi.org/10.4018/jbdcn.2010010104","mag":"2072307788"},"language":"en","primary_location":{"id":"doi:10.4018/jbdcn.2010010104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jbdcn.2010010104","pdf_url":null,"source":{"id":"https://openalex.org/S108454011","display_name":"International Journal of Business Data Communications and Networking","issn_l":"1548-0631","issn":["1548-0631","1548-064X"],"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 Business Data Communications and Networking","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/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":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088180075","display_name":"Jeffrey Elcock","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158067","display_name":"University of the West Indies","ror":"https://ror.org/05p4f7w60","country_code":"BB","type":"education","lineage":["https://openalex.org/I137799390","https://openalex.org/I4210158067"]}],"countries":["BB"],"is_corresponding":false,"raw_author_name":"Jeffrey Elcock","raw_affiliation_strings":["University of the West Indies, Barbados","University of the West Indies , Barbados"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of the West Indies, Barbados","institution_ids":["https://openalex.org/I4210158067"]},{"raw_affiliation_string":"University of the West Indies , Barbados","institution_ids":["https://openalex.org/I4210158067"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7457,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74375105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"1","first_page":"58","last_page":"69"},"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.9998999834060669,"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.9998999834060669,"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.9983000159263611,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.8460578918457031},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.7701517343521118},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.693612813949585},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6297959685325623},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6255417466163635},{"id":"https://openalex.org/keywords/symmetric-multiprocessor-system","display_name":"Symmetric multiprocessor system","score":0.6114177703857422},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5467920303344727},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5145630240440369},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5007953643798828},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49975156784057617},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.49700453877449036},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.46655720472335815},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4609317183494568},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.44164127111434937},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4346679747104645},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1886768341064453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07473626732826233},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06506216526031494}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8460578918457031},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.7701517343521118},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.693612813949585},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6297959685325623},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6255417466163635},{"id":"https://openalex.org/C172430144","wikidata":"https://www.wikidata.org/wiki/Q17111997","display_name":"Symmetric multiprocessor system","level":2,"score":0.6114177703857422},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5467920303344727},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5145630240440369},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5007953643798828},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49975156784057617},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.49700453877449036},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.46655720472335815},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4609317183494568},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.44164127111434937},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4346679747104645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1886768341064453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07473626732826233},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06506216526031494},{"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/jbdcn.2010010104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jbdcn.2010010104","pdf_url":null,"source":{"id":"https://openalex.org/S108454011","display_name":"International Journal of Business Data Communications and Networking","issn_l":"1548-0631","issn":["1548-0631","1548-064X"],"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 Business Data Communications and Networking","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jbdcn0:v:6:y:2010:i:1:p:58-69","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbdcn.2010010104","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1977590451","https://openalex.org/W2011039300","https://openalex.org/W2023753260","https://openalex.org/W2055022889","https://openalex.org/W2057392949","https://openalex.org/W2101578791","https://openalex.org/W2114719509","https://openalex.org/W2118173476","https://openalex.org/W2147169741","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W2155951254"],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2245286458","https://openalex.org/W2050732033","https://openalex.org/W2390610159","https://openalex.org/W2541348386","https://openalex.org/W2888222534","https://openalex.org/W3082963403","https://openalex.org/W2116530378","https://openalex.org/W3172098","https://openalex.org/W2072307788"],"abstract_inverted_index":{"Scheduling":[0],"tasks":[1,47],"in":[2,89],"heterogeneous":[3,50],"parallel":[4],"and":[5,37,82,124],"distributed":[6],"computing":[7],"environments":[8],"continues":[9],"to":[10,72],"be":[11],"a":[12,42,49,99,106],"challenging":[13],"problem.":[14],"In":[15],"this":[16,90],"paper,":[17],"the":[18,21,38,59,65,75,114,120,126],"authors":[19,54],"investigate":[20],"Heterogeneous":[22],"Earliest":[23],"Finish":[24],"Time":[25],"(HEFT)":[26],"algorithm,":[27],"along":[28],"with":[29,64,94],"alternative":[30],"scheduling":[31,46,86],"policies":[32],"for":[33,45],"task":[34,66],"prioritising":[35],"phases":[36],"Critical":[39],"Path":[40],"on":[41,48],"Processor":[43],"(CPOP)":[44],"multiprocessor":[51],"system.":[52],"The":[53,84,102],"show":[55],"that":[56,97],"by":[57,79],"combining":[58],"HEFT":[60,81],"algorithm":[61,87,104],"selection":[62],"policy":[63],"duplication":[67],"strategy,":[68],"it":[69],"is":[70],"possible":[71],"further":[73],"reduce":[74],"schedule":[76],"length":[77],"produced":[78],"both":[80],"CPOP.":[83],"process":[85],"presented":[88],"paper":[91],"compares":[92],"favourably":[93],"other":[95],"algorithms":[96],"use":[98],"similar":[100],"strategy.":[101],"proposed":[103],"has":[105],"time":[107],"complexity":[108],"of":[109,116,122,129],"?(\u00a6V\u00a62(p":[110],"+":[111],"d)),":[112],"whererepresents":[113],"number":[115,121],"tasks,":[117],"p":[118],"represents":[119],"processors":[123],"d":[125],"maximum":[127],"in-degree":[128],"tasks.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}