{"id":"https://openalex.org/W27009444","doi":null,"title":"Task scheduling and algorithm portability on parallel computers","display_name":"Task scheduling and algorithm portability on parallel computers","alternate_titles":[],"publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W27009444","mag":"27009444"},"language":"en","primary_location":{"id":"mag:27009444","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=128137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W27009444"],"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/A5065374743","display_name":"Jiahuang Ji","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Jiahuang Ji","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5065374743"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4211,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58929285,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.513700008392334,"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.513700008392334,"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.3328000009059906,"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.03629999980330467,"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/task-scheduling","display_name":"task scheduling","score":0.9919999837875366},{"id":"https://openalex.org/keywords/parallel-computers","display_name":"parallel computers","score":0.7210000157356262},{"id":"https://openalex.org/keywords/algorithm-portability","display_name":"algorithm portability","score":0.8600000143051147},{"id":"https://openalex.org/keywords/task-graphs","display_name":"task graphs","score":0.5889999866485596},{"id":"https://openalex.org/keywords/dynamic-scheduling","display_name":"dynamic scheduling","score":0.8429999947547913},{"id":"https://openalex.org/keywords/completion-time-minimization","display_name":"completion time minimization","score":0.8759999871253967},{"id":"https://openalex.org/keywords/two-dimensional-packing-problem","display_name":"two-dimensional packing problem","score":0.7480000257492065},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithms","display_name":"asymptotically optimal algorithms","score":0.7710000276565552},{"id":"https://openalex.org/keywords/interconnection-networks","display_name":"interconnection networks","score":0.8299999833106995},{"id":"https://openalex.org/keywords/perfect-shuffle","display_name":"perfect shuffle","score":0.7860000133514404}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7372326254844666},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5783051252365112},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.5373647809028625},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5302165150642395},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5156211256980896},{"id":"https://openalex.org/C63000827","wikidata":"https://www.wikidata.org/wiki/Q3080428","display_name":"Software portability","level":2,"score":0.5067165493965149},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49791646003723145},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4955211877822876},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.43621861934661865},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4180164933204651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3885790705680847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2131817638874054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1497611105442047},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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":1,"locations":[{"id":"mag:27009444","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=128137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4076753144","display_name":null,"funder_award_id":"61377051","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8201689659","display_name":null,"funder_award_id":"BK20130053","funder_id":"https://openalex.org/F4320334982","funder_display_name":"Basic Research Program of Jiangsu Province"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334982","display_name":"Basic Research Program of Jiangsu Province","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2150498383","https://openalex.org/W2157254931","https://openalex.org/W2057108708","https://openalex.org/W2468395309","https://openalex.org/W47045467","https://openalex.org/W2110250220","https://openalex.org/W7097138638","https://openalex.org/W2142860409","https://openalex.org/W2093230729","https://openalex.org/W2784202640"],"abstract_inverted_index":{"Many":[0],"parallel":[1,27,148,207],"computers":[2],"have":[3],"the":[4,71,105,113,117,155,165,172],"potential":[5],"to":[6,13,31,36,103,154,164,181,200,215,230],"be":[7,121,146,182],"divided":[8],"into":[9],"several":[10],"independent":[11],"subsystems":[12],"execute":[14],"multiple":[15,23],"tasks":[16,24,35,60,76,139,178],"simultaneously.":[17],"One":[18],"important":[19],"issue":[20],"of":[21,42,52,59,74,83,135,157,175,177,203,226],"executing":[22],"on":[25,205],"a":[26,147],"computer":[28],"is":[29,88,93,110,130,152,162,192,197,236],"how":[30],"schedule":[32,102],"or":[33],"allocate":[34],"minimize":[37],"completion":[38,118],"time.":[39],"Two":[40],"types":[41],"problems":[43,53,136],"are":[44,140,179,222],"considered":[45],"in":[46],"this":[47],"dissertation.":[48],"The":[49,81,108,132,224],"first":[50],"type":[51,134],"assume":[54,137],"that":[55,116,138,171],"an":[56,66,98],"application":[57],"consists":[58],"with":[61,188],"precedence":[62],"relations":[63],"represented":[64],"by":[65],"acyclic":[67],"task":[68,84,101,126,144],"graph,":[69],"and":[70,112,219,234],"execution":[72,85,127],"time":[73,86,119,128,190],"individual":[75,125],"may":[77],"vary":[78],"during":[79],"run-time.":[80],"effect":[82],"variation":[87,129],"analyzed.":[89],"A":[90],"dynamic":[91],"scheme":[92],"presented":[94],"which":[95,161],"can":[96,120,145],"adjust":[97],"originally":[99],"optimal/suboptimal":[100],"reduce":[104],"above":[106],"effect.":[107],"method":[109],"simulated":[111],"result":[114],"shows":[115],"significantly":[122],"reduced":[123],"when":[124],"large.":[131],"second":[133],"independent,":[141],"but":[142],"each":[143],"task.":[149],"This":[150],"problem":[151,156,169],"abstracted":[153],"Packing":[158],"Adjustable":[159],"Rectangle,":[160],"similar":[163],"two":[166],"dimensional":[167],"packing":[168],"except":[170],"sizes":[173],"(number":[174],"processors)":[176],"assumed":[180],"adjustable.":[183],"An":[184],"asymptotically":[185],"optimal":[186],"algorithm":[187],"polynomial":[189],"complexity":[191],"presented.\r\nSimulation":[193],"among":[194],"interconnection":[195,213,228],"functions":[196,214,221,229],"also":[198,237],"studied":[199],"increase":[201],"portabilities":[202],"algorithms":[204,210],"different":[206],"systems.":[208],"Optimal":[209],"for":[211],"PM2I":[212],"simulate":[216,231],"perfect":[217,232],"shuffle":[218,233],"unshuffle":[220,235],"developed.":[223],"use":[225],"ILLIAC":[227],"discussed.":[238]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W27009444","counts_by_year":[],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2016-06-24T00:00:00"}
