{"id":"https://openalex.org/W838958356","doi":null,"title":"Parallel alogorithms for MIMD parallel computers","display_name":"Parallel alogorithms for MIMD parallel computers","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W838958356","mag":"838958356"},"language":"en","primary_location":{"id":"pmh:oai:dspace.lboro.ac.uk:2134/15113","doi":null,"is_oa":true,"landing_page_url":"https://dspace.lboro.ac.uk/2134/15113","pdf_url":"https://dspace.lboro.ac.uk/2134/15113","source":{"id":"https://openalex.org/S4306401023","display_name":"Loughborough University Institutional Repository (Loughborough University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I143804889","host_organization_name":"Loughborough University","host_organization_lineage":["https://openalex.org/I143804889"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.lboro.ac.uk/2134/15113","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057974803","display_name":"Hilal M. Yousif","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hilal M. Yousif","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5057974803"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.7958999872207642,"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.7958999872207642,"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.19529999792575836,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/asynchronous-parallel-algorithms","display_name":"asynchronous parallel algorithms","score":0.902999997138977},{"id":"https://openalex.org/keywords/mimd-parallel-computers","display_name":"MIMD parallel computers","score":0.9919999837875366},{"id":"https://openalex.org/keywords/alternating-group-explicit-method","display_name":"alternating group explicit method","score":0.8659999966621399},{"id":"https://openalex.org/keywords/partial-differential-equations","display_name":"partial differential equations","score":0.6980000138282776},{"id":"https://openalex.org/keywords/boundary-value-problems","display_name":"boundary value problems","score":0.7670000195503235},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.6959999799728394},{"id":"https://openalex.org/keywords/shell-sort","display_name":"shell sort","score":0.9020000100135803},{"id":"https://openalex.org/keywords/computational-complexity-analysis","display_name":"complexity analysis","score":0.7300000190734863}],"concepts":[{"id":"https://openalex.org/C21032095","wikidata":"https://www.wikidata.org/wiki/Q1149237","display_name":"MIMD","level":2,"score":0.9545890092849731},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8122879266738892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7695629000663757},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5994255542755127},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.567803680896759},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5482079982757568},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.5117299556732178},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47772738337516785},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.4387859106063843},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.43639427423477173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29736194014549255},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.18182793259620667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16235095262527466},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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":6,"locations":[{"id":"pmh:oai:dspace.lboro.ac.uk:2134/15113","doi":null,"is_oa":true,"landing_page_url":"https://dspace.lboro.ac.uk/2134/15113","pdf_url":"https://dspace.lboro.ac.uk/2134/15113","source":{"id":"https://openalex.org/S4306401023","display_name":"Loughborough University Institutional Repository (Loughborough University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I143804889","host_organization_name":"Loughborough University","host_organization_lineage":["https://openalex.org/I143804889"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:hdl:10068/648858","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/648858","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},{"id":"pmh:oai:figshare.com:article/9406358","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/Parallel_alogorithms_for_MIMD_parallel_computers/9406358","pdf_url":null,"source":{"id":"https://openalex.org/S4306402585","display_name":"Loughborough University Research Repository (Loughborough University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I143804889","host_organization_name":"Loughborough University","host_organization_lineage":["https://openalex.org/I143804889"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:uilis.unsyiah.ac.id:23818","doi":null,"is_oa":false,"landing_page_url":"http://uilis.unsyiah.ac.id/opentheses/items/show/23818","pdf_url":null,"source":{"id":"https://openalex.org/S4377196378","display_name":"UPT. Syiah Kuala University Library (Syiah Kuala University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I187494767","host_organization_name":"Universitas Syiah Kuala","host_organization_lineage":["https://openalex.org/I187494767"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:uilis.unsyiah.ac.id:24122","doi":null,"is_oa":false,"landing_page_url":"http://uilis.unsyiah.ac.id/opentheses/items/show/24122","pdf_url":null,"source":{"id":"https://openalex.org/S4377196378","display_name":"UPT. Syiah Kuala University Library (Syiah Kuala University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I187494767","host_organization_name":"Universitas Syiah Kuala","host_organization_lineage":["https://openalex.org/I187494767"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"mag:838958356","doi":null,"is_oa":false,"landing_page_url":"https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.480498","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":{"id":"pmh:oai:dspace.lboro.ac.uk:2134/15113","doi":null,"is_oa":true,"landing_page_url":"https://dspace.lboro.ac.uk/2134/15113","pdf_url":"https://dspace.lboro.ac.uk/2134/15113","source":{"id":"https://openalex.org/S4306401023","display_name":"Loughborough University Institutional Repository (Loughborough University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I143804889","host_organization_name":"Loughborough University","host_organization_lineage":["https://openalex.org/I143804889"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W838958356.pdf","grobid_xml":"https://content.openalex.org/works/W838958356.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7023799009","https://openalex.org/W2807854274","https://openalex.org/W6944335082","https://openalex.org/W820194519","https://openalex.org/W6986318540","https://openalex.org/W2912558176","https://openalex.org/W38601207","https://openalex.org/W2776106025","https://openalex.org/W6996712320","https://openalex.org/W2786489643"],"abstract_inverted_index":{"This":[0],"thesis":[1,352],"mainly":[2],"covers":[3],"the":[4,24,30,58,61,72,75,80,97,115,133,172,176,185,189,199,214,217,221,239,245,250,254,264,270,275,288,291,315,318,321,329,342,358],"design":[5],"and":[6,42,49,74,89,147,156,160,193,203,223,256,290,300,304,328],"analysis":[7,346],"of":[8,32,46,51,60,82,100,114,129,144,175,188,216,253,263,272,277,341,347],"asynchronous\\nparallel":[9],"algorithms":[10,53,91,267,332],"that":[11,123],"can":[12,311],"be":[13,312],"run":[14,138],"on":[15,132,314],"MIMD":[16,64],"(Multiple":[17],"Instruction\\nMultiple":[18],"Data)":[19],"parallel":[20,33,39,47,52,105,142,173,218,240,251,265,316,337],"computers,":[21],"in":[22,84,94,119,139,183,213,325,336],"particular":[23],"NEPTUNE":[25,65],"system":[26,66],"at\\nLoughborough":[27],"University.":[28],"Initially":[29],"fundamentals":[31],"computer\\narchitectures":[34],"are":[35,54,67,92],"introduced":[36],"with":[37,158,244,295,338,354],"different":[38,167],"architectures":[40],"being\\ndescribed":[41],"compared.":[43,231],"The":[44,141,226,282],"principles":[45],"programming":[48],"the\\ndesign":[50],"also":[55],"outlined.":[56],"Also":[57,232],"main\\ncharacteristics":[59],"4":[62],"processor":[63],"presented,\\nand":[68],"performance":[69],"indicators,":[70],"i.e.":[71],"speed-up":[73],"efficiency":[76],"factors\\nare":[77],"defined":[78],"for":[79,165,233],"measurement":[81],"parallelism":[83],"a":[85,121,260,339,355],"given":[86],"system.\\nBoth":[87],"numerical":[88,98],"non-numerical":[90],"covered":[93],"the\\nthesis.":[95],"In":[96],"solution":[99],"partial":[101],"differential":[102],"equations,\\na":[103],"new":[104],"9-point":[106,146],"block":[107,149],"iterative":[108,150],"method":[109,297],"is":[110,117,181,191,268,350],"developed.":[111],"Here,":[112],"the\\norganization":[113],"blocks":[116],"done":[118],"such":[120],"way":[122],"each":[124,296],"process\\ncontains":[125],"its":[126],"own":[127],"group":[128],"9":[130],"points":[131],"network,":[134],"therefore,":[135],"they":[136],"can\\nbe":[137],"parallel.":[140],"implementation":[143,215],"both":[145,201],"4-\\npoint":[148],"methods":[151,284,349],"were":[152,169,230,242,280,286,302,333],"programmed":[153],"using":[154,220],"natural":[155],"redblack\\nordering":[157],"synchronous":[159,222],"asynchronous":[161,224],"approaches.":[162,225],"The\\nresults":[163],"obtained":[164,237,248,313],"these":[166,228,348],"implementations":[168,229],"compared":[170,243,305],"and\\nanalysed.\\nNext":[171],"version":[174],"A.G.E.":[177,241,266],"(Alternating":[178],"Group":[179],"Explicit)\\nmethod":[180],"developed":[182],"which":[184,285,310],"explicit":[186],"nature":[187],"difference\\nequation":[190],"revealed":[192],"exploited":[194],"when":[195],"applied":[196],"to":[197,306],"derive":[198],"solution\\nof":[200],"linear":[202],"non-linear":[204],"2-point":[205],"boundary":[206],"value":[207],"problems.":[208],"Two\\nstrategies":[209],"have":[210],"been":[211],"used":[212,303],"A.G.E.\\nmethod":[219],"results\\nfrom":[227],"comparison":[234],"reasons\\nthe":[235],"results":[236,247,309],"from":[238,249],"~\\ncorresponding":[246],"versions":[252],"Jacobi,\\nGauss-Seidel":[255],"S.O.R.":[257],"methods.":[258,294],"Finally,":[259],"computational":[261],"complexity\\nanalysis":[262],"included.\\nIn":[269],"area":[271],"non-numeric":[273],"algorithms,":[274],"problems":[276],"sorting":[278,283],"and\\nsearching":[279],"studied.":[281],"investigated\\nwas":[287],"shell":[289],"digit":[292],"sort":[293],"different\\nparallel":[298],"strategies":[299],"approaches":[301],"find":[307],"the\\nbest":[308],"machine.\\nIn":[317],"searching":[319],"methods,":[320],"sequential":[322],"search":[323,331],"algorithm":[324],"an\\nunordered":[326],"table":[327],"binary":[330],"investigated":[334],"and\\nimplemented":[335],"presentation":[340],"results.":[343,360],"Finally,\\na":[344],"complexity":[345],"presented.\\nThe":[351],"concludes":[353],"chapter":[356],"summarizing":[357],"main":[359]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}