{"id":"https://openalex.org/W2399115012","doi":null,"title":"An Efficient Task Assignment Algorithm for Heterogeneous Multi-Computers","display_name":"An Efficient Task Assignment Algorithm for Heterogeneous Multi-Computers","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2399115012","mag":"2399115012"},"language":"en","primary_location":{"id":"mag:2399115012","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=JBCRC7_1998_v5n5_1151","pdf_url":null,"source":{"id":"https://openalex.org/S4306532753","display_name":"The Transactions of the Korea Information Processing Society","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Transactions of the Korea Information Processing Society","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/A5066497288","display_name":"Kyungryong Seo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kyungryong Seo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074876355","display_name":"Jeong-Mo Yeo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeong-Mo Yeo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":"5","issue":"5","first_page":"1151","last_page":"1161"},"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.8593999743461609,"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.8593999743461609,"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.04610000178217888,"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.013399999588727951,"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/task-allocation","display_name":"task allocation","score":0.9940000176429749},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.8600000143051147},{"id":"https://openalex.org/keywords/distributed-programs","display_name":"distributed programs","score":0.6639999747276306},{"id":"https://openalex.org/keywords/processor-reliability","display_name":"processor reliability","score":0.5720000267028809},{"id":"https://openalex.org/keywords/imbalance-costs","display_name":"imbalance costs","score":0.7590000033378601},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.9419999718666077},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7070000171661377},{"id":"https://openalex.org/keywords/execution-time-reduction","display_name":"execution time reduction","score":0.7009999752044678}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8103323578834534},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.7921401858329773},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.671991229057312},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6713199019432068},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6165508031845093},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5313057899475098},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5019867420196533},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4736529588699341},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4599626660346985},{"id":"https://openalex.org/C2776628324","wikidata":"https://www.wikidata.org/wiki/Q22222748","display_name":"Frequency assignment","level":2,"score":0.43099331855773926},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4257129430770874},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3549541234970093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27552396059036255},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26612478494644165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10580253601074219},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08237886428833008},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2399115012","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=JBCRC7_1998_v5n5_1151","pdf_url":null,"source":{"id":"https://openalex.org/S4306532753","display_name":"The Transactions of the Korea Information Processing Society","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Transactions of the Korea Information Processing Society","raw_type":null},{"id":"mag:3171213944","doi":null,"is_oa":false,"landing_page_url":"http://ktccs.kips.or.kr/digital-library/9942","pdf_url":null,"source":{"id":"https://openalex.org/S4306517440","display_name":"KIPS Transactions on Computer and Communication Systems","issn_l":"2287-5891","issn":["2287-5891","2734-049X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"KIPS Transactions on Computer and Communication Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2005172784","https://openalex.org/W7100888719","https://openalex.org/W2151089374","https://openalex.org/W2018897310","https://openalex.org/W2064682240","https://openalex.org/W2123408066","https://openalex.org/W3171213944","https://openalex.org/W3198812883","https://openalex.org/W7096874847","https://openalex.org/W2433426294"],"abstract_inverted_index":{"In":[0,21],"this":[1,26,100],"paper,":[2],"we":[3,92,162],"are":[4,124],"considering":[5],"a":[6,40,48,94,120],"heterogeneous":[7],"processor":[8,13,121],"system":[9],"in":[10,46,171],"which":[11,98],"each":[12,115],"may":[14],"have":[15],"different":[16],"performance":[17,68,85],"and":[18,130,142,145,160,177],"reliability":[19],"characteristics.":[20],"other":[22],"to":[23,34,43,64,66,109,119,157],"fully":[24],"utilize":[25],"diversity":[27],"of":[28,39,54,62,138,148,173],"processing":[29,82],"power":[30],"it":[31],"is":[32,58,69,108,117,134,155],"advantageous":[33],"assign":[35],"the":[36,44,51,55,75,84,88,104,128,131,149],"program":[37,42,57],"modules":[38,176],"distributed":[41],"processors":[45,65,77],"such":[47],"way":[49],"that":[50,114,136],"execution":[52,143],"time":[53,169],"entire":[56],"minimized.":[59],"This":[60],"assignment":[61,90,106,154],"tasks":[63],"maximize":[67],"commonly":[70],"called":[71],"load":[72],"balancing,":[73],"since":[74],"overloaded":[76],"can":[78],"perform":[79],"their":[80],"own":[81],"with":[83,168],"degradation.":[86],"For":[87],"task":[89,105,175],"problem,":[91],"propose":[93],"new":[95],"objective":[96],"function":[97],"formulates":[99],"imbalancing":[101],"cost.":[102],"Thus":[103],"problem":[107],"be":[110,158],"carried":[111],"out":[112],"so":[113],"module":[116],"assigned":[118],"whose":[122],"capabilities":[123],"most":[125],"appropriate":[126],"for":[127],"module,":[129],"total":[132],"cost":[133,141,144,147],"minimized":[135],"sum":[137],"inter-processor":[139],"communication":[140],"imbalance":[146],"assignment.":[150],"To":[151],"find":[152],"optimal":[153],"known":[156],"NP-hard,":[159],"thus":[161],"proposed":[163],"an":[164],"efficient":[165],"heuristic":[166],"algorithm":[167],"complexity":[170],"case":[172],"m":[174],"n":[178],"processors.":[179]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}