乐胖代购免代理版

{"id":"https://openalex.org/W2132180549","doi":"https://doi.org/10.1109/empdp.2004.1271445","title":"A static task scheduling heuristic for homogeneous computing environments","display_name":"A static task scheduling heuristic for homogeneous computing environments","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2132180549","doi":"https://doi.org/10.1109/empdp.2004.1271445","mag":"2132180549"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/empdp.2004.1271445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5043977401","display_name":"Tarek Hagras","orcid":"https://orcid.org/0000-0002-3736-425X"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"T. Hagras","raw_affiliation_strings":["Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031124070","display_name":"Jan Jane\u010dek","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"J. Janecek","raw_affiliation_strings":["Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.262,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":7,"citation_normalized_percentile":{"value":0.676299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":79},"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"198"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9999,"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.9999,"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.9981,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9943,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7871127},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.6106693},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.60508186},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5265653},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.50208426},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.49779224},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.45439106},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41392082},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41374546},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4104339},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38894233},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3602358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3311565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2051898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1342102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12536496},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.05540335},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/empdp.2004.1271445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1599248213","https://openalex.org/W177450199","https://openalex.org/W1913953800","https://openalex.org/W1961360692","https://openalex.org/W2023753260","https://openalex.org/W2043331236","https://openalex.org/W2097911714","https://openalex.org/W2098464112","https://openalex.org/W2107351313","https://openalex.org/W2151038512","https://openalex.org/W2164631467","https://openalex.org/W2541367100"],"related_works":["https://openalex.org/W4390722068","https://openalex.org/W4390711934","https://openalex.org/W3036719625","https://openalex.org/W2978148977","https://openalex.org/W2397293317","https://openalex.org/W2372008037","https://openalex.org/W2225350526","https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W2106332846"],"abstract_inverted_index":{"List-based":[0],"scheduling":[1,12],"is":[2,47,67],"generally":[3],"accepted":[4],"as":[5],"an":[6],"attractive":[7],"approach":[8],"to":[9],"static":[10],"task":[11],"in":[13],"a":[14,27,37,68,76],"homogeneous":[15,43],"environment,":[16],"since":[17],"it":[18],"pairs":[19],"low":[20,28,77],"complexity":[21,29,78,98],"with":[22,52],"good":[23],"results.":[24],"We":[25],"present":[26],"algorithm":[30,46,58],"based":[31,72,82],"on":[32,36,73,83,93],"list-scheduling":[33],"and":[34,75],"task-duplication":[35],"bounded":[38],"number":[39],"of":[40,60],"fully":[41],"connected":[42],"machines.":[44],"The":[45,56,85],"called":[48],"critical":[49],"unlisted":[50],"parents":[51],"fast":[53],"duplicator":[54],"(CUPFD).":[55],"CUPFD":[57,91],"consists":[59],"two":[61],"phases:":[62],"the":[63],"listing":[64,70],"phase,":[65],"which":[66],"simple":[69],"heuristic":[71],"list-scheduling,":[74],"machine":[79],"assigning":[80],"phase":[81],"task-duplication.":[84],"experimental":[86],"work":[87],"has":[88],"shown":[89],"that":[90],"outperformed":[92],"average":[94],"all":[95],"other":[96],"higher":[97],"algorithms.":[99]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2132180549","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-02-17T01:26:23.930622","created_date":"2016-06-24"}