{"id":"https://openalex.org/W124239725","doi":null,"title":"Parallel simplex algorithms and loop spreading","display_name":"Parallel simplex algorithms and loop spreading","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W124239725","mag":"124239725"},"language":"en","primary_location":{"id":"mag:124239725","doi":null,"is_oa":false,"landing_page_url":"https://ir.library.oregonstate.edu/downloads/zs25xb782","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},"volume":null,"type":"dissertation","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/A5101174906","display_name":"Youfeng Wu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Youfeng Wu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101174906"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9824000000953674,"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.9824000000953674,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.007499999832361937,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.004000000189989805,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/linear-programming","display_name":"linear programming","score":0.8500000238418579},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.9869999885559082},{"id":"https://openalex.org/keywords/compiler-parallelization","display_name":"compiler parallelization","score":0.6069999933242798},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.527999997138977}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7493560314178467},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7057503461837769},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7000956535339355},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5843313932418823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5724711418151855},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5495194792747498},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.504414439201355},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.46288204193115234},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4598783552646637},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28078487515449524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13086578249931335},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:124239725","doi":null,"is_oa":false,"landing_page_url":"https://ir.library.oregonstate.edu/downloads/zs25xb782","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2144538029","https://openalex.org/W2091102007","https://openalex.org/W2273742976","https://openalex.org/W155884404","https://openalex.org/W7101151216","https://openalex.org/W7096426826","https://openalex.org/W1032922807","https://openalex.org/W2011515100","https://openalex.org/W2738219775","https://openalex.org/W1987050234"],"abstract_inverted_index":{"Parallel":[0],"solutions":[1],"for":[2,38],"two":[3],"classes":[4],"of":[5,59,65,74,91,126,138,146,149,182,190,193],"linear":[6,26,40],"programs":[7],"are":[8],"presented.":[9],"First":[10],"we":[11,43,55,86,156],"parallelized":[12],"the":[13,34,48,57,60,78,92,103,112,124,127,136,139,147,180,183,191],"two-phase":[14],"revised":[15],"simplex":[16,31,62,80,94,130],"algorithm":[17,32,37,81,95,109,131],"and":[18,42],"showed":[19],"that":[20,165,201,216],"it":[21],"is":[22,33,47,142,186,197],"possible":[23],"to":[24,132,209],"get":[25],"improvement":[27,76],"in":[28,116,176,213],"performance.":[29],"The":[30,106],"best":[35,49],"known":[36],"solving":[39],"programs,":[41],"claim":[44],"our":[45,66],"result":[46],"one":[50],"which":[51,96],"can":[52,97,202],"be":[53,203],"achieved.\r\nNext":[54],"study":[56],"parallelization":[58],"decomposed":[61,79,93,129],"algorithm.":[63],"One":[64],"new":[67,107],"parallel":[68,108,118,128,168,218],"algorithms":[69],"has":[70],"achieved":[71],"2*P":[72],"time":[73],"performance":[75,125,177],"over":[77],"using":[82],"P":[83],"processors.":[84,151,194],"Meanwhile,":[85],"discovered":[87],"a":[88,144,158,174,188,198,207],"particular":[89],"variation":[90],"run":[98],"2":[99],"times":[100],"faster":[101],"than":[102],"original":[104],"one.":[105],"linearly":[110],"speedups":[111],"fast":[113],"sequential":[114],"algorithm.\r\nAs":[115],"any":[117,214],"program,":[119],"unbalanced":[120],"processor":[121,211],"load":[122,159,212],"causes":[123],"drop":[133,175],"significantly":[134],"when":[135,179],"size":[137,181],"input":[140,184],"data":[141,185],"not":[143,187],"multiple":[145,171,189],"number":[148,192],"available":[150],"To":[152],"remove":[153],"this":[154],"limitation,":[155],"invented":[157],"balance":[160,210],"technique":[161,200],"called":[162],"Loop":[163,195],"Spreading":[164,196],"evenly":[166],"distributes":[167],"tasks":[169],"on":[170],"processors":[172],"without":[173],"even":[178],"general":[199],"used":[204],"automatically":[205],"by":[206],"compiler":[208],"language":[215],"supports":[217],"loop":[219],"constructs.":[220]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}