{"id":"https://openalex.org/W2168553375","doi":"https://doi.org/10.1145/237578.237620","title":"An efficient steepest-edge simplex algorithm for SIMD computers","display_name":"An efficient steepest-edge simplex algorithm for SIMD computers","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2168553375","doi":"https://doi.org/10.1145/237578.237620","mag":"2168553375"},"language":"en","primary_location":{"id":"doi:10.1145/237578.237620","doi":"https://doi.org/10.1145/237578.237620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/237578.237620","pdf_url":null,"source":{"id":"https://openalex.org/S4306419857","display_name":"International Conference on Supercomputing","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international conference on Supercomputing - ICS '96","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"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/A5076231038","display_name":"Michael E. Thomadakis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael E. Thomadakis","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024732465","display_name":"Jyh\u2010Charn Liu","orcid":"https://orcid.org/0000-0003-1330-5092","observed_orcids":["https://orcid.org/0000-0003-1330-5092"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jyh-Charn Liu","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"286","last_page":"293"},"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.8833000063896179,"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.8833000063896179,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.05249999836087227,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.029500000178813934,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"simplex algorithm","score":0.7239999771118164},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8650000095367432},{"id":"https://openalex.org/keywords/simd-computers","display_name":"SIMD machines","score":0.8870000243186951},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.527999997138977},{"id":"https://openalex.org/keywords/data-replication","display_name":"data replication","score":0.6740000247955322},{"id":"https://openalex.org/keywords/maspar","display_name":"MasPar","score":0.7360000014305115},{"id":"https://openalex.org/keywords/global-reduction","display_name":"global reduction","score":0.5529999732971191}],"concepts":[{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.7998133301734924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6935625672340393},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5879169702529907},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5645439624786377},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5558616518974304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5249155163764954},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5070207118988037},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46432891488075256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23991429805755615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17164018750190735}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/237578.237620","doi":"https://doi.org/10.1145/237578.237620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/237578.237620","pdf_url":null,"source":{"id":"https://openalex.org/S4306419857","display_name":"International Conference on Supercomputing","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international conference on Supercomputing - ICS '96","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.9738","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.cs.tamu.edu/ncstrl/TR96-032.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.6026","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.6026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rtds.cs.tamu.edu/publications/conferences/AnEffecient1996.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332377","display_name":"Goddard Space Flight Center","ror":"https://ror.org/0171mag52"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W198311999","https://openalex.org/W1496592812","https://openalex.org/W1559845238","https://openalex.org/W1968593058","https://openalex.org/W1985726366","https://openalex.org/W2010997912","https://openalex.org/W2011959190","https://openalex.org/W2013327579","https://openalex.org/W2053913299","https://openalex.org/W2127470768"],"related_works":["https://openalex.org/W7096426826","https://openalex.org/W2014669156","https://openalex.org/W1648507431","https://openalex.org/W2066443208","https://openalex.org/W2248333685","https://openalex.org/W3006534761","https://openalex.org/W7101151216","https://openalex.org/W1986761264","https://openalex.org/W1978491979","https://openalex.org/W2004747092"],"abstract_inverted_index":{"This":[0,245],"paper":[1],"proposes":[2],"a":[3,59,107,112,160,199],"new":[4],"parallelization":[5],"of":[6,39,62,76,82,98,125,169,198,207,222,248,266],"the":[7,30,36,40,67,74,77,83,93,99,117,126,144,157,167,170,204,214,220,264],"Primal":[8],"and":[9,35,55,64,89,110,151,180,209,225,253],"Dual":[10],"Simplex":[11],"algorithms":[12,26],"for":[13,143],"Linear":[14],"Programming":[15],"(LP)":[16],"problems":[17],"on":[18,29,49,95],"massively":[19],"parallel":[20,78],"Single-Instruction":[21],"Multiple-Data":[22],"(SIMD)":[23],"computers.":[24],"The":[25,43,101,130,148,196],"are":[27,86,153],"based":[28],"Steepest-Edge":[31,131],"pivot":[32,108,132,146,149,161,223,249],"selection":[33,133,221],"method":[34],"tableau":[37,46,85],"representation":[38],"constraint":[41],"matrix.":[42],"initial":[44],"canonical":[45],"is":[47,120,128,193,257],"formed":[48],"an":[50],"attached":[51],"scalar":[52],"host":[53],"unit,":[54],"then":[56],"partitioned":[57],"into":[58],"rectangular":[60],"grid":[61],"sub-matrices":[63,94],"distributed":[65],"to":[66,141,156,190,227,259],"individual":[68,176],"Processor":[69],"Element":[70],"(PE)":[71],"memories.":[72],"In":[73],"beginning":[75],"algorithm":[79,104],"key":[80],"portions":[81],"simplex":[84,103,113],"partially":[87],"replicated":[88],"stored":[90],"along":[91],"with":[92],"each":[96],"one":[97],"PEs.":[100],"SIMD":[102],"iteratively":[105],"selects":[106],"element":[109],"carries-out":[111],"computation":[114,162],"step":[115],"until":[116],"optimal":[118],"solution":[119,265],"found,":[121],"or":[122],"when":[123],"unboundedness":[124],"LP":[127],"established.":[129],"technique":[134],"utilizes":[135],"information":[136],"mainly":[137],"from":[138],"local":[139],"replicas":[140,184],"search":[142],"next":[145],"element.":[147],"row":[150],"column":[152],"selectively":[154],"broadcasted":[155],"PEs":[158],"before":[159],"step,":[163],"by":[164],"efficiently":[165],"utilizing":[166],"geometry":[168],"toroidal":[171],"mesh":[172,205],"interconnection":[173],"network.":[174],"Every":[175],"PE":[177,243],"maintains":[178],"locally":[179],"keeps":[181],"consistent":[182],"its":[183],"so":[185],"that":[186],"inter-processor":[187],"communication":[188],"due":[189],"data":[191,255],"dependencies":[192],"further":[194],"reduced.":[195],"presence":[197],"pipelined":[200],"inteconnection":[201],"network,":[202],"like":[203],"network":[206],"MP-1":[208],"MP-2":[210],"MasPar":[211],"models":[212],"allows":[213],"global":[215],"reduction":[216],"operations":[217],"necessary":[218],"in":[219,230,238,263],"columns":[224],"rows":[226],"be":[228,260],"performed":[229],"time":[231],"O(log":[232],"nR":[233],"+":[234],"log":[235],"nC":[236,241],"),":[237],"(nR":[239],"\\\\Theta":[240],")":[242],"arrays.":[244],"particular":[246],"combination":[247],"selection,":[250],"matrix":[251],"representation,":[252],"selective":[254],"replication":[256],"shown":[258],"highly":[261],"efficient":[262],"linear":[267],"prog...":[268]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}