{"id":"https://openalex.org/W573093302","doi":"https://doi.org/10.5287/ora-wrgyrokp4","title":"Complexity issues in general purpose parallel computing","display_name":"Complexity issues in general purpose parallel computing","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W573093302","doi":"https://doi.org/10.5287/ora-wrgyrokp4","mag":"573093302"},"language":"en","primary_location":{"id":"pmh:oai:ora.ox.ac.uk:uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","doi":null,"is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","pdf_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848/files/me0b01e997ae29a7cdc4fa9b109ebbb25","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polonsky Theses Digitisation Project","raw_type":"http://purl.org/coar/resource_type/c_db06"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848/files/me0b01e997ae29a7cdc4fa9b109ebbb25","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021912231","display_name":"Douglas Andrew. Chin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Chin, Douglas Andrew.","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":null,"display_name":"Chin, Douglas Andrew","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chin, Douglas Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021912231"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"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.9775000214576721,"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.9775000214576721,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.005499999970197678,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.005100000184029341,"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/parallel-algorithms","display_name":"parallel algorithms","score":0.5910000205039978},{"id":"https://openalex.org/keywords/granularity","display_name":"granularity","score":0.531000018119812},{"id":"https://openalex.org/keywords/shared-memory","display_name":"shared memory","score":0.5249999761581421},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7009999752044678},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"fault tolerance","score":0.656000018119812},{"id":"https://openalex.org/keywords/synchronization","display_name":"synchronization","score":0.597000002861023},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"universal hashing","score":0.7599999904632568},{"id":"https://openalex.org/keywords/skewing","display_name":"skewing","score":0.9539999961853027},{"id":"https://openalex.org/keywords/asynchronous-algorithms","display_name":"asynchronous algorithms","score":0.48500001430511475},{"id":"https://openalex.org/keywords/boolean-circuits","display_name":"Boolean circuits","score":0.7639999985694885}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.862908124923706},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7171579599380493},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6731857657432556},{"id":"https://openalex.org/C106251023","wikidata":"https://www.wikidata.org/wiki/Q851989","display_name":"Porting","level":3,"score":0.6571882963180542},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.5864092707633972},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.5787116289138794},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5677968859672546},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5395410060882568},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.47259077429771423},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.4590076804161072},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43175944685935974},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.420004278421402},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.3442479372024536},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3315742611885071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29299497604370117},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12442705035209656},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:ora.ox.ac.uk:uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","doi":null,"is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","pdf_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848/files/me0b01e997ae29a7cdc4fa9b109ebbb25","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polonsky Theses Digitisation Project","raw_type":"http://purl.org/coar/resource_type/c_db06"},{"id":"doi:10.5287/ora-wrgyrokp4","doi":"https://doi.org/10.5287/ora-wrgyrokp4","is_oa":true,"landing_page_url":"https://doi.org/10.5287/ora-wrgyrokp4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:573093302","doi":null,"is_oa":false,"landing_page_url":"https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.291096","pdf_url":null,"source":{"id":"https://openalex.org/S4306508408","display_name":"Dr Leonard Polonsky thesis digitisation","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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Dr Leonard Polonsky thesis digitisation","raw_type":null}],"best_oa_location":{"id":"pmh:oai:ora.ox.ac.uk:uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","doi":null,"is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848","pdf_url":"https://ora.ox.ac.uk/objects/uuid:b16a89c9-c44e-48cd-b120-9ed755ac7848/files/me0b01e997ae29a7cdc4fa9b109ebbb25","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polonsky Theses Digitisation Project","raw_type":"http://purl.org/coar/resource_type/c_db06"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W573093302.pdf","grobid_xml":"https://content.openalex.org/works/W573093302.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W43376698","https://openalex.org/W4254525773","https://openalex.org/W7097886185","https://openalex.org/W2956565761","https://openalex.org/W2123768021","https://openalex.org/W7097715828","https://openalex.org/W7036742237","https://openalex.org/W1509962102","https://openalex.org/W2274522089","https://openalex.org/W4253977563"],"abstract_inverted_index":{"In":[0,84,122],"recent":[1],"years,":[2],"powerful":[3],"theoretical":[4,204],"techniques":[5,29,152,182],"have":[6,236],"been":[7,237],"developed":[8],"for":[9,52,94,120,133,153,175,183,206,239,281,299],"supporting":[10],"communication,":[11],"synchronization":[12],"and":[13,65,130,145,158,164,178,191,230,266],"fault":[14,274],"tolerance":[15],"in":[16,73,105,156,189],"general":[17,211],"purpose":[18,212],"parallel":[19,71,154,193,213],"computing.":[20],"The":[21,37,276],"proposition":[22],"of":[23,62,70,103,111,117,162,209,245,263,273,284],"this":[24,240],"thesis":[25,124,277],"is":[26,40,90,253],"that":[27,235,254,286],"different":[28,35],"should":[30],"be":[31,227],"used":[32],"to":[33,45,100,167,226,258,295],"support":[34],"algorithms.":[36],"determining":[38],"factor":[39],"granularity,":[41],"or":[42],"the":[43,58,75,85,106,112,115,123,198,207,222,249,260,282],"extent":[44],"which":[46,74,180,220],"an":[47],"algorithm":[48],"uses":[49],"long":[50,118],"blocks":[51,119],"communication":[53],"between":[54],"processors.":[55],"We":[56,196,291],"consider":[57],"Block":[59,86,127,199,223,250],"PRAM":[60,87,128,200,224,251],"model":[61,69,113,201,225,252],"Aggarwal,":[63],"Chandra":[64],"Snir,":[66],"a":[67,81,91,98,101,160,203,270],"synchronous":[68],"computation":[72,155],"processors":[76],"commu-":[77],"nicate":[78],"by":[79,97],"accessing":[80],"shared":[82,107],"memory.":[83,108],"model,":[88],"there":[89],"time":[92],"cost":[93],"each":[95],"access":[96,188],"processor":[99],"block":[102],"locations":[104],"This":[109],"feature":[110],"encourages":[114],"use":[116,289],"communication.":[121],"we":[125],"present":[126],"algorithms":[129,165,174,265,285],"lower":[131],"bounds":[132],"specific":[134],"problems":[135,163],"on":[136,248],"arrays,":[137],"lists,":[138],"expression":[139],"trees,":[140],"graphs,":[141],"strings,":[142],"binary":[143],"trees":[144],"butterflies.":[146],"These":[147],"results":[148,217],"introduce":[149],"useful":[150],"basic":[151],"practice,":[157],"provide":[159],"classification":[161],"according":[166],"their":[168],"granularity.":[169],"Also":[170],"presented":[171,219],"are":[172,181,218,256],"optimal":[173],"universal":[176],"hashing":[177],"skewing,":[179],"sup-":[184],"porting":[185],"conflict-free":[186],"memory":[187],"general-":[190],"special-purpose":[192],"computations,":[194],"respectively.":[195],"explore":[197],"as":[202],"basis":[205],"design":[208,283],"scalable":[210],"computers.":[214],"Several":[215],"simulation":[216],"show":[221],"comparable":[228],"to,":[229],"competitive":[231],"with,":[232],"other":[233],"models":[234],"proposed":[238],"role.":[241],"Two":[242],"major":[243],"advantages":[244],"machines":[246],"based":[247],"they":[255],"able":[257],"preserve":[259],"granularity":[261],"properties":[262],"individual":[264],"can":[267],"efficiently":[268],"incorporate":[269],"significant":[271],"degree":[272],"tolerance.":[275],"also":[278],"discusses":[279],"methods":[280,294],"do":[287],"not":[288],"synchronization.":[290],"apply":[292],"these":[293],"define":[296],"fast":[297],"circuits":[298],"several":[300],"fundamental":[301],"Boolean":[302],"functions.":[303]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}