{"id":"https://openalex.org/W2404845478","doi":null,"title":"An Efficient Processor Allocation Scheme fer Hypercubes","display_name":"An Efficient Processor Allocation Scheme fer Hypercubes","alternate_titles":[],"publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2404845478","mag":"2404845478"},"language":"en","primary_location":{"id":"mag:2404845478","doi":null,"is_oa":false,"landing_page_url":"http://ktccs.kips.or.kr/digital-library/9425","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},"parent_works":[],"lineage":["https://openalex.org/W2404845478"],"child_works_count":0,"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/A5033449310","display_name":"Son Yoo Ek","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Son Yoo Ek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073062127","display_name":"Nam Jae Yeal","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nam Jae Yeal","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,"reviewed_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":"3","issue":"4","first_page":"781","last_page":"790"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.41850000619888306,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.41850000619888306,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.37040001153945923,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.19599999487400055,"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":[{"id":"https://openalex.org/keywords/processor-allocation","display_name":"processor allocation","score":0.9390000104904175},{"id":"https://openalex.org/keywords/hypercube","display_name":"hypercube","score":0.7519999742507935},{"id":"https://openalex.org/keywords/binary-tree-representation","display_name":"binary tree representation","score":0.8180000185966492},{"id":"https://openalex.org/keywords/cpu-utilization","display_name":"CPU utilization","score":0.8009999990463257},{"id":"https://openalex.org/keywords/system-fragmentation","display_name":"system fragmentation","score":0.8870000243186951},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.41600000858306885},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7779985666275024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7579999566078186},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.596784770488739},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5760958194732666},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5234384536743164},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41134247183799744},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.369951069355011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30501988530158997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1589086949825287},{"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":[{"id":"mag:2404845478","doi":null,"is_oa":false,"landing_page_url":"http://ktccs.kips.or.kr/digital-library/9425","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}],"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/W1963135563","https://openalex.org/W2135130858","https://openalex.org/W2151671508","https://openalex.org/W2098616058","https://openalex.org/W2132936846","https://openalex.org/W2133593621","https://openalex.org/W2097402140","https://openalex.org/W2134554249","https://openalex.org/W2149434632","https://openalex.org/W2164502111"],"abstract_inverted_index":{"processors":[0,27],"must":[1],"be":[2],"allocated":[3],"to":[4,34,39,46,62],"incoming":[5],"tasks":[6],"in":[7,28,109],"a":[8,29,32,51,64,85],"way":[9],"that":[10],"will":[11],"maximize":[12],"the":[13,18,48,58,70,75,80,93,101],"processor":[14],"utilization":[15],"and":[16,56,77,87],"minimize":[17],"system":[19,35],"fragmentation.":[20],"Thus,":[21],"an":[22,88],"efficient":[23,89],"method":[24],"of":[25,50,53,79,84,100],"allocating":[26],"hypercube":[30],"is":[31,44,103],"key":[33],"performance.":[36],"In":[37],"order":[38],"achieve":[40],"this":[41],"goal,":[42],"it":[43,105],"necessary":[45],"detect":[47],"availability":[49],"subcube":[52],"required":[54],"size":[55],"merge":[57],"released":[59],"small":[60],"cubes":[61],"form":[63],"larger":[65],"ones.":[66],"This":[67],"paper":[68],"presents":[69],"tree-exchange":[71],"algorithm":[72,102],"which":[73],"detemines":[74],"levels":[76],"partners":[78],"binary":[81],"tree":[82],"representation":[83],"hypercube,":[86],"allocation":[90],"strategy":[91],"using":[92],"algorithm.":[94],"The":[95],"complexity":[96],"for":[97],"search":[98],"time":[99],"n/22n)and":[104],"shows":[106],"good":[107],"performance":[108],"comparison":[110],"with":[111],"other":[112],"strategies.":[113]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2404845478","counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}
