乐胖代购免代理版

{"id":"https://openalex.org/W1821435681","doi":"https://doi.org/10.1109/icpp.1998.708514","title":"Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques","display_name":"Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques","publication_year":2002,"publication_date":"2002-11-27","ids":{"openalex":"https://openalex.org/W1821435681","doi":"https://doi.org/10.1109/icpp.1998.708514","mag":"1821435681"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1998.708514","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":true,"oa_status":"green","oa_url":"http://ranger.uta.edu/~iahmad/conf-papers/[C48] Optimal and Near-Optimal Allocation of.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023585194","display_name":"Iftikhar Ahmad","orcid":"https://orcid.org/0000-0001-9801-6462"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"funder","lineage":["https://openalex.org/I889458895"]},{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"funder","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"I. Ahmad","raw_affiliation_strings":["Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I889458895","https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102156323","display_name":"Yu\u2010Kwong Kwok","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"funder","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"None Yu-Kwong Kwok","raw_affiliation_strings":["Parallel Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Parallel Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.118,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":20,"citation_normalized_percentile":{"value":0.833796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":"1","issue":null,"first_page":"424","last_page":"431"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998,"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.9998,"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.9982,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.998,"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/pruning","display_name":"Pruning","score":0.7260456}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7349136},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7260456},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.57641226},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.54864234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5370634},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.53673595},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49656087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4457199},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42252326},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32197905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20134261},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1998.708514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5693","pdf_url":"http://ranger.uta.edu/~iahmad/conf-papers/[C48] Optimal and Near-Optimal Allocation of.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5693","pdf_url":"http://ranger.uta.edu/~iahmad/conf-papers/[C48] Optimal and Near-Optimal Allocation of.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":20,"referenced_works":["https://openalex.org/W1977590451","https://openalex.org/W1995456883","https://openalex.org/W1998978603","https://openalex.org/W2011039300","https://openalex.org/W2012223233","https://openalex.org/W2023753260","https://openalex.org/W2024790103","https://openalex.org/W2034319651","https://openalex.org/W2042872950","https://openalex.org/W2051315758","https://openalex.org/W2078162318","https://openalex.org/W2118396891","https://openalex.org/W2135449963","https://openalex.org/W2143406029","https://openalex.org/W2144482271","https://openalex.org/W2147110864","https://openalex.org/W2162063405","https://openalex.org/W2476096155","https://openalex.org/W4285719527","https://openalex.org/W634463279"],"related_works":["https://openalex.org/W4206442282","https://openalex.org/W2594301978","https://openalex.org/W2384505857","https://openalex.org/W2379704676","https://openalex.org/W2378744544","https://openalex.org/W2373300491","https://openalex.org/W2355171581","https://openalex.org/W2145253956","https://openalex.org/W2034510042","https://openalex.org/W1212596013"],"abstract_inverted_index":{"Obtaining":[0],"an":[1,120,139,156],"optimal":[2,19,35,130,161],"schedule":[3],"for":[4,33,37,59,159,163],"a":[5,14,54,68,125,174],"set":[6],"of":[7,70,77,143],"precedence-constrained":[8],"tasks":[9],"with":[10,63,152],"arbitrary":[11],"costs":[12],"is":[13,46,93,100,155,173],"well-known":[15],"NP-complete":[16],"problem.":[17],"However,":[18],"solutions":[20,162,180],"are":[21,181],"desired":[22],"in":[23],"many":[24],"situations.":[25],"In":[26],"this":[27],"paper":[28],"we":[29,86,146],"propose":[30,67,119],"search-based":[31],"algorithms":[32],"determining":[34],"schedules":[36],"moderately":[38,166],"large":[39,167],"problem":[40],"sizes.":[41],"The":[42,90],"first":[43],"algorithm":[44,122,151,172],"which":[45],"based":[47,94],"on":[48,95,138],"the":[49,61,75,78,84,88,111,115,129,144,149,170],"A*":[50],"search":[51,62,79,112],"technique":[52],"uses":[53],"computationally":[55],"efficient":[56,157],"cost":[57],"function":[58],"guiding":[60],"reduced":[64,96],"complexity.":[65],"We":[66,117],"number":[69],"state-pruning":[71],"techniques":[72,154],"to":[73,108,114,165],"reduce":[74],"size":[76],"space.":[80],"For":[81],"further":[82],"lowering":[83],"complexity,":[85],"parallelize":[87],"search.":[89],"parallel":[91,150],"version":[92],"interprocessor":[97],"communication":[98],"and":[99,104],"guided":[101],"by":[102],"static":[103],"dynamic":[105],"load-balancing":[106],"schemes":[107],"evenly":[109],"distribute":[110],"states":[113],"processors.":[116],"also":[118],"approximate":[121,171],"that":[123,148],"guarantees":[124],"bounded":[126],"deviation":[127],"from":[128],"solution":[131],"but":[132],"takes":[133],"considerably":[134],"shorter":[135],"time.":[136],"Based":[137],"extensive":[140],"experimental":[141],"evaluation":[142],"algorithms,":[145],"conclude":[147],"pruning":[153],"scheme":[158],"generating":[160],"medium":[164],"problems":[168],"while":[169],"useful":[175],"alternative":[176],"if":[177],"slightly":[178],"degraded":[179],"acceptable.":[182]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1821435681","counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-03-23T19:56:56.584619","created_date":"2016-06-24"}