{"id":"https://openalex.org/W2100527443","doi":"https://doi.org/10.1080/10637199408915411","title":"MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS\u2217 \u2020","display_name":"MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS\u2217 \u2020","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2100527443","doi":"https://doi.org/10.1080/10637199408915411","mag":"2100527443"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915411","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915411","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},"type":"article","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/A5051142842","display_name":"Clay P. Breshears","orcid":null},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"CLAY P. BRESHEARS","raw_affiliation_strings":["Department of Computer Science , University of Tennessee , Knoxville, TN 37996-1301, USA","Department of Computer Science, University of Tennessee, Knoxville, TN 37996\u20101301, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Tennessee , Knoxville, TN 37996-1301, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, TN 37996\u20101301, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MICHAEL A. LANGSTON","raw_affiliation_strings":["Department of Computer Science , University of Tennessee , Knoxville, TN 37996-1301, USA","Department of Computer Science, University of Tennessee, Knoxville, TN 37996\u20101301, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , University of Tennessee , Knoxville, TN 37996-1301, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Department of Computer Science, University of Tennessee, Knoxville, TN 37996\u20101301, USA","institution_ids":["https://openalex.org/I75027704"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051142842"],"corresponding_institution_ids":["https://openalex.org/I75027704"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17893826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"1-2","first_page":"123","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9991000294685364,"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/mimd","display_name":"MIMD","score":0.969468891620636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.902655839920044},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.8674653768539429},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8037703037261963},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.43381866812705994},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.4288889765739441},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4195634126663208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3536960780620575}],"concepts":[{"id":"https://openalex.org/C21032095","wikidata":"https://www.wikidata.org/wiki/Q1149237","display_name":"MIMD","level":2,"score":0.969468891620636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.902655839920044},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.8674653768539429},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8037703037261963},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.43381866812705994},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4288889765739441},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4195634126663208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3536960780620575}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915411","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915411","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1512709563","https://openalex.org/W1589943916","https://openalex.org/W1977041160","https://openalex.org/W1989741444","https://openalex.org/W2077333890","https://openalex.org/W2141389982","https://openalex.org/W2160101242","https://openalex.org/W2921847140"],"related_works":["https://openalex.org/W1439745913","https://openalex.org/W2144984987","https://openalex.org/W1501055404","https://openalex.org/W1991465874","https://openalex.org/W322664006","https://openalex.org/W1633181085","https://openalex.org/W2070983336","https://openalex.org/W1837558792","https://openalex.org/W1994175142","https://openalex.org/W2363502211"],"abstract_inverted_index":{"We":[0,19,167],"focus":[1],"on":[2,14,155],"differences":[3],"inherent":[4],"in":[5,111,118,149,163],"the":[6,38,43,51,112,119,130,175],"design":[7],"and":[8,16,28,34,42,71,93,115,158,172],"implementation":[9],"of":[10,61,132,174],"non-numeric":[11,79],"parallel":[12,77,80],"algorithms":[13,143],"MIMD":[15,33,113,133],"SIMD":[17,35,120,135],"architectures.":[18],"take":[20],"as":[21,108],"our":[22],"prototypical":[23],"examples":[24,127],"time-space":[25],"optimal":[26],"merging":[27],"sorting":[29],"routines.":[30],"Our":[31,122],"representative":[32],"machines":[36,62],"are":[37,82,124,151],"Sequent":[39],"Symmetry":[40],"S81":[41],"Connection":[44],"Machine":[45],"CM-2,":[46],"respectively.":[47],"In":[48],"addition":[49],"to":[50,65,88,134],"contrast":[52],"provided":[53],"by":[54],"their":[55],"differing":[56],"execution":[57,154],"philosophies,":[58],"this":[59,184],"choice":[60],"allows":[63],"us":[64],"compare":[66],"results":[67],"from":[68],"both":[69],"shared-memory":[70],"distributed-memory":[72],"models.":[73],"Unlike":[74],"many":[75],"numerical":[76],"algorithms,":[78],"programs":[81],"rarely":[83],"well":[84],"structured":[85],"with":[86,104,126,145],"respect":[87],"inter-processor":[89],"cooperation,":[90],"memory":[91],"access":[92],"communication":[94],"patterns.":[95],"This":[96],"is":[97],"particularly":[98],"apparent":[99],"when":[100,142],"one":[101,146],"must":[102],"deal":[103],"delicate":[105],"issues":[106],"such":[107],"process":[109,131],"synchronization":[110],"model":[114],"coding":[116],"variations":[117],"model.":[121],"experiences":[123],"highlighted":[125],"obtained":[128],"during":[129,183],"program":[136],"transformation":[137,185],"Unexpected":[138],"events":[139],"can":[140],"occur":[141],"designed":[144],"architectural":[147],"style":[148],"mind":[150],"modified":[152],"for":[153],"another.":[156],"Timings":[157],"other":[159],"measurements":[160],"arc":[161],"useful":[162],"identifying":[164],"important":[165],"bottlenecks.":[166],"discuss":[168],"some":[169],"relative":[170],"strengths":[171],"weaknesses":[173],"two":[176],"competing":[177],"models":[178],"that":[179],"have":[180],"become":[181],"evident":[182],"process.":[186]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}