{"id":"https://openalex.org/W2384698351","doi":null,"title":"Task duplication based scheduling algorithm","display_name":"Task duplication based scheduling algorithm","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2384698351","mag":"2384698351"},"language":"en","primary_location":{"id":"mag:2384698351","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-SJSJ200908026.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764384989","display_name":"Jisuanji gongcheng yu sheji","issn_l":"1000-7024","issn":["1000-7024"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322614511","host_organization_name":"China Aerospace Science and Industry Group","host_organization_lineage":["https://openalex.org/P4322614511"],"host_organization_lineage_names":["China Aerospace Science and Industry Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng yu sheji","raw_type":null},"volume":null,"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/A5033338273","display_name":"Yong Qu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2800710378","display_name":"Naval University of Engineering","ror":"https://ror.org/056vyez31","country_code":"CN","type":"education","lineage":["https://openalex.org/I2800710378"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yong Qu","raw_affiliation_strings":["College of Science, Naval University of Engineering, Wuhan 430033, China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Science, Naval University of Engineering, Wuhan 430033, China)","institution_ids":["https://openalex.org/I2800710378"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033338273"],"corresponding_institution_ids":["https://openalex.org/I2800710378"],"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":null,"issue":null,"first_page":null,"last_page":null},"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.8970000147819519,"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.8970000147819519,"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.03519999980926514,"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.02459999918937683,"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/task-duplication","display_name":"task duplication","score":0.8460000157356262},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.8560000061988831},{"id":"https://openalex.org/keywords/distributed-parallel-processing","display_name":"distributed parallel computing","score":0.6669999957084656},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.8500000238418579},{"id":"https://openalex.org/keywords/optimal-schedules","display_name":"optimal schedules","score":0.7570000290870667},{"id":"https://openalex.org/keywords/communication-time","display_name":"communication time","score":0.7059999704360962},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6570000052452087}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8962773084640503},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5913617014884949},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5826417803764343},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5581327080726624},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.49498671293258667},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.47728291153907776},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4682430028915405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4533109962940216},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.44806987047195435},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4270438551902771},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4038051664829254},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39254647493362427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18515726923942566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08196058869361877},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2384698351","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-SJSJ200908026.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764384989","display_name":"Jisuanji gongcheng yu sheji","issn_l":"1000-7024","issn":["1000-7024"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322614511","host_organization_name":"China Aerospace Science and Industry Group","host_organization_lineage":["https://openalex.org/P4322614511"],"host_organization_lineage_names":["China Aerospace Science and Industry Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng yu sheji","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1959344422","https://openalex.org/W1961407660","https://openalex.org/W2232435834","https://openalex.org/W2137243035","https://openalex.org/W4385377072","https://openalex.org/W2036363862","https://openalex.org/W2378786965","https://openalex.org/W2159644278","https://openalex.org/W2147027167","https://openalex.org/W2355107757"],"abstract_inverted_index":{"Task":[0],"Scheduling":[1],"is":[2,18,57,76],"one":[3],"of":[4,43,72,81,88],"the":[5,23,73,79,85],"most":[6],"challenging":[7],"NP-complete":[8],"problems":[9],"in":[10],"parallel":[11],"and":[12,67,83],"distributed":[13],"computing":[14],"systems.Du-plication":[15],"based":[16,53],"scheduling(DBS)":[17],"an":[19,35,61],"efficient":[20],"approach":[21],"to":[22,33],"scheduling":[24,55],"problems.Although":[25],"there":[26],"are":[27,31,45],"some":[28],"algorithms":[29],"that":[30],"able":[32],"find":[34],"optimal":[36,62],"schedule":[37,63],"under":[38],"relatively":[39],"short":[40],"communication":[41],"time,conditions":[42],"which":[44],"either":[46],"restricted":[47],"or":[48],"complex.A":[49],"new":[50],"task":[51],"duplication":[52],"clustering":[54],"algorithm(TDCS)":[56],"presented,which":[58],"can":[59],"generate":[60],"with":[64],"a":[65],"simple":[66],"loose":[68],"condition.The":[69],"time":[70],"complexity":[71],"proposed":[74],"algorithm":[75],"O(log),where":[77],"represents":[78,84],"number":[80],"tasks":[82,89],"maximum":[86],"indegree":[87],"respectively.":[90]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}